On Extrinsic Information of Good Codes Operating Over Discrete Memoryless Channels
نویسندگان
چکیده
We show that the Extrinsic Information about the coded bits of any good (capacity achieving) code operating over a wide class of discrete memoryless channels (DMC) is zero when channel capacity is below the code rate and positive constant otherwise, that is, the Extrinsic Information Transfer (EXIT) chart is a step function of channel quality, for any capacity achieving code. It follows that, for a common class of iterative receivers where the error correcting decoder must operate at first iteration at rate above capacity (such as in turbo equalization, turbo channel estimation, parallel and serial concatenated coding and the like), classical good codes which achieve capacity over the DMC are not effective and should be replaced by different new ones. Another meaning of the results is that a good code operating at rate above channel capacity falls apart into its individual transmitted symbols in the sense that all the information about a coded transmitted symbol is contained in the corresponding received symbol and no information about it can be inferred from the other received symbols. This report comprises two stand-alone parts. Part 1 treats the binary input additive white Gaussian noise channel. Part 2 extends the results to the symmetric binary channel and to the binary erasure channel and provides an heuristic extension to wider class of channel models such as common fading models combined with QPSK and other inputs which might be rigorized by further work. The authors are with the Technion-Israel Institute of Technology, Technion city, Haifa, Israel
منابع مشابه
Rate-splitting multiple access for discrete memoryless channels
It is shown that the encoding/decoding problem for any asynchronous -user discrete memoryless multiple-access channel can be reduced to corresponding problems for at most 2 1 single-user discrete memoryless channels. This result, which extends a similar result for Gaussian channels, reduces the seemingly hard task of finding good multiple-access codes to the much better understood task of findi...
متن کاملPolarization of Multi-Relay Channels: A Suitable Method for DF and CF Relaying with Orthogonal Receiver
Polar codes, that have been recently introduced by Arikan, are one of the first codes that achieved the capacity for vast numerous channels and they also have low complexity in symmetric memoryless channels. Polar codes are constructed based on a phenomenon called channel polarization. This paper discusses relay channel polarization in order to achieve the capacity and show that if inputs of tw...
متن کاملInformation Theory On extrinsic information of good binary codes operating over Gaussian channels
We show that the extrinsic information about the coded bits of any good (capacity achieving) binary code operating over a Gaussian channel is zero when the channel capacity is lower than the code rate and unity when capacity exceeds the code rate, that is, the extrinsic information transfer (EXIT) chart is a step function of the signal to noise ratio and independent of the code. It follows that...
متن کاملTime-Splitting Multiple-Access
It is shown that the encoding/decoding problem for any asynchronous M -user memoryless multiple-access channel can be reduced to corresponding problems for at most 2M 1 single-user memoryless channels. This is done via a method called time-splitting multiple-access which is closely related to a recently developed method called rate-splitting multiple access. It is also related to to multilevel ...
متن کاملState Dependent Channels: Strong Converse and Bounds on Reliability Function
We consider an information theoretic model of a communication channel with a time-varying probability law. Specifically, our model consists of a state dependent discrete memoryless channel, in which the underlying state process is independent and identically distributed with known probability distribution, and for which the channel output at any time instant depends on the inputs and states onl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/cs/0504028 شماره
صفحات -
تاریخ انتشار 2005