By Topic

A complex-valued cyclic code using fast Fourier transform

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)
Yeun-Renn Ting ; Dept. of Electr. Eng., Chang Gung Univ., Taoyuan, Taiwan ; Erl-Huei Lu ; Chiou-Yng Lee

A (N, N-dmin+1) cyclic code based on the complex-valued discrete Fourier transform is proposed. Since the code length N of the code can be any positive integer and each symbol in a code word can be a complex value (consists of two real-valued symbols), the code may be more suitable for some applications, than those codes based on Galois fields. One can design an encoder structure using the existing FFT chip. Due to the cyclic structure decoding is easy in a step-by-step manner

Published in:

Wireless Communications, 2001. (SPAWC '01). 2001 IEEE Third Workshop on Signal Processing Advances in

Date of Conference: