Close category search window
 

Efficient multiplierless designs for 1-D DWT using 9/7 filters based on distributed arithmetic

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Mohanty, B.K. ; Dept. of Electron. & Commun. Eng., Jaypee Inst. of Eng. & Technol., Guna, India ; Meher, P.K.

In this paper, we present a distributed arithmetic (DA) formulation of the computation of discrete wavelet transform (DWT) using 9/7 filters, and mapped that into bit-parallel and bit-serial architectures for high-throughput and low-hardware implementations, respectively. The bit-serial structure processes the bit-slices of input vector in serial manner for low-hardware solution, while the bit-parallel structure processes all the bit-slices in parallel for high-throughput computation. The bit-parallel structure has 100% hardware utilization efficiency. Compared with the existing multiplierless structures, the proposed structures offer significantly higher throughput rate and involve less area-delay product.

Published in:
Integrated Circuits, ISIC '09. Proceedings of the 2009 12th International Symposium on

Date of Conference: 14-16 Dec. 2009

Need Help?


IEEE Advancing Technology for Humanity 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.