scispace - formally typeset
Search or ask a question
Institution

Alcatel-Lucent

Stuttgart, Germany
About: Alcatel-Lucent is a based out in Stuttgart, Germany. It is known for research contribution in the topics: Signal & Network packet. The organization has 37003 authors who have published 53332 publications receiving 1430547 citations. The organization is also known as: Alcatel-Lucent S.A. & Alcatel.


Papers
More filters
Patent
30 Mar 1998
TL;DR: In this article, a method for combining digital data with a perceptible program signal is proposed, where the data stream is modulated onto an electromagnetic signal encoding the perceptible signal; the modulating employs a spread spectrum encoding of the data streams.
Abstract: A method for combining digital data with a perceptible program signal. The data stream is modulated onto an electromagnetic signal encoding the perceptible signal; the modulating employs a spread spectrum encoding of the data stream. The modulated program signal is transduced into perceptible form. A capture device receives the perceptible signal, and a decoder extracts the spread spectrum encoded data from the received signal. The method is particularly useful in encoding purchase information or watermarking information into the signal.

273 citations

Journal ArticleDOI
TL;DR: This paper explores how transmit diversity can improve the direction finding performance of a radar utilizing an antenna array at the receiver with multiple-input multiple-output antenna systems.
Abstract: It has been recently shown that multiple-input multiple-output (MIMO) antenna systems have the potential to dramatically improve the performance of communication systems over single antenna systems. Unlike beamforming, which presumes a high correlation between signals either transmitted or received by an array, the MIMO concept exploits the independence between signals at the array elements. In conventional radar, the target's radar cross section (RCS) fluctuations are regarded as a nuisance parameter that degrades radar performance. The novelty of MIMO radar is that it provides measures to overcome those degradations or even utilizes the RCS fluctuations for new applications. This paper explores how transmit diversity can improve the direction finding performance of a radar utilizing an antenna array at the receiver. To harness diversity, the transmit antennas have to be widely separated, while for direction finding, the receive antennas have to be closely spaced. The analysis is carried out by evaluating several Cramer-Rao bounds for bearing estimation and the mean square error of the maximum likelihood estimate

273 citations

Patent
01 Apr 1997
TL;DR: The scaleable OFDM system as discussed by the authors provides increased flexibility and adaptability by providing scaling of the operating parameters and/or characteristics for the OFDM systems. But, the scaling of OFDM symbol duration, the number of carriers, and the bits per symbol per carrier is not considered in this paper.
Abstract: The scaleable OFDM system according to the principles of the present invention provides increased flexibility and adaptability by providing scaling of the operating parameters and/or characteristics for the OFDM system. For example, control circuitry can scale the bit rate by scaling of the OFDM symbol duration, the number of carriers and/or the number of bits per symbol per carrier. Scaleability permits the scaleable OFDM system to operate in various communications environments requiring various operating parameters and/or characteristics. By scaling the operating parameters and/or characteristics of the OFDM system when control circuitry determines that different operating parameters and/or characteristics are necessary or advantageous, the control circuitry can dynamically change the operating parameters and/or characteristics, thereby providing compatibility or the desired performance. For example, by dynamically scaling the bit rate, widely varying signal bandwidths, delay spread tolerances and signal-to-noise ratio (SNR) requirements can be achieved. As such, a scaleable OFDM system is particularly suitable for application in mobile, wireless communication devices, which support a variety of services, in a variety of environments, indoor as well as outdoor and in radio channels with differing bandwidths.

273 citations

Journal ArticleDOI
TL;DR: In this paper, the reverse bias leakage current in macroscopic GaN Schottky diodes is found to be insensitive to barrier height, while most of the sample is insulating.
Abstract: The reverse bias leakage current in macroscopic GaN Schottky diodes is found to be insensitive to barrier height. Using a scanning current–voltage microscope, we show that the reverse bias current occurs at small isolated regions, while most of the sample is insulating. By comparing the current maps to topographic images and transmission electron microscopy results, we conclude that reverse bias leakage occurs primarily at dislocations with a screw component. Furthermore, for a fixed dislocation density, the V/III ratio during the molecular beam epitaxial growth strongly affects reverse leakage, indicating complex dislocation electrical behavior that is sensitive to the local structural and/or chemical changes.

273 citations

Journal ArticleDOI
TL;DR: A simple new randomized algorithm, called ResolveSat, for finding satisfying assignments of Boolean formulas in conjunctive normal form, which is the fastest known probabilistic algorithm for k-CNF satisfiability and proves a lower bound on the number of codewords of a code defined by a k-C NF.
Abstract: We propose and analyze a simple new randomized algorithm, called ResolveSat, for finding satisfying assignments of Boolean formulas in conjunctive normal form. The algorithm consists of two stages: a preprocessing stage in which resolution is applied to enlarge the set of clauses of the formula, followed by a search stage that uses a simple randomized greedy procedure to look for a satisfying assignment. Currently, this is the fastest known probabilistic algorithm for k-CNF satisfiability for k g 4 (with a running time of O(20.5625n) for 4-CNF). In addition, it is the fastest known probabilistic algorithm for k-CNF, k g 3, that have at most one satisfying assignment (unique k-SAT) (with a running time O(2(2 ln 2 − 1)n p o(n)) = O(20.386 … n) in the case of 3-CNF). The analysis of the algorithm also gives an upper bound on the number of the codewords of a code defined by a k-CNF. This is applied to prove a lower bounds on depth 3 circuits accepting codes with nonconstant distance. In particular we prove a lower bound Ω(21.282…√>i/ii/ii/i

273 citations


Authors

Showing all 37011 results

NameH-indexPapersCitations
George M. Whitesides2401739269833
Yoshua Bengio2021033420313
John A. Rogers1771341127390
Zhenan Bao169865106571
Thomas S. Huang1461299101564
Federico Capasso134118976957
Robert S. Brown130124365822
Christos Faloutsos12778977746
Robert J. Cava125104271819
Ramamoorthy Ramesh12264967418
Yann LeCun121369171211
Kamil Ugurbil12053659053
Don Towsley11988356671
Steven P. DenBaars118136660343
Robert E. Tarjan11440067305
Network Information
Related Institutions (5)
Bell Labs
59.8K papers, 3.1M citations

96% related

Eindhoven University of Technology
52.9K papers, 1.5M citations

88% related

Samsung
163.6K papers, 2M citations

87% related

Chalmers University of Technology
53.9K papers, 1.5M citations

87% related

Georgia Institute of Technology
119K papers, 4.6M citations

87% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
20231
202212
202130
202050
201983
2018215