A. Lapidoth and P. Narayan. Reliable communication under channel uncertainty. IEEE Transactions on Information Theory, 44(6):2148--2177, 1998.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....both know the statistics of the channel. An important aspect of our assumption is that we do not assume feedback to the transmitter. In particular, this rules out power control. Note that there can also be the case where there is no knowledge of the statistics of the channel. Lapidoth and Narayan [16] give a comprehensive treatment of such channels and Biglieri et al. 3] give a detailed survey of capacity related results on fading channels. Broadband channels are a special case of channels with a large number of degrees of freedom. In a seminal work Gallager [9] discussed energy limited ....

A. Lapidoth and P. Narayan, \Reliable communication under channel uncertainty," IEEE Trans. on Information Theory, vol. IT-44, pp. 2148-2177, Dec 1997.

.... one should avoid making a priori assumptions about the embedding and decoding functions, analogously to Shannon s analysis of the fundamental limits of communication systems [16] and one may want to assume an intelligent opponent, as is done in some game theoretic analyses of jamming systems [17, 18]. The goal of this paper is to develop estimates of data hiding capacity, or maximum rates of reliable transmission, for host image sources. To this end, we use several recent theoretical results, which are not yet well known in the data hiding and image watermarking communities, and are ....

....consider restricted classes of attack channels which include many attack channels used in practice. Developing a capacity analysis for the broadest possible class of attack channels is still an open problem, analogous to the study of arbitrarily varying channels in classical communication problems [21, 22, 18]. Capacity can be zero in some cases [20, 21, 22, 18] In Secs. 4 7, we first consider memoryless, time invariant attack channels of the form AN(YNIxN ) N = Ii= A(yi[xi) Such attack channels include addition of i.i.d. noise (in case X is a field) erasures, and JPEG like 2 attacks (in case X ....

[Article contains additional citation context not shown here]

A. Lapidoth and P. Narayan, "Reliable Communication Under Channel Uncertainty," IEEE Trans. Info. Thy, Vol. 44, No. 6, pp. 2148--2177, Oct. 1998.

....occurring in practical applications, have been analyzed in [16] 21] All the previous results assume that perfect channel state information is known at the receiver. Some results, however, exist even when the channel state information is estimated with error: see for example [26] 27] [28] and references therein. The notion of ergodic capacity applies to fiat fading channels where the transmis sion time is much longer that the coherence time of the channel, i.e. the fading process can reflect its ergodic nature during the transmission. In the case where no significant variations ....

A. Lapidoth and P. Narayan, "Reliable communication under channel uncertain- ity," IEEE Trans. on Inform. Theory, pp. 2148 2177, Oct. 1998.

....the data link layer and the network layer. We are not interested in the physical layer. It su#ces to say that on one hand there exists the possibility of denial of service attacks by signal jamming, on the other there are such well known counter measures as spreadspectrum and frequency hopping [29]. We also do not consider the transport layer. The reasoning goes like this: if the data link layer and network layer are secure, then the transport layer can be sure that the packets it receives from the network layer are confidential, authenticated and original. What is left for the transport ....

A. Lapidoth and P. Narayan. Reliable communication under channel uncertainty. IEEE Transactions on Information Theory, 44(6), 1998.

.... one should avoid making a priori assumptions about the embedding and decoding functions, analogously to Shannon s analysis of the fundamental limits of communication systems [44] and one may want to assume an intelligent opponent, as is done in some game theoretic analyses of jamming systems 2 [2, 25]. The goal of this paper is to develop estimates of data hiding capacity, or maximum rates of reliable transmission, for host image sources. To this end, we use several recent theoretical results, which are not yet well known in the data hiding and image watermarking communities, and are ....

....consider restricted classes of attack channels which include many attack channels used in practice. Developing a capacity analysis for the broadest possible class of attack channels is still an open problem, analogous to the study of arbitrarily varying channels in classical communication problems [11, 18, 25]. Capacity can be zero in some cases [7, 11, 18, 25] In Secs. 4 7, we first consider memoryless, time invariant attack channels of the form A N (y N x N ) # N i=1 A(y i x i ) Such attack channels include addition of i.i.d. noise (in case S is a field) erasures, and JPEG like ....

[Article contains additional citation context not shown here]

A. Lapidoth and P. Narayan, "Reliable Communication Under Channel Uncertainty," IEEE Trans. Info. Thy, Vol. 44, No. 6, pp. 2148---2177, Oct. 1998.

.... [64] 94] 114] 122] 223] 225] 267] for some recent developments) Neither the treatment of statistical time varying channels is new in information theory, and in fact by now this topic is considered as classic [64] with Shannon himself contributing to some of its aspects [261] see [164] for a recent tutorial exposition, and references therein) Fading phenomena were also carefully studied by informationtheoretic tools for a long time. However, it is only relatively recently that information theoretic study of increasingly complicated fading channel models, under a variety of ....

....to be described in Section V, as an inherent part of this paper. The precise statistical information on the behavior of is not always available. This gives rise to the use of mismatched metrics and universal decoders [64] and makes classical notions of compound and arbitrarily variable channels [164], along with the large body of associated results, relevant to our setting. Central notions as random versus deterministic code books and maximum versus average error probabilities emerge naturally [164] With the above discussion we hope to have made clear that the scope of ....

[Article contains additional citation context not shown here]

A. Lapidoth and P. Narayan,"Reliable communication under channel uncertainty," this issue, pp. 2148--2177.

....multiple users employing short repeating spreading codes. Each user can potentially have a di#erent spreading gain and or a # A single user analysis can be found in [43] for block fading channels. Optimal schemes do not rely on channel estimation but lead to computationally intractable schemes [63]. 48 di#erent chipping rate. A user is characterized by its spreading gain N k , chip period T c k , symbol period T k = N k T c k , spreading code c k [l] N k 1 l=0 with c k [l] # 1, 1 and bandlimited chip waveform # k (t) The spreading waveform for user k is then given by s k (t) ....

A. Lapidoth and P. Narayan, "Reliable communication under channel uncertainty, " IEEE Transactions on Information Theory, vol. 44, no. 6, pp. 2148-- 2177, Oct 1998.

....decreases to zero. Telatar and Tse[3] consider specular multipath channels with time varying delays of the various multipath components, in the case of no intersymbol interference. Note that there can also be the case where there is no knowledge of the statistics of the channel. Lapidoth, et al. [16] give an extensive treatment of such channels. 4. CAPACITY CALCULATIONS We consider using the WSSUS fading channel in blocks of time T 0 units long where T 0 T T coherence Tmax with T being the duration of the input signal. We also assume that u(t) 0 if t T . Assuming that we code ....

A. Lapidoth, P. Narayan, and M. S. Pinsker, "Reliable communication under channel uncertainty," preprint, Dec 1997.

....tends to zero as the spread factor tends to infinity. Thus, even for some non Gaussian channels, DS CDMA signals fail to measure the channel accurately enough for good performance. Note that there can also be the case where there is no knowledge of the statistics of the channel. Lapidoth et al. [18] give a comprehensive treatment of such channels. 1.2 Summary of Results One of the main goals of this thesis is to understand how to achieve the capacity of a WSSUS fading channel. A central theme to the thesis is that burstiness in time frequency is necessarily needed in order to achieve ....

A. Lapidoth, P. Narayan, and M. S. Pinsker, "Reliable communication under channel uncertainty," preprint, Dec 1997.

....both know the statistics of the channel. An important aspect of our assumption is that we do not assume feedback to the transmitter. In particular, this rules out power control. Note that there can also be the case where there is no knowledge of the statistics of the channel. Lapidoth and Narayan [14] give a comprehensive treatment of such channels and Bigleri et al. 3] give a detailed survey of capacity related results on fading channels. Broadband channels are a special case of channels with a large number of degrees of freedom. In a seminal work Gallager [8] discussed energy limited ....

A. Lapidoth and P. Narayan, \Reliable communication under channel uncertainty," IEEE Trans. on Information Theory, vol. IT-44, pp. 2148-2177, Dec 1997.

