Signal processing algorithms in piecewise polynomial bases

This thesis describes a development of Haar and Harmut``s fast transformation algorithm for the calculation of coefficients both piecewise-linear and piecewise-quadratic bases factors in digital signal processing (DSP). In the thesis, the fundamentals introduced reasons, which involve attention of expert to Haar and Harmut``s bases: 1. Reduction number of the factors necessary for approximation (with the set accuracy) in relation to the general number of binary pieces. 2. Absence of ``long`` operations in expression (1.3.4.). Operations of addition, subtraction and shift are used only. In the thesis, the results of the comparative analysis of possibilities piecewise-polynomial local bases on three parameters are shown: by quantity of indispensable operations, by efficiency of compression of the information and by error. Finally proposed achievement the advantages of piecewise-quadratic bases: greater accuracy and good smoothness of approximation in comparison with piecewise-constant and piecewise-linear bases.
Advisors
Lee, Sang-Gugresearcher이상국researcher
Publisher
한국정보통신대학교
Issue Date
2008
Identifier
393013/225023 / 020064633
Language
eng
Description

학위논문(석사) - 한국정보통신대학교 : 공학부, 2008.8, [ 84 p. ]

URI
http://hdl.handle.net/10203/55015
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=393013&flag=t
Appears in Collection
School of Engineering-Theses_Master(공학부 석사논문)
Files in This Item
There are no files associated with this item.
  • Hit : 108
  • Download : 0
  • Cited 0 times in thomson ci

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0