Institution
Motorola
Company•Schaumburg, Illinois, United States•
About: Motorola is a company organization based out in Schaumburg, Illinois, United States. It is known for research contribution in the topics: Signal & Communications system. The organization has 27298 authors who have published 38274 publications receiving 968710 citations. The organization is also known as: Motorola, Inc. & Galvin Manufacturing Corporation.
Papers published on a yearly basis
Papers
More filters
•
24 Jan 1994TL;DR: In this article, a carry case (102) for transporting an electronic device, such as a radio (100) or controller module (300), and providing paging capability when combined with the electronic device is described.
Abstract: A carry case (102) for transporting an electronic device, such as a radio (100) or controller module (300), and providing paging capability when combined with the electronic device. The carry case includes a housing and contained within the housing is a first part or first section of a pager while the electronic device contains a second part or second section of the pager. Electrical interface contacts (504) located within the carry case (102) and electrical interface contacts (204) located within the electronic device allow for the paging circuitry to connect and form a complete pager. The electrical interface contacts of the electronic devices are common so that either can be combined with carry case (102) to provide either a radio and pager combination or a pager only option.
131 citations
•
15 Feb 1996TL;DR: An interactive electronic game system (10) composed of at least one control unit (12) for receiving, monitoring, compiling and transmitting game data and information and several personal display units (14) for controlling game play and displaying game data.
Abstract: An interactive electronic game system (10) composed of at least one control unit (12) for receiving, monitoring, compiling and transmitting game data and information and several personal display units (14) for controlling game play and displaying game data and information. The personal display units (14) and the control unit (12) being in constant omni-directional communication. The personal display units (14) of the system having an aperture (100) formed therein, and capable of receiving and displaying game data and information in a direct view image and/or a virtual image.
131 citations
•
17 Jul 1995TL;DR: In this article, a paging system (10) includes any number of spaced apart transmitters (12), each of which has its own area (15) of coverage, and a call is placed from a telephone instrument (22) to a destination controller (28) through the public switched telecommunication network (21).
Abstract: A paging system (10) includes any number of spaced apart transmitters (12), each of which has its own area (15) of coverage. A population of subscriber units (24) freely roams between the areas (15). When a subscriber unit (24) roams to a new area (15), a call is placed from a telephone instrument (22) to a destination controller (28) through the public switched telecommunication network (21). A subscriber ID and location data are transferred to the system (10) during this call. The location data are used internally by the system (10) to route pages to only the transmitters (12) whose areas (15) correspond to the location data, and only these transmitters (12) broadcast the pages. Subscriber units (24) may generate the location data which the system (10) uses in routing pages to transmitters (12). A position-determining receiver (42) may directly obtain location data from a positioning system (34). Alternatively, location data may be obtained from transmissions broadcast by the transmitters (12).
131 citations
••
01 Jan 2000TL;DR: This paper presents a new approach to evaluate a sequence pair based on comparing longest common subsequence in a pair of weighted sequences and presents a very simple and efficient O(n/sup 2/) algorithm to solve the sequence pair evaluation problem.
Abstract: Murata et al. (1996) introduced an elegant representation of block placement called sequence pair. All block placement algorithms which are based on sequence pairs use simulated annealing where the generation and evaluation of a large number of sequence pairs is required. Therefore, a fast algorithm is needed to evaluate each generated sequence pair, i.e. to translate the sequence pair to its corresponding block placement. This paper presents a new approach to evaluate a sequence pair based on comparing longest common subsequence in a pair of weighted sequences. We present a very simple and efficient O(n/sup 2/) algorithm to solve the sequence pair evaluation problem. We also show that using a more sophisticated data structure, the algorithm can be implemented to run in O(n log n) time. Both implementations of our algorithm are significantly faster than the previous O(n/sup 2/) graph-based algorithm. For example, we achieve 60/spl times/ speedup over the previous algorithm when input size n=128.
131 citations
•
13 Aug 2002TL;DR: In this paper, a process for forming a metal-insulator-metal (MIM) capacitor structure is described, where a recess is formed in the dielectric layer of a semiconductor substrate.
Abstract: A process for forming a metal-insulator-metal (MIM) capacitor structure includes forming a recess in the dielectric layer (20) of a semiconductor substrate (10). A first capacitor electrode (30, 40) is formed in the recess having a copper first metal layer (30) with a conductive oxidation barrier (40) formed over the first metal layer (30). The first capacitor electrode (30, 40) is planarized relative to the dielectric layer (20). An insulator (50) is formed over the first capacitor electrode (30, 40) and a second capacitor electrode (65) is formed over the insulator (50). Forming the first capacitor electrode (30, 40) in the recess maintains the alignment of a periphery of the copper first metal layer (30) with the conductive oxidation barrier (40).
131 citations
Authors
Showing all 27298 results
Name | H-index | Papers | Citations |
---|---|---|---|
Georgios B. Giannakis | 137 | 1321 | 73517 |
Yonggang Huang | 136 | 797 | 69290 |
Chenming Hu | 119 | 1296 | 57264 |
Theodore S. Rappaport | 112 | 490 | 68853 |
Chang Ming Li | 97 | 896 | 42888 |
John Kim | 90 | 406 | 41986 |
James W. Hicks | 89 | 406 | 51636 |
David Blaauw | 87 | 750 | 29855 |
Mark Harman | 83 | 506 | 29118 |
Philippe Renaud | 77 | 773 | 26868 |
Aggelos K. Katsaggelos | 76 | 946 | 26196 |
Min Zhao | 71 | 547 | 24549 |
Weidong Shi | 70 | 528 | 16368 |
David Pearce | 70 | 342 | 25680 |
Douglas L. Jones | 70 | 512 | 21596 |