DocumentCode
1030915
Title
Upper bounds for small trellis codes
Author
Calderbank, A.R. ; Pottie, G.J.
Author_Institution
AT&T Bell Lab., Murray Hill, NJ, USA
Volume
38
Issue
6
fYear
1992
fDate
11/1/1992 12:00:00 AM
Firstpage
1791
Lastpage
1795
Abstract
An upper bound on the minimum squared distance of trellis codes by packing Voronoi cells is derived and compared with previously known bounds. The authors focus on codes with small memory for modulation formats such as pulse amplitude modulation (PAM), m -ary quadrature amplitude modulation (QAM), and m -ary phase shift keying (PSK). The bound is tight to search results for coset codes with a small number of states
Keywords
amplitude modulation; phase shift keying; pulse amplitude modulation; trellis codes; PAM; PSK; QAM; Voronoi cells; coset codes; m-ary phase shift keying; m-ary quadrature amplitude modulation; minimum squared distance; pulse amplitude modulation; small memory; upper bound; Communication system control; Communication system software; Control systems; Convolutional codes; Feedback; Gaussian channels; Gaussian noise; Phase shift keying; Quadrature amplitude modulation; Upper bound;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.165452
Filename
165452
Link To Document