Linear (zero–one) programming approach to fixed-rate entropy-coded vector quantisation | Zendy

Amir K. Khandani | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Linear (zero–one) programming approach to fixed-rate entropy-coded vector quantisation

Author(s) -

Amir K. Khandani

Publication year - 1999

Publication title -

iee proceedings - communications

Language(s) - English

Resource type - Journals

eISSN - 1359-7019

pISSN - 1350-2425

DOI - 10.1049/ip-com:19990133

Subject(s) - decoding methods , mathematics , algorithm , linear programming , computational complexity theory , entropy (arrow of time) , mathematical optimization , reduction (mathematics) , zero (linguistics) , gaussian , discrete mathematics , linguistics , philosophy , physics , geometry , quantum mechanics

The problem of the decoding of a shaped set is formulated in terms of a zero-one linearprogram. Some special features of the problem are exploited to relax the zero-one constraint, and tosubstantially reduce the complexity of the mderlying simplex search. The proposed decoding methodhas applications in txed-rate entropy-coded vector quantisation of a memoryless source, in decodingof a shaped constellation, and in the bit allocation problem. The first application is considered andnumerical...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research