The DOI matches its Crossref record; 127 of the 127 references it cites were found in a registry or an index.
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.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
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
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
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,954
Information Theory and Reliable Communication.
Lee, P. M., & Gallager, R. G. (1970) · Journal of the Royal Statistical Society Series A (General) · doi:10.2307/2344305 · Cited by 5,429
Ahmed, N., Natarajan, T., & Rao, K. R. (1974) · IEEE Transactions on Computers · doi:10.1109/t-c.1974.223784 · Cited by 5,156
Optimal decoding of linear codes for minimizing symbol error rate
Bahl, L. R. (1974) · IEEE Transactions on Information Theory · Cited by 4,665
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,821
Modular Multiplication Without Trial Division
Montgomery, P. L. (1985) · Mathematics of Computation · doi:10.1090/s0025-5718-1985-0777282-x · Cited by 2,659
The CORDIC Trigonometric Computing Technique
Volder, J. E. (1959) · IRE Transactions on Electronic Computers · doi:10.1109/tec.1959.5222693 · Cited by 2,655
Gaussian elimination is not optimal
Strassen, V. (1969) · Numerische Mathematik · doi:10.1007/bf02165411 · Cited by 2,509
Berlekamp, E. R. (2014) · WORLD SCIENTIFIC eBooks · doi:10.1142/9407 · Cited by 2,501
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
Shift-register synthesis and BCH decoding
Massey, J. L. (1969) · IEEE Transactions on Information Theory · doi:10.1109/tit.1969.1054260 · Cited by 2,213
Theory and practice of error control codes
Blahut, R. E. (1983) · Virtual Defense Library (Ministerio de Defensa) · Cited by 2,066
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
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
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
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
The art of computer programming. Vol.1: Fundamental algorithms
Knuth, D. E. (1978) · Virtual Defense Library (Ministerio de Defensa) · Cited by 801
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
Beam-forming matrix simplifies design of electronically scanned antennas
Butler, J. K. (1961) · Electronic design · Cited by 706
Algebraic Codes for Data Transmission
Blahut, R. E. (2003) · Cambridge University Press eBooks · doi:10.1017/cbo9780511800467 · Cited by 657
Self-citationOn computing the discrete Fourier transform
Winograd, S. (1978) · Mathematics of Computation · doi:10.1090/s0025-5718-1978-0468306-4 · Cited by 613
Fundamentals of Convolutional Coding
Johannesson, R., & Zigangirov, K. S. (2015) · doi:10.1002/9781119098799.fmatter · Cited by 589
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
Arithmetic Complexity of Computations
Winograd, S. (1980) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970364 · Cited by 547
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
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
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
Williams, J. W. (1964) · Communications of the ACM · doi:10.1145/512274.3734138 · Cited by 530
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
An Algorithm for the Evaluation of Finite Trigonometric Series
Goertzel, G. (1958) · American Mathematical Monthly · doi:10.2307/2310304 · Cited by 510
A heuristic discussion of probabilistic decoding
Fano, R. M. (1963) · IEEE Transactions on Information Theory · doi:10.1109/tit.1963.1057827 · Cited by 487
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
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
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
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
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
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
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
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
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
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
High-speed convolution and correlation
Stockham, T. G. (1966) · AFIPS Spring Joint Computer Conference (SJCC) · doi:10.1145/1464182.1464209 · Cited by 322
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
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
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
Number theory in digital signal processing
McClellen, J. H., & Rader, C. M. (1979) · Cited by 265
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
Number Theory and Its History.
Pall, G., & Ore, Ö. (1949) · American Mathematical Monthly · doi:10.2307/2304748 · Cited by 258
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
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
Hardy, G. H. (1922) · Science · doi:10.1126/science.56.1450.401 · Cited by 223
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
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
The Montgomery inverse and its applications
Kaliski, B. S. (1995) · IEEE Transactions on Computers · doi:10.1109/12.403725 · Cited by 172
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
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
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
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
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
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
A New Algorithm for Inner Product
Winograd, S. (1968) · IEEE Transactions on Computers · doi:10.1109/tc.1968.227420 · Cited by 148
Sequential decoding for reliable communication
Wozencraft, J. M. (1957) · Cited by 141
Memory Management in a Viterbi Decoder
Rader, C. M. (1981) · IRE Transactions on Communications Systems · doi:10.1109/tcom.1981.1095146 · Cited by 139
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
The Solution of a Toeplitz Set of Linear Equations
Zohar, S. (1974) · Journal of the ACM · doi:10.1145/321812.321822 · Cited by 133
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
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
A Fast Computer Method for Matrix Transposing
Eklundh, J. (1972) · IEEE Transactions on Computers · doi:10.1109/t-c.1972.223584 · Cited by 129
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
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 105
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
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
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
Griffiths, L. W., Birkhoff, G., & MacLane, S. (1942) · National Mathematics Magazine · doi:10.2307/3028154 · Cited by 88
Convolutional codes III. Sequential decoding
Forney, G. D. (1974) · Information and Control · doi:10.1016/s0019-9958(74)90876-6 · Cited by 82
(2008) · Springer eBooks · doi:10.1007/978-0-387-22601-9_1 · Cited by 81
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
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
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
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
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
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
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
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
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
Cozzens, J. H., & Finkelstein, L. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057081 · Cited by 60
Digital Filtering Using Complex Mersenne Transforms
Nussbaumer, H. (1976) · IBM Journal of Research and Development · doi:10.1147/rd.205.0498 · Cited by 55
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
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
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
An introduction to discrete systems
Steiglitz, K., & Krieger, R. E. (1974) · Medical Entomology and Zoology · Cited by 44
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
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
Digital filtering using polynomial transforms
Nussbaumer, H. (1977) · Electronics Letters · doi:10.1049/el:19770280 · Cited by 38
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
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
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
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
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
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
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
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
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
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
Efficient transforms for multidimensional convolutions
Arambepola, B., & Rayner, P. J. (1979) · Electronics Letters · doi:10.1049/el:19790132 · Cited by 28
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
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
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
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
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
Complex approximations using algebraic integers
Games, R. A. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057099 · Cited by 19
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
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
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
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
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
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
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
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
Semi-Fast Fourier Transforms over GF(2m).
Sarwate (1978) · IEEE Transactions on Computers · doi:10.1109/tc.1978.1675088 · Cited by 11
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
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
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
How the Fast Fourier Transform Got its Name
Huang, T. S. (1971) · Computer · doi:10.1109/c-m.1971.216789 · Cited by 5
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
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 953
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
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
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
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 126
Metadata
- 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
