El-Khamy, Mostafa and Vikalo, Haris and Hassibi, Babak (2005) Bounds on the performance of sphere decoding of linear block codes. In: Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, ITW 2005. IEEE , Piscataway, NJ, pp. 47-51. ISBN 0-7803-9480-1 http://resolver.caltech.edu/CaltechAUTHORS:20110725-143155106
Full text is not posted in this repository. Consult Related URLs below.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:20110725-143155106
A sphere decoder searches for the closest lattice point within a certain search radius. The search radius provides a tradeoff between performance and complexity. We derive tight upper bounds on the performance of sphere decoding of linear block codes. The performance of soft-decision sphere decoding on AWGN channels as well as that of hard-decision sphere decoding on binary symmetric channels is analyzed.
|Item Type:||Book Section|
|Additional Information:||© 2005 IEEE. Issue Date: 29 Aug.-1 Sept. 2005. Date of Current Version: 14 November 2005. This research was supported by NSF grant no. CCR- 0118670 and grants from Sony, Qualcomm, and the Lee Center for Advanced Networking.|
|Other Numbering System:|
|Official Citation:||El-Khamy, M.; Vikalo, H.; Hassibi, B.; , "Bounds on the performance of sphere decoding of linear block codes," Information Theory Workshop, 2005 IEEE , vol., no., pp. 5 pp., 29 Aug.-1 Sept. 2005 doi: 10.1109/ITW.2005.1531854 URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1531854&isnumber=32676|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Tony Diaz|
|Deposited On:||28 Jul 2011 16:53|
|Last Modified:||23 Aug 2016 10:03|
Repository Staff Only: item control page