Properties of Finite Response Input Sequences of Recursive Convolutional Codes
Author(s) -
Didier Le Ruyet,
Han Vu Thien,
Hong Sun
Publication year - 1999
Publication title -
lecture notes in computer science
Language(s) - English
Resource type - Book series
SCImago Journal Rank - 0.249
H-Index - 400
eISSN - 1611-3349
pISSN - 0302-9743
ISBN - 3-540-66723-7
DOI - 10.1007/3-540-46796-3_32
Subject(s) - finite field , hamming weight , convolutional code , computer science , encoder , algorithm , hamming code , hamming distance , sequence (biology) , impulse response , infinite impulse response , convolution (computer science) , discrete mathematics , mathematics , block code , decoding methods , artificial intelligence , digital filter , telecommunications , mathematical analysis , biology , artificial neural network , genetics , operating system , bandwidth (computing)
A recursive convolutional encoder can be regarded as an infinite impulse response system over the Galois Field of order 2. First, in this paper, we introduce finite response input sequences for recursive convolutional codes that give finite weight output sequences. In practice, we often need to describe the finite response sequence with a certain Hamming weight. Then, different properties of finite response input sequences are presented. It is shown that all finite response input sequences with a certain Hamming weight can be obtained in closed-form expressions from the so-called basic sequences. These basic sequences are presented for important recursive convolutional encoders and some possible applications are given.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom