The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.02 - February (2011 vol.60)
pp: 202-213
Mark G. Arnold , Lehigh University, Bethlehem
Sylvain Collange , ELIAUS, Université de Perpignan, Perpignan
ABSTRACT
The real Logarithmic Number System (LNS) offers fast multiplication but uses more expensive addition. Cotransformation and higher order table methods allow real LNS ALUs with reasonable precision on Field-Programmable Gate Arrays (FPGAs). The Complex LNS (CLNS) is a generalization of LNS, which represents complex values in log-polar form. CLNS is a more compact representation than traditional rectangular methods, reducing bus and memory cost in the FFT; however, prior CLNS implementations were either slow CORDIC-based or expensive 2D-table-based approaches. Instead, we reuse real LNS hardware for CLNS, with specialized hardware (including a novel \log \sin that overcomes singularity problems) that is smaller than the real-valued LNS ALU to which it is attached. All units were derived from the Floating-Point-Cores (FloPoCo) library. FPGA synthesis shows our CLNS ALU is smaller than prior fast CLNS units. We also compare the accuracy of prior and proposed CLNS implementations. The most accurate of the proposed methods increases the error in radix-two FFTs by less than half a bit, and a more economical FloPoCo-based implementation increases the error by only one bit.
INDEX TERMS
Complex arithmetic, logarithmic number system, hardware function evaluation, FPGA, fast Fourier transform, VHDL.
CITATION
Mark G. Arnold, Sylvain Collange, "A Real/Complex Logarithmic Number System ALU", IEEE Transactions on Computers, vol.60, no. 2, pp. 202-213, February 2011, doi:10.1109/TC.2010.154
REFERENCES
[1] M.G. Arnold, "Approximating Trigonometric Functions with the Laws of Sines and Cosines Using the Logarithmic Number System," Proc. Eighth EuroMicro Conf. Digital System Design, pp. 48-55, 2005.
[2] M.G. Arnold, T.A. Bailey, J.R. Cowles, and C. Walter, "Analysis of Complex LNS FFTs," Signal Processing Systems SIPS 2001: Design and Implementation, F. Catthoor and M. Moonen, eds., pp. 58-69, IEEE Press, 2001.
[3] M.G. Arnold, T.A. Bailey, J.R. Cowles, and C. Walter, "Fast Fourier Transforms Using the Complex Logarithm Number System," J. VLSI Signal Processing, vol. 33, no. 3, pp. 325-335, 2003.
[4] M.G. Arnold, T.A. Bailey, J.R. Cowles, and M.D. Winkel, "Arithmetic Co-Transformations in the Real and Complex Logarithmic Number Systems," IEEE Trans. Computers, vol. 47, no. 7, pp. 777-786, July 1998.
[5] M.G. Arnold and S. Collange, "A Dual-Purpose Real/Complex Logarithmic Number System ALU," Proc. 19th IEEE Symp. Computer Arithmetic, pp. 15-24, June 2009.
[6] N. Brisebarre, F. de Dinechin, and J.-M. Muller, "Integer and Floating-Point Constant Multipliers for FPGAs," Proc. Int'l Conf. Application-Specific Systems, Architectures and Processors, pp. 239-244, 2008.
[7] N. Burgess, "Scaled and Unscaled Residue Number System to Binary Conversion Techniques Using the Residue Number System," Proc. 13th Symp. Computer Arithmetic (ARITH '97), pp. 250-257, Aug. 1997.
[8] J. Detrey and F. de Dinechin, "A Tool for Unbiased Comparison between Logarithmic and Floating-Point Arithmetic," J. VLSI Signal Processing, vol. 49, no. 1, pp. 161-175, 2007.
[9] J. Detrey and F. de Dinechin, "Table-Based Polynomials for Fast Hardware Function Evaluation," Proc. IEEE Int'l Conf. Application-Specific Systems, Architecture and Processors, pp. 328-333, July 2005.
[10] F. de Dinechin, C. Klein, and B. Pasca, "Generating High-Performance Custom Floating-Point Pipelines," Proc. Int'l Conf. Field-Programmable Logic, Aug. 2009.
[11] F. de Dinechin, B. Pasca, O. Creţ, and R. Tudoran, "An FPGA-Specific Approach to Floating-Point Accumulation and Sum-of-Products," Field-Programmable Technology, pp. 33-40, IEEE Press, 2008.
[12] D.M. Lewis, "An Architecture for Addition and Subtraction of Long Word Length Numbers in the Logarithmic Number System," IEEE Trans. Computers, vol. 39, no. 11, pp. 1325-1336, Nov. 1990.
[13] D.M. Lewis, "Complex Logarithmic Number System Arithmetic Using High Radix Redundant CORDIC Algorithms," Proc. 14th IEEE Symp. Computer Arithmetic, pp. 194-203, Apr. 1999.
[14] R. Mehmke, "Additionslogarithmen für Complexe Grössen," Zeitschrift für Math. Physik, vol. 40, pp. 15-30, 1895.
[15] R. Muscedere, V.S. Dimitrov, G.A. Jullien, and W.C. Miller, "Efficient Conversion from Binary to Multi-Digit Multidimensional Logarithmic Number Systems Using Arrays of Range Addressable Look-Up Tables," Proc. 13th IEEE Int'l Conf. Application-Specific Systems, Architectures and Processors (ASAP '02), pp. 130-138, July 2002.
[16] E.E. Swartzlander and A.G. Alexopoulos, "The Sign/Logarithm Number System," IEEE Trans. Computers, vol. 24, no. 12, pp. 1238-1242, Dec. 1975.
[17] E.E. Swartzlander et al., "Sign/Logarithm Arithmetic for FFT Implementation," IEEE Trans. Computers, vol. 32, no. 6, pp. 526-534, June 1983.
[18] P.R. Turner, "Complex SLI Arithmetic: Representation, Algorithms and Analysis," Proc. 11th IEEE Symp. Computer Arithmetic, pp. 18-25, July 1993.
[19] P. Vouzis and M.G. Arnold, "A Parallel Search Algorithm for CLNS Addition Optimization," Proc. IEEE Int'l Symp. Circuits and Systems (ISCAS '06), pp. 20-24, May 2006.
[20] P. Vouzis, M.G. Arnold, and V. Paliouras, "Using CLNS for FFTs in OFDM Demodulation of UWB Receivers," Proc. IEEE Int'l Symp. Circuits and Systems (ISCAS '05), pp. 3954-3957, May 2005.
[21] P. Vouzis, S. Collange, and M.G. Arnold, "Cotransformation Provides Area and Accuracy Improvement in an HDL Library for LNS Subtraction," Proc. 10th EuroMicro Conf. Digital System Design Architectures, Methods and Tools, pp. 85-93, Aug. 2007.
[22] P. Vouzis, S. Collange, and M.G. Arnold, "LNS Subtraction Using Novel Cotransformation and/or Interpolation," Proc. 18th Int'l Conf. Application-Specific Systems, Architectures and Processors, pp. 107-114, July 2007.
[23] http://www.wikipedia.org/wikiarctangent, Oct. 2008.
[24] http:/www.xlnsresearch.com, 2010.
20 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool