Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
Hostname: page-component-84b7d79bbc-c654p Total loading time: 0 Render date: 2024-07-30T19:50:30.717Z Has data issue: false hasContentIssue false

Bibliography

Published online by Cambridge University Press:  03 May 2011

Richard E. Blahut
Richard E. Blahut
Affiliation:
University of Illinois, Urbana-Champaign
Get access

Summary

A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Chapter
Information
Fast Algorithms for Signal Processing , pp. 442 - 448
Publisher: Cambridge University Press
Print publication year: 2010

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

R. C., Agarwal and C. S., Burrus, Fast Digital Convolution Using Fermat Transforms, Southwest IEEE Conference Record, Houston, 538–543, 1973.Google Scholar
R. C., Agarwal and C. S., Burrus, Fast Convolution Using Fermat Number Transforms with Applications to Digital Filtering, IEEE Transaction on Acoustics, Speech, and Signal Processing, ASSP-22, 87–97, 1974a.Google Scholar
R. C., Agarwal and C. S., Burrus, Fast One-Dimensional Digital Convolution by Multidimensional Techniques, IEEE Transactions on Acoustics, Speech, and Signal Processing, ASSP-22, 1–10, 1974b.Google Scholar
R. C., Agarwal and C. S., Burrus, Number Theoretic Transforms to Implement Fast Digital Convolution, Proceedings of the IEEE, 63, 550–560, 1975.Google Scholar
R. C., Agarwal and J. W., Cooley, New Algorithms for Digital Convolution, IEEE Transactions on Acoustics, Speech, and Signal Processing, ASSP-25, 392–410, 1977.Google Scholar
N., Ahmed, T., Natarajan, and K. R., Rao, Discrete Cosine Transform, IEEE Transactions on Computers, C-23, 90–93, 1974.Google Scholar
A. V., Aho, J. E., Hopcroft, and J. D., Ullman, The Design and Analysis of Computer Algorithms, Reading, MA, Addison-Wesley, 1974.Google Scholar
B., Arambepola and P. J. W., Rayner, Efficient Transforms for Multidimensional Convolutions, Electronic Letters, 15, 189–190, 1979.Google Scholar
L., Auslander, E., Feig, and S., Winograd, New Algorithms for the Multidimensional Discrete Fourier Transform, IEEE Transactions on Acoustics, Speech, and Signal Processing, ASSP-31, 388–403, 1983.Google Scholar
L., Bahl, J., Cocke, F., Jelinek, and J., Raviv, Optimal Decoding of Linear Codes for Minimizing Symbol Error Rate, IEEE Transactions on Information Theory, IT-20, 284–287, 1974.Google Scholar
B., Baumslag and B., Chandler, Theory and Problems of Group Theory, Schaum's Outline Series, New York, McGraw-Hill, 1968.Google Scholar
E. R., Berlekamp, Algebraic Coding Theory, New York, McGraw-Hill, 1968.Google Scholar
R., Bernardini, G. M., Cortelazzo, and G. A., Mian, A New Technique for Twiddle-Factor Elimination in Multidimensional FFTs, IEEE Transactions on Signal Processing, SP-42, 2176–2178, 1994.Google Scholar
T., Beth, W., Fumy, and R., Muhlfeld, On Algebraic Discrete Fourier Transforms, Abstracts on the 1982 IEEE International Symposium on Information Theory, Les Arcs, France, 1982.Google Scholar
G., Birkhoff and S., MacLane, A Survey of Modern Algebra, New York, MacMillan, 1941; rev. ed., 1953.Google Scholar
R. E., Blahut, Fast Convolution of Rational Sequences, Abstracts on the 1983 IEEE International Symposium on Information Theory, St. Jovite, Quebec, Canada, 1983a.Google Scholar
R. E., Blahut, Theory and Practice of Error Control Codes, Reading, MA, Addison-Wesley, 1983b.Google Scholar
R. E., Blahut, Algebraic Methods for Signal Processing and Communications Coding, New York, Springer-Verlag, 1992.Google Scholar
R. E., Blahut, Algebraic Codes for Data Transmission, Cambridge, Cambridge University Press, 2003.Google Scholar
R. E., Blahut and D. E., Waldecker, Half-Angle Sine-Cosine Generator, IBM Technical Disclosure Bulletin, 13, no. 1, 222–223, 1970.Google Scholar
L. I., Bluestein, A Linear Filtering Approach to the Computation of the Discrete Fourier Transform, IEEE Transactions on Audio Electroacoustics, AU-18, 451–455, 1970.Google Scholar
R. P., Brent, F. O., Gustavson, and D. Y. Y., Yun, Fast Solution of Toeplitz Systems of Equations and Computation of Pade Approximants, Journal on Algorithms, 1, 259–295, 1980.Google Scholar
C. S., Burrus and P. W., Eschenbacher, An In-Place, In-Order Prime Factor FFT Algorithm, IEEE Transactions on Acoustics, Speech, and Signal Processing, ASSP-29, 806–817, 1979.Google Scholar
J., Butler and R., Lowe, Beam-forming Matrix Simplifies Design of Electronically Scanned Antennas, Electronic Design, 9, 170–173, 1961.Google Scholar
W.-H., Chen, C. H., Smith, and S. C., Fralick, A Fast Computational Algorithm for the Discrete Cosine Transform, IEEE Transactions on Communications, COM-25, 1004–1009, 1977.Google Scholar
P. R., Chevillat, Transform-Domain Filtering with Number Theoretic Transforms, and Limited Word Length, IEEE Transactions on Acoustics, Speech, and Signal Processing, ASSP-26, 284–290, 1978.Google Scholar
P. R., Chevillat and D. J., Costello Jr., An Analysis of Sequential Decoding for Specific Time-Invariant Convolutional Codes, IEEE Transactions on Information Theory, IT-24, 443–451, 1978.Google Scholar
J. W., Cooley, P. A. W., Lewis, and P. D., Welch, Historical Notes on the Fourier Transform, IEEE Transactions on Audio Electroacoustics, AU-15, 76–79, 1967.Google Scholar
J. W., Cooley and J. W., Tukey, An Algorithm for the Machine Computation of Complex Fourier Series, Mathematics of Computation, 19, 297–301, 1965.Google Scholar
D., Coppersmith and S., Winograd, Matrix Multiplication via Arithmetic Progressions, Journal of Symbolic Computation, 9, 251–280, 1990.Google Scholar
J. H., Cozzens and L. A., Finkelstein, Computing the Discrete Fourier Transform Using Residue Number Systems in a Ring of Algebraic Integers, IEEE Transactions on Information Theory, IT-31, 580–588, 1985.Google Scholar
R. E., Crochiere and L. R., Rabiner, Interpolation and Decimation of Digital Signals – A Tutorial Review, Proceedings of the IEEE, 69, 330–331, 1981.Google Scholar
B. W., Dickinson, Efficient Solution of Linear Equations with Banded Toeplitz Matrices, IEEE Transactions on Acoustics, Speech, and Signal Processing, ASSP-27, 421–423, 1979.Google Scholar
B. W., Dickinson, M., Morf, and T., Kailath, A Minimal Realization Algorithm for Matrix Sequences, IEEE Transactions on Automatic Control, AC-19, 31–38, 1974.Google Scholar
E., DuBois and A. N., Venetsanopoulos, Convolution Using a Conjugate Symmetry Property for the Generalized Discrete Fourier Transform, IEEE Transactions on Acoustics, Speech, and Signal Processing, ASSP-26, 165–170, 1978.Google Scholar
J., Durbin, The Fitting of Time-Series Models, Reviews of the International Statistical Institute, 23, 233–244, 1960.Google Scholar
S. R., Dussé and B. S., Kaliski, A Cryptographic Library for the Motorola DSP56000, Advances in Cryptology, Eurocrypt90, I. B., Damgard, editor, 230–244, New York, Springer-Verlag, 1991.Google Scholar
J. O., Eklundh, A Fast Computer Method for Matrix Transposing, IEEE Transactions on Computers, C-21, 801–803, 1972.Google Scholar
R. M., Fano, A Heuristic Discussion of Probabilistic Decoding, IEEE Transactions on Information Theory, IT-11, no. 9, 64–74, 1963.Google Scholar
S. V., Fedorenko, A Method for Computation of the Discrete Fourier Transform over a Finite Field, Problemy Peredachi Informatsii, 42, 81–93, 2006, English translation: Problems of Information Transmission, 42, 139–151, 2006.Google Scholar
E., Feig and S., Winograd, Fast Algorithms for the Discrete Cosine Transform, IEEE Transactions on Signal Processing, SP-40, 2174–2193, 1992.Google Scholar
C. M., Fiduccia, Polynomial Evaluation via the Division Algorithm – The Fast Fourier Transform Revisited, Proceedings of the 4th Annual ACM Symposium on the Theory of Computing, 88–93, 1972.Google Scholar
G. D., Forney, Convolutional Codes III: Sequential Decoding, Information and Control, 25, 267–297, 1974.Google Scholar
J. B., Fraleigh, A First Course in Abstract Algebra, 2nd edition, Reading, MA, Addison-Wesley, 1976.Google Scholar
B., Friedlander, M., Morf, T., Kailath, and L., Ljung, New Inversion Formulas for Matrices Classified in Terms of Their Distance from Toeplitz Matrices, Linear Algebra and Its Application, 27, 31–60, 1979.Google Scholar
R. G., Gallager, Information Theory and Reliable Communications, New York, John Wiley, 1968.Google Scholar
R. A., Games, Complex Approximations Using Algebraic Integers, IEEE Transactions on Information Theory, IT-31, 565–579, 1985.Google Scholar
R. A., Games, An Algorithm for Complex Approximations in Z[e2πi/8], IEEE Transactions on Information Theory, IT-32, 603–607, 1986.Google Scholar
C. F., Gauss, Nachlass: Theoria interpolationis methodo nova tractata, Werke band 3, 265–327. Göttingen Königliche Gesellschaft der Wissenschaften, 1866.
I., Gertner, A New Efficient Algorithm to Compute the Two-Dimensional Discrete-Fourier Transform, IEEE Transactions on Acoustics, Speech, and Signal Processing, ASSP-36, 1036–1050, 1988.Google Scholar
G., Goertzel, An Algorithm for the Evaluation of Finite Trigonometric Series, American Mathematics Monthly, 65, 34–35, 1968.Google Scholar
I. J., Good, The Interaction Algorithm and Practical Fourier Analysis, Journal of the Royal Statistics Society, B20, 361–375, 1958. Addendum, 22, 372–375, 1960.Google Scholar
I. J., Good, The Relationship between Two Fast Fourier Transforms, IEEE Transactions on Computers, C-20, 310–317, 1971.Google Scholar
D., Haccoun and M. J., Ferguson, Generalized Stack Algorithms for Decoding Convolutional Codes, IEEE Transactions on Information Theory, IT-21, 638–651, 1975.Google Scholar
G. H., Hardy and E. M., Wright, The Theory of Numbers, Oxford, Oxford University Press, 1960.Google Scholar
D. B., Harris, J. H., McClellan, D. S. K., Chan, and H. W., Schuessler, Vector Radix Fast Fourier Transform, Record of the 1977 IEEE International Conference on Acoustics, Speech, and Signal Processing, 548–551, 1977.Google Scholar
M. T., Heideman, D. H., Johnson, and C. S., Burrus, Gauss and the History of the FFT, IEEE Signal Processing Magazine, 1, 14–21, 1984.Google Scholar
C. A. R., Hoare, Quicksort, Computer Journal 5, 5, no. 1, 10–16, 1962. (Reprinted in Hoare and Jones: Essays in Computing Science, New York, Prentice Hall, 1989.)Google Scholar
J. E., Hopcroft and I., Musinski, Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms, SIAM Journal of Computation, 2, 159–173, 1973.Google Scholar
T. S., Huang, How the Fast Fourier Transform Got Its Name, Computer, 3, 15, 1971.Google Scholar
I. M., Jacobs and E. R., Berlekamp, A Lower Bound to the Distribution of Computations for Sequential Decoding, IEEE Transactions on Information Theory, IT-13, 167–174, 1967.Google Scholar
F., Jelinek, Probabilistic Information Theory, New York, McGraw-Hill, 1968.Google Scholar
F., Jelinek, A Fast Sequential Decoding Algorithm Using a Stack, IBM Journal of Research and Development, 13, 675–685, 1969a.Google Scholar
F., Jelinek, An Upper Bound on Moments of Sequential Decoding Effort, IEEE Transactions on Information Theory, IT-15, 140–149, 1969b.Google Scholar
W. K., Jenkins and J. V., Krogmeier, The Design of Dual-Mode Complex Signal Processors Based on Quadratic Modular Number Codes, IEEE Transactions on Circuits and Systems, CAS-34, 354–364, 1987.Google Scholar
W. K., Jenkins and B. J., Leon, The Use of Residue Number Systems in the Design of Finite Impulse Response Digital Filters, IEEE Transactions on Circuits and Systems, CAS-24, 191–201, 1977.Google Scholar
R., Johannesson and K. Sh., Zigangirov, Fundamentals of Convolutional Coding, New York, IEEE Press, 1999.Google Scholar
H. W., Johnson and C. S., Burrus, Large DFT Modules: 11, 13, 17, 19 and 25, Technical Report 8105, Department of Electrical Engineering, Rice University, Houston, TX, 1981.Google Scholar
H. W., Johnson and C. S., Burrus, The Design of Optimal DFT Algorithms Using Dynamic Programming, IEEE Transactions on Acoustics, Speech and Signal Processing, ASSP-31, 378–387, 1983.Google Scholar
S. G., Johnson and M., Frigo, A Modified Split-Radix FFT with Fewer Arithmetic Operations, IEEE Transactions on Signal Processing, SP-55, 111–119, 2007.Google Scholar
B. S., Kaliski, The Montgomery Inverse and its Applications, IEEE Transactions on Computers, C-44, 1064–1065, 1995.Google Scholar
D. E., Knuth, The Art of Computer Programming, Vol. 1: Fundamental Algorithms, Reading, MA, Addison-Wesley, 1968.Google Scholar
D. P., Kolba and T. W., Parks, A Prime Factor FFT Algorithm Using High Speed Convolution, IEEE Transactions on Acoustics, Speech, and Signal Processing, ASSP-25, 281–294, 1977.Google Scholar
L. M., Leibowitz, A Simplified Binary Arithmetic for the Fermat Number Transform, IEEE Transactions on Acoustics, Speech, and Signal Processing, ASSP-24, 356–359, 1976.Google Scholar
N., Levinson, The Wiener RMS Error Criterion in Filter Design and Prediction, Journal of Mathematical Physics, 25, 261–278, 1947.Google Scholar
B., Liu and F., Mintzer, Calculation of Narrow-Band Spectra by Direct Decimation, IEEE Transactions on Acoustics, Speech, and Signal Processing, ASSP-26, 529–534, 1978.Google Scholar
J., Makhoul, A Fast Cosine Transform in One and Two Dimensions, IEEE Transaction on Acoustics, Speech, and Signal Processing, ASSP-28, 27–34, 1980.Google Scholar
J. L., Massey, Shift-Register Synthesis and BCH Decoding, IEEE Transactions on Information Theory, IT-15, 122–127, 1969.Google Scholar
J. H., McClellan, Hardware Realization of a Fermat Number Transform, IEEE Transactions on Acoustics, Speech, and Signal Processing, ASSP-24, 216–225, 1976.Google Scholar
J. H., McClellan and C. M., Rader, Number Theory in Digital Signal Processing, Englewood Cliffs, NJ, Prentice-Hall, 1979.Google Scholar
R., Mersereau and T. C., Speake, A Unified Treatment of Cooley–Tukey Algorithms for the Evaluation of the Multidimensional DFT, IEEE Transactions on Acoustics, Speech, and Signal Processing, ASSP-29, 1011–1018, 1981.Google Scholar
R. L., Miller, T. K., Truong, and I. S., Reed, Efficient Program for Decoding the (255, 223) Reed–Solomon Code Over GF(28) with Both Errors and Erasures Using Transform Coding, Proceedings of the IEEE, 127, 136–142, 1980.Google Scholar
Y., Monden and S., Arimoto, Generalized Rouche's Theorem and Its Application to Multivariate Autoregressions, IEEE Transactions on Acoustics, Speech, and Signal Processing, ASSP-28, 733–738, 1980.Google Scholar
P. L., Montgomery, Modular Multiplication Without Trial Division, Mathematics of Computation, 44, 519–521, 1985.Google Scholar
M., Morf, B. W., Dickinson, T., Kailath, and A. C. O., Vieira, Efficient Solution of Covariance Equations for Linear Prediction, IEEE Transactions on Acoustics, Speech, and Signal Processing, ASSP-25, 429–433, 1977.Google Scholar
R. L., Morris, A Comparative Study of Time Efficient FFT and WFTA Programs for General Purpose Computers, IEEE Transactions on Acoustics, Speech, and Signal Processing, ASSP-26, 141–150, 1978.Google Scholar
M. J., Narasimha and A. M., Peterson, On the Computation of the Discrete Cosine Transform, IEEE Transactions on Communications, COM-26, 934–936, 1978.Google Scholar
H., Nawab and J. H., McClellan, Bounds on the Minimum Number of Data Transfers in WFTA and FFT Programs, IEEE Transactions on Acoustics, Speech, and Signal Processing, ASSP-27, 393–398, 1979.Google Scholar
H. J., Nussbaumer, Digital Filtering Using Complex Mersenne Transforms, IBM Journal of Research and Development, 20, 498–504, 1976.Google Scholar
H. J., Nussbaumer, Digital Filtering Using Polynomial Transforms, Electronics Letters, 13, 386–387, 1977.Google Scholar
H. J., Nussbaumer, New Algorithms for Convolution and DFT Based on Polynomial Transforms, Proceedings of the 1978 IEEE International Conference on Acoustics, Speech, and Signal Processing, 638–641, 1978.Google Scholar
H. J., Nussbaumer and P., Quandalle, Fast Computation of Discrete Fourier Transforms Using Polynomial Transforms, IEEE Transactions on Acoustics, Speech and Signal Processing, ASSP-27, 169–181, 1979.Google Scholar
H. J., Nussbaumer and P., Quandalle, New Polynomial Transform Algorithms for Fast DFT Computations, Proceedings of the IEEE 1979 International Acoustics, Speech and Signal Processing Conference (1979), 510–513, 1979.Google Scholar
A. V., Oppenheim and R. W., Shafer, Digital Signal Processing, Englewood Cliffs, NJ, Prentice-Hall, 1975.Google Scholar
O., Ore, Number Theory and its History, New York, McGraw-Hill, 1948.Google Scholar
O., Panda, R. N., Pal, and B., Chatterjee, Error Analysis of Good-Winograd Algorithm Assuming Correlated Truncation Errors, IEEE Transactions on Acoustics, Speech, and Signal Processing, ASSP-31, 508–512, 1983.Google Scholar
T. W., Parsons, A Winograd–Fourier Transform Algorithm for Real-Valued Data, IEEE Transactions on Acoustics, Speech, and Signal Processing, ASSP-27, 398–402, 1979.Google Scholar
R. W., Patterson and J. H., McClellan, Fixed-Point Error Analysis of Winograd Fourier Transform Algorithms, IEEE Transactions on Acoustics, Speech, and Signal Processing, ASSP-26, 447–455, 1978.Google Scholar
I., Pitas and M. G., Strintzis, On the Multiplicative Complexity of Two-Dimensional Fast Convolution Methods, Abstr. 1982 IEEE International Symposium on Information Theory, Les Arcs, France, 1982.Google Scholar
J. M., Pollard, The Fast Fourier Transform in a Finite Field, Mathematics of Computation, 25, 365–374, 1971.Google Scholar
F. P., Preparata and D. V., Sarwate, Computational Complexity of Fourier Transforms over Finite Fields, Mathematics of Computation, 31, 740–751, 1977.Google Scholar
R. D., Preuss, Very Fast Computation of the Radix-2 Discrete Fourier Transform, IEEE Transactions on Acoustics, Speech, and Signal Processing, ASSP-30, 595–607, 1982.Google Scholar
J. G., Proakis and D. K., Manolakis, Digital Signal Processing (fourth edition), Englewood Cliffs, NJ, Prentice Hall, 2006.Google Scholar
L. R., Rabiner and B., Gold, Theory and Application of Digital Signal Processing, Englewood Cliffs, NJ, Prentice-Hall, 1975.
C. M., Rader, Discrete Fourier Transforms When the Number of Data Samples Is Prime, Proceedings of the IEEE, 56, 1107–1108, 1968.Google Scholar
C. M., Rader, An Improved Algorithm for High Speed Autocorrelation with Applications to Spectral Estimation, IEEE Transactions on Audio Electroacoustics, AU-18, 439–441, 1970.Google Scholar
C. M., Rader, Discrete Convolutions via Mersenne Transforms, IEEE Transactions on Computers, C-21, 1269–1273, 1972.Google Scholar
C. M., Rader, Memory Management in a Viterbi Decoder, IEEE Transactions on Communications, COM-29, 1399–1401, 1981.Google Scholar
C. M., Rader and N. M., Brenner, A New Principle for Fast Fourier Transformation, IEEE Transactions on Acoustics, Speech, and Signal Processing, ASSP-24, 264–265, 1976.Google Scholar
I. S., Reed and T. K., Truong, The Use of Finite Fields to Compute Convolutions, IEEE Transactions on Information Theory, IT-21, 208–213, 1975.Google Scholar
B., Rice, Some Good Fields and Rings for Computing Number Theoretic Transforms, IEEE Transactions on Acoustics, Speech, and Signal Processing, ASSP-27, 432–433, 1979.Google Scholar
B., Rice, Winograd Convolution Algorithms overt Finite Fields, Congressus Numberatium, 29, 827–857, 1980.Google Scholar
G. E., Rivard, Direct Fast Fourier Transform of Bivariate Functions, IEEE Transactions on Acoustics, Speech, and Signal Processing, ASSP-25, 250–252, 1977.Google Scholar
S., Robinson, Towards an Optimal Algorithm for Matrix Multiplication, SIAM News, 9, 8, 2005.Google Scholar
D. V., Sarwate, Semi-Fast Fourier Transforms Over GF(2m), IEEE Transactions on Computers, C-27, 283–284, 1978.Google Scholar
J. E., Savage, Sequential Decoding-The Computation Problem, Bell System Technical Journal, 45, 149–175, 1966.Google Scholar
I. W., Selesnick and C. S., Burrus, Automatic Generations of Prime Length FFT Programs, IEEE Transactions on Signal Processing, 44, 14–24, 1996.Google Scholar
H. F., Silverman, An Introduction to Programming the Winograd Fourier Transform Algorithm (WFTA), IEEE Transactions on Acoustics, Speech and Signal Processing, ASSP-25, 152–165, 1977.Google Scholar
R. C., Singleton, An Algorithm for Computing the Mixed Radix Fast Fourier Transform, IEEE Transactions on Audio Electroacoustics, AU-17, 93–103, 1969.Google Scholar
K., Steiglitz, An Introduction to Discrete Systems, New York, John Wiley, 1974.Google Scholar
T. G., Stockham, High Speed Convolution and Correlation, Spring Joint Computer Conference, AFIPS Conference Proceedings, 28, 229–233, 1966.Google Scholar
G., Strang, Linear Algebra and Its Applications, second edition, New York, Academic Press, 1980.Google Scholar
V., Strassen, Gaussian Elimination is not Optimal, Numerical Mathematics, 13, 354–356, 1969.Google Scholar
Y., Sugiyama, M., Kasahara, S., Hirasawa, and T., Namekawa, A Method for Solving Key Equations for Decoding Goppa Codes, Information and Control, 27, 87–99, 1975.Google Scholar
N. S., Szabo and R. I., Tanaka, Residue Arithmetic and Its Application to Computer Technology, New York, McGraw-Hill, 1967.Google Scholar
L. H., Thomas, Using a Computer to Solve Problems in Physics, in Applications of Digital Computers, Boston, MA, Ginn and Co., 1963.Google Scholar
R. M., Thrall and L., Tornheim, Vector Spaces and Matrices, New York, John Wiley, 1957.Google Scholar
R., Tolmieri, M., An, and C., Lu, Mathematics of Multidimensional Fourier Transform Algorithms, New York, Springer-Verlag, 1993, second edition, 1997.
W. F., Trench, An Algorithm for the Inversion of Finite Toeplitz Matrices, J. SIAM, 12, no. 3, 512–522, 1964.Google Scholar
P. V., Trifonov and S. V., Fedorenko, A Method for Fast Computation of the Fourier Transform Over a Finite Field, Problemy Peredachi Informatsaii, 39, no. 3, 3–10, 2003, English translation, Problems of Information Transmission, 39, 231–238, 2003.Google Scholar
B. L., Van der Waerden, Modern Algebra, two volumes, translated by F., Blum and T. J., Benac, New York, Frederick Ungar Publishing Co., 1949, 1953.Google Scholar
A., Vieira and T., Kailath, On Another Approach to the Schur–Cohn Criterion, IEEE Transactions on Circuits and Systems, CAS-24, no. 4, 218–220, 1977.Google Scholar
A. J., Viterbi, Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm, IEEE Transactions on Information Theory, IT-13, 260–269, 1967.Google Scholar
J. E., Volder, The CORDIC Trigonometric Computing Technique, IRE Transactions on Electronic Computers, EC-8, no. 3, 330–334, 1959.Google Scholar
J. S., Walther, A Unified Algorithm for Elementary Functions, Conference Proceedings, Spring Joint Computer Conference, 379–385, 1971.Google Scholar
L. R., Welch and R. A., Scholtz, Continued Fractions and Berlekamp's Algorithm, IEEE Transactions on Information Theory, IT-25, 19–27, 1979.Google Scholar
R. A., Wiggins and B. A., Robinson, Recursive Solution to the Multichannel Filtering Problem, Journal of Geophysical Research, 70, 1885–1891, 1965.Google Scholar
N. M., Wigley and G. A., Jullien, On Modulus Replication for Residue Arithmetic Computation of Complex Inner Products, IEEE Transactions on Computers, C-39, 1065–1076, 1990.Google Scholar
N. M., Wigley, G. A., Jullien, and D., Reaume, Large Dynamic Range Computations over Small Finite Rings, IEEE Transactions on Computers, C-43, 78–86, 1994.Google Scholar
J. W. J., Williams, Algorithm 232: Heapsort, Communications of the ACM, 7, 347–348, 1964.Google Scholar
S., Winograd, A New Algorithm for Inner Product, IEEE Transactions on Computers, C-17, 693–694, 1968.Google Scholar
S., Winograd, On Computing the Discrete Fourier Transform, Proceedings of the National Academy of Science USA, 73, 1005–1006, 1976.Google Scholar
S., Winograd, Some Bilinear Forms Whose Multiplicative Complexity Depends on the Field of Constants, Mathematical Systems Theory, 10, 169–180, 1977.Google Scholar
S., Winograd, On Computing the Discrete Fourier Transform, Mathematics of Computation, 32, 175–199, 1978.Google Scholar
S., Winograd, On the Complexity of Symmetric Filters, Proceedings of the International Symposium on Circuits and Systems, Tokyo, 262–265, 1979.Google Scholar
S., Winograd, Arithmetic Complexity of Computations, CBMS-NSF Regional Conference Series Appl. Math, Siam Publications33, 1980a.Google Scholar
S., Winograd, Signal Processing and Complexity of Computation, Proceedings of the International Conference on Acoustics, Speech, and Signal Processing, 24, 94–101, 1980b.Google Scholar
J. M., Wozencraft, Sequential Decoding for Reliable Communication, 1957 National IRE Convention Record, 5, part 2, 11–25, 1957.Google Scholar
J. M., Wozencraft and B., Reiffen, Sequential Decoding, Cambridge, MA, MIT Press, 1961.
E. L., Zapata and F., Arguëllo, Application-Specific Architecture for Fast Transforms Based on the Successive Doubling Method, IEEE Transactions on Signal Processing, SP-41, 1476–1481, 1993.Google Scholar
Y., Zheng, G., Bi, and A. R., Leyman, New Polynomial Transform Algorithm for Multidimensional DCT, IEEE Transactions on Signal Processing, SP-48, 2814–2821, 2000.Google Scholar
K., Zigangirov, Some Sequential Decoding Procedures, Problemy Peredachi Informatsii, 2, 13–25, 1966.Google Scholar
S., Zohar, The Solution of a Toeplitz Set of Linear Equations, Journal of the Association for Computing Machinery, 21, 272–276, 1974.Google Scholar

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

  • Bibliography
  • Richard E. Blahut, University of Illinois, Urbana-Champaign
  • Book: Fast Algorithms for Signal Processing
  • Online publication: 03 May 2011
  • Chapter DOI: https://doi.org/10.1017/CBO9780511760921.016
Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

  • Bibliography
  • Richard E. Blahut, University of Illinois, Urbana-Champaign
  • Book: Fast Algorithms for Signal Processing
  • Online publication: 03 May 2011
  • Chapter DOI: https://doi.org/10.1017/CBO9780511760921.016
Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

  • Bibliography
  • Richard E. Blahut, University of Illinois, Urbana-Champaign
  • Book: Fast Algorithms for Signal Processing
  • Online publication: 03 May 2011
  • Chapter DOI: https://doi.org/10.1017/CBO9780511760921.016
Available formats
×