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