Fast Algorithms for Signal Processing
Abstract
Efficient signal processing algorithms are important for embedded and power-limited applications since, by reducing the number of computations, power consumption can be reduced significantly. Similarly, efficient algorithms are also critical to very large scale applications such as video processing and four-dimensional medical imaging. This self-contained guide, the only one of its kind, enables engineers to find the optimum fast algorithm for a specific application. It presents a broad range of computationally-efficient algorithms, describes their structure and implementation, and compares their relative strengths for given problems. All the necessary background mathematics is included and theorems are rigorously proved, so all the information needed to learn and apply the techniques is provided in one convenient guide. With this practical reference, researchers and practitioners in electrical engineering, applied mathematics, and computer science can reduce power dissipation for low-end applications of signal processing, and extend the reach of high-end applications.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Cites
An algorithm for the machine calculation of complex Fourier series
Cooley, J. W., & Tukey, J. W. (1965) · Mathematics of Computation · doi:10.1090/s0025-5718-1965-0178586-1 · Cited by 13,154 · see citing works
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403 · see citing works
Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
Viterbi, A. J. (1967) · IEEE Transactions on Information Theory · doi:10.1109/tit.1967.1054010 · Cited by 6,877 · see citing works
Information Theory and Reliable Communication.
Lee, P. M., & Gallager, R. T. (1970) · Journal of the Royal Statistical Society Series A (General) · doi:10.2307/2344305 · Cited by 5,559 · see citing works
Ahmed, N., Natarajan, T., & Rao, K. R. (1974) · IEEE Transactions on Computers · doi:10.1109/t-c.1974.223784 · Cited by 5,156 · see citing works
Optimal decoding of linear codes for minimizing symbol error rate
Bahl, L. R. (1974) · IEEE Transactions on Information Theory · Cited by 4,665 · see citing works
Theory and Application of Digital Signal Processing
Rabiner, L. R., Gold, B., & Yuen, C. K. (1978) · IEEE Transactions on Systems Man and Cybernetics · doi:10.1109/tsmc.1978.4309918 · Cited by 2,831 · see citing works
Modular Multiplication Without Trial Division
Montgomery, P. L. (1985) · Mathematics of Computation · doi:10.1090/s0025-5718-1985-0777282-x · Cited by 2,659 · see citing works
The CORDIC Trigonometric Computing Technique
Volder, J. E. (1959) · IRE Transactions on Electronic Computers · doi:10.1109/tec.1959.5222693 · Cited by 2,655 · see citing works
Gaussian elimination is not optimal
Strassen, V. (1969) · Numerische Mathematik · doi:10.1007/bf02165411 · Cited by 2,509 · see citing works
Berlekamp, E. R. (2014) · WORLD SCIENTIFIC eBooks · doi:10.1142/9407 · Cited by 2,501 · see citing works
Matrix multiplication via arithmetic progressions
Coppersmith, D., & Winograd, S. (1990) · Journal of Symbolic Computation · doi:10.1016/s0747-7171(08)80013-2 · Cited by 2,248 · see citing works
Shift-register synthesis and BCH decoding
Massey, J. (1969) · IEEE Transactions on Information Theory · doi:10.1109/tit.1969.1054260 · Cited by 2,205 · see citing works
Theory and practice of error control codes
Blahut, R. E. (1983) · Virtual Defense Library (Ministerio de Defensa) · Cited by 2,066 · see citing works
Self-citationA Fast Computational Algorithm for the Discrete Cosine Transform
Chen, W.-H., Smith, C., & Fralick, S. (1977) · IEEE Transactions on Communications · doi:10.1109/tcom.1977.1093941 · Cited by 1,148 · see citing works
The Fitting of Time-Series Models
Durbin, J. (1960) · Revue de l Institut International de Statistique / Review of the International Statistical Institute · doi:10.2307/1401322 · Cited by 1,066 · see citing works
A unified algorithm for elementary functions
Walther, J. S. (1971) · AFIPS Spring Joint Computer Conference (SJCC) · doi:10.1145/1478786.1478840 · Cited by 1,038 · see citing works
An exact recursion for the composite nearest-neighbor degeneracy for a 2× N lattice space
McQuistan, R. B., & Hock, J. L. (1984) · Journal of Mathematical Physics · doi:10.1063/1.526133 · Cited by 924 · see citing works
The art of computer programming. Vol.1: Fundamental algorithms
Knuth, D. E. (1978) · Virtual Defense Library (Ministerio de Defensa) · Cited by 801 · see citing works
A First Course in Abstract Algebra.
Bogart, K. P., Grätzer, G., & Fraleigh, J. B. (1969) · American Mathematical Monthly · doi:10.2307/2317912 · Cited by 717 · see citing works
Beam-forming matrix simplifies design of electronically scanned antennas
Butler, J. K. (1961) · Electronic design · Cited by 706 · see citing works
Algebraic Codes for Data Transmission
Blahut, R. E. (2003) · Cambridge University Press eBooks · doi:10.1017/cbo9780511800467 · Cited by 657 · see citing works
Self-citationOn computing the discrete Fourier transform
Winograd, S. (1978) · Mathematics of Computation · doi:10.1090/s0025-5718-1978-0468306-4 · Cited by 613 · see citing works
Fundamentals of Convolutional Coding
Johannesson, R., & Zigangirov, K. S. (2015) · doi:10.1002/9781119098799.fmatter · Cited by 589 · see citing works
An Algorithm for the Inversion of Finite Toeplitz Matrices
Trench, W. F. (1964) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0112045 · Cited by 560 · see citing works
Arithmetic Complexity of Computations
Winograd, S. (1980) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970364 · Cited by 547 · see citing works
Fast Sequential Decoding Algorithm Using a Stack
Jelinek, F. (1969) · IBM Journal of Research and Development · doi:10.1147/rd.136.0675 · Cited by 543 · see citing works
Discrete Fourier transforms when the number of data samples is prime
Rader, C. M. (1968) · Proceedings of the IEEE · doi:10.1109/proc.1968.6477 · Cited by 540 · see citing works
An algorithm for computing the mixed radix fast Fourier transform
Singleton, R. C. (1969) · IEEE Transactions on Audio and Electroacoustics · doi:10.1109/tau.1969.1162042 · Cited by 538 · see citing works
Williams, J. W. (1964) · Communications of the ACM · doi:10.1145/512274.3734138 · Cited by 530 · see citing works
The Interaction Algorithm and Practical Fourier Analysis
Good, I. J. (1958) · Journal of the Royal Statistical Society Series B (Statistical Methodology) · doi:10.1111/j.2517-6161.1958.tb00300.x · Cited by 515 · see citing works
An Algorithm for the Evaluation of Finite Trigonometric Series
Goertzel, G. (1958) · American Mathematical Monthly · doi:10.2307/2310304 · Cited by 510 · see citing works
A heuristic discussion of probabilistic decoding
Fano, R. M. (1963) · IEEE Transactions on Information Theory · doi:10.1109/tit.1963.1057827 · Cited by 487 · see citing works
Interpolation and decimation of digital signals—A tutorial review
Crochiere, R. E., & Rabiner, L. R. (1981) · Proceedings of the IEEE · doi:10.1109/proc.1981.11969 · Cited by 485 · see citing works
A linear filtering approach to the computation of discrete Fourier transform
Bluestein, L. I. (1970) · IEEE Transactions on Audio and Electroacoustics · doi:10.1109/tau.1970.1162132 · Cited by 470 · see citing works
The Fast Fourier Transform in a Finite Field
Pollard, J. M. (1971) · Mathematics of Computation · doi:10.1090/s0025-5718-1971-0301966-0 · Cited by 469 · see citing works
Fast algorithms for the discrete cosine transform
Feig, E., & Winograd, S. (1992) · IEEE Transactions on Signal Processing · doi:10.1109/78.157218 · Cited by 409 · see citing works
A method for solving key equation for decoding goppa codes
Sugiyama, Y., Kasahara, M., Hirasawa, S., & Namekawa, T. (1975) · Information and Control · doi:10.1016/s0019-9958(75)90090-x · Cited by 408 · see citing works
Fast solution of toeplitz systems of equations and computation of Padé approximants
Brent, R. P., Gustavson, F. G., & Yun, D. Y. Y. (1980) · Journal of Algorithms · doi:10.1016/0196-6774(80)90013-9 · Cited by 388 · see citing works
A modified split-radix fft with fewer arithmetic operations
Johnson, S. G., & Frigo, M. (2007) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2006.882087 · Cited by 380 · see citing works
Recursive solution to the multichannel filtering problem
Wiggins, R. A., & Robinson, E. A. (1965) · Journal of Geophysical Research Atmospheres · doi:10.1029/jz070i008p01885 · Cited by 373 · see citing works
A fast cosine transform in one and two dimensions
Makhoul, J. (1980) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1980.1163351 · Cited by 346 · see citing works
On the Computation of the Discrete Cosine Transform
Narasimha, M. J., & Peterson, A. M. (1978) · IRE Transactions on Communications Systems · doi:10.1109/tcom.1978.1094144 · Cited by 323 · see citing works
High-speed convolution and correlation
Stockham, T. G. (1966) · AFIPS Spring Joint Computer Conference (SJCC) · doi:10.1145/1464182.1464209 · Cited by 322 · see citing works
A prime factor FFT algorithm using high-speed convolution
Kolba, D. P., & Parks, T. W. (1977) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1977.1162973 · Cited by 307 · see citing works
Fast Convolution using fermat number transforms with applications to digital filtering
Agarwal, R. K., & Burrus, C. S. (1974) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1974.1162555 · Cited by 301 · see citing works
Number theoretic transforms to implement fast digital convolution
Agarwal, R. C., & Burrus, C. S. (1975) · Proceedings of the IEEE · doi:10.1109/proc.1975.9791 · Cited by 270 · see citing works
Number theory in digital signal processing
McClellen, J. H., & Rader, C. M. (1979) · Cited by 265 · see citing works
The use of residue number systems in the design of finite impulse response digital filters
Jenkins, W. K., & Leon, B. (1977) · IEEE Transactions on Circuits and Systems · doi:10.1109/tcs.1977.1084321 · Cited by 263 · see citing works
Number Theory and Its History.
Pall, G., & Ore, Ö. (1949) · American Mathematical Monthly · doi:10.2307/2304748 · Cited by 258 · see citing works
New algorithms for digital convolution
Agarwal, R. K., & Cooley, J. W. (1977) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1977.1162981 · Cited by 257 · see citing works
A simplified binary arithmetic for the Fermat number transform
Leibowitz, L. M. (1976) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1976.1162834 · Cited by 228 · see citing works
Hardy, G. H. (1922) · Science · doi:10.1126/science.56.1450.401 · Cited by 223 · see citing works
New inversion formulas for matrices classified in terms of their distance from Toeplitz matrices
Friedlander, B., Morf, M., Kailath, T., & Lennart Ljung, A. (1979) · Linear Algebra and its Applications · doi:10.1016/0024-3795(79)90030-2 · Cited by 206 · see citing works
An in-place, in-order prime factor FFT algorithm
Burrus, C. S., & Eschenbacher, P. (1981) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1981.1163645 · Cited by 175 · see citing works
The Montgomery inverse and its applications
Kaliski, B. S. (1995) · IEEE Transactions on Computers · doi:10.1109/12.403725 · Cited by 172 · see citing works
The use of finite fields to compute convolutions
Reed, I. S., & Truong, T.-K. (1975) · IEEE Transactions on Information Theory · doi:10.1109/tit.1975.1055352 · Cited by 171 · see citing works
Some bilinear forms whose multiplicative complexity depends on the field of constants
Winograd, S. (1976) · Theory of Computing Systems · doi:10.1007/bf01683270 · Cited by 168 · see citing works
An introduction to programming the Winograd Fourier transform algorithm (WFTA)
Silverman, H. F. (1977) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1977.1162924 · Cited by 165 · see citing works
A Cryptographic Library for the Motorola DSP56000
Dussé, S. R., & Kaliski, B. S. (1991) · Lecture notes in computer science · doi:10.1007/3-540-46877-3_21 · Cited by 160 · see citing works
A new principle for fast Fourier transformation
Rader, C. M., & Brenner, N. (1976) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1976.1162805 · Cited by 155 · see citing works
Efficient solution of covariance equations for linear prediction
Morf, M., Dickinson, B., Kailath, T., & Vieira, A. (1977) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1977.1162989 · Cited by 154 · see citing works
A New Algorithm for Inner Product
Winograd, S. (1968) · IEEE Transactions on Computers · doi:10.1109/tc.1968.227420 · Cited by 148 · see citing works
Sequential decoding for reliable communication
Wozencraft, J. M. (1957) · Cited by 141 · see citing works
Memory Management in a Viterbi Decoder
Rader, C. M. (1981) · IRE Transactions on Communications Systems · doi:10.1109/tcom.1981.1095146 · Cited by 139 · see citing works
The Relationship Between Two Fast Fourier Transforms
Good, I. J. (1971) · IEEE Transactions on Computers · doi:10.1109/t-c.1971.223236 · Cited by 138 · see citing works
The Solution of a Toeplitz Set of Linear Equations
Zohar, S. (1974) · Journal of the ACM · doi:10.1145/321812.321822 · Cited by 133 · see citing works
Fast one-dimensional digital convolution by multidimensional techniques
Agarwal, R. K., & Burrus, C. S. (1974) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1974.1162532 · Cited by 131 · see citing works
Vector radix fast Fourier transform
Harris, D. B., McClellan, J. H., Chan, D. S. K., & Schuessler, H. A. (2005) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.1977.1170349 · Cited by 129 · see citing works
A Fast Computer Method for Matrix Transposing
Eklundh, J. (1972) · IEEE Transactions on Computers · doi:10.1109/t-c.1972.223584 · Cited by 129 · see citing works
Algebraic Methods for Signal Processing and Communications Coding
Blahut, R. E. (1992) · Signal processing and digital filtering · doi:10.1007/978-1-4612-2826-4 · Cited by 117 · see citing works
Self-citationDuality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms
Hopcroft, J. E., & Musinski, J. E. (1973) · SIAM Journal on Computing · doi:10.1137/0202013 · Cited by 103 · see citing works
A minimal realization algorithm for matrix sequences
Dickinson, B., Morf, M., & Kailath, T. (1974) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1974.1100457 · Cited by 100 · see citing works
Direct fast Fourier transform of bivariate functions
Rivard, G. E. (1977) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1977.1162951 · Cited by 99 · see citing works
Continued fractions and Berlekamp's algorithm
Welch, L. R., & Scholtz, R. A. (1979) · IEEE Transactions on Information Theory · doi:10.1109/tit.1979.1055987 · Cited by 96 · see citing works
Griffiths, L. W., Birkhoff, G., & MacLane, S. (1942) · National Mathematics Magazine · doi:10.2307/3028154 · Cited by 88 · see citing works
Convolutional codes III. Sequential decoding
Forney, G. D. (1974) · Information and Control · doi:10.1016/s0019-9958(74)90876-6 · Cited by 82 · see citing works
(2008) · Springer eBooks · doi:10.1007/978-0-387-22601-9_1 · Cited by 81 · see citing works
Generalized stack algorithms for decoding convolutional codes
Haccoun, D., & Ferguson, M. J. (1975) · IEEE Transactions on Information Theory · doi:10.1109/tit.1975.1055463 · Cited by 77 · see citing works
A new efficient algorithm to compute the two-dimensional discrete Fourier transform
Gertner, I. (1988) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/29.1627 · Cited by 74 · see citing works
Hardware realization of a Fermat number transform
McClellan, J. H. (1976) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1976.1162806 · Cited by 70 · see citing works
Fast computation of discrete Fourier transforms using polynomial transforms
Nussbaumer, H., & Quandalle, P. (1979) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1979.1163216 · Cited by 70 · see citing works
A unified treatment of Cooley-Tukey algorithms for the evaluation of the multidimensional DFT
Mersereau, R., & Speake, T. (1981) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1981.1163687 · Cited by 65 · see citing works
Polynomial evaluation via the division algorithm the fast Fourier transform revisited
Fiduccia, C. M. (1972) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/800152.804900 · Cited by 63 · see citing works
An upper bound on moments of sequential decoding effort
Jelinek, F. (1969) · IEEE Transactions on Information Theory · doi:10.1109/tit.1969.1054264 · Cited by 62 · see citing works
A Method for Fast Computation of the Fourier Transform over a Finite Field
Trifonov, P., & Fedorenko, S. V. (2003) · Problems of Information Transmission · doi:10.1023/a:1026171930630 · Cited by 61 · see citing works
An improved algorithm for high speed autocorrelation with applications to spectral estimation
Rader, C. M. (1970) · IEEE Transactions on Audio and Electroacoustics · doi:10.1109/tau.1970.1162147 · Cited by 61 · see citing works
Cozzens, J. H., & Finkelstein, L. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057081 · Cited by 60 · see citing works
Digital Filtering Using Complex Mersenne Transforms
Nussbaumer, H. (1976) · IBM Journal of Research and Development · doi:10.1147/rd.205.0498 · Cited by 55 · see citing works
Sequential Decoding - The Computation Problem*
Savage, J. E. (1966) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1966.tb04210.x · Cited by 53 · see citing works
On another approach to the Schur-Cohn criterion
Vieira, A., & Kailath, T. (1977) · IEEE Transactions on Circuits and Systems · doi:10.1109/tcs.1977.1084319 · Cited by 52 · see citing works
Computational Complexity of Fourier Transforms Over Finite Fields
Preparata, F. P., & Sarwate, D. V. (1977) · Mathematics of Computation · doi:10.1090/s0025-5718-1977-0436662-8 · Cited by 50 · see citing works
An introduction to discrete systems
Steiglitz, K., & Krieger, R. E. (1974) · Medical Entomology and Zoology · Cited by 44 · see citing works
Mathematics of Multidimensional Fourier Transform Algorithms
Tolimieri, R., An, M. H., & Lu, C. (1993) · Signal processing and digital filtering · doi:10.1007/978-1-4684-0205-6 · Cited by 42 · see citing works
The design of optimal DFT algorithms using dynamic programming
Johnson, H., & Burrus, C. S. (1983) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1983.1164071 · Cited by 41 · see citing works
Digital filtering using polynomial transforms
Nussbaumer, H. (1977) · Electronics Letters · doi:10.1049/el:19770280 · Cited by 38 · see citing works
Very fast computation of the radix-2 discrete Fourier transform
Preuss, R. D. (1982) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1982.1163935 · Cited by 37 · see citing works
On modulus replication for residue arithmetic computations of complex inner products
Wigley, N. M., & JULLIEN, G. A. (1990) · IEEE Transactions on Computers · doi:10.1109/12.57045 · Cited by 36 · see citing works
An analysis of sequential decoding for specific time-invariant convolutional codes
Chevillat, P., & Costello, D. J. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055916 · Cited by 35 · see citing works
The design of dual-mode complex signal processors based on quadratic modular number codes
Jenkins, W. K., & Krogmeier, J. V. (1987) · IEEE Transactions on Circuits and Systems · doi:10.1109/tcs.1987.1086154 · Cited by 35 · see citing works
New polynomial transform algorithm for multidimensional DCT
Zeng, Y., Bi, G., & Leyman, A. R. (2000) · IEEE Transactions on Signal Processing · doi:10.1109/78.869031 · Cited by 34 · see citing works
Efficient solutions of linear equations with banded Toeplitz matrices
Dickinson, B. (1979) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1979.1163264 · Cited by 33 · see citing works
A comparative study of time efficient FFT and WFTA programs for general purpose computers
Morris, L. (1978) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1978.1163065 · Cited by 33 · see citing works
Automatic generation of prime length FFT programs
Selesnick, I., & Burrus, C. S. (1996) · IEEE Transactions on Signal Processing · doi:10.1109/78.482008 · Cited by 31 · see citing works
New algorithms for the multidimensional discrete Fourier transform
Auslander, L., Feig, E., & Winograd, S. (1983) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1983.1164081 · Cited by 29 · see citing works
A method for computation of the discrete Fourier transform over a finite field
Fedorenko, S. V. (2006) · Problems of Information Transmission · doi:10.1134/s0032946006020074 · Cited by 28 · see citing works
Efficient transforms for multidimensional convolutions
Arambepola, B., & Rayner, P. J. (1979) · Electronics Letters · doi:10.1049/el:19790132 · Cited by 28 · see citing works
Convolution using a conjugate symmetry property for the generalized discrete Fourier transform
Dubois, É., & Venetsanopoulos, A. (1978) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1978.1163066 · Cited by 28 · see citing works
Calculation of narrow-band spectra by direct decimation
Liu, B., & Mintzer, F. (1978) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1978.1163156 · Cited by 27 · see citing works
Fixed-point error analysis of winograd Fourier transform algorithms
Patterson, R., & McClellan, J. H. (1978) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1978.1163134 · Cited by 27 · see citing works
Large dynamic range computations over small finite rings
Wigley, N. M., JULLIEN, G. A., & Reaume, D. (1994) · IEEE Transactions on Computers · doi:10.1109/12.250611 · Cited by 26 · see citing works
Generalized Rouche's theorem and its application to multivariate autoregressions
Monden, Y., & Arimoto, S. (1980) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1980.1163469 · Cited by 25 · see citing works
Complex approximations using algebraic integers
Games, R. A. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057099 · Cited by 19 · see citing works
Application-specific architecture for fast transforms based on the successive doubling method
Zapaga, E. L., & Argüello, F. (1993) · IEEE Transactions on Signal Processing · doi:10.1109/78.205761 · Cited by 17 · see citing works
Bounds on the minimum number of data transfers in WFTA and FFT programs
Nawab, H., & McClellan, J. H. (1979) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1979.1163272 · Cited by 16 · see citing works
A winograd-Fourier transform algorithm for real-valued data
Parsons, T. W. (1979) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1979.1163263 · Cited by 14 · see citing works
New algorithms for convolution and DFT based on polynomial transforms
Nussbaumer, H. (2005) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.1978.1170580 · Cited by 13 · see citing works
Miller, R., Truong, T. K., & Reed, I. S. (1980) · IEE Proceedings E Computers and Digital Techniques · doi:10.1049/ip-e:19800026 · Cited by 13 · see citing works
Transform-domain digital filtering with number theoretic transforms and limited word lengths
Chevillat, P. (1978) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1978.1163097 · Cited by 13 · see citing works
Miller, R., Truong, T. K., & Reed, I. S. (1980) · IEE Proceedings E Computers and Digital Techniques · doi:10.1049/ip-e.1980.0026 · Cited by 13 · see citing works
Signal processing and complexity of computation
Winograd, S. (2005) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.1980.1171044 · Cited by 12 · see citing works
Semi-Fast Fourier Transforms over GF(2m).
Sarwate (1978) · IEEE Transactions on Computers · doi:10.1109/tc.1978.1675088 · Cited by 11 · see citing works
Some good fields and rings for computing number theoretic transforms
Rice, B. F. (1979) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1979.1163258 · Cited by 9 · see citing works
A new technique for twiddle-factor elimination in multidimensional FFT's
Bernardini, R., Cortelazzo, G. M., & Mian, G. A. (1994) · IEEE Transactions on Signal Processing · doi:10.1109/78.301853 · Cited by 8 · see citing works
New polynomial transform algorithms for fast DFT computation
Nussbaumer, H., & Quandalle, P. (2005) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.1979.1170654 · Cited by 7 · see citing works
How the Fast Fourier Transform Got its Name
Huang, T. S. (1971) · Computer · doi:10.1109/c-m.1971.216789 · Cited by 5 · see citing works
Error analysis of Good-Winograd algorithm assuming correlated truncation errors
Panda, G., Pal, R., & Chatterjee, B. (1983) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1983.1164077 · Cited by 4 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
Fast Algorithms for Convolutional Neural Networks
Lavin, A., & Gray, S. (2016) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2016.435 · Cited by 937 · see citing works
Low complexity LMMSE Receiver for OTFS
Tiwari, S., Das, S. S., & Rangamgari, V. (2019) · IEEE Communications Letters · doi:10.1109/lcomm.2019.2945564 · Cited by 272 · see citing works
Towards Efficient Arithmetic for Lattice-Based Cryptography on Reconfigurable Hardware
Pöppelmann, T., & Güneysu, T. E. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-33481-8_8 · Cited by 169 · see citing works
High-Performance Ideal Lattice-Based Cryptography on 8-Bit ATxmega Microcontrollers
Pöppelmann, T., Oder, T., & Güneysu, T. E. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-22174-8_19 · Cited by 147 · see citing works
MNN: A Universal and Efficient Inference EnginePreprint
Jiang, X., Wang, H., Chen, Y., Wu, Z., Wang, L., Zou, B., Yang, Y., Cui, Z., Cai, Y., Yu, T., et al. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2002.12418 · Cited by 109 · see citing works
Encryption of medical images based on the cosine number transform
Lima, J. B., Madeiro, F., & Sales, F. J. R. (2015) · Signal Processing Image Communication · doi:10.1016/j.image.2015.03.005 · Cited by 100 · see citing works
Audio encryption based on the cosine number transform
Lima, J. B., & Neto, E. F. D. S. (2015) · Multimedia Tools and Applications · doi:10.1007/s11042-015-2755-6 · Cited by 93 · see citing works
Image encryption based on the fractional Fourier transform over finite fields
Lima, J. B., & Novaes, L. F. G. (2013) · Signal Processing · doi:10.1016/j.sigpro.2013.07.020 · Cited by 88 · see citing works
Zhu, Q., & Billings, S. A. (1996) · International Journal of Control · doi:10.1080/00207179608921662 · Cited by 72 · see citing works
Fast Algorithms for Convolutional Neural NetworksPreprint
Lavin, A., & Gray, S. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1509.09308 · Cited by 72 · see citing works
Low-complexity 8-point DCT approximations based on integer functions
Cintra, R. J., Bayer, F. M., & Tablada, C. J. (2014) · Signal Processing · doi:10.1016/j.sigpro.2013.12.027 · Cited by 65 · see citing works
Low-Complexity Image and Video Coding Based on an Approximate Discrete Tchebichef Transform
Oliveira, P. A. M., Cintra, R. J., Bayer, F. M., Kulasekera, S., & Madanayake, A. (2016) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2016.2515378 · Cited by 62 · see citing works
Madanayake, A., Cintra, R. J., Dimitrov, V. S., Bayer, F. M., Wahid, K. A., Kulasekera, S., Edirisuriya, A., Potluri, U., Madishetty, S. K., & Rajapaksha, N. (2015) · IEEE Circuits and Systems Magazine · doi:10.1109/mcas.2014.2385553 · Cited by 57 · see citing works
Practical Lattice-Based Digital Signature Schemes
Howe, J., Pöppelmann, T., O'Neill, M. P., O’Sullivan, E., & Güneysu, T. E. (2015) · ACM Transactions on Embedded Computing Systems · doi:10.1145/2724713 · Cited by 59 · see citing works
High-Performance Ideal Lattice-Based Cryptography on 8-bit ATxmega Microcontrollers
Pöppelmann, T., Oder, T., & Güneysu, T. E. (2015) · Cited by 56 · see citing works
A Survey of Different Approaches for Overcoming the Processor - Memory Bottleneck
Efnusheva, D., Чолакоска, А., & Tentov, A. (2017) · International Journal of Computer Science and Information Technology · doi:10.5121/ijcsit.2017.9214 · Cited by 54 · see citing works
Low-Complexity Approximate Convolutional Neural Networks
Cintra, R. J., Duffner, S., García, C., & Leite, A. (2018) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2018.2815435 · Cited by 50 · see citing works
Duhamel, P. (1990) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/29.60070 · Cited by 45 · see citing works
Image encryption based on the finite field cosine transform
Lima, J. B., Lima, E. A. O., & Madeiro, F. (2013) · Signal Processing Image Communication · doi:10.1016/j.image.2013.05.008 · Cited by 44 · see citing works
New Approaches to Coding Information using Inverse Scattering Transform
Frumin, L. L., Gelash, A. A., & Turitsyn, S. K. (2017) · Physical Review Letters · doi:10.1103/physrevlett.118.223901 · Cited by 44 · see citing works
Optimal DNN primitive selection with partitioned boolean quadratic programming
Anderson, A., & Gregg, D. (2018) · Proceedings of the CGO/Proceedings of the ... CGO · doi:10.1145/3168805 · Cited by 34 · see citing works
A class of DCT approximations based on the Feig–Winograd algorithm
Tablada, C. J., Bayer, F. M., & Cintra, R. J. (2015) · Signal Processing · doi:10.1016/j.sigpro.2015.01.011 · Cited by 32 · see citing works
A Row-Parallel 8$\,\times\,$8 2-D DCT Architecture Using Algebraic Integer-Based Exact Computation
Madanayake, A., Cintra, R. J., Onen, D., Dimitrov, V. S., Rajapaksha, N., Bruton, L. T., & Edirisuriya, A. (2011) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2011.2181232 · Cited by 33 · see citing works
Towards a Low-SWaP 1024-Beam Digital Array: A 32-Beam Subsystem at 5.8 GHz
Madanayake, A., Mandal, S., Rappaport, T. S., Ariyarathna, V., Madishetty, S., Pulipati, S. K., Cintra, R. J., Coelho, D. F. G., Oliviera, R., Bayer, F. M., et al. (2019) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.2019.2938704 · Cited by 32 · see citing works
Ariyarathna, V., Madanayake, A., Tang, X., Coelho, D. F. G., Cintra, R. J., Belostotski, L., Mandal, S., & Rappaport, T. S. (2018) · IEEE Journal on Emerging and Selected Topics in Circuits and Systems · doi:10.1109/jetcas.2018.2832177 · Cited by 32 · see citing works
Multibeam Digital Array Receiver Using a 16-Point Multiplierless DFT Approximation
Ariyarathna, V., Coelho, D. F. G., Pulipati, S. K., Cintra, R. J., Bayer, F. M., Dimitrov, V. S., & Madanayake, A. (2018) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.2018.2882629 · Cited by 32 · see citing works
Xu, W., Zhang, Z., You, X., & Zhang, C. (2020) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2020.2973355 · Cited by 31 · see citing works
Fast Radix-32 Approximate DFTs for 1024-Beam Digital RF Beamforming
Madanayake, A., Cintra, R. J., Akram, N., Ariyarathna, V., Mandal, S., Coutinho, V. A., Bayer, F. M., Coelho, D. F. G., & Rappaport, T. S. (2020) · IEEE Access · doi:10.1109/access.2020.2994550 · Cited by 31 · see citing works
Vibration Analysis in Turbomachines Using Machine Learning Techniques
Pinheiro, A. A., Brandao, I. M., & Da Costa, C. (2019) · European Journal of Engineering Research and Science · doi:10.24018/ejers.2019.4.2.1128 · Cited by 31 · see citing works
Rethinking Parallel Memory Access Pattern in Number Theoretic Transform Design
Geng, Y., Hu, X. H., Li, M., & Wang, Z. (2023) · IEEE Transactions on Circuits & Systems II Express Briefs · doi:10.1109/tcsii.2023.3260811 · Cited by 30 · see citing works
High-Performance Ideal Lattice-Based Cryptography on 8-Bit AVR Microcontrollers
Liu, Z., Pöppelmann, T., Oder, T., Seo, H., Roy, S. S., Güneysu, T. E., Großschädl, J., Kim, H., & Verbauwhede, I. M. R. (2017) · ACM Transactions on Embedded Computing Systems · doi:10.1145/3092951 · Cited by 30 · see citing works
Low-complexity 8-point DCT approximation based on angle similarity for image and video coding
Oliveira, R. S., Cintra, R. J., Bayer, F. M., da Silveira, T. L. T., Madanayake, A., & Leite, A. (2018) · Multidimensional Systems and Signal Processing · doi:10.1007/s11045-018-0601-5 · Cited by 29 · see citing works
A Discrete Tchebichef Transform Approximation for Image and Video Coding
Oliveira, P. A. M., Cintra, R. J., Bayer, F. M., Kulasekera, S., & Madanayake, A. (2015) · IEEE Signal Processing Letters · doi:10.1109/lsp.2015.2389899 · Cited by 29 · see citing works
Multi‐beam RF aperture using multiplierless FFT approximation
Suarez, D., Cintra, R. J., Bayer, F. M., Sengupta, A., Kulasekera, S., & Madanayake, A. (2014) · Electronics Letters · doi:10.1049/el.2014.3561 · Cited by 29 · see citing works
Tiwari, S., Das, S. S., & Bandyopadhyay, K. K. (2015) · IET Communications · doi:10.1049/iet-com.2015.0081 · Cited by 28 · see citing works
Sarker, A., Kermani, M. M., & Azarderakhsh, R. (2018) · IEEE Transactions on Very Large Scale Integration (VLSI) Systems · doi:10.1109/tvlsi.2018.2881097 · Cited by 26 · see citing works
An orthogonal 16-point approximate DCT for image and video compression
da Silveira, T. L. T., Bayer, F. M., Cintra, R. J., Kulasekera, S., Madanayake, A., & Kozakevicius, A. D. J. (2014) · Multidimensional Systems and Signal Processing · doi:10.1007/s11045-014-0291-6 · Cited by 26 · see citing works
Efficient Winograd Convolution via Integer ArithmeticPreprint
Meng, L., & Brothers, J. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1901.01965 · Cited by 26 · see citing works
Mandal, S., & Roy, D. B. (2024) · IEEE Transactions on Circuits and Systems I Regular Papers · doi:10.1109/tcsi.2024.3470335 · Cited by 25 · see citing works
Neto, J. R. D. O., Lima, J. B., & Panario, D. (2019) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2019.2925522 · Cited by 25 · see citing works
Winograd Convolution for Deep Neural Networks: Efficient Point Selection
Alam, S. A., Anderson, A., Barabasz, B., & Gregg, D. (2022) · ACM Transactions on Embedded Computing Systems · doi:10.1145/3524069 · Cited by 29 · see citing works
Error Analysis and Improving the Accuracy of Winograd Convolution for Deep Neural Networks
Barabasz, B., Anderson, A., Soodhalter, K. M., & Gregg, D. (2020) · ACM Transactions on Mathematical Software · doi:10.1145/3412380 · Cited by 25 · see citing works
Phase-Code-Based Modulation for Coherent Lidar
Banzhaf, S., & Waldschmidt, C. (2021) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2021.3104109 · Cited by 24 · see citing works
Automatic Detection of Aquatic Weeds: A Case Study in the Guadiana River, Spain
Rodríguez-Garlito, E. C., Paz, A., & Plaza, A. (2022) · IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing · doi:10.1109/jstars.2022.3210373 · Cited by 24 · see citing works
Jafarzadeh, S., Jess, D., Stangalini, M., Grant, S., Higham, J., Pessah, M., Keys, P., Belov, S., Calchetti, D., Duckenfield, T., et al. (2025) · Nature Reviews Methods Primers · doi:10.1038/s43586-025-00392-0 · Cited by 28 · see citing works
Zhang, X., Zheng, Y., Jiang, Z., & Byun, H. (2022) · Journal of Applied Mathematics and Computing · doi:10.1007/s12190-022-01819-7 · Cited by 23 · see citing works
Searching for Winograd-aware Quantized NetworksPreprint
Fernández-Marqués, J., Whatmough, P. N., Mundy, A., & Mattina, M. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2002.10711 · Cited by 28 · see citing works
Coutinho, V. A., Cintra, R. J., Bayer, F. M., Kulasekera, S., & Madanayake, A. (2015) · Journal of Real-Time Image Processing · doi:10.1007/s11554-015-0492-8 · Cited by 22 · see citing works
F-DNA: Fast Convolution Architecture for Deconvolutional Network Acceleration
Mao, W., Lin, J., & Wang, Z. (2020) · IEEE Transactions on Very Large Scale Integration (VLSI) Systems · doi:10.1109/tvlsi.2020.3000519 · Cited by 22 · see citing works
A Low-SWaP 16-Beam 2.4 GHz Digital Phased Array Receiver Using DFT Approximation
Coutinho, V. A., Ariyarathna, V., Coelho, D. F. G., Pulipati, S. K., Cintra, R. J., Madanayake, A., Bayer, F. M., & Dimitrov, V. S. (2020) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.2020.2987094 · Cited by 21 · see citing works
Multiplierless 16-point DCT approximation for low-complexity image and video coding
da Silveira, T. L. T., Oliveira, R. S., Bayer, F. M., Cintra, R. J., & Madanayake, A. (2016) · Signal Image and Video Processing · doi:10.1007/s11760-016-0923-4 · Cited by 21 · see citing works
Low-Complexity Joint-MMSE GFDM Receiver
Tiwari, S., & Das, S. S. (2017) · IEEE Transactions on Communications · doi:10.1109/tcomm.2017.2780854 · Cited by 21 · see citing works
Plonka, G., Potts, D., Steidl, G., & Tasche, M. (2018) · Applied and numerical harmonic analysis · doi:10.1007/978-3-030-04306-3_5 · Cited by 21 · see citing works
D 4 M: Dataset Distillation via Disentangled Diffusion Model
Su, D., Hou, J., Gao, W., Tian, Y., & Tang, B. (2024) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr52733.2024.00555 · Cited by 21 · see citing works
The fractional Fourier transform over finite fields
Lima, J. B., & de Souza, R. M. C. (2011) · Signal Processing · doi:10.1016/j.sigpro.2011.08.010 · Cited by 20 · see citing works
Fractional cosine and sine transforms over finite fields
Lima, J. B., & de Souza, R. M. C. (2013) · Linear Algebra and its Applications · doi:10.1016/j.laa.2012.12.021 · Cited by 20 · see citing works
Low-Complexity Multidimensional DCT Approximations for High-Order Tensor Data Decorrelation
Coutinho, V. A., Cintra, R. J., & Bayer, F. M. (2017) · IEEE Transactions on Image Processing · doi:10.1109/tip.2017.2679442 · Cited by 20 · see citing works
A unified approach to the fast FIR filtering algorithms
Mou, Z.-J., & Duhamel, P. (2003) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.1988.197001 · Cited by 19 · see citing works
Elgendi, M., Howard, N., Lovell, N. H., Cichocki, A. S., Brearley, M. B., Abbott, D., & Adatia, I. (2016) · JMIR Biomedical Engineering · doi:10.2196/biomedeng.6401 · Cited by 18 · see citing works
A Class of Low-Complexity DCT-Like Transforms for Image and Video Coding
da Silveira, T. L. T., Canterle, D. R., Coelho, D. F. G., Coutinho, V. A., Bayer, F. M., & Cintra, R. J. (2021) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2021.3134054 · Cited by 18 · see citing works
Energy-Efficient 8-Point DCT Approximations: Theory and Hardware Architectures
Cintra, R. J., Bayer, F. M., Coutinho, V. A., Kulasekera, S., Madanayake, A., & Leite, A. (2015) · Circuits Systems and Signal Processing · doi:10.1007/s00034-015-0233-z · Cited by 17 · see citing works
Davatgari, A., Cokyasar, T., Verbas, Ö., & Mohammadian, A. (2024) · Transportation Research Part C Emerging Technologies · doi:10.1016/j.trc.2024.104656 · Cited by 16 · see citing works
Multi-beam 4 GHz microwave apertures using current-mode DFT approximation on 65 nm CMOS
Ariyarathna, V., Kulasekera, S., Madanayake, A., Lee, K., Suarez, D., Cintra, R. J., Bayer, F. M., & Belostotski, L. (2015) · IEEE MTT-S International Microwave Symposium digest · doi:10.1109/mwsym.2015.7167112 · Cited by 16 · see citing works
Holovatyy, A., Teslyuk, V., Iwaniec, M., & Mashevska, M. (2017) · Eastern-European Journal of Enterprise Technologies · doi:10.15587/1729-4061.2017.116082 · Cited by 16 · see citing works
Efficient and Self-Recursive Delay Vandermonde Algorithm for Multi-beam Antenna Arrays
Perera, S. M., Madanayake, A., & Cintra, R. J. (2020) · IEEE Open Journal of Signal Processing · doi:10.1109/ojsp.2020.2991586 · Cited by 15 · see citing works
Souza, C. E. C., Moreno, D., Chaves, D. P. B., & Pimentel, C. J. L. (2022) · IEEE Transactions on Instrumentation and Measurement · doi:10.1109/tim.2022.3197774 · Cited by 15 · see citing works
Madanayake, A., Lawrance, K., Kumarasiri, B. U., Sivasankar, S., Gunaratne, T., Edussooriya, C. U. S., & Cintra, R. J. (2024) · Algorithms · doi:10.3390/a17080338 · Cited by 15 · see citing works
Adaptive Optical Transceivers: Concepts and Challenges
Mello, D. A. A., Rozental, V. N., Lima, T. C., Pereira, F. C., Barreto, A. N., Camera, M., & Bruno, G. (2014) · Journal of Communication and Information Systems · doi:10.14209/jcis.2014.3 · Cited by 15 · see citing works
Filtered Carrier Phase Estimator for High-Order QAM Optical Systems
Rozental, V. N., Kong, D., Corcoran, B., Mello, D. A. A., & Lowery, A. J. (2018) · Journal of Lightwave Technology · doi:10.1109/jlt.2018.2829153 · Cited by 15 · see citing works
Winograd Convolution for DNNs: Beyond Linear Polynomials
Barabasz, B., & Gregg, D. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-35166-3_22 · Cited by 14 · see citing works
Kodnyanko, V., Shatokhin, S., Kurzakov, A., & Pikalov, Y. (2020) · Lubricants · doi:10.3390/lubricants8050057 · Cited by 14 · see citing works
Distributed Deep Learning for Power Control in D2D Networks With Outdated Information
Shi, J., Zhang, Q., Liang, Y., & Yuan, X. (2021) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2021.3069638 · Cited by 14 · see citing works
DFT Computation Using Gauss-Eisenstein Basis: FFT Algorithms and VLSI Architectures
Coelho, D. F. G., Cintra, R. J., Rajapaksha, N., Mendis, G. J., Madanayake, A., & Dimitrov, V. S. (2017) · IEEE Transactions on Computers · doi:10.1109/tc.2017.2677427 · Cited by 14 · see citing works
Convolution algorithms on DSP processors
Meyer, R., Reng, R. L., & Schwarz, K. (1991) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.1991.150849 · Cited by 14 · see citing works
Structured knowledge-based causal discovery: Agentic streams of thought
Meier, S., Raut, P. N., Mahr, F., Thielen, N., Franke, J. E., & Risch, F. (2025) · Information Processing & Management · doi:10.1016/j.ipm.2025.104202 · Cited by 13 · see citing works
Clipping Noise Cancellation Receiver for the Downlink of Massive MIMO OFDM System
Wachowiak, M., & Kryszkiewicz, P. (2023) · IEEE Transactions on Communications · doi:10.1109/tcomm.2023.3293159 · Cited by 13 · see citing works
Xing, Z. X., Zheng, Y., Jiang, Z., & Byun, H. (2023) · Japan Journal of Industrial and Applied Mathematics · doi:10.1007/s13160-023-00616-4 · Cited by 12 · see citing works
Low-Complexity Loeffler DCT Approximations for Image and Video Coding
Coelho, D. F. G., Cintra, R. J., Bayer, F. M., Kulasekera, S., Madanayake, A., Martinez, P., da Silveira, T. L. T., Oliveira, R. S., & Dimitrov, V. S. (2018) · Journal of Low Power Electronics and Applications · doi:10.3390/jlpea8040046 · Cited by 12 · see citing works
Histogram Uniformization for Digital Image Encryption
Lima, J. B., & de Souza, R. M. C. (2012) · SIBGRAPI Conference on Graphics, Patterns and Images (SIBGRAPI) · doi:10.1109/sibgrapi.2012.17 · Cited by 12 · see citing works
Coelho, D. F. G., Cintra, R. J., Kulasekera, S., Madanayake, A., & Dimitrov, V. S. (2016) · IET Signal Processing · doi:10.1049/iet-spr.2015.0175 · Cited by 12 · see citing works
A Fast DVM Algorithm for Wideband Time-Delay Multi-Beam Beamformers
Perera, S. M., Lingsch, L., Madanayake, A., Mandal, S., & Mastronardi, N. (2022) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2022.3231182 · Cited by 11 · see citing works
Approximating Knapsack and Partition via Dense Subset Sums
Deng, M., Jin, C., & Mao, X. (2023) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611977554.ch113 · Cited by 11 · see citing works
Fast algorithm for computing cosine number transform
Lima, J. B. (2015) · Electronics Letters · doi:10.1049/el.2015.0905 · Cited by 11 · see citing works
Jia, Y., Yu, Z., Dai, J., & Liu, Q. H. (2016) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.2016.2600745 · Cited by 11 · see citing works
Lossy image compression based on efficient multiplier-less 8-points DCT
Brahimi, N., Bouden, T., Brahimi, T., & Boubchir, L. (2021) · Multimedia Systems · doi:10.1007/s00530-021-00762-0 · Cited by 11 · see citing works
An 8-Beam 2.4 GHz Digital Array Receiver Based on a Fast Multiplierless Spatial DFT Approximation
Coutinho, V. A., Ariyarathna, V., Coelho, D. F. G., Cintral, R. J., & Madanayake, A. (2018) · IEEE MTT-S International Microwave Symposium digest · doi:10.1109/mwsym.2018.8439422 · Cited by 11 · see citing works
Normalized Cyclic Convolution: The Case of Even Length
Fedorenko, S. V. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2453135 · Cited by 11 · see citing works
Fast and Efficient Sparse 2D Discrete Fourier Transform using Sparse-Graph CodesPreprint
Ong, F., Pawar, S., & Ramchandran, K. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1509.05849 · Cited by 11 · see citing works
Zhang, X., Zheng, Y., Jiang, Z., & Byun, H. (2023) · Journal of Applied Analysis & Computation · doi:10.11948/20230073 · Cited by 10 · see citing works
MoDE: CLIP Data Experts via Clustering
Ma, J., Huang, P.-Y., Xie, S., Li, S.-W. D., Zettlemoyer, L., Chang, S., Yih, W.-T., & Xu, H. (2024) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr52733.2024.02489 · Cited by 10 · see citing works
A Wideband Spectrum Sensing Approach for Cognitive Radios Based on Cepstral Analysis
Moawad, A., Yao, K. C., Mansour, A., & Gautier, R. (2020) · IEEE Open Journal of the Communications Society · doi:10.1109/ojcoms.2020.3007171 · Cited by 10 · see citing works
Design of the Processors for Fast Cosine and Sine Fourier Transforms
Tsmots, I., Rabyk, V., Kryvinska, N., Yatsymirskyy, M., & Teslyuk, V. (2022) · Circuits Systems and Signal Processing · doi:10.1007/s00034-022-02012-8 · Cited by 10 · see citing works
Resource-efficient parallel acquisition architectures for modernized GNSS signals
Leclère, J. (2014) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · doi:10.5075/epfl-thesis-6190 · Cited by 10 · see citing works
Computation of 2D 8×8 DCT Based on the Loeffler Factorization Using Algebraic Integer Encoding
Coelho, D. F. G., Nimmalapalli, S., Dimitrov, V. S., Madanayake, A., Cintra, R. J., & Tisserand, A. (2018) · IEEE Transactions on Computers · doi:10.1109/tc.2018.2837755 · Cited by 10 · see citing works
Some FFT Algorithms for Small-Length Real-Valued Sequences
Majorkowska-Mech, D., & Cariow, A. (2022) · Applied Sciences · doi:10.3390/app12094700 · Cited by 10 · see citing works
Acquisition of GPS L1 signals using Cooley-tukey FFT algorithm
Ratnam, D. V., Pasha, A., Swathi, P., & Rao, M. V. G. (2013) · International Conference on Signal Processing, Computing and Control (ISPCC) · doi:10.1109/ispcc.2013.6663397 · Cited by 10 · see citing works
A Generalized Prefix Construction for OFDM Systems Over Quasi-Static Channels
Cooklev, T., Dogan, H., Cintra, R. J., & Yildiz, H. (2011) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2011.2165741 · Cited by 10 · see citing works
Efficient Computation of the 8-point DCT via Summation by Parts
Coelho, D. F. G., Cintra, R. J., & Dimitrov, V. S. (2017) · Journal of Signal Processing Systems · doi:10.1007/s11265-017-1270-6 · Cited by 10 · see citing works
Low-Complexity Scaling Methodsfor DCT-II Approximations
Coelho, D. F. G., Cintra, R. J., Madanayake, A., & Perera, S. M. (2021) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2021.3099623 · Cited by 10 · see citing works
Implementation and performance of composite fast FIR filtering algorithms
Zergainoh, A., & Duhamel, P. (2002) · SiPS ... design and implementation - IEEE Workshop on Signal Processing Systems · doi:10.1109/vlsisp.1995.527498 · Cited by 9 · see citing works
- Authors
- Blahut, R. E.
- Affiliations
- University of Illinois Urbana-Champaign (US)
- Corresponding author
- Blahut, Richard E.
- Venue
- Cambridge University Press eBooks
- Publisher
- Cambridge University Press
- Published
- 2010-06-24
- OpenAlex
- W565312106
- Cited by
- 274
- References
- 126
- Citations by year
- 2026: 13 · 2025: 17 · 2024: 24 · 2023: 20 · 2022: 15 · 2021: 22 · 2020: 27 · 2019: 21 · 2018: 22 · 2017: 14 · 2016: 15 · 2015: 28 · 2014: 12 · 2013: 8 · 2012: 4
- FWCI
- 1.43
- Type
- book
- Language
- en
- Open access
- closed
- Locations
- Cambridge University Press eBooks (publishedVersion)
- CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Signal Processing › Digital Filter Design and Implementation
- Physical Sciences › Mathematics › Applied Mathematics › Mathematical Analysis and Transform Methods
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Data Compression Techniques
- Keywords
- fast algorithms, computational efficiency, energy consumption reduction, embedded systems, video processing, algorithm comparison
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