....of complex AWGN and A is an unknown complex channel coefficient. All vectors are of size N Theta 1 where N is the duration over which the channel is assumed constant, known as the coherence interval. The philosophy of the GLRT is as follows (The theory of the GLRT has been studied before in [6] [7], as also its application to multi user detection in [8] An estimate of the transmitted signal is derived as the candidate from the constellation that is closest to the received signal among all signals and under all possible channel states. Mathematically, the GLRT gives the following estimate ....

A. Lapidoth and P. Narayan, "Reliable Communication under Channel Uncertainty," IEEE Trans. on Inf. Theory,vol. 44, no. 6, pp.2148-2177, October 1998.

....choice for A # A(D 1 , D 2 , # 2 u ) See Section 3.4 for further discussion on this di#erence. Also note that the mutual information games introduced here are somewhat di#erent from the classical information theoretic games corresponding to communication in the presence of an unknown jammer [29] or the lossless encoding of an unknown source [30] While all these games can be viewed as two player zero sum games (encoder vs. attacker, communicator vs. jammer, and compressor vs. nature) the watermarking games are dynamic, whereas the latter two games are static. Thus, in the latter two ....

....technique that shows the existence of a good codebook, but a defining feature of the encoding. For example, the randomization at the encoder prevents the attacker from knowing the particular mapping used for each message; the attacker only knows the strategy used for generating the codewords. See [29] for more on this subject. Nevertheless, in the private version of the i.i.d. Gaussian watermarking game, common randomness is not needed between the encoder and the decoder and deterministic codes su#ce. Indeed, part of the covertext, to which both the encoder and the decoder have access, can be ....

A. Lapidoth and P. Narayan, "Reliable communication under channel uncertainty," IEEE Trans. Inform. Theory, vol. 44, pp. 2148--2177, Oct. 1998.

No context found.

A. Lapidoth and P. Narayan. Reliable communication under channel uncertainty. IEEE Transactions on Information Theory, 44(6):2148--2177, 1998.

No context found.

Lapidoth, A. and Narayan, P. "Reliable Communication under Channel Uncertainty," (Special Commemorative Issue: Information Theory:

No context found.

A. Lapidoth and P. Narayan. Reliable communication under channel uncertainty. IEEE Transactions on Information Theory, 44(6):2148--2177, 1998.

No context found.

A. Lapidoth and P. Narayan, "Reliable communication under channel uncertainty," IEEE Transactions on Information Theory, vol. 44, no. 6, pp. 2148-2177, Oct. 1998.

No context found.

A. Lapidoth and P. Narayan. Reliable Communication Under Channel Uncertainty. IEEE Trans. on Info. Th., 44(6):2148--2177, Oct. 1998.

No context found.

A. Lapidoth and P. Narayan, "Reliable Communication Under Channel Uncertainty," IEEE Trans. Info. Thy, Vol. 44, No. 6, pp. 2148---2177, Oct. 1998.

No context found.

A. Lapidoth and P. Narayan. Reliable Communication Under Channel Uncertainty. IEEE Trans. on Info. Th., 44(6):2148--2177, Oct. 1998.

No context found.

A. Lapidoth and P. Narayan, "Reliable communication under channel uncertainty," IEEE Transactions on Information Theory, vol. 44, pp. 2148--2177, Oct 1998.

No context found.

A. Lapidoth and E. Telatar. Reliable communication under channel uncertainty. IEEE Trans. Inform. Theory, IT-44:2148--2177, October 1998.

No context found.

A. Lapidoth and P. Narayan, "Reliable communication under channel uncertainty," IEEE Trans. Inform. Theory, vol. 44, Oct 1998.

No context found.

A. Lapidoth and P. Narayan, "Reliable communication under channel uncertainty," IEEE Trans. Inform. Theory, vol. 44, pp. 2148--2177, Oct. 1998.

No context found.

A. Lapidoth and P. Narayan. Reliable communication under channel uncertainty. IEEE Transactions on Information Theory, 44(6):2148 --2177, October 1998.

No context found.

A. Lapidoth and P. Narayan, "Reliable communication under channel uncertainty," IEEE Trans. Inform. Theory, vol. 44, pp. 2148--2177, Oct. 1998.

First 50 documents

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC