Published September 2005
| Published
Book Section - Chapter
Open
Bounds on the performance of sphere decoding of linear block codes
- Creators
- El-Khamy, Mostafa
- Vikalo, Haris
-
Hassibi, Babak
- Other:
- Dinneen, M. J.
Abstract
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.
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.Attached Files
Published - ELKitw05.pdf
Files
ELKitw05.pdf
Files
(474.4 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:cf2d37edb35341db51cc748a4e902afa
|
474.4 kB | Preview Download |
Additional details
- Eprint ID
- 24532
- Resolver ID
- CaltechAUTHORS:20110725-143155106
- NSF
- CCR-0118670
- Sony
- Qualcomm
- Caltech Lee Center for Advanced Networking
- Created
-
2011-07-28Created from EPrint's datestamp field
- Updated
-
2021-11-09Created from EPrint's last_modified field