By Topic

A Novel High-Speed Systematic Encoder for Long Binary Cyclic Codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
El-Din, R.F.T. ; Dept. of Eng. Phys. & Math., Ain Shams Univ., Cairo, Egypt ; El-Hassani, R.M. ; El-Ramly, S.H.

Long codes encoders have some limitations in high speed data transmission, making them not adequate to some applications' requirements. In this paper, a novel systematic encoding algorithm for cyclic codes shows a satisfactory time saving percentage over traditional algorithms, especially for long codes (n ≥ 214-1). Time computational complexity of max{O(t √k),O(t2 log n) log(t log n) log (log (t log n)))} has been estimated for the proposed encoder. Although the proposed encoder is applicable to any cyclic code, comparisons to conventional encoders (systematic and non-systematic) are carried out for long BCH codes. MATLAB simulated results prove superior time saving percentage over traditional encoders, especially for extremely long codes even with large error correction capability.

Published in:

Communications Letters, IEEE  (Volume:17 ,  Issue: 5 )