| Project/Area Number |
10650351
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
情報通信工学
|
|---|
| Research Institution | Tokyo Institute of Technology |
|---|
Principal Investigator |
UYEMATSU Tomohiko Tokyo Institute of Technology, Faculty of Engineering, Associate Professor, 工学部, 助教授 (60168656)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
SAKANIWA Kohichi Tokyo Institute of Technology, Faculty of Engineering, Professor, 工学部, 教授 (30114870)
|
|---|
| Project Period (FY) |
1998 – 1999
|
| Project Status |
Completed (Fiscal Year 1999)
|
| Budget Amount *help |
¥1,500,000 (Direct Cost: ¥1,500,000)
Fiscal Year 1999: ¥500,000 (Direct Cost: ¥500,000)
Fiscal Year 1998: ¥1,000,000 (Direct Cost: ¥1,000,000)
|
|---|
| Keywords | finite-state channel / universal channel code / reliability function / random coding |
|---|
| Research Abstract |
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.
|
