Majid MAZROOEI, Lale RAHIMI, Najme SAHAMI

Two-dimensional generalized discrete Fourier transform and related quasi-cyclicReed{Solomon codes

Using the concept of the partial Hasse derivative, we introduce a generalization of the classical 2-dimensionaldiscrete Fourier transform, which will be called 2D-GDFT. Begining with the basic properties of 2D-GDFT, we proceedto study its computational aspects as well as the inverse transform, which necessitate the development of a faster wayto calculate the 2D-GDFT. As an application, we will employ 2D-GDFT to construct a new family of quasi-cyclic linearcodes that can be assumed to be a generalization of Reed{Solomon codes.

PDF

___

[1]Arazi B. Two-dimensional digital processing of one-dimensional signal. IEEE T Acoust Speech 1974; 22: 31-36.
[2]Blahut RE. Algebraic Codes for Data Transmission. New York, NY, USA: Cambridge University Press, 2003.
[3]Bongiovanni G, Corsini P, Frosini G. One-dimensional and two-dimensional generalized discrete Fourier transforms.IEEE T Acoust Speech 1974; 24: 97-99.
[4]Brenner NM. Fast Fourier transform of externally stored data. IEEE T Acoust Speech 1963; 17: 128-132.
[5]Buijs HL. Fast Fourier transformation of large arrays of data. Appl Optimizat 1963; 8: 211-212.
[6]Corsini P, Frosini G. Properties of the multidimensional generalized discrete Fourier transform. IEEE T Comput1979; C-28: 819-830.
[7]Gao S. A new algorithm for decoding Reed-Solomon codes. In: Bhargava VK, Poor HV, Tarokh V, Yoon S,editors. Communications, Information and Network Security. The Springer International Series in Engineering andComputer Science (Communications and Information Theory), Vol. 712. Boston, MA, USA: Springer, pp. 55-68.
[8]Gulliver TA, Bhargava VK. New good rate (m1)=pmternary and quaternary quasi-cyclic codes. Design CodeCryptogr 1996; 7: 223-233.
[9]Massey JL, Serconek S. Linear complexity of periodic sequences: a general theory. Lect Notes Comput Sc 1996;1109: 358-371.
[10]Reed IS, Solomon G. Polynomial codes over certain nite elds. Siam J Appl Math 1960; 8: 300-304.
[11]Sarwate D, Shanbhag N. High-speed architectures for Reed-Solomon decoders. IEEE T VLSI Syst 2001; 9: 641-655.
[12]Singleton RC. A method for computing the fast Fourier transform with auxiliary memory and limited high-speedstorage. IEEE T Acoust Speech 1967; 16: 91-98.
[13]Wicker SB, Bhargava VK. Reed-Solomon Codes and Their Applications. New York, NY, USA: IEEE Press, 1994

ISSN: 1300-0098
Yayın Aralığı: Yılda 6 Sayı
Yayıncı: TÜBİTAK

Arşiv