.png){kind=icon}
Return
A robust initialization scheme for the Remez exchange algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2002.806701.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A well-known least squares optimum approximation method is proposed as an efficient initialization scheme for the Remez exchange algorithm. More specifically, we theoretically demonstrate that the don't care least squares optimum solution guarantees, inside the bands of interest, the correct number of alternating in-sign extrema of the error function, thus satisfying one of the two basic conditions that are sufficient for obtaining the L. optimum solution. Although convergence of Remez is theoretically assured, its practical implementations may fail to converge in difficult design problems when classical initialization is used. In particular, Matlab's realization of Remez,,when initialized with the proposed scheme, exhibits a significantly better overall performance that translates into faster convergence and more robust behavior, especially in difficult designs problems.
Keywords:
alternation theorem
don't care filter design method
FIR filter design theory
min-max approximations
Remez exchange algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.6
Papers:
1.1W
Citations:
1.7W
Organization
No organization information available
Cited Papers
ShareSaveFIR DIGITAL-FILTER DESIGN TECHNIQUES USING WEIGHTED CHEBYSHEV APPROXIMATION.png)
PROCEEDINGS OF THE IEEE
PROCEEDINGS OF THE IEEEIF25.9
PREAI
ShareSaveShareSaveShareSaveTransfer of the Cupulate-Flowered Arabis microsperma and A. tricornuta to Pennellia (Brassicaceae)Novon
OAAI
NovonIF0
OAAIShareSave
View more