Theory of linear and integer programming
Theory of linear and integer programming
Digital signal processing (3rd ed.): principles, algorithms, and applications
Digital signal processing (3rd ed.): principles, algorithms, and applications
A methodology and design environment for DSP ASIC fixed point refinement
DATE '99 Proceedings of the conference on Design, automation and test in Europe
FRIDGE: a fixed-point design and simulation environment
Proceedings of the conference on Design, automation and test in Europe
Multi-Antenna Transceiver Techniques for 3g and Beyond
Multi-Antenna Transceiver Techniques for 3g and Beyond
Convex Optimization
Capacity and coding for quantized MIMO systems
Proceedings of the 2006 international conference on Wireless communications and mobile computing
On fast-decodable space-time block codes
IEEE Transactions on Information Theory
Construction of high rate super-orthogonal space-time block codes
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Fast optimal decoding of multiplexed orthogonal designs by conditional optimization
IEEE Transactions on Information Theory
IEEE Transactions on Signal Processing
Square-matrix embeddable space-time block codes for complex signal constellations
IEEE Transactions on Information Theory
Perfect Space–Time Block Codes
IEEE Transactions on Information Theory
Fast Essentially Maximum Likelihood Decoding of the Golden Code
IEEE Transactions on Information Theory
On the capacity of the discrete-time channel with uniform output quantization
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
| Hi-index | 35.68 |
Low complexity optimal (or nearly optimal) decoders for space-time codes have recently been under intensive investigation. For example, recent works by Sirianunpiboon and others show that the Silver code and the Golden code can be decoded optimally (or nearly optimally) with quadratic decoding complexity. Fast decodability makes them very attractive in practice. In implementing these decoders, floating-point to fixed-point conversion (FFC) needs to be carefully undertaken to minimize hardware cost while retaining decoding performance. The process of quantization for fixed-point representations is often ignored by research community and lacks investigation, and so FFC is often conducted heuristically based on simulations. This paper studies the effects of quantization to space-time coded systems from an information theoretic perspective. It shows the analytical relationship between quantization error and decoding performance deterioration. This paper also proposes a general finite precision implementation methodology including two FFC criteria for space-time coded systems within an integer optimization framework. As a particular example, this paper examines the finite precision implementation of the quadratic optimal decoding algorithm of the Silver code. However, our methodology and techniques can be applied to general space-time codes.