Convolutional code search for good permutation trellis codes using M-ary FSK

Theo G. Swart; A. J. Han Vinck; Hendrik C. Ferreira

doi:10.1109/ISPLC.2007.371165

Convolutional code search for good permutation trellis codes using M-ary FSK

Theo G. Swart, A. J. Han Vinck, Hendrik C. Ferreira

Electrical and Electronic Engineering Science

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

3 Citations (Scopus)

Abstract

Permutation trellis codes combined with M-ary FSK are considered with the aim of combating additive noise, impulse noise and permanent frequency disturbances. New permutation trellis codes are presented that were found by exhaustive computer search, considering the free distance and the distance spectrum of the codes. Until now the best binary convolutional codes were considered to be the best candidates to use in mappings for trellis codes, however the results will show that this is not always the case. Simulation results are also presented, showing that in most cases the new permutation trellis codes are performing better than the previous codes, although the gains attained are small.

Original language	English
Title of host publication	2007 IEEE International Symposium on Power Line Communications and Its Applications, ISPLC'07
Pages	441-446
Number of pages	6
DOIs	https://doi.org/10.1109/ISPLC.2007.371165
Publication status	Published - 2007
Event	2007 IEEE International Symposium on Power Line Communications and Its Applications, ISPLC'07 - Pisa, Italy Duration: 26 Mar 2007 → 28 Mar 2007

Publication series

Name	2007 IEEE International Symposium on Power Line Communications and Its Applications, ISPLC'07

Conference

Conference	2007 IEEE International Symposium on Power Line Communications and Its Applications, ISPLC'07
Country/Territory	Italy
City	Pisa
Period	26/03/07 → 28/03/07

Keywords

Channel coding
Convolutional codes
Frequency-shift keying (FSK)
Interference suppression

ASJC Scopus subject areas

Energy Engineering and Power Technology
Electrical and Electronic Engineering

Access to Document

10.1109/ISPLC.2007.371165

Cite this

Swart, T. G., Han Vinck, A. J., & Ferreira, H. C. (2007). Convolutional code search for good permutation trellis codes using M-ary FSK. In 2007 IEEE International Symposium on Power Line Communications and Its Applications, ISPLC'07 (pp. 441-446). Article 4231739 (2007 IEEE International Symposium on Power Line Communications and Its Applications, ISPLC'07). https://doi.org/10.1109/ISPLC.2007.371165

@inproceedings{46acb0567e5a438fa27f843955cf6fef,

title = "Convolutional code search for good permutation trellis codes using M-ary FSK",

abstract = "Permutation trellis codes combined with M-ary FSK are considered with the aim of combating additive noise, impulse noise and permanent frequency disturbances. New permutation trellis codes are presented that were found by exhaustive computer search, considering the free distance and the distance spectrum of the codes. Until now the best binary convolutional codes were considered to be the best candidates to use in mappings for trellis codes, however the results will show that this is not always the case. Simulation results are also presented, showing that in most cases the new permutation trellis codes are performing better than the previous codes, although the gains attained are small.",

keywords = "Channel coding, Convolutional codes, Frequency-shift keying (FSK), Interference suppression",

author = "Swart, {Theo G.} and {Han Vinck}, {A. J.} and Ferreira, {Hendrik C.}",

year = "2007",

doi = "10.1109/ISPLC.2007.371165",

language = "English",

isbn = "1424410908",

series = "2007 IEEE International Symposium on Power Line Communications and Its Applications, ISPLC'07",

pages = "441--446",

booktitle = "2007 IEEE International Symposium on Power Line Communications and Its Applications, ISPLC'07",

note = "2007 IEEE International Symposium on Power Line Communications and Its Applications, ISPLC'07 ; Conference date: 26-03-2007 Through 28-03-2007",

}

Swart, TG, Han Vinck, AJ & Ferreira, HC 2007, Convolutional code search for good permutation trellis codes using M-ary FSK. in 2007 IEEE International Symposium on Power Line Communications and Its Applications, ISPLC'07., 4231739, 2007 IEEE International Symposium on Power Line Communications and Its Applications, ISPLC'07, pp. 441-446, 2007 IEEE International Symposium on Power Line Communications and Its Applications, ISPLC'07, Pisa, Italy, 26/03/07. https://doi.org/10.1109/ISPLC.2007.371165

Convolutional code search for good permutation trellis codes using M-ary FSK. / Swart, Theo G.; Han Vinck, A. J.; Ferreira, Hendrik C.
2007 IEEE International Symposium on Power Line Communications and Its Applications, ISPLC'07. 2007. p. 441-446 4231739 (2007 IEEE International Symposium on Power Line Communications and Its Applications, ISPLC'07).

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

TY - GEN

T1 - Convolutional code search for good permutation trellis codes using M-ary FSK

AU - Swart, Theo G.

AU - Han Vinck, A. J.

AU - Ferreira, Hendrik C.

PY - 2007

Y1 - 2007

N2 - Permutation trellis codes combined with M-ary FSK are considered with the aim of combating additive noise, impulse noise and permanent frequency disturbances. New permutation trellis codes are presented that were found by exhaustive computer search, considering the free distance and the distance spectrum of the codes. Until now the best binary convolutional codes were considered to be the best candidates to use in mappings for trellis codes, however the results will show that this is not always the case. Simulation results are also presented, showing that in most cases the new permutation trellis codes are performing better than the previous codes, although the gains attained are small.

AB - Permutation trellis codes combined with M-ary FSK are considered with the aim of combating additive noise, impulse noise and permanent frequency disturbances. New permutation trellis codes are presented that were found by exhaustive computer search, considering the free distance and the distance spectrum of the codes. Until now the best binary convolutional codes were considered to be the best candidates to use in mappings for trellis codes, however the results will show that this is not always the case. Simulation results are also presented, showing that in most cases the new permutation trellis codes are performing better than the previous codes, although the gains attained are small.

KW - Channel coding

KW - Convolutional codes

KW - Frequency-shift keying (FSK)

KW - Interference suppression

UR - http://www.scopus.com/inward/record.url?scp=34548834168&partnerID=8YFLogxK

U2 - 10.1109/ISPLC.2007.371165

DO - 10.1109/ISPLC.2007.371165

M3 - Conference contribution

AN - SCOPUS:34548834168

SN - 1424410908

SN - 9781424410903

T3 - 2007 IEEE International Symposium on Power Line Communications and Its Applications, ISPLC'07

SP - 441

EP - 446

BT - 2007 IEEE International Symposium on Power Line Communications and Its Applications, ISPLC'07

T2 - 2007 IEEE International Symposium on Power Line Communications and Its Applications, ISPLC'07

Y2 - 26 March 2007 through 28 March 2007

ER -

Convolutional code search for good permutation trellis codes using M-ary FSK

Abstract

Publication series

Conference

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this