Search methods for rate 1/N convolutional codes used in concatenated systems

Erik Paaske; Ole Riis Jensen

doi:10.1109/ISIT.1994.395017

Search methods for rate 1/N convolutional codes used in concatenated systems

Erik Paaske, Ole Riis Jensen

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

276 Downloads (Pure)

Abstract

Different criteria for selection of good convolutional codes have been tested and the interesting conclusion is that the Viterbi bound on BER evaluated at a higher Eb/N0 value is the best guide when selecting codes for use on low Eb/N0 channels

Original language	English
Title of host publication	Proceedings IEEE International Symposium on Information Theory
Publisher	IEEE
Publication date	1994
Pages	277-277
ISBN (Print)	0-7803-2015-8
DOIs	https://doi.org/10.1109/ISIT.1994.395017
Publication status	Published - 1994
Event	1994 IEEE International Symposium on Information Theory - Trondheim, Norway Duration: 27 Jun 1994 → 1 Jul 1994 http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=3149

Conference

Conference	1994 IEEE International Symposium on Information Theory
Country/Territory	Norway
City	Trondheim
Period	27/06/1994 → 01/07/1994
Internet address	http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=3149

Bibliographical note

Copyright: 1994 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE

Access to Document

10.1109/ISIT.1994.395017

PaaskeFinal published version, 107 KB

SFX availability

Full text

Cite this

@inproceedings{a07a2c6a56cc4c0ba24fa62b940cd24e,

title = "Search methods for rate 1/N convolutional codes used in concatenated systems",

abstract = "Different criteria for selection of good convolutional codes have been tested and the interesting conclusion is that the Viterbi bound on BER evaluated at a higher Eb/N0 value is the best guide when selecting codes for use on low Eb/N0 channels",

author = "Erik Paaske and Jensen, {Ole Riis}",

note = "Copyright: 1994 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE; 1994 IEEE International Symposium on Information Theory, ISIT 1994 ; Conference date: 27-06-1994 Through 01-07-1994",

year = "1994",

doi = "10.1109/ISIT.1994.395017",

language = "English",

isbn = "0-7803-2015-8",

pages = "277--277",

booktitle = "Proceedings IEEE International Symposium on Information Theory",

publisher = "IEEE",

address = "United States",

url = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=3149",

}

TY - GEN

T1 - Search methods for rate 1/N convolutional codes used in concatenated systems

AU - Paaske, Erik

AU - Jensen, Ole Riis

N1 - Copyright: 1994 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE

PY - 1994

Y1 - 1994

N2 - Different criteria for selection of good convolutional codes have been tested and the interesting conclusion is that the Viterbi bound on BER evaluated at a higher Eb/N0 value is the best guide when selecting codes for use on low Eb/N0 channels

AB - Different criteria for selection of good convolutional codes have been tested and the interesting conclusion is that the Viterbi bound on BER evaluated at a higher Eb/N0 value is the best guide when selecting codes for use on low Eb/N0 channels

U2 - 10.1109/ISIT.1994.395017

DO - 10.1109/ISIT.1994.395017

M3 - Article in proceedings

SN - 0-7803-2015-8

SP - 277

EP - 277

BT - Proceedings IEEE International Symposium on Information Theory

PB - IEEE

T2 - 1994 IEEE International Symposium on Information Theory

Y2 - 27 June 1994 through 1 July 1994

ER -

Search methods for rate 1/N convolutional codes used in concatenated systems

Abstract

Conference

Bibliographical note

Access to Document

SFX availability

Fingerprint

Cite this