Abstract
The splitted generalized LeRoux-Gueguen algorithm performs a least-squares estimate of autoregressive parameters. Due to its lattice structure and finite memory length it seems to be well suited to fixed-point arithmetic implementation. In the present paper the effect of round-off errors caused by such implementation is studied. This is done by computer simulation of the fixed-point implementation with varying wordlengths for characteristic quantities and comparison with a floating-point implementation as a reference. Input signals are determined by pole trajectories of the transfer functions of their autoregressive model filters. Comparison between the two implementations is carried out by a likelihood ratio. The simulation results lead to empirical guidelines for the choice of wordlengths.
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.
