DocumentCode
1003850
Title
Fast additive normalisation method for exponential computation
Author
Chen, C. ; Chen, R.-L. ; Sheu, M.-H.
Author_Institution
Dept. of Inf. Eng. & Comput. Sci., Feng Chia Univ., Taichung, Taiwan
Volume
151
Issue
3
fYear
2004
fDate
5/19/2004 12:00:00 AM
Firstpage
191
Lastpage
198
Abstract
Conventional additive normalisation methods suffer from their linear convergence rate. A new method yields the normalisation factor values directly from predetermined terms without computation. The number of normalisation factors obtained in each normalisation stage is twice the number of normalisation factors in the previous stage. As a result the number of normalisation stages needed to compute the exponential function is proportional to the logarithmic value of the operand word-length. In other words, the convergence rate of the proposed method is exponential. These two advantages of the new method significantly enhance the speed of the additive normalisation method. Based on this method, 24-bit and 53-bit exponential unit architectures have been designed. Extensive 24-bit unit simulations verify the proposed algorithm and error analysis method. Based on the analysis, the hardware cost of the 53-bit unit includes 80 kbits ROM, four adders, and four multipliers.
Keywords
Walsh functions; digital arithmetic; Reed-Muller weights; VLSI digital circuits; basic Walsh technique; block-size coding; block-size segmentation; computer-aided design tools; coordinate data coding; discrete multiple-valued input binary functions; grey-scale images; image compression; logic functions; lossless compression; minterm coding; prediction residual mapping; reference row technique; spectra technique; triangular technique;
fLanguage
English
Journal_Title
Computers and Digital Techniques, IEE Proceedings -
Publisher
iet
ISSN
1350-2387
Type
jour
DOI
10.1049/ip-cdt:20040258
Filename
1304180
Link To Document