Institution
Nokia
Company•Espoo, Finland•
About: Nokia is a company organization based out in Espoo, Finland. It is known for research contribution in the topics: Signal & Mobile station. The organization has 16625 authors who have published 28347 publications receiving 695725 citations. The organization is also known as: Nokia Oyj & Oy Nokia Ab.
Papers published on a yearly basis
Papers
More filters
••
TL;DR: New positioning algorithms to take advantage of the NLOS propagation paths rather than canceling them are investigated, and the Cramer-Rao lower bound on the RMSE is derived for the benchmark of the performance comparison.
Abstract: Mobile positioning has drawn significant attention in recent years Nonline-of-sight (NLOS) propagation error is the dominant error source in mobile positioning Most previous research in this area has focused on NLOS identification and mitigation In this paper, we investigate new positioning algorithms to take advantage of the NLOS propagation paths rather than canceling them Based on a prior information about the NLOS path, a geometrical approach is proposed to estimate mobile location by using two NLOS paths On top of this, the least-squares (LS)-based position estimation algorithm is developed to take multiple NLOS paths into account, and its performance in terms of root mean-square error (RMSE) is analyzed A general LS algorithm considering both LOS and NLOS paths is also derived, and the maximum likelihood-based algorithm is presented to jointly estimate the mobile's and scatterers' positions The Cramer-Rao lower bound on the RMSE is derived for the benchmark of the performance comparison The performance of the proposed algorithms is evaluated analytically and is done via computer simulations Numerical results demonstrate that the derived analytical results closely match the simulated results
186 citations
•
20 Nov 2001TL;DR: In this article, a form factor for a portable device with a display screen and three linear input devices (e.g., touch-sensitive strips), one on each of three sides of the display screen, for providing user input.
Abstract: A form factor for a portable device is disclosed. A first face of the portable device may house a display screen and three linear input devices (e.g., touch-sensitive strips), one on each of three sides of the display screen, for providing user input. On a second, opposite face of the portable device, is a planar input device (e.g., a touchpad) for providing user input. There may also be a microphone and speaker on the second face of the portable device, with the speaker placed behind the planar input device. Sound output by the speaker passes through holes in the planar input device. In one embodiment, the planar input device is used for scrolling content displayed on the display screen, one of the linear input devices is used for zooming in and out, and the other two linear input devices are used for identifying a location on the display screen. In another embodiment, the planar input device is used to identify a location on the display screen, and two of the linear input devices are used for scrolling.
186 citations
•
03 Jan 2003TL;DR: In this article, a lattice filter and a ladder filter are coupled to form a passband filter with an unbalanced input port (41) and two balanced output ports (16, 18).
Abstract: A bulk acoustic wave device (20) having two resonators (92, 94) in a stacked-up configuration separated by a dielectric layer (50). The device (20) can be coupled to a lattice filter or a ladder filter to form a passband filter with an unbalanced input port (41) and two balanced output ports (16, 18). One or more such passband filters can be used, together with another lattice or ladder filter, to form a duplexer having an unbalanced antenna port, two balanced ports for one transceiver part and two balanced ports for another transceiver part.
185 citations
••
TL;DR: The dynamic aspects of the coverage of a mobile sensor network resulting from continuous movement of sensors, as well as the time durations that a location is covered and uncovered, are studied.
Abstract: We study the dynamic aspects of the coverage of a mobile sensor network resulting from continuous movement of sensors. As sensors move around, initially uncovered locations may be covered at a later time, and intruders that might never be detected in a stationary sensor network can now be detected by moving sensors. However, this improvement in coverage is achieved at the cost that a location is covered only part of the time, alternating between covered and not covered. We characterize area coverage at specific time instants and during time intervals, as well as the time durations that a location is covered and uncovered. We further consider the time it takes to detect a randomly located intruder and prove that the detection time is exponentially distributed with parameter 2λrvs where λ represents the sensor density, r represents the sensor's sensing range, and vs denotes the average sensor speed. For mobile intruders, we take a game theoretic approach and derive optimal mobility strategies for both sensors and intruders. We prove that the optimal sensor strategy is to choose their directions uniformly at random between (0, 2π). The optimal intruder strategy is to remain stationary. This solution represents a mixed strategy which is a Nash equilibrium of the zero-sum game between mobile sensors and intruders.
185 citations
•
14 Dec 1993
TL;DR: In this paper, the authors proposed a method for congestion management in a frame relay network, where a virtual channel associated with a frame (39) to be transferred is determined, and when the result of the comparison falls outside a predetermined value range, the frame is discarded.
Abstract: The invention relates to a method for congestion management in a frame relay network. In the method, a virtual channel associated with a frame (39) to be transferred is determined. In order to provide a congestion management method which is reliable and capable of rapid responding and which allows event virtual connections to be prioritized with respect to the throughput probability, (a) at least some of the virtual channels are assigned a respective service level; (b) a congestion level having values in a predetermined relationship to the values of the service levels is determined for a network resource (15) liable to congestion; (c) the value representing the service level of the virtual channel of the FR frame (39) is compared with the value representing the congestion level of said resource; and (d) when the result of the comparison falls outside a predetermined value range, the frame (39) is discarded.
185 citations
Authors
Showing all 16635 results
Name | H-index | Papers | Citations |
---|---|---|---|
Federico Capasso | 134 | 1189 | 76957 |
Andreas Richter | 110 | 769 | 48262 |
Shunpei Yamazaki | 109 | 3476 | 66579 |
Jinsong Huang | 105 | 290 | 49042 |
Marc Pollefeys | 98 | 601 | 36463 |
Merouane Debbah | 96 | 652 | 41140 |
Benjamin J. Eggleton | 92 | 1195 | 34486 |
Jérôme Faist | 91 | 970 | 37221 |
Jean-Pierre Hubaux | 90 | 415 | 35837 |
Bernd Girod | 87 | 604 | 32298 |
Howard E. Katz | 87 | 475 | 27991 |
J.J. Garcia-Luna-Aceves | 86 | 602 | 25151 |
Ramesh Raskar | 86 | 670 | 30675 |
Ananth Dodabalapur | 85 | 394 | 27246 |
Stephen A. Spector | 85 | 424 | 41705 |