BLOCK CODES FOR THE 2**N -PSK CHANNEL.

Henk C.A. Van Tilborg; Li Fung Chang

BLOCK CODES FOR THE 2**N -PSK CHANNEL.

Henk C.A. Van Tilborg
, Li Fung Chang

Coding Theory and Cryptology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

Abstract

Summary form only given. In 1977 it was described how n binary block codes can be combined to construct block codes for the 2**n -PSK channel. Using this technique it is quite easy to construct block codes for this channel with very high asymptotic coding gains. The result seems to have theoretical value, because good soft decision decoding algorithms seldom exist for these codes. For the 8-PSK channel it is shown how three nearly trivial, binary linear codes together form a block code, that has a very simple maximum-likelihood decoding algorithm. Its performance and complexity are comparable with Ungerboeck's v equals 2 convolutional code.

Original language	English
Title of host publication	1986 IEEE International Symposium on Information Theory (ISIT)
Pages	100
Number of pages	1
Publication status	Published - 1986

Cite this

@inproceedings{4c0a726453124d53b9157c0cbc2df282,

title = "BLOCK CODES FOR THE 2**N -PSK CHANNEL.",

abstract = "Summary form only given. In 1977 it was described how n binary block codes can be combined to construct block codes for the 2**n -PSK channel. Using this technique it is quite easy to construct block codes for this channel with very high asymptotic coding gains. The result seems to have theoretical value, because good soft decision decoding algorithms seldom exist for these codes. For the 8-PSK channel it is shown how three nearly trivial, binary linear codes together form a block code, that has a very simple maximum-likelihood decoding algorithm. Its performance and complexity are comparable with Ungerboeck's v equals 2 convolutional code.",

author = "\{Van Tilborg\}, \{Henk C.A.\} and Chang, \{Li Fung\}",

year = "1986",

language = "English",

pages = "100",

booktitle = "1986 IEEE International Symposium on Information Theory (ISIT)",

}

TY - GEN

T1 - BLOCK CODES FOR THE 2**N -PSK CHANNEL.

AU - Van Tilborg, Henk C.A.

AU - Chang, Li Fung

PY - 1986

Y1 - 1986

N2 - Summary form only given. In 1977 it was described how n binary block codes can be combined to construct block codes for the 2**n -PSK channel. Using this technique it is quite easy to construct block codes for this channel with very high asymptotic coding gains. The result seems to have theoretical value, because good soft decision decoding algorithms seldom exist for these codes. For the 8-PSK channel it is shown how three nearly trivial, binary linear codes together form a block code, that has a very simple maximum-likelihood decoding algorithm. Its performance and complexity are comparable with Ungerboeck's v equals 2 convolutional code.

AB - Summary form only given. In 1977 it was described how n binary block codes can be combined to construct block codes for the 2**n -PSK channel. Using this technique it is quite easy to construct block codes for this channel with very high asymptotic coding gains. The result seems to have theoretical value, because good soft decision decoding algorithms seldom exist for these codes. For the 8-PSK channel it is shown how three nearly trivial, binary linear codes together form a block code, that has a very simple maximum-likelihood decoding algorithm. Its performance and complexity are comparable with Ungerboeck's v equals 2 convolutional code.

UR - https://www.scopus.com/pages/publications/0022982609

M3 - Conference contribution

AN - SCOPUS:0022982609

SP - 100

BT - 1986 IEEE International Symposium on Information Theory (ISIT)

ER -

BLOCK CODES FOR THE 2**N -PSK CHANNEL.

Abstract

Other files and links

Fingerprint

Cite this