Channel-matched hierarchical table-lookup vector quantization

作     者：Jafarkhani, H Farvardin, N 

作者机构：AT&T Labs Res Red Bank NJ 07701 USA Univ Maryland Dept Elect Engn College Pk MD 20742 USA Univ Maryland Syst Res Inst College Pk MD 20742 USA 

出 版 物：《IEEE TRANSACTIONS ON INFORMATION THEORY》 (IEEE Trans. Inf. Theory)

年 卷 期：2000年第46卷第3期

页      面：1121-1125页

核心收录：

学科分类：0808[工学-电气工程] 08[工学] 0701[理学-数学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：National Institute of Standards and Technology, NIST, (70NANBSH0051) Army Research Laboratory, ARL, (DAAL01-96-2-0002) 

主　　题：channel-matched vector quantization table-lookup vector quantization transcoding 

摘      要：In this correspondence, we propose a channel-matched hierarchical table-lookup vector quantizer for a discrete memoryless channel. We show that this scheme simultaneously pro,ides low encoding complexity and robustness against transmission noise. Additionally, we propose the use of lookup tables for transcoding in heterogeneous networks. We show, through an example motivated by an application in multicasting, that the proposed table-lookup transcoding approach is an elegant alternative to the expensive and delay-introducing method of transcoding achieved by decoding and re-encoding.