Ultra Low Power CORDIC Processor for Wireless Communication Algorithms
Journal of VLSI Signal Processing Systems
A Scalable Configurable Architecture for Advanced Wireless Communication Algorithms
Journal of VLSI Signal Processing Systems
An improved recursive algorithm for BLAST
Signal Processing
Proceedings of the conference on Design, automation and test in Europe
EURASIP Journal on Applied Signal Processing
EURASIP Journal on Wireless Communications and Networking
A practical, hardware friendly MMSE detector for MIMO-OFDM-based systems
EURASIP Journal on Advances in Signal Processing
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Multiuser detection of alamouti signals
IEEE Transactions on Communications
IEEE Transactions on Signal Processing
A power-efficient configurable low-complexity MIMO detector
IEEE Transactions on Circuits and Systems Part I: Regular Papers
IEEE Transactions on Communications
Some results for the fast MMSE-SIC detection in spatially multiplexed MIMO systems
IEEE Transactions on Wireless Communications
IEEE Transactions on Communications
A hybrid ZF and QR receiver for MIMO-OFDM systems
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
A reduced dimension VBLAST detection algorithm with approximating maximum Likelihood performance
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Low-complexity decoding via reduced dimension maximum-likelihood search
IEEE Transactions on Signal Processing
A pipelined parallel algorithm for OSIC decoding
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Efficient symbol detection in multi-device STBC-MIMO system
ISCIT'09 Proceedings of the 9th international conference on Communications and information technologies
A Gram-Schmidt based lattice-reduction aided MMSE detection in MIMO systems
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Improved fast recursive algorithms for V-BLAST and G-STBC with novel efficient matrix inversion
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
A joint symbol detection algorithm efficient at low SNR for a multi-device STBC-MIMO system
RWS'10 Proceedings of the 2010 IEEE conference on Radio and wireless symposium
QR decomposition of Laurent polynomial matrices sampled on the unit circle
IEEE Transactions on Information Theory
Low-complexity soft-output decoding with lattice-reduction-aided detectors
IEEE Transactions on Communications
A radius adaptive K-Best decoder with early termination: algorithm and VLSI architecture
IEEE Transactions on Circuits and Systems Part I: Regular Papers - Special section on 2009 IEEE custom integrated circuits conference
Adaptive reduced-rank MIMO decoder for military communications
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Designing low-complexity detectors based on Seysen's algorithm
IEEE Transactions on Wireless Communications
Wireless Personal Communications: An International Journal
Heterogeneous pipelined square-root Kalman Filter algorithm for the MMSE-OSIC problem
The Journal of Supercomputing
Adaptive Parallel and Iterative QRDM Detection Algorithms for MIMO Multiplexing Systems
Wireless Personal Communications: An International Journal
Efficient QR-Based Multi-Mode Precoding for Limited Feedback Multi-User MIMO Systems
Wireless Personal Communications: An International Journal
| Hi-index | 0.07 |
Bell Labs Layered Space-Time (BLAST) is a scheme for transmitting information over a rich-scattering wireless environment using multiple receive and transmit antennas. The main computational bottleneck in the BLAST algorithm is a "nulling and cancellation" step, where the optimal ordering for the sequential estimation and detection of the received signals is determined. To reduce the computational cost of BLAST, we develop an efficient square-root algorithm for the nulling and cancellation step. The main features of the algorithm include efficiency: the computational cost is reduced by 0.7 M, where M is the number of transmit antennas, and numerical stability: the algorithm is division-free and uses only orthogonal transformations. In a 14 antenna system designed for transmission of 1 Mbit/s over a 30 kHz channel, the nulling and cancellation computation is reduced from 190 MFlops/s to 19 MFlops/s, with the overall computations being reduced from 220 MFlops/s to 49 MFlops/s. The numerical stability of the algorithm also make it attractive for implementation in fixed-point (rather than floating-point) architectures.