DocumentCode :
1808838
Title :
An accelerated search algorithm for punctured convolutional codes
Author :
Bian, Yi ; O´Reilly, John
Author_Institution :
Dept. of Electron. & Electr. Eng., Univ. Coll. London, UK
Volume :
3
fYear :
1995
fDate :
14-16 Nov 1995
Firstpage :
2262
Abstract :
An accelerated search algorithm for punctured convolutional codes is presented. Its application yields a significant extension of recent results on punctured convolutional codes to higher rates (up to 13/14) and longer memory (up to 12). The algorithm enables the search of a new class of codes, defined over a much larger code space, which provides greatly improved error performance. The new codes have the prospect of wide applications in digital satellite, fiber-optical, personal mobile, and many other communications systems including mass information storage systems. A performance comparison between the new and existing classes of code is effected
Keywords :
convolutional codes; error correction codes; variable rate codes; accelerated search algorithm; code space; digital satellite communication; error performance; fiber-optical communication; mass information storage systems; personal mobile communication; punctured convolutional codes; Acceleration; Artificial satellites; Convolutional codes; Decoding; Educational institutions; Encoding; Error probability; Forward error correction; Optical fiber communication; Viterbi algorithm;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Global Telecommunications Conference, 1995. GLOBECOM '95., IEEE
Print_ISBN :
0-7803-2509-5
Type :
conf
DOI :
10.1109/GLOCOM.1995.502804
Filename :
502804
Link To Document :
بازگشت