Trellis complexity versus the coding gain of lattices .1.

被引：16
|
作者：
Tarokh, V
Blake, IF
机构：
[1] UNIV ILLINOIS,COORDINATED SCI LAB,URBANA,IL 61801
[2] UNIV WATERLOO,DEPT ELECT & COMP ENGN,WATERLOO,ON N2L 3G1,CANADA
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 1996年 / 42卷 / 06期
基金：
加拿大自然科学与工程研究理事会;
关键词：
trellis complexity; coding gain; lattices; maximum-likelihood decoding;
D O I：
10.1109/18.556675
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The best possible tradeoff between the coding gain and trellis complexity for lattices is studied, Three trellis complexity functions are defined for lattices as a measure of minimum trellis decoding complexity per dimension required for achieving a coding gain gamma. The properties of these functions are studied from an analytic perspective, It is also shown that the trellis decoding complexity per dimension is lower-bounded by an explicit power of gamma.
引用
收藏
页码：1796 / 1807
页数：12
相关论文
共 50 条
12345