Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/46820
Title: Algorithm and circuit design for conversion of binary numbers to signed power-of-two terms
Authors: Vedavally Jayaraman
Keywords: DRNTU::Engineering::Electrical and electronic engineering
Issue Date: 2009
Abstract: Improvements in VLSI technology have enabled digital filters to be used in an increasing number of application domains. In a full custom hardware implementation, the coefficient multiplier is the most expensive and the most important speed determining component. Consequently the primary concern in the design of filters for hardware implementation is to reduce the multiplier complexity. Many methods have been proposed to reduce the hardware complexity of digital filters. One of these methods is to approximate each coefficient value by a small number of signed power-of-two terms (SPT) as the number of SPT terms is proportional to the hardware complexity which is the aim of this thesis.
Description: 84 p.
URI: http://hdl.handle.net/10356/46820
Rights: Nanyang Technological University
Fulltext Permission: restricted
Fulltext Availability: With Fulltext
Appears in Collections:EEE Theses

Files in This Item:
File Description SizeFormat 
EEE_THESES_164.pdf
  Restricted Access
6.15 MBAdobe PDFView/Open

Page view(s) 50

223
Updated on Dec 4, 2020

Download(s)

13
Updated on Dec 4, 2020

Google ScholarTM

Check

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.