Abstract

The main advantage of the fixed slope universal lossy data compression scheme over the fixed rate (fixed distortion) universal lossy data compression scheme lies in the fact that it converts the encoding problem to a search problem through a trellis and then permits one to use some sequential search algorithms to implement it. Simulation results with the kth order arithmetic codeword length function as a lossless codeword length function and the M-algorithm as a sequential search algorithm show that this fixed slope universal algorithm, combined with suitable search algorithms, might be implementable in practice.

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 call

Disclaimer: 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.