Application of set-membership techniques to symbol-by-symbol decoding for binary data-transmission systems

Author

Wells, R.B.

Author_Institution

Idaho Univ., Boise, ID

Volume

42

Issue

4

fYear

1996

fDate

7/1/1996 12:00:00 AM

Firstpage

1285

Lastpage

1290

Abstract

The application of set theory methods to problems in estimation, system identification, and classification is emerging as a viable approach to a number of different problems. This correspondence studies the use of set-membership methods in symbol-by-symbol decoding of binary data in data-transmission systems. Theorems for necessary and sufficient conditions for error-free decoding are presented. Following these theorems, an algorithm is presented for selection of decode threshold levels based on set-membership properties of the system. A second algorithm is presented for automatic generation of logic truth tables for the decoder

Keywords

data communication; decoding; logic design; set theory; algorithm; automatic generation; binary data-transmission systems; decode threshold levels; error-free decoding; logic truth tables; set theory methods; set-membership techniques; symbol-by-symbol decoding; Automatic logic units; Data communication; Decoding; Detectors; Distortion measurement; Estimation theory; Set theory; Signal processing algorithms; Sufficient conditions; System identification;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/18.508861

Filename

508861