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

Erik Paaske, Ole Riis Jensen

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

211 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 languageEnglish
Title of host publicationProceedings IEEE International Symposium on Information Theory
PublisherIEEE
Publication date1994
Pages277-277
ISBN (Print)0-7803-2015-8
DOIs
Publication statusPublished - 1994
Event1994 IEEE International Symposium on Information Theory - Trondheim, Norway
Duration: 27 Jun 19941 Jul 1994
http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=3149

Conference

Conference1994 IEEE International Symposium on Information Theory
CountryNorway
CityTrondheim
Period27/06/199401/07/1994
Internet address

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

Fingerprint Dive into the research topics of 'Search methods for rate 1/N convolutional codes used in concatenated systems'. Together they form a unique fingerprint.

Cite this