{"title":"Path Pruning for Unequal Error Protection Turbo Codes","authors":"W. Henkel, N. von Deetzen","doi":"10.1109/IZS.2006.1649100","DOIUrl":null,"url":null,"abstract":"For some applications in communications, it is desirable to provide unequal error protection for different types of information data. In image coding, e.g., types of bits exist which have to be protected with different protection levels when transmitting these data over noisy channels. In this paper, we concentrate on turbo codes C. Berrou et al., 1993) with unequal error protection capabilities which are achieved by modifying the code rate R = k/n. After pointing out that puncturing and path pruning are modifications of the rate in the denominator and numerator, respectively, the latter is studied in more detail. Design rules are given and EXIT charts for performance analysis of turbo codes with path-pruned convolutional component codes are presented","PeriodicalId":405389,"journal":{"name":"2006 International Zurich Seminar on Communications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 International Zurich Seminar on Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IZS.2006.1649100","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 18
Abstract
For some applications in communications, it is desirable to provide unequal error protection for different types of information data. In image coding, e.g., types of bits exist which have to be protected with different protection levels when transmitting these data over noisy channels. In this paper, we concentrate on turbo codes C. Berrou et al., 1993) with unequal error protection capabilities which are achieved by modifying the code rate R = k/n. After pointing out that puncturing and path pruning are modifications of the rate in the denominator and numerator, respectively, the latter is studied in more detail. Design rules are given and EXIT charts for performance analysis of turbo codes with path-pruned convolutional component codes are presented