Please use this identifier to cite or link to this item:
http://localhost:8081/jspui/handle/123456789/10156
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Dutta, Shaibal | - |
dc.date.accessioned | 2014-11-23T06:14:35Z | - |
dc.date.available | 2014-11-23T06:14:35Z | - |
dc.date.issued | 1992 | - |
dc.identifier | M.Tech | en_US |
dc.identifier.uri | http://hdl.handle.net/123456789/10156 | - |
dc.guide | Gautam, J. K. | - |
dc.description.abstract | in this dissertation three tecehniques for the designing ®' optimal finite wdrdlength FIR. digital filters are studied. Firstly analysis of response._ error due to coefficient quantization has been given, then algorithm is presented to minimize the error in frequency response when finite word tengt.h filter coefficient. are evaluated rounding- off the infinitely precise coefficients. In second me.thod,applica.tio.n of general purpose', branch and bound techniques is described to design FIR filters. At last7a method' optimizing (in the least square response -error sense) the -remaining unquantiz.ed ._ ...__. coefficients for FIR linear, phase filter, when one or more coefficient-: take,:. on discrete values, is produced. By incorporating this optimization method into tree — search algorithm and, employing suitable branching policy, an efficient algorithm for design of high - order discrete coefficient FIR filter is produced. | en_US |
dc.language.iso | en | en_US |
dc.subject | ELECTRONICS AND COMPUTER ENGINEERING | en_US |
dc.subject | FINITE WORDLENGTH FIR DIGITAL FILTERS | en_US |
dc.subject | FIR LINEAR | en_US |
dc.subject | FIR FILTERS | en_US |
dc.title | DESIGN OF OPTIMAL FINITE WORDLENGTH FIR DIGITAL FILTERS | en_US |
dc.type | M.Tech Dessertation | en_US |
dc.accession.number | 246079 | en_US |
Appears in Collections: | MASTERS' THESES (E & C) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
ECD246079.pdf | 2.27 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.