APPLICATION OF SET-MEMBERSHIP TECHNIQUES TO SYMBOL-BY-SYMBOL DECODINGFOR BINARY DATA-TRANSMISSION SYSTEMS

Authors
Citation
Rb. Wells, APPLICATION OF SET-MEMBERSHIP TECHNIQUES TO SYMBOL-BY-SYMBOL DECODINGFOR BINARY DATA-TRANSMISSION SYSTEMS, IEEE transactions on information theory, 42(4), 1996, pp. 1285-1290
Citations number
14
Categorie Soggetti
Information Science & Library Science","Engineering, Eletrical & Electronic
ISSN journal
00189448
Volume
42
Issue
4
Year of publication
1996
Pages
1285 - 1290
Database
ISI
SICI code
0018-9448(1996)42:4<1285:AOSTTS>2.0.ZU;2-#
Abstract
The application of set theory methods to problems in estimation, syste m 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 c onditions for error-free decoding are presented. Following these theor ems, an algorithm is presented for selection of decode threshold level s based on set-membership properties of the system. A second algorithm is presented for automatic generation of logic truth tables for the d ecoder.