A State Space Approach to Periodic Convolutional Codes
نویسندگان
چکیده
In this paper we study periodically time-varying convolutional codes by means of input-state-output representations. Using these representations we investigate under which conditions a given time-invariant convolutional code can be transformed into an equivalent periodic time-varying one. The relation between these two classes of convolutional codes is studied for period 2. We illustrate the ideas presented in this paper by constructing a periodic time-varying convolutional code from a time-invariant one. The resulting periodic code has larger free distance than any time-invariant convolutional code with equivalent parameters.
منابع مشابه
A State Space Approach for Constructing MDS Rate 1/n Convolutional Codes - Information Theory Workshop, 1998
In th is p a p e r w e provide a state space approach for cons t ruc t ing convoIutiona1 codes of rate 1/72 a n d complexi ty 6, whose f ree d is tance is n(6 + l), the max ima l possible f ree dis tance.
متن کاملMDP Periodically Time-Varying Convolutional Codes
In this paper we use some classical ideas from linear systems theory to analyse convolutional codes. In particular, we exploit input-state-output representations of periodic linear systems to study periodically time-varying convolutional codes. In this preliminary work we focus on the column distance of these codes and derive explicit necessary and sufficient conditions for an (n, 2, 1) periodi...
متن کاملOptimum space-time convolutional codes
| Optimum space-time convolutional codes, that provide maximum diversity and coding gain, are produced for cases with PSK modulation and various numbers of states and antennas. The codes are found using a new approach introduced recently in a companion paper. The new approach provides an eecient method that allows a search for optimum codes for many practical problems, while previous research w...
متن کاملState Space Realizations and Monomial Equivalence for Convolutional Codes
We will study convolutional codes with the help of state space realizations. It will be shown that two such minimal realizations belong to the same code if and only if they are equivalent under the full state feedback group. This result will be used in order to prove that two codes with positive Forney indices are monomially equivalent if and only if they share the same adjacency matrix. The ad...
متن کاملPragmatic Space-Time Trellis Codes for Block Fading Channels
A pragmatic approach for the construction of space-time codes over block fading channels is investigated. The approach consists in using common convolutional encoders and Viterbi decoders with suitable generators and rates, thus greatly simplifying the implementation of space-time codes. For the design of pragmatic space-time codes a methodology is proposed and applied, based on the extension o...
متن کامل