Probabilistic capacity and optimal coding for asynchronous channel

被引:8
作者
Cai, Ning [1 ]
Ho, Siu-Wai [2 ]
Yeung, Raymond W. [3 ]
机构
[1] Xidian Univ, State Key Lab ISN, Xian 710071, Shaanxi, Peoples R China
[2] Princeton Univ, Dept Elect Engn, Princeton, NJ 08544 USA
[3] Chinese Univ Hong Kong, Dept Informat Engn, Shatin, Hong Kong, Peoples R China
来源
2007 IEEE INFORMATION THEORY WORKSHOP, VOLS 1 AND 2 | 2007年
关键词
D O I
10.1109/ITW.2007.4313049
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The continuous-time asynchronous channel as a model for time jitter in a communication system with no common clock between the transmitter and the receiver was introduced in [1]. The paper unveiled that it is not necessary for the receiver clock to re-synchronize with the transmitter clock within a fixed maximum time in order to achieve reliable communication. In this paper, the runlength limited code is shown not to be optimal for this channel model. An upper bound on the rate loss is given for the constraint that the transmitter and receiver clocks cannot be out of synchronization for a fixed maximum time. The probabilistic capacity of the asynchronous channel is determined and the result is used to design an optimal code. The relation between coding in constrained channels and random number generation is also discussed.
引用
收藏
页码:54 / +
页数:2
相关论文
共 9 条
[1]  
ALDER RL, 1983, IEEE T, V29, P5
[2]  
[Anonymous], P 2002 IEEE INT S IN
[3]   SIMPLE PROOFS OF SOME THEOREMS ON NOISELESS CHANNELS [J].
CSISZAR .
INFORMATION AND CONTROL, 1969, 14 (03) :285-&
[4]  
ELIAS P, 1975, IEEE T INFORM THEORY, V21, P194, DOI 10.1109/TIT.1975.1055349
[5]  
Han TS, 1997, IEEE T INFORM THEORY, V43, P599, DOI 10.1109/18.556116
[6]   Codes for digital recorders [J].
Immink, KAS ;
Siegel, PH ;
Wolf, JK .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (06) :2260-2299
[7]  
IMMINK KAS, 1999, CODES MASS DATA STOR
[8]   A MATHEMATICAL THEORY OF COMMUNICATION [J].
SHANNON, CE .
BELL SYSTEM TECHNICAL JOURNAL, 1948, 27 (03) :379-423
[9]  
YEUNG RW, UNPUB IEEE T INFORM