Upper bounds for small trellis codes

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), an...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on information theory Vol. 38; no. 6; pp. 1791 - 1795
Main Authors:	Calderbank, A.R., Pottie, G.J.
Format:	Journal Article
Language:	English
Published:	New York, NY IEEE 01-11-1992 Institute of Electrical and Electronics Engineers
Subjects:	Applied sciences Coding, codes Communication system control Communication system software Control systems Convolutional codes Exact sciences and technology Feedback Gaussian channels Gaussian noise Information, signal and communications theory Phase shift keying Quadrature amplitude modulation Signal and communications theory Telecommunications and information theory Upper bound Upper bound Code Bandwidth Treillis code
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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.< >
Bibliography:	ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23
ISSN:	0018-9448 1557-9654
DOI:	10.1109/18.165452