Published July 2006
| Published
Book Section - Chapter
Open
On the Performance of Sphere Decoding of Block Codes
Abstract
The performance of sphere decoding of block codes over a variety of channels is investigated. We derive a tight bound on the performance of maximum likelihood decoding of linear codes on q-ary symmetric channels. We use this result to bound the performance of q-ary hard decision sphere decoders. We also derive a tight bound on the performance of soft decision sphere decoders on the AWGN channel for BPSK and M-PSK modulated block codes. The performance of soft decision sphere decoding of arbitrary finite lattices or block codes is also analyzed.
Additional Information
© 2006 IEEE. This research was supported by NSF grant no. CCF-0514881 and grants from Sony, Qualcomm, and the Lee Center for Advanced Networking.Attached Files
Published - 04036311.pdf
Files
04036311.pdf
Files
(278.4 kB)
Name | Size | Download all |
---|---|---|
md5:9f688c3f98c679c50741207d53d46906
|
278.4 kB | Preview Download |
Additional details
- Eprint ID
- 77278
- Resolver ID
- CaltechAUTHORS:20170508-174050826
- NSF
- CCF-0514881
- Sony
- Qualcomm Inc.
- Caltech Lee Center for Advanced Networking
- Created
-
2017-05-16Created from EPrint's datestamp field
- Updated
-
2021-11-15Created from EPrint's last_modified field