Eric Ojard
Broadcom
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Eric Ojard.
IEEE Transactions on Signal Processing | 2008
Sirikiat Lek Ariyavisitakul; Jun Zheng; Eric Ojard; Joonsuk Kim
A subspace beamforming method is presented that decomposes a multiple-input multiple-output (MIMO) channel into multiple pairs of subchannels. The pairing is done based on singular values such that similar channel capacity is obtained between different subchannel pairs. This new capacity balancing concept is key to achieving high performance with low complexity. We apply the subspace idea to geometric mean decomposition (GMD) and maximum-likelihood (ML) detection. The proposed subspace GMD scheme requires only two layers of detection/decoding, regardless of the total number of subchannels, thus alleviating the latency issue associated with conventional GMD. We also show how the subspace concept makes the optimization of ML beamforming and ML detection itself feasible for any K timesK MIMO system. Simulation results show that subspace beamforming performs nearly as well as optimum GMD performance, and to within only a few decibels of the Shannon bound.
information theory and applications | 2013
Ron Porat; Eric Ojard; Nihar Jindal; Matthew James Fischer; Vinko Erceg
Multiuser MIMO (MU-MIMO) is a new technology adopted in IEEE 802.11ac for enhancing downlink throughput. 802.11ac has an explicit feedback mechanism that enables very high quality channel feedback to be provided to the transmitter, but the overhead can be quite substantial. We propose a differential feedback method that significantly reduces this overhead by using a simple lossless, variable-length compression technique that exploits the slowly time varying wireless channel.
information theory and applications | 2008
Sirikiat Lek Ariyavisitakul; Eric Ojard; Joonsuk Kim; Jun Zheng; Nambi Seshadri
A subspace beamforming method is presented that decomposes a MIMO channel into multiple pairs of subchannels. The pairing is done based on singular values such that similar channel capacity is obtained between different subchannel pairs. This new capacity balancing concept is key to achieving high performance with low complexity. We apply the subspace idea to geometric mean decomposition (GMD) and maximum likelihood (ML) detection. The proposed subspace GMD scheme requires only two layers of detection/decoding, regardless of the total number of subchannels, thus alleviating the latency issue associated with conventional GMD. We also show how the subspace concept makes the optimization of ML beamforming and ML detection itself feasible for any KtimesK MIMO system. Simulation results show that subspace beamforming performs nearly as well as optimum GMD performance, and to within only a few dB of the Shannon bound.
international symposium on information theory | 2008
Sirikiat Lek Ariyavisitakul; Jun Zheng; Eric Ojard; Joonsuk Kim
A subspace beamforming method is presented that decomposes a MIMO channel into multiple pairs of subchannels. The pairing is done based on singular values such that similar channel capacity is obtained between different subchannel pairs. This new capacity balancing concept is key to achieving high performance with low complexity. We apply the subspace idea to geometric mean decomposition (GMD) and maximum likelihood (ML) detection. The proposed subspace GMD scheme requires only two layers of detection/decoding, regardless of the total number of subchannels, thus alleviating the latency issue associated with conventional GMD. We also show how the subspace concept makes the optimization of ML beamforming and ML detection itself feasible for any K times K MIMO system. Simulation results show that subspace beamforming performs nearly as well as optimum GMD performance, and to within only a few dB of the Shannon bound.
ieee hot chips symposium | 2007
Jason A. Trachewsky; Vijay Adusumilli; Carlos Aldana; Amit G. Bagchi; Arya Reza Behzad; Keith A. Carter; Erol Erslan; Matthew James Fischer; Rohit V. Gaikwad; Joachim S. Hammerschmidt; Min-Chuan Hoo; Simon Jean; Venkat Kodavati; George Kondylis; Joseph Paul Lauer; Rajendra Tushar Moorti; Walter Morton; Eric Ojard; Ling Su; Dalton Victor; Larry C. Yamano
This article consists of a collection of slides from the authors conference presentation on a 2X2 MIMO basedband system for high throughput wireless local area networking. Some of the specific topics discussed include: the demand for wireless LAN, 2000-2011; schemas of multipath channels; exploiting multipath processing for high rates and the impact on energy capacity planning; system architecture for MIMO-ODFM; system processing capabilities and performance summaries; the need for flexible transceivers; and block diagrams and system topologies.
Archive | 2001
Jason A. Trachewsky; Eric Ojard; Srinivasa H. Garlapati; Alan Corry
Archive | 2001
Jason A. Trachewsky; Eric Ojard; Srinivasa H. Garlapati; Alan G. Corry
Archive | 2000
Eric Ojard; Jason A. Trachewsky; John T. Holloway; Edward H. Frank; Kevin H. Peterson
Archive | 2010
Joonsuk Kim; Matthew James Fischer; Peiman Amini; Joseph Paul Lauer; Vinko Erceg; Carlos Aldana; Eric Ojard; Sirikiat Lek Ariyavisitakul
Archive | 2004
Jeyhan Karaoguz; Eric Ojard; Edward H. Frank