Multiplierless approximation of transforms with adder constraint
Reads0
Chats0
TLDR
This letter describes an algorithm for systematically finding a multiplierless approximation of transforms by replacing floating-point multipliers with VLSI-friendly binary coefficients of the form k/2/sup n/.Abstract:
This letter describes an algorithm for systematically finding a multiplierless approximation of transforms by replacing floating-point multipliers with VLSI-friendly binary coefficients of the form k/2/sup n/. Assuming the cost of hardware binary shifters is negligible, the total number of binary adders employed to approximate the transform can be regarded as an index of complexity. Because the new algorithm is more systematic and faster than trial-and-error binary approximations with adder constraint, it is a much more efficient design tool. Furthermore, the algorithm is not limited to a specific transform; various approximations of the discrete cosine transform are presented as examples of its versatility.read more
Citations
More filters
Journal ArticleDOI
Multiplierless multiple constant multiplication
Yevgen Voronenko,Markus Püschel +1 more
TL;DR: This work proposes a new algorithm for the multiple constant multiplication problem, which produces solutions that require up to 20% less additions and subtractions than the best previously known algorithm and can handle problem sizes as large as 100 32-bit constants in a time acceptable for most applications.
Fast fourier transform algorithms with applications
Shuhong Gao,Todd Mateer +1 more
TL;DR: This book presents an introduction to the principles of the fast Fourier transform, which covers FFTs, frequency domain filtering, and applications to video and audio signal processing.
Journal ArticleDOI
M-channel lifting factorization of perfect reconstruction filter banks and reversible M-band wavelet transforms
Ying-Jui Chen,K.S. Amaratunga +1 more
TL;DR: It is shown how to achieve reversible, possibly multiplierless, implementations under finite precision, through the unit diagonal scaling property of the Monic Euclidean algorithm.
Patent
System and method for signal decomposition, analysis and reconstruction
TL;DR: In this article, a system and method for representing quasi-periodic (qp) waveforms comprising, representing a plurality of limited decompositions of the qp waveform, wherein each decomposition includes a first and second amplitude value and at least one time value.
Proceedings ArticleDOI
Lossless multi-channel EEG compression
TL;DR: The Karhunen-Loeve transform is used to exploit the inter-correlation among the EEG channels and an integer time-frequency transform is applied to further minimize the temporal redundancy.
References
More filters
Book ChapterDOI
Factoring wavelet transforms into lifting steps
Ingrid Daubechies,Wim Sweldens +1 more
TL;DR: In this paper, a self-contained derivation from basic principles such as the Euclidean algorithm, with a focus on applying it to wavelet filtering, is presented, which asymptotically reduces the computational complexity of the transform by a factor two.
Book
Discrete Cosine Transform: Algorithms, Advantages, Applications
TL;DR: This paper presents two Dimensional DCT Algorithms and their relations to the Karhunen-Loeve Transform, and some applications of the DCT, which demonstrate the ability of these algorithms to solve the discrete cosine transform problem.
Journal ArticleDOI
Signed-Digit Numbe Representations for Fast Parallel Arithmetic
TL;DR: Sign-digit representations limit carry-propagation to one position to the left during the operations of addition and subtraction in digital computers and arithmetic operations with signed-digit numbers: addition, subtraction, multiplication, division and roundoff are discussed.
Journal ArticleDOI
Reversible integer-to-integer wavelet transforms for image compression: performance evaluation and analysis
Michael D. Adams,F. Kossentni +1 more
TL;DR: At low bit rates, reversible integer-to-integer and conventional versions of transforms were found to often yield results of comparable quality, with the best choice for a given application depending on the relative importance of the preceding criteria.