Abstract
This article presents a highly optimized translation of the core discrete Remez multiple exchange (RME) part of the Parks-McClellan (PM) algorithm from its original FORTRAN code to its MATLAB counterpart. The optimization reduces the CPU execution time and code complexity. For achieving these goals, first, according to a thorough study of the existing FORTRAN code of the PM algorithm, the search in the core part for the “real” extremal points of the weighted error function, which is generated based on the “trial” extremal points, is compressed into only two compact basic search techniques. Secondly, vectors and matrices are used whenever possible due to many fast built-in operations in the MATLAB. Several examples are included to illustrate the superiority of the proposed MATLAB version of the PM algorithm over the existing function firpm, which is mostly based on a direct translation of the original FORTRAN code.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
