Enumeration encoding and decoding algorithms for pyramid cubic lattice and trellis codes

作     者：Fischer, TR Pan, JP 

作者机构：ROCKWELL TELECOMMUNWIRELESS SYSTNEWPORT BEACHCA 92658 

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

年 卷 期：1995年第41卷第6期

页      面：2056-2061页

核心收录：

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

基　　金：National Science Foundation  NSF  (CDA-9121675  MIP-9116683  NCR-9303868) 

主　　题：quantization trellis code lattice 

摘      要：A pyramid source code is a code that assigns equal-length binary strings to all reproduction codevectors of equal (weighted) ii norm. A pyramid source encoding is partitioned into two concatenated mappings;the first from source word to reproduction codeword within a codebook;the second from the reproduction codevector to a binary string, The first mapping allows distortion and is accomplished using lattice quantization or trellis-coded quantization. The second mapping is noiseless and is denoted as enumeration. Efficient pyramid enumeration encoding and decoding algorithms are presented, for use with fixed-rate or variable-rate pyramid lattice and trellis codes.