Approximation Algorithm of Series Expansion for Digital System Implementation
Summary :
This letter presents a new approximation algorithm suitable for Taylor series expansion. The algorithm can effectively reduce the approximation error by using only a small number of terms in series expansion. The proposed algorithm can be more easily implemented and has better performance than the conventional Euler approximation algorithm. Also, the approximation performance of the proposed algorithm is compared with direct approaches, such as least-squares and Chebyshev approximation algorithm to show the relative advantages of the proposed algorithm. This letter also presents an application example of the proposed approximation algorithm in carrier recovery of OFDM (Orthogonal Frequency Division Multiplexing) modem.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E85-A No.11 pp.2532-2537
- Publication Date
- 2002/11/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- LETTER
- Category
- Digital Signal Processing
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Ki-Yun KIM, Hyung-Jin CHOI, Ho KIM, "Approximation Algorithm of Series Expansion for Digital System Implementation" in IEICE TRANSACTIONS on Fundamentals,
vol. E85-A, no. 11, pp. 2532-2537, November 2002, doi: .
Abstract: This letter presents a new approximation algorithm suitable for Taylor series expansion. The algorithm can effectively reduce the approximation error by using only a small number of terms in series expansion. The proposed algorithm can be more easily implemented and has better performance than the conventional Euler approximation algorithm. Also, the approximation performance of the proposed algorithm is compared with direct approaches, such as least-squares and Chebyshev approximation algorithm to show the relative advantages of the proposed algorithm. This letter also presents an application example of the proposed approximation algorithm in carrier recovery of OFDM (Orthogonal Frequency Division Multiplexing) modem.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e85-a_11_2532/_p
Copy
@ARTICLE{e85-a_11_2532,
author={Ki-Yun KIM, Hyung-Jin CHOI, Ho KIM, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Approximation Algorithm of Series Expansion for Digital System Implementation},
year={2002},
volume={E85-A},
number={11},
pages={2532-2537},
abstract={This letter presents a new approximation algorithm suitable for Taylor series expansion. The algorithm can effectively reduce the approximation error by using only a small number of terms in series expansion. The proposed algorithm can be more easily implemented and has better performance than the conventional Euler approximation algorithm. Also, the approximation performance of the proposed algorithm is compared with direct approaches, such as least-squares and Chebyshev approximation algorithm to show the relative advantages of the proposed algorithm. This letter also presents an application example of the proposed approximation algorithm in carrier recovery of OFDM (Orthogonal Frequency Division Multiplexing) modem.},
keywords={},
doi={},
ISSN={},
month={November},}
Copy
TY - JOUR
TI - Approximation Algorithm of Series Expansion for Digital System Implementation
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2532
EP - 2537
AU - Ki-Yun KIM
AU - Hyung-Jin CHOI
AU - Ho KIM
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E85-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 2002
AB - This letter presents a new approximation algorithm suitable for Taylor series expansion. The algorithm can effectively reduce the approximation error by using only a small number of terms in series expansion. The proposed algorithm can be more easily implemented and has better performance than the conventional Euler approximation algorithm. Also, the approximation performance of the proposed algorithm is compared with direct approaches, such as least-squares and Chebyshev approximation algorithm to show the relative advantages of the proposed algorithm. This letter also presents an application example of the proposed approximation algorithm in carrier recovery of OFDM (Orthogonal Frequency Division Multiplexing) modem.
ER -
English
