Results 151 to 160 of about 38,212 (190)

Notes on Cyclic Convolutional Codes

1975
Let Fq be the finite field of order q. We then denote by Fq[D] the set of polynomials in D with coefficients in Fq, and by Fq[D] the set of sequences on Fq:
openaire   +1 more source

A fast algorithm for half-cyclic convolution

[Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing, 1991
The definition of half-cyclic convolution is introduced. It is shown that the computation for cyclic convolution can be carried out based on the half-cyclic convolution, which is more general. The algorithm for half-cyclic convolution then can be used to build an algorithm for cyclic convolution and the fast Fourier transform (FFT), so that some ...
H. Liu, R. Tolimieri
openaire   +1 more source

Multidimensional cyclic convolution algorithms with minimal multiplicative complexity

IEEE Transactions on Acoustics, Speech, and Signal Processing, 1987
This paper presents novel multidimensional cyclic convolution algorithms which achieve the theoretically minimum number of multiplications. The proposed algorithms are compared to the well-known and used polynomial transform and split nesting convolution algorithms.
I. Pitas, M. Strintzis
openaire   +1 more source

A New Perspective of Cyclicity in Convolutional Codes

IEEE Transactions on Information Theory, 2016
In this paper, we propose a new way of providing cyclic structures to convolutional codes. We define the skew cyclic convolutional codes as left ideals of a quotient ring of a suitable non-commutative polynomial ring. In contrast to the previous approaches to cyclicity for convolutional codes, we use Ore polynomials with coefficients in a field (the ...
Jose Gomez-Torrecillas, F. J. Lobillo, Gabriel Navarro   +2 more
openaire   +1 more source

Improved fast polynomial transform algorithm for cyclic convolutions

Circuits, Systems, and Signal Processing, 1995
The authors present an improved version of the fast polynomial transform which eliminates totally the pre-transform and post-transform computations for the realization of the cyclic convolution. This new formulation has the advantage of regular structure and requires just one type of complex root of unity. The computation time is 20\% reduced.
Loh, Albert Ming, Siu, Wan-Chi
openaire   +2 more sources

Cyclic convolution algorithms over finite fields: Multidimensional considerations

ICASSP '81. IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005
By making an example of the earlier proposed cyclic convolution algorithms, the computational efficiency of the multidimensional techniques over finite fields is investigated. It is shown that the multidimensional techniques are inferior to the directly designed algorithms for all lengths except when applied to lengths whose exponents are relatively ...
M. Wagh, S. Morgera
openaire   +1 more source

Optimal Cyclic Convolution System for Maximizing SNR

IETE Journal of Research, 1976
The problem of maximizing SNR at the output of a cyclic convolution system is considered. It is shown that the required impulse response function of the system has an interpretation analogous to that of matched filter. Similarities and differences with the matched filter are discussed.
openaire   +1 more source

Short quasi-cyclic LDPC codes from convolutional codes

2009 IEEE International Symposium on Information Theory, 2009
We search for good regular quasi-cyclic (QC) LDPC codes with J = 2 ones in each column. In order to simplify the search, QC LDPC codes are represented in the form of tail-biting (TB) convolutional codes. A modified BEAST algorithm is used for finding the free distance (minimum distance) and the girth of both parent convolutional and block LDPC codes ...
Irina E. Bocharova, Boris D. Kudryashov, Roman V. Satyukov, Stephan Stiglmayry   +3 more
openaire   +1 more source

A Short Introduction to Cyclic Convolutional Codes

2009
We introduce the notion of cyclic convolutional codes and briefly survey some recent results that were derived with the aid of Grobner-type theory.
Heide Gluesing-Luerssen, Barbara Langfeld, Wiland Schmale   +2 more
openaire   +1 more source

Quasi-cyclic low-density parity-check convolutional code

2011 IEEE 7th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob), 2011
This paper proposes a novel quasi-cyclic low-density parity-check convolutional code, and a two-stage construction algorithm with modified progressive edge growth (PEG) method is provided. We propose both encoder and decoder implementation architecture for this code.
null Yixiang Wang, null Hui Yu, null Youyun Xu   +2 more
openaire   +1 more source