Constructions of rate (n - 1)/n punctured convolutional codes with minimum required SNR criterion.

被引：0

作者：

Lee, Pil J. ^{[1
]}

机构：

[1] Bell Communications Research,, Morristown, NJ, USA

来源：

IEEE Transactions on Communications | 1988年 / 36卷 / 10期

关键词：

CONVOLUTIONAL CODING - DEEP-SPACE COMMUNICATIONS - PUNCTURED CONVOLUTIONAL CODES - SNR MINIMIZATION;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

页码：1171 / 1174

共 50 条

[1] CONSTRUCTIONS OF RATE (N-1)/N PUNCTURED CONVOLUTIONAL-CODES WITH MINIMUM REQUIRED SNR CRITERION
LEE, PJ
[J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 1988, 36 (10) : 1171 - 1174
[2] FURTHER RESULTS ON RATE 1/N CONVOLUTIONAL CODE CONSTRUCTIONS WITH MINIMUM REQUIRED SNR CRITERION.
Lee, Pil Joong
[J]. IEEE Transactions on Communications, 1986, COM-34 (04): : 395 - 399
[3] FURTHER RESULTS ON RATE 1/N CONVOLUTIONAL CODE CONSTRUCTIONS WITH MINIMUM REQUIRED SNR CRITERION
LEE, PJ
[J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 1986, 34 (04) : 395 - 399
[4] PUNCTURED CONVOLUTIONAL CODES OF RATE (N-1)-N AND SIMPLIFIED MAXIMUM LIKELIHOOD DECODING
CAIN, JB
CLARK, GC
GEIST, JM
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1979, 25 (01) : 97 - 100
[5] On (n, n-1) Punctured Convolutional Codes and Their Trellis Modules
Katsiotis, Alexandros
Kalouptsidis, Nicholas
[J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2011, 59 (05) : 1213 - 1217
[6] STRUCTURE OF RATE 1/N CONVOLUTIONAL CODES
BAHL, L
JELINEK, F
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1972, 18 (01) : 192 - +
[7] Recognition of (n,k,m) convolutional codes based on maximum and minimum criterion
Zhong Z.
Liu J.
Zhang L.
[J]. Xi Tong Gong Cheng Yu Dian Zi Ji Shu/Systems Engineering and Electronics, 2019, 41 (05): : 1133 - 1142
[8] An algorithm for identifying rate (n-1)/n catastrophic punctured convolutional encoders
Sun, FW
Vinck, AJ
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (03) : 1010 - 1013
[9] AN ALGORITHM FOR DETERMINING IF A RATE (N-1)/N PUNCTURED CONVOLUTIONAL ENCODER IS CATASTROPHIC
HOLE, KJ
[J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 1991, 39 (03) : 386 - 389
[10] Tight bounds on the minimum average weight per branch for rate (N-1)/N convolutional codes
Hole, MF
Hole, KJ
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1997, 43 (04) : 1301 - 1305

← 1 2 3 4 5 →