Abstract
The encoding process of vector quantisation is computationally very expensive. To reduce distortion computation between the input vector and candidate codewords, the well-known partial distortion search (PDS) algorithm has been proposed. To reduce further its computational cost, a new PDS algorithm is proposed by making current dmin decrease as quickly as possible. Experimental results have demonstrated the effectiveness of the proposed PDS algorithm in terms of both the computing dimensions and arithmetical operations per input vector.
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.
