FFT-Based Implementation of Sampling Rate Conversion with a Small Number of Delays

Xiaoxia ZOU; Shogo MURAMATSU; Hitoshi KIYA

FFT-Based Implementation of Sampling Rate Conversion with a Small Number of Delays

Xiaoxia ZOU, Shogo MURAMATSU, Hitoshi KIYA

Full Text Views

0

Cite this

Summary :

Block delay caused by using fast Fourier transform (FFT), and computational complexity in sampling rate conversion system are considered in this paper. The relationship between the number of block delays and the computational complexity is investigated. The proposed method can avoid the redundant operations of sampling rate conversion completely and moreover provide a good trade-off between the number of block delays and the computational complexity. As a result, ti is shown that with the proposed method, the sampling rate conversion can be realized more efficiently under a small number of block delays.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E80-A No.8 pp.1367-1375

Publication Date: 1997/08/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Section on Digital Signal Processing)

Category

Cite this

Copy

Xiaoxia ZOU, Shogo MURAMATSU, Hitoshi KIYA, "FFT-Based Implementation of Sampling Rate Conversion with a Small Number of Delays" in IEICE TRANSACTIONS on Fundamentals, vol. E80-A, no. 8, pp. 1367-1375, August 1997, doi: .
Abstract: Block delay caused by using fast Fourier transform (FFT), and computational complexity in sampling rate conversion system are considered in this paper. The relationship between the number of block delays and the computational complexity is investigated. The proposed method can avoid the redundant operations of sampling rate conversion completely and moreover provide a good trade-off between the number of block delays and the computational complexity. As a result, ti is shown that with the proposed method, the sampling rate conversion can be realized more efficiently under a small number of block delays.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e80-a_8_1367/_p

Copy

@ARTICLE{e80-a_8_1367,
author={Xiaoxia ZOU, Shogo MURAMATSU, Hitoshi KIYA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={FFT-Based Implementation of Sampling Rate Conversion with a Small Number of Delays},
year={1997},
volume={E80-A},
number={8},
pages={1367-1375},
abstract={Block delay caused by using fast Fourier transform (FFT), and computational complexity in sampling rate conversion system are considered in this paper. The relationship between the number of block delays and the computational complexity is investigated. The proposed method can avoid the redundant operations of sampling rate conversion completely and moreover provide a good trade-off between the number of block delays and the computational complexity. As a result, ti is shown that with the proposed method, the sampling rate conversion can be realized more efficiently under a small number of block delays.},
keywords={},
doi={},
ISSN={},
month={August},}

Copy

TY - JOUR
TI - FFT-Based Implementation of Sampling Rate Conversion with a Small Number of Delays
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1367
EP - 1375
AU - Xiaoxia ZOU
AU - Shogo MURAMATSU
AU - Hitoshi KIYA
PY - 1997
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E80-A
IS - 8
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - August 1997
AB - Block delay caused by using fast Fourier transform (FFT), and computational complexity in sampling rate conversion system are considered in this paper. The relationship between the number of block delays and the computational complexity is investigated. The proposed method can avoid the redundant operations of sampling rate conversion completely and moreover provide a good trade-off between the number of block delays and the computational complexity. As a result, ti is shown that with the proposed method, the sampling rate conversion can be realized more efficiently under a small number of block delays.
ER -