A complex-valued cyclic code using fast Fourier transform

Yeun Renn Ting; Erl Huei Lu; Chiou Yng Lee

doi:10.1109/SPAWC.2001.923900

A complex-valued cyclic code using fast Fourier transform

Yeun Renn Ting, Erl Huei Lu, Chiou Yng Lee

Department of Electrical Engineering

Chang Gung University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

Abstract

A (N, N-d_min+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.

Original language	English
Title of host publication	2001 IEEE 3rd Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2001
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	271-274
Number of pages	4
ISBN (Electronic)	0780367200
DOIs	https://doi.org/10.1109/SPAWC.2001.923900
State	Published - 2001
Event	3rd IEEE Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2001 - Taoyuan, Taiwan Duration: 20 03 2001 → 23 03 2001

Publication series

Name	IEEE Workshop on Signal Processing Advances in Wireless Communications, SPAWC
Volume	2001-January

Conference

Conference	3rd IEEE Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2001
Country/Territory	Taiwan
City	Taoyuan
Period	20/03/01 → 23/03/01

Bibliographical note

Publisher Copyright:
© 2001 IEEE.

Keywords

Arithmetic
Data storage systems
Decoding
Digital systems
Discrete Fourier transforms
Encoding
Error correction
Fast Fourier transforms
Galois fields
Reed-Solomon codes

Access to Document

10.1109/SPAWC.2001.923900

Cite this

Ting, Y. R., Lu, E. H., & Lee, C. Y. (2001). A complex-valued cyclic code using fast Fourier transform. In 2001 IEEE 3rd Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2001 (pp. 271-274). Article 923900 (IEEE Workshop on Signal Processing Advances in Wireless Communications, SPAWC; Vol. 2001-January). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/SPAWC.2001.923900

@inproceedings{3ed5f2fbfeff42168847fb0efd01972f,

title = "A complex-valued cyclic code using fast Fourier transform",

abstract = "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.",

keywords = "Arithmetic, Data storage systems, Decoding, Digital systems, Discrete Fourier transforms, Encoding, Error correction, Fast Fourier transforms, Galois fields, Reed-Solomon codes",

author = "Ting, {Yeun Renn} and Lu, {Erl Huei} and Lee, {Chiou Yng}",

note = "Publisher Copyright: {\textcopyright} 2001 IEEE.; 3rd IEEE Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2001 ; Conference date: 20-03-2001 Through 23-03-2001",

year = "2001",

doi = "10.1109/SPAWC.2001.923900",

language = "英语",

series = "IEEE Workshop on Signal Processing Advances in Wireless Communications, SPAWC",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "271--274",

booktitle = "2001 IEEE 3rd Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2001",

address = "美国",

}

Ting, YR, Lu, EH & Lee, CY 2001, A complex-valued cyclic code using fast Fourier transform. in 2001 IEEE 3rd Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2001., 923900, IEEE Workshop on Signal Processing Advances in Wireless Communications, SPAWC, vol. 2001-January, Institute of Electrical and Electronics Engineers Inc., pp. 271-274, 3rd IEEE Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2001, Taoyuan, Taiwan, 20/03/01. https://doi.org/10.1109/SPAWC.2001.923900

A complex-valued cyclic code using fast Fourier transform. / Ting, Yeun Renn; Lu, Erl Huei; Lee, Chiou Yng.
2001 IEEE 3rd Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2001. Institute of Electrical and Electronics Engineers Inc., 2001. p. 271-274 923900 (IEEE Workshop on Signal Processing Advances in Wireless Communications, SPAWC; Vol. 2001-January).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A complex-valued cyclic code using fast Fourier transform

AU - Ting, Yeun Renn

AU - Lu, Erl Huei

AU - Lee, Chiou Yng

PY - 2001

Y1 - 2001

N2 - 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.

AB - 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.

KW - Arithmetic

KW - Data storage systems

KW - Decoding

KW - Digital systems

KW - Discrete Fourier transforms

KW - Encoding

KW - Error correction

KW - Fast Fourier transforms

KW - Galois fields

KW - Reed-Solomon codes

UR - http://www.scopus.com/inward/record.url?scp=84949645050&partnerID=8YFLogxK

U2 - 10.1109/SPAWC.2001.923900

DO - 10.1109/SPAWC.2001.923900

M3 - 会议稿件

AN - SCOPUS:84949645050

T3 - IEEE Workshop on Signal Processing Advances in Wireless Communications, SPAWC

SP - 271

EP - 274

BT - 2001 IEEE 3rd Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2001

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 3rd IEEE Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2001

Y2 - 20 March 2001 through 23 March 2001

ER -

Ting YR, Lu EH, Lee CY. A complex-valued cyclic code using fast Fourier transform. In 2001 IEEE 3rd Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2001. Institute of Electrical and Electronics Engineers Inc. 2001. p. 271-274. 923900. (IEEE Workshop on Signal Processing Advances in Wireless Communications, SPAWC). doi: 10.1109/SPAWC.2001.923900

A complex-valued cyclic code using fast Fourier transform

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this