A LINEAR ALGEBRA APPROACH TO MINIMAL CONVOLUTIONAL ENCODERS
文献类型：期刊论文
| 作者 | JOHANNESSON, R; WAN, ZX |
| 刊名 | IEEE TRANSACTIONS ON INFORMATION THEORY
 |
| 出版日期 | 1993-07-01 |
| 卷号 | 39期号:4页码:1219-1233 |
| 关键词 | CONVOLUTIONAL CODE BASIC ENCODING MATRIX MINIMAL-BASIC ENCODING MATRIX MINIMAL ENCODING MATRIX MINIMAL ENCODER |
| ISSN号 | 0018-9448 |
| 英文摘要 | This semitutorial paper starts with a review of some of Forney's contributions on the algebraic structure of convolutional encoders on which some new results on minimal convolutional encoders rest. An example is given of a basic convolutional encoding matrix whose number of abstract states is minimal over all equivalent encoding matrices. However, this encoding matrix can be realized with a minimal number of memory elements neither in controller canonical form nor in observer canonical form. Thus, this encoding matrix is not minimal according to Forney's definition of a minimal encoder. To resolve this difficulty, the following three minimality criteria are introduced: minimal-basic encoding matrix (minimal overall constraint length over equivalent basic encoding matrices), minimal encoding matrix (minimal number of abstract states over equivalent encoding matrices), and minimal encoder (realization of a minimal encoding matrix with a minimal number of memory elements over all realizations). Among other results, it is shown that all minimal-basic encoding matrices are minimal, but that there exist (basic) minimal encoding matrices that are not minimal-basic! Several equivalent conditions are given for an encoding matrix to be minimal. It is also proven that the constraint lengths of two equivalent minimal-basic encoding matrices are equal one by one up to a rearrangement. All results are proven using only elementary linear algebra. Most important among the new results are a simple minimality test, the surprising fact that there exist basic encoding matrices that are minimal but not minimal-basic, the existence of basic encoding matrices that are nonminimal, and a recent result, due to Forney, that states exactly when a basic encoding matrix is minimal. |
| WOS研究方向 | Computer Science ; Engineering |
| 语种 | 英语 |
| WOS记录号 | WOS:A1993MG07500010 |
| 出版者 | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/27568]  |
| 专题 | 中国科学院数学与系统科学研究院 |
| 通讯作者 | JOHANNESSON, R |
| 作者单位 | CHINESE ACAD SCI,INST SYST SCI,BEIJING 100080,PEOPLES R CHINA |
| 推荐引用方式 GB/T 7714 | JOHANNESSON, R,WAN, ZX. A LINEAR ALGEBRA APPROACH TO MINIMAL CONVOLUTIONAL ENCODERS[J]. IEEE TRANSACTIONS ON INFORMATION THEORY,1993,39(4):1219-1233. |
| APA | JOHANNESSON, R,&WAN, ZX.(1993).A LINEAR ALGEBRA APPROACH TO MINIMAL CONVOLUTIONAL ENCODERS.IEEE TRANSACTIONS ON INFORMATION THEORY,39(4),1219-1233. |
| MLA | JOHANNESSON, R,et al."A LINEAR ALGEBRA APPROACH TO MINIMAL CONVOLUTIONAL ENCODERS".IEEE TRANSACTIONS ON INFORMATION THEORY 39.4(1993):1219-1233. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。