Abstract
We present a method to construct lower rate codes from a known high rate code by inserting known dummy bits into the information bit sequence before encoding. Like other multirate codes based on puncturing or repetition, this new class of codes can adjust the amount of protection given to the information bits, and can be decoded using the same decoder as for the mother codes. Specifically, we focused on the recursive systematic insertion convolutional (RSIC) codes. Our analysis and simulation results show that the proposed RSIC code achieves a performance which is comparable to the corresponding optimal recursive systematic repetition convolutional (RSRC) code
Original language | English |
---|---|
Title of host publication | Proceedings Globecom 2000, IEEE Global Telecommunications Conference, November 27 - December 1, San Francisco, California, USA |
Place of Publication | Piscataway |
Publisher | Institute of Electrical and Electronics Engineers |
Pages | 830-834 |
Volume | 2 |
ISBN (Print) | 0-7803-6451-1 |
DOIs | |
Publication status | Published - 2000 |
Event | 2000 IEEE Global Telecommunications Conference (GLOBECOM 2000) - Fairmont Hotel, San Francisco, United States Duration: 27 Nov 2000 → 1 Dec 2000 |
Conference
Conference | 2000 IEEE Global Telecommunications Conference (GLOBECOM 2000) |
---|---|
Abbreviated title | GLOBECOM 2000 |
Country/Territory | United States |
City | San Francisco |
Period | 27/11/00 → 1/12/00 |