536 Chapter 12 Fast Fourier Transform afa,afb,and afc into your address space.In other words,these arrays are replaced by references to a single data array,with offsets that get modified wherever fourfs performs an I/O operation.The resulting algorithm will have its memory references local within blocks of size KBF.Execution speed is thereby sometimes increased enormously,albeit at the cost of requiring twice as much virtual memory as an in-place FFT. CITED REFERENCES AND FURTHER READING: Singleton,R.C.1967,IEEE Transactions on Audio and Electroacoustics,vol.AU-15,pp.91-97. [1] http://www.n read able files Permission is Sample page Oppenheim.A.V.,and Schafer.R.W.1989,Discrete-Time Signa/Processing (Englewood Cliffs NJ:Prentice-Hall).Chapter 9. .com or call 1-800-872-7423(North America only)orsend email to directcustserv@cambridge.org (outside North America). granted for internet users to make one paper copy for their Copyright (C)1988-1992 by Cambridge University Press.Programs Copyright(C)1988-1992 by Numerical Recipes from NUMERICAL RECIPES IN C:THE ART OF SCIENTIFIC COMPUTING (ISBN 0-521-43108-5) Software.536 Chapter 12. Fast Fourier Transform Permission is granted for internet users to make one paper copy for their own personal use. Further reproduction, or any copyin Copyright (C) 1988-1992 by Cambridge University Press. Programs Copyright (C) 1988-1992 by Numerical Recipes Software. Sample page from NUMERICAL RECIPES IN C: THE ART OF SCIENTIFIC COMPUTING (ISBN 0-521-43108-5) g of machine￾readable files (including this one) to any server computer, is strictly prohibited. To order Numerical Recipes books or CDROMs, visit website http://www.nr.com or call 1-800-872-7423 (North America only), or send email to directcustserv@cambridge.org (outside North America). afa, afb, and afc into your address space. In other words, these arrays are replaced by references to a single data array, with offsets that get modified wherever fourfs performs an I/O operation. The resulting algorithm will have its memory references local within blocks of size KBF. Execution speed is thereby sometimes increased enormously, albeit at the cost of requiring twice as much virtual memory as an in-place FFT. CITED REFERENCES AND FURTHER READING: Singleton, R.C. 1967, IEEE Transactions on Audio and Electroacoustics, vol. AU-15, pp. 91–97. [1] Oppenheim, A.V., and Schafer, R.W. 1989, Discrete-Time Signal Processing (Englewood Cliffs, NJ: Prentice-Hall), Chapter 9