Geoff Knagge
ABSTRACT
This paper describes a power, speed and area efficient VLSI implementation of a noise whitening algorithm for a 4x4 MIMO channel. The architecture combines innovative use of Hermitian matrices to streamline the iterative calculations, with a 4x1 matrix row-column multiplier as the core component. The optimisations in the datapath reduce the power and latency needed to implement the algorithm. The Booth recoded complex multipliers use logic sharing to reduce power and complexity, and incorporate low-power sleep logic that does not increase the critical path. The design has been successfully synthesised in a 0.18μm, 1.8V CMOS technology, and has the potential to be adapted to other applications requiring matrix multiplication.
- G. J. Foschini and M. J. Gans, "On limits of wireless communications in a fading environment when using multiple antennas," Wireless Personal Communications, vol. 6, pp. 311--335, March 1998. Google Scholar
Digital Library
- I. E. Telatar, "Capacity of multi-antenna gaussian channels," European Trans. Telecomm., vol. 10, pp. 585--596, November-December 1999.Google ScholarCross Ref
- S. Venkatesan, L. Mailaender, and J. Salz, "Iterative algorithms for noise whitening." Bell Labs Technical Memorandum, in preparation.Google Scholar
- C. R. Baugh and B. A. Wooley, "A two's complement parallel array multiplication algorithm," IEEE Transactions on Computers, vol. 22, pp. 1045--1047, December 1973.Google ScholarDigital Library
- Y. B. Mahdy, S. A. Ali, and K. M. Shaaban, "Algorithm and two efficient implementations for complex multiplier," in Proceedings of ICECS, pp. 949--953, 1999.Google Scholar
Index Terms
- Matrix datapath architecture for an iterative 4x4 MIMO noise whitening algorithm
Recommendations
Digit-Serial Complex-Number Multipliers on FPGAs
This paper presents an optimized implementation on FPGA of digit-serial Complex-Number Multipliers (CMs) using Booth recoding techniques and tree adders based on Carry Save (CS) and Ripple Carry Adders (RCA). This kind of Complex-Number multipliers can ...
Secondary Radix Recodings for Higher Radix Multipliers
For progressively higher radices, the reduction in partial products obtained by the well-known modified Booth multiplier recoding is offset by the need to precompute a rapidly increasing store of odd multiples of the multiplicand as inputs to each ...
To booth or not to booth
Booth Recoding is a commonly used technique to recode one of the operands in binary multiplication. In this way the implementation of a multipliers' adder tree can be improved in both cost and delay. The improvement due to Booth Recoding is said to be ...
Comments