Fast paired method of a 1-D cyclic convolution realization

Details Fast paired method of a 1-D cyclic convolution realization Fast paired method of a 1-D cyclic convolution realization

2003-01-31

2008-03-18

Kneppper, David D. (Department: 2626)

Data processing: speech signal processing, linguistics, language

Speech signal processing

For storage or transmission

Reexamination Certificate

active

07346498

ABSTRACT:
Systems and methods are described for a fast paired method of 1-D cyclic convolution. A method includes calculating a paired transform of a signal, grouping components of the paired transform to form a plurality of splitting-signals, shifting the plurality of splitting signals, multiplying the plurality of splitting signals by a plurality of corresponding Fourier transforms, and calculating an inverse paired transform of the plurality of splitting signals.

REFERENCES:
patent: 4797923 (1989-01-01), Clarke
patent: 5526446 (1996-06-01), Adelson et al.
patent: 6119080 (2000-09-01), Liu et al.
patent: 6459818 (2002-10-01), George
patent: 6625629 (2003-09-01), Garcia
Agarwal and Cooley, “New algorithms for digital convolution,”IEEE Transactions Conf., Acoust., Speech, Signal Processing, ASSP-25:392-409, 1977.
Agarwal and Cooley, “New algorithms for digital convolution,” in:Intern. Conf. Acouts. Speech Signal Processing, 360-362, 1977.
Agarwal and Burrus, “Fast one-dimensional digital convolution by multidimensional techniques,”IEEE Trans. on Acoustics, Speech, Signal Processing., ASSP-22:1-10, 1974.
Bhattacharya and Agarwal, “Number theoretic techniques for computation of digital convolution,”IEEE Trans. Acoustic, Speech, Signal Proc., ASSP-32(3):507-511, 1984.
Burrus and Parks,DFT/FFT and Convolution Algorithms: Theory and Implementation, New York: Wiley, 1985.
Ersoy,Fourier-Related Transform, Fast Algorithms and Applications, Prentice Hall, 1997.
Grigoryan and Agaian, “Split manageable efficient algorithm for Fourier and Hadamard transforms,”IEEE Transaction on Signal Processing, 48(1):172-183, 2000.
Grigoryan, “2-D and 1-D multipaired transforms: Frequency-time type wavelets,”IEEE Trans. Signal Processing, 49(2):344-353, 2001.
Grigoryan, “New algorithms for calculating the discrete Fourier transforms,”Vichislit. Matem. i Mat. Fiziki, AS USSR(USSR Compt. Naths. Math. Pys.), 26(5): 84-88, 1986.
Heidemann,Multiplicative Complexity, Convolution, and the DFT, New York: Springer-Verlag, 1988.
Ifeacher and Jervis (eds.),Digital Signal Processing, 2ndedition, Prentice Hall, 2002.
Nussbaumer,Fast Fourier Transform and Convolution Algorithms, 2nd ed., Springer—Verlag, Berlin, 1982.
Oppenheim and Shafer,Digital Signal Processing, Prentice-Hall, Englewood Cliffs, NJ: Prentice-Hall, c1975.
Proakis and Manolakis,Digital Signal Processing: Principles, Algorithms, and Applications, 3rded., Englewood Cliffs, NJ: Prentice-Hall, 1996.
Reddy and Reddy, “Complex rectangular transforms for digital convolution,”IEEE Trans. Acoustic, Speech, Signal Proc., ASSP-28(5):592-596, 1980.
Stockham, “High-speed convolution and correlation with applications to digital filtering,” In:Digital Processing of Signals, Gold et al., (eds.), McGraw-Hill, New York, pp. 203-232, 1969.
Stockham, “High-speed convolution and correlation,” in:Spring Joint Computer Conf., AFIPS Proc., 28: 229-233, 1966.

Affiliated with

Also associated with

Rating

Fast paired method of a 1-D cyclic convolution realization does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Fast paired method of a 1-D cyclic convolution realization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast paired method of a 1-D cyclic convolution realization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3973180