scispace - formally typeset
Search or ask a question
Institution

Qualcomm

CompanyFarnborough, United Kingdom
About: Qualcomm is a company organization based out in Farnborough, United Kingdom. It is known for research contribution in the topics: Wireless & Signal. The organization has 19408 authors who have published 38405 publications receiving 804693 citations. The organization is also known as: Qualcomm Incorporated & Qualcomm, Inc..


Papers
More filters
Patent
27 Sep 2010
TL;DR: In this article, a mobile platform includes a plurality of proximity sensors coupled to a housing including on the sides, front and back of the housing, and signals from proximity sensors are analyzed to determine configuration of the proximity sensors that are activated.
Abstract: A mobile platform includes a plurality of proximity sensors coupled to a housing including on the sides, front and back of the housing. Signals from the proximity sensors are analyzed to determine configuration of the proximity sensors that are activated. The configuration may be a sequence of proximity sensors that are activated, e.g., when a gesture is detected, or the locations of the proximity sensors that are activated when the mobile platform is held in different manners. Mobile platform applications associated with the configuration are determined and automatically launched. For example, the applications may include a camera application or short message service (SMS) application, as well as controlling telephony operations, controlling a music player, and providing status information. Information from an orientation sensor and/or ambient light detector may also be used to assist in determining the applications to be launched.

148 citations

Patent
15 May 2014
TL;DR: In this article, the authors proposed a method to improve channel reuse by determining signal performance metrics associated with the different transmission modes in a powerline communication (PLC) network, where a transmission mode may be selected based on interference and signal measurements at one or more receivers of the second device.
Abstract: Channel reuse may be used so that multiple networks may communicate via a shared powerline communication (PLC) medium. In a PLC network that supports different transmission modes, channel reuse may be improved by determining signal performance metrics associated with the different transmission modes. A transmission mode may be selected to facilitate channel reuse of the PLC medium by the local network and neighbor network. A first device and a second device may belong to a local network that shares the PLC medium with a neighbor network. The transmission mode may be selected based on interference and signal measurements at one or more receivers of the second device. The transmission mode may be selected from a group comprising a 2-stream multi-input multi-output (MIMO) eigen-beamforming transmission mode, a 1-stream MIMO spot-beamforming transmission mode, and a 1-stream single-input-single-output (SISO) transmission mode.

148 citations

Journal ArticleDOI
TL;DR: The simulation results show that the proposed primary-prioritized dynamic spectrum access approach under proportional fairness criterion achieves much higher throughput than the CSMA-based random access approaches and the approach achieving max-min fairness.
Abstract: Dynamic spectrum access has become a promising approach to fully utilize the scarce spectrum resources. In a dynamically changing spectrum environment, it is very important to consider the statistics of different users' spectrum access so as to achieve more efficient spectrum allocation. In this paper, we propose a primary-prioritized Markov approach for dynamic spectrum access through modeling the interactions between the primary and the secondary users as continuous-time Markov chains (CTMC). Based on the CTMC models, to compensate the throughput degradation due to the interference among secondary users, we derive the optimal access probabilities for the secondary users, by which the spectrum access of the secondary users is optimally coordinated, and the spectrum dynamics are clearly captured. Therefore, a good tradeoff can be achieved between the spectrum efficiency and fairness. The simulation results show that the proposed primary-prioritized dynamic spectrum access approach under proportional fairness criterion achieves much higher throughput than the CSMA-based random access approaches and the approach achieving max-min fairness. Moreover, it provides fair spectrum sharing among secondary users with only small performance degradation compared to the approach maximizing the overall average throughput.

148 citations

Patent
Thomas F. Doyle1
01 Feb 2006
TL;DR: In this article, a processor is used to monitor a battery charge and estimate a required charge needed by the electronic tool to complete any task or job shift, when the processor determines the battery charge is insufficient, the processor applies business rules to reduce and terminate functions to conserve power.
Abstract: An electronic tool and method to manage a battery includes a processor to monitor a battery charge and estimate a required charge needed by the electronic tool to complete any task or job shift. When the processor determines the battery charge is insufficient, the processor applies business rules to reduce and terminate functions of the electronic tool to conserve power.

147 citations

Journal ArticleDOI
TL;DR: It is shown that rich physical layer/MAC layer (PHY/MAC) diversities are available for exploitation in ad hoc networks and an online stochastic iterative algorithm is developed based on local observations only to establish its convergence to the Nash equilibrium.
Abstract: In this paper, we study distributed opportunistic scheduling (DOS) in an ad hoc network, where many links contend for the same channel using random access. In such a network, DOS involves a process of joint channel probing and distributed scheduling. Due to channel fading, the link condition corresponding to a successful channel probing could be either good or poor. In the latter case, further channel probing, although at the cost of additional delay, may lead to better channel conditions and hence yield higher throughput. The desired tradeoff boils down to judiciously choosing the optimal stopping rule for channel probing and distributed scheduling. In this paper, we pursue a rigorous characterization of the optimal strategies from two perspectives, namely, a network-centric perspective and a user-centric perspective. We first consider DOS from a network-centric point of view, where links cooperate to maximize the overall network throughput. Using optimal stopping theory, we show that the optimal scheme for DOS turns out to be a pure threshold policy, where the rate threshold can be obtained by solving a fixed-point equation. We further devise iterative algorithms for computing the threshold. We also generalize the studies to take into account fairness requirements. Next, we explore DOS from a user-centric perspective, where each link seeks to maximize its own throughput. We treat the problem of threshold selection across different links as a noncooperative game. We explore the existence and uniqueness of the Nash equilibrium, and show that the Nash equilibrium can be approached by the best response strategy. Since the best response strategy requires message passing from neighboring nodes, we then develop an online stochastic iterative algorithm based on local observations only, and establish its convergence to the Nash equilibrium. Because there is an efficiency loss at the Nash equilibrium, we then study pricing-based mechanisms to mitigate the loss. Our results reveal that rich physical layer/MAC layer (PHY/MAC) diversities are available for exploitation in ad hoc networks. We believe that these initial steps open a new avenue for channel-aware distributed scheduling.

147 citations


Authors

Showing all 19413 results

NameH-indexPapersCitations
Jian Yang1421818111166
Xiaodong Wang1351573117552
Jeffrey G. Andrews11056263334
Martin Vetterli10576157825
Vinod Menon10126960241
Michael I. Miller9259934915
David Tse9243867248
Kannan Ramchandran9159234845
Michael Luby8928234894
Max Welling8944164602
R. Srikant8443226439
Jiaya Jia8029433545
Hai Li7957033848
Simon Haykin7745462085
Christopher W. Bielawski7633432512
Network Information
Related Institutions (5)
Intel
68.8K papers, 1.6M citations

92% related

Motorola
38.2K papers, 968.7K citations

89% related

Samsung
163.6K papers, 2M citations

88% related

NEC
57.6K papers, 835.9K citations

87% related

Texas Instruments
39.2K papers, 751.8K citations

86% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
20229
20211,188
20202,266
20192,224
20182,124
20171,477