Design and implementation of discrete-time filters for efficient sampling rate conversion
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2007. === This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections. === Includes bibliographical refere...
Main Author: | |
---|---|
Other Authors: | |
Format: | Others |
Language: | English |
Published: |
Massachusetts Institute of Technology
2007
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/38531 |
id |
ndltd-MIT-oai-dspace.mit.edu-1721.1-38531 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-MIT-oai-dspace.mit.edu-1721.1-385312019-05-02T15:50:01Z Design and implementation of discrete-time filters for efficient sampling rate conversion Baran, Thomas A. (Thomas Anthony) Alan V. Oppenheimer. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Electrical Engineering and Computer Science. Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2007. This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections. Includes bibliographical references (p. 63-64). Rate-conversion systems are used in an array of applications, including the oversampled audio and video CODECs often found in entertainment and communications systems. It is common practice for many such systems to sample signals at rates which are much faster than the minimum required to represent some bandwidth of interest, and high-quality filters are often implemented at this fast rate. Therefore, their designs tend to be computationally expensive. A number of structures have been proposed to address this, including polyphase implementations and folded structures for linear-phase FIR filters. In this thesis, techniques which combine benefits from both classes of structures are discussed, and an efficient class of structures is proposed. The Generalized Transposition Theorem is also reviewed to demonstrate that an efficient downsampling structure also implies an equally efficient, closely-related upsampling structure. Techniques are investigated for designing minimum multiply filters for the class of structures presented, and methods are discussed for designing filters that, for a given set of frequency domain filter specifications, often require fewer multipliers and have smaller maximum error than Parks-McClellan designs. by Thomas A. Baran. S.M. 2007-08-29T19:06:43Z 2007-08-29T19:06:43Z 2007 2007 Thesis http://hdl.handle.net/1721.1/38531 163947349 eng M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582 64 p. application/pdf Massachusetts Institute of Technology |
collection |
NDLTD |
language |
English |
format |
Others
|
sources |
NDLTD |
topic |
Electrical Engineering and Computer Science. |
spellingShingle |
Electrical Engineering and Computer Science. Baran, Thomas A. (Thomas Anthony) Design and implementation of discrete-time filters for efficient sampling rate conversion |
description |
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2007. === This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections. === Includes bibliographical references (p. 63-64). === Rate-conversion systems are used in an array of applications, including the oversampled audio and video CODECs often found in entertainment and communications systems. It is common practice for many such systems to sample signals at rates which are much faster than the minimum required to represent some bandwidth of interest, and high-quality filters are often implemented at this fast rate. Therefore, their designs tend to be computationally expensive. A number of structures have been proposed to address this, including polyphase implementations and folded structures for linear-phase FIR filters. In this thesis, techniques which combine benefits from both classes of structures are discussed, and an efficient class of structures is proposed. The Generalized Transposition Theorem is also reviewed to demonstrate that an efficient downsampling structure also implies an equally efficient, closely-related upsampling structure. Techniques are investigated for designing minimum multiply filters for the class of structures presented, and methods are discussed for designing filters that, for a given set of frequency domain filter specifications, often require fewer multipliers and have smaller maximum error than Parks-McClellan designs. === by Thomas A. Baran. === S.M. |
author2 |
Alan V. Oppenheimer. |
author_facet |
Alan V. Oppenheimer. Baran, Thomas A. (Thomas Anthony) |
author |
Baran, Thomas A. (Thomas Anthony) |
author_sort |
Baran, Thomas A. (Thomas Anthony) |
title |
Design and implementation of discrete-time filters for efficient sampling rate conversion |
title_short |
Design and implementation of discrete-time filters for efficient sampling rate conversion |
title_full |
Design and implementation of discrete-time filters for efficient sampling rate conversion |
title_fullStr |
Design and implementation of discrete-time filters for efficient sampling rate conversion |
title_full_unstemmed |
Design and implementation of discrete-time filters for efficient sampling rate conversion |
title_sort |
design and implementation of discrete-time filters for efficient sampling rate conversion |
publisher |
Massachusetts Institute of Technology |
publishDate |
2007 |
url |
http://hdl.handle.net/1721.1/38531 |
work_keys_str_mv |
AT baranthomasathomasanthony designandimplementationofdiscretetimefiltersforefficientsamplingrateconversion |
_version_ |
1719029438201462784 |