Construction of Universal Channel Codes for Finite-State Channels

有限状态信道通用信道码的构建

• 批准号: 10650351
• 负责人: UYEMATSU Tomohiko
• 金额: $ 0.96万
• 依托单位: Tokyo Institute of Technology
• 依托单位国家: 日本
• 项目类别: Grant-in-Aid for Scientific Research (C)
• 财政年份: 1998
• 资助国家: 日本
• 起止时间: 1998 至 1999
• 项目状态: 已结题
• 来源: https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-10650351/
• 关键词: finite-state channel; universal channel code; reliability function; random coding

In mobile communications, only a little can be said about the characteristics of the channel. 'This prompted many researchers to investigate codes of which encoding and decoding do not depend on a particular channel. These codes are usually referred to as universal codes. From the viewpoint of information theory, universal codes were first proposed by the Hungarian researchers Csiszar, Korner and Matron in 1977. They proved the existence of universal block codes for discrete memoryless channels (DMC's). Unfortunately, a family of DMC's is not a realistic model for mobile communications since it does not consider memory effect of the channel due to fading or intersymbol interferences. For this purpose, we have investigate a family of finite state channels (FSC's) which is the most appropriate candidate for the model of mobile communication, and obtained the following results:(1) For a family of FSC's, we prove that there exist universal block codes of which both encoding and decoding do not depend on the channel, and that the obtained universal codes asymptotically achieves Gallager's random coding error exponent.(2) We show that universal channel decoder can be constructed from any universal source encoder. Especially, for the class of DMS's and FSC's where the state is known to the receiver, we show the sufficient conditions that the universal source code can be utilized as the universal channel decoder. Further, we show that there exists a code which asymptotically achieves Gallager's random coding error exponent when the proposed universal decoder is employed.

在移动通信中，关于频道的特征只能说一点。 ``这促使许多研究人员研究了哪种编码和解码的代码不取决于特定的渠道。这些代码通常称为通用代码。从信息理论的角度来看，匈牙利研究人员CSiszar，Korner和Matron于1977年首次提出了通用代码。它们证明了存在分散无内存通道（DMC）的通用块代码。不幸的是，DMC的家族不是移动通信的现实模型，因为它不考虑由于衰落或符号间干扰而引起的通道的内存效应。 For this purpose, we have investigate a family of finite state channels (FSC's) which is the most appropriate candidate for the model of mobile communication, and obtained the following results:(1) For a family of FSC's, we prove that there exist universal block codes of which both encoding and decoding do not depend on the channel, and that the obtained universal codes asymptotically achieves Gallager's random coding error exponent.(2) We show that universal channel decoder can由任何通用源编码器构造。尤其是，对于DMS和FSC的类别中，该州已知接收器已知，我们表明了可以将通用源代码用作通用通道解码器的足够条件。此外，我们表明存在一个代码，该代码在采用了拟议的通用解码器时渐近地实现Gallager的随机编码错误指数。

项目成果

T. Uyemats and S. Kisra: "Universal Channel Decoder Can Be Constructed form Any Universal Source Encoder"IEICE Tech. Report on Information Theory. vol. 99 (to be printed). (2000)

T. Uyemats 和 S. Kisra：“可以从任何通用源编码器构建通用通道解码器”IEICE Tech。

S. Kisra and T. Uyematsu: "Universally Optimum Codes for Finite-State Channels"Proc. of 1999 IEICE General Conf.. 225 (1999)

S. Kisra 和 T. Uyematsu：“有限状态通道的通用最优代码”Proc。

T.uyematsu,S.Kisra: "Universal Channel Decoder can Be Constructed from Any Universal Encoder"電子情報通信学会 技術報告. (発表予定).

T.uyematsu、S.Kisra：“可以从任何通用编码器构建通用通道解码器”IEICE 技术报告（待提交）。

キスラサード、植松友彦: "有限状態通信路における最適なユニバーサル符号"電子情報通信学会・1999年総合大会講演論文集基礎境界. 225-225 (1999)

Kisrasad，Tomohiko Uematsu：“有限状态通道的最优通用代码”IEICE 1999 年大会论文集基本边界 225-225 (1999)。

T.Uyematsu,S.Kisra: "Universal Channel Decoder can be Constructed from Any Universal Source Encoder"電子情報通信学会 技術報告. (発表予定).

T.Uyematsu、S.Kisra：“通用通道解码器可以由任何通用源编码器构建”IEICE 技术报告（待提交）。