Referenced Items are not available for this document.
This article presents an improved Toom's algorithm that allows hardware savings without slowing down the processing speed. We derive formulae for the number of multiplications and additions required to compute the linear convolution of size n = 2/sup /spl alpha//. We demonstrate the computational advantage of the proposed improved algorithm when compared to previous algorithms, such as the original matrix-vector multiplication and the FFT algorithms.
Published in:
Signal Processing Letters, IEEE
(Volume:9
,
Issue:
7
)
Date of Publication: July 2002
- Page(s):
- 211 - 214
- ISSN :
- 1070-9908
- INSPEC Accession Number:
- 7361958
- Digital Object Identifier :
- 10.1109/LSP.2002.801718
- Date of Current Version :
- 07 November 2002
- Issue Date :
- July 2002
- Sponsored by :
- IEEE Signal Processing Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
