A VLSI decoder for the Golden code

Proceedings of the IEEE International Conference on Electronics, Circuits, and Systems

Volumn , Issue , 2006, Pages 549-552

  Cerato, Barbara ^a   Masera, Guido ^a   Viterbo, Emanuele ^a  

^a POLITECNICO DI TORINO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE MODULATION (CANDIDATE); CELLULAR RADIO SYSTEMS; CODES (STANDARDS); CODES (SYMBOLS); COMPUTER SYSTEMS; MIM DEVICES; MODULATION; MULTIPLEXING;

ADAPTIVE MODULATION SCHEMES; GOLDEN CODE; HIGH-RELIABILITY; INHERENT FLEXIBILITY; INTERNATIONAL CONFERENCES; MAXIMUM LIKELIHOOD (ML) DECODING; MODULATION SCHEMES; MULTIPLE-INPUT-MULTIPLE-OUTPUT (MIMO) SYSTEMS; OPTIMAL SPACE; POLYNOMIAL SEARCH (PS); SPHERE DECODING ALGORITHM (SDA); TIME-BLOCK; WIRELESS TRANSMISSIONS;

DECODING;

EID: 47349089679     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICECS.2006.379847     Document Type: Conference Paper

References (13)

1. B. Hassibi and B. Hochwald, "High-rate codes that are linear in space and time," IEEE Trans. Inform. Theory, vol. 48, no. 7, pp. 1804-1824, July 2002.
2. B. A. Sethuraman, B. S. Rajan, and V. Shashidhar, "Full-diversity, highrate space-time block codes from division algebras," IEEE Trans. Inform. Theory, vol. 49, no. 10, pp. 2596-2616, Oct. 2003.
3. J.-C. Belfiore, G. Rekaya, and E. Viterbo, "The Golden code: A 2 × 2 full-rate space-time code with non-vanishing determinants," IEEE Trans. Inform. Theory, vol. 51, no. 4, pp. 1432-1436, April 2005.
4. H. Yao and G. Wornell, "Achieving the full MIMO diversity- multiplexing frontier with rotation-based space-time codes," in Proc. of Allerton Conf. on Communication, Control and Computing, October 2003.
5. P. Dayal and M. Varanasi, "An optimal two transmit antenna space-time code and its stacked extensions," in Proc. of Asilomar Conf. on Signals, Systems and Computers, November 2003.
6. E. Viterbo. (2006) The Golden Code Homepage. [Online], Available: http://wwwl.tlc.polito.it/~viterbo/perfect.codes/Golden.Code.html
7. M. O. Damen, H. El Gamal, and G. Caire, "On maximum-likelihood detection and the search of the closest lattice point," IEEE Trans. Inform. Theory, vol. 49, no. 10, pp. 2389-2402, October 2003.
8. H. Hassibi and B. Vikalo, "The expected complexity of sphere decoding, Part I: Theory, Part II: Applications," IEEE Trans. Signal Processing, vol. 44, no. 170, pp. 463-471, April 1985.
9. U. Fincke and M.Pohst, "Improved methods for calculating vectors of short length in a lattice, including a complexity analysis," Math. Computat., vol. 44, no. 170, pp. 463-471, April 1985.
10. C. Schnorr and M. Euchner, "Lattice basis reduction: inmproved practi-cal algorithms and solving subset sum problems," Math. Programming, vol. 66, no. 2, pp. 181-191, September 1994.
11. A. Burg, M. Borgmann, M. Wenk, M. Zellwegger, W. Fichtner, and H. Bölcskei, "VLSI implementation of MIMO detection using the sphere decoding algorithm," IEEE J. Solid-State Circuits, vol. 40, no. 7, pp. 1566-1577, July 2005.
12. K. Wong, C. Tsui, R. S. Cheng, and W. Mow, "A VLSI architecture of a K-best lattice decoding algorithm for MIMO channels," in Proc. IEEE ISCAS'02, 2002, pp. 273-276.
13. Z. Guo and P. Nilsson, "A VLSI architecture for the Schnorr-Euchner decoder for MIMO systems," in Proc. IEEE CAS Symp. Emerging Technologies, June 2004, pp. 65-68.