Cyclically permutable codes specified by roots of generator polynomial

2014 ◽  
Vol 50 (17) ◽  
pp. 1202-1204 ◽  
Author(s):  
J.S. Lemos‐Neto ◽  
V.C. Rocha
Keyword(s):  
1999 ◽  
Vol 35 (7) ◽  
pp. 551 ◽  
Author(s):  
M. Elia ◽  
M. Leone ◽  
C. Visentin

2014 ◽  
Vol 2014 ◽  
pp. 1-8
Author(s):  
Peter S. Chami ◽  
Bernd Sing ◽  
Norris Sookoo

We investigate polynomials, called m-polynomials, whose generator polynomial has coefficients that can be arranged in a square matrix; in particular, the case where this matrix is a Hadamard matrix is considered. Orthogonality relations and recurrence relations are established, and coefficients for the expansion of any polynomial in terms of m-polynomials are obtained. We conclude this paper by an implementation of m-polynomials and some of the results obtained for them in Mathematica.


2011 ◽  
Vol 39 (4) ◽  
pp. 72-77 ◽  
Author(s):  
Amila Akagić ◽  
Hideharu Amano

2016 ◽  
Vol 2016 ◽  
pp. 1-8 ◽  
Author(s):  
Gaurav Purohit ◽  
Kota Solomon Raju ◽  
Vinod Kumar Chaubey

This paper presents a novel XOR-FREE algorithm to implement the convolutional encoder using reconfigurable hardware. The approach completely removes the XOR processing of a chosen nonsystematic, feedforward generator polynomial of larger constraint length. The hardware (HW) implementation of new architecture uses Lookup Table (LUT) for storing the parity bits. The design implements architectural reconfigurability by modifying the generator polynomial of the same constraint length and code rate to reduce the design complexity. The proposed architecture reduces the dynamic power up to 30% and improves the hardware cost and propagation delay up to 20% and 32%, respectively. The performance of the proposed architecture is validated in MATLAB Simulink and tested on Zynq-7 series FPGA.


1989 ◽  
Vol 25 (18) ◽  
pp. 1223 ◽  
Author(s):  
Y.R. Shayan ◽  
T. Le-Ngoc

Sign in / Sign up

Export Citation Format

Share Document