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.
Topics: Signal, Network packet, Base station, Optical fiber, Node (networking)
Papers published on a yearly basis
Papers
More filters
••
TL;DR: In this article, a negative conductance device consisting of a heterojunction bipolar transistor with a quantum well and a symmetric double barrier or a superlattice in the base region is proposed.
Abstract: We propose a new negative conductance device consisting of a heterojunction bipolar transistor with a quantum well and a symmetric double barrier or a superlattice in the base region. The key difference compared to previously studied structures is that resonant tunneling is achieved by high‐energy minority carrier injection into the quantum state rather than by application of an electric field. Thus this novel geometry maintains the crucial, structural symmetry of the double barrier, allowing unity transmission at all resonance peaks and higher peak‐to‐valley ratios and currents compared to conventional resonant tunneling structures. Both tunneling and ballistic injection in the base are considered. These new functional devices have significant potential for a variety of signal processing and multiple‐valued logic applications and for the study of the physics of transport in superlattices.
314 citations
••
TL;DR: This work presents an architecture that is optimal, in the sense of maximum link spectral efficiency, inThe presence of spatially colored interference, and compares it, under various propagation conditions, to other adaptive-antenna techniques with equal number of antennas.
Abstract: Previous information theory results have demonstrated the enormous capacity potential of wireless communication systems with multiple transmit and receive antennas. To exploit this potential, a number of space-time architectures have been proposed which transmit parallel data streams, simultaneously and on the same frequency, in a multiple-input multiple-output fashion. With sufficient multipath propagation, these different streams can be separated at the receiver. Mostly, these space-time schemes have been studied only in the presence of spatially white noise. We present an architecture that is optimal, in the sense of maximum link spectral efficiency, in the presence of spatially colored interference. We evaluate this new architecture and compare it, under various propagation conditions, to other adaptive-antenna techniques with equal number of antennas.
313 citations
••
TL;DR: In this article, steady-state and transient optical characterization of phenylenevinylene polymers and extract a picture of the photoexcitations and dynamics which may apply more generally to non-degenerate ground-state conjugated polymers.
313 citations
••
TL;DR: It is shown that for even codes the set of zero neighbors is strictly optimal in this class of algorithms, which implies that general asymptotic improvements of the zero-neighbors algorithm in the frame of gradient-like approach are impossible.
Abstract: Minimal vectors in linear codes arise in numerous applications, particularly, in constructing decoding algorithms and studying linear secret sharing schemes. However, properties and structure of minimal vectors have been largely unknown. We prove basic properties of minimal vectors in general linear codes. Then we characterize minimal vectors of a given weight and compute their number in several classes of codes, including the Hamming codes and second-order Reed-Muller codes. Further, we extend the concept of minimal vectors to codes over rings and compute them for several examples. Turning to applications, we introduce a general gradient-like decoding algorithm of which minimal-vectors decoding is an example. The complexity of minimal-vectors decoding for long codes is determined by the size of the set of minimal vectors. Therefore, we compute this size for long randomly chosen codes. Another example of algorithms in this class is given by zero-neighbors decoding. We discuss relations between the two decoding methods. In particular, we show that for even codes the set of zero neighbors is strictly optimal in this class of algorithms. This also implies that general asymptotic improvements of the zero-neighbors algorithm in the frame of gradient-like approach are impossible. We also discuss a link to secret-sharing schemes.
313 citations
••
TL;DR: In this article, the processes in physical vapor transport: vaporization, transport and crystal growth, the regimes for transport: molecular flow path limited, diffusion-limited, convection-limited and forced-convection limited are analyzed.
313 citations
Authors
Showing all 37011 results
Name | H-index | Papers | Citations |
---|---|---|---|
George M. Whitesides | 240 | 1739 | 269833 |
Yoshua Bengio | 202 | 1033 | 420313 |
John A. Rogers | 177 | 1341 | 127390 |
Zhenan Bao | 169 | 865 | 106571 |
Thomas S. Huang | 146 | 1299 | 101564 |
Federico Capasso | 134 | 1189 | 76957 |
Robert S. Brown | 130 | 1243 | 65822 |
Christos Faloutsos | 127 | 789 | 77746 |
Robert J. Cava | 125 | 1042 | 71819 |
Ramamoorthy Ramesh | 122 | 649 | 67418 |
Yann LeCun | 121 | 369 | 171211 |
Kamil Ugurbil | 120 | 536 | 59053 |
Don Towsley | 119 | 883 | 56671 |
Steven P. DenBaars | 118 | 1366 | 60343 |
Robert E. Tarjan | 114 | 400 | 67305 |