检索结果-内蒙古大学图书馆

Outage Behavior of Discrete Memoryless Channels Under Channel Estimation Errors

IEEE TRANSACTIONS ON INFORMATION THEORY 2009年第9期55卷 4221-4239页

作者： Piantanida, Pablo Matz, Gerald Duhamel, Pierre SUPELEC Dept Telecommun F-91192 Gif Sur Yvette France Vienna Univ Technol Inst Commun & Radio Frequency Engn A-1010 Vienna Austria SUPELEC Signaux & Syst Lab CNRS F-91192 Gif Sur Yvette France

Communication systems are usually designed by assuming perfect channel state information (CSI). However, in many practical scenarios, only a noisy estimate of the channel is available, which may strongly differ from the true channel. This imperfect CSI scenario is addressed by introducing the notion of estimation-induced outage (EIO). We derive a single-letter characterization of the maximal EIO rate and prove an associated coding theorem and its strong converse for discrete memoryless channels (DMCs). The transmitter and the receiver rely on the channel estimate and the statistics of the estimate to construct codes that guarantee reliable communication with a certain outage probability. This ensures that in the non-outage case the transmission meets the target rate with small error probability, irrespective of the quality of the channel estimate. Applications of the EIO capacity to a single-antenna (nonergodic) Ricean fading channel are considered. The EIO capacity for this case is compared to the EIO rates of a communication system in which the receiver decodes by using a mismatched maximum-likelihood (ML) decoder. The effects of rate-limited feedback to provide the transmitter with quantized CSI are also investigated.

关键词： Channel estimation channel uncertainty coding theorem compound channel fading channel feedback mismatch decoding outage capacity quality-of-service quantized CSI side information

来源：评论

学校读者我要写书评

暂无评论

Rate-distortion theory for the Shannon cipher system

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 1997年第3期43卷 827-835页

作者： Yamamoto, H Department of Mathematical Engineering and Information Physics Faculty of Engineering University of Tokyo Bunkyo Tokyo Japan

Rate-distortion theory is considered for the Shannon cipher system (SCS), The admissible region of cryptogram rate R, key rate R-k, legitimate receiver's distortion D, and wiretapper's uncertainty h is determined for the SCS with a noisy channel, Furthermore, inner and outer bounds of the admissible region of R, R-k, D, and wiretapper's attainable minimum distortion (D) over tilde are derived for the SCS with a finite discrete source and a noiseless channel.

关键词： rate-distortion theory Shannon cipher system wiretap channel broadcast channel coding theorem

来源：评论

学校读者我要写书评

暂无评论

Quantum channel capacities

引用

QUANTUM ELECTRONICS 2020年第5期50卷 440-446页

作者： Holevo, A. S. Russian Acad Sci Steklov Math Inst Ul Gubkina 8 Moscow 119991 Russia

A brief general review is presented of the theory of information transmission capacities of quantum communication channels, which is a development of the classical Shannon theory. Unlike a classical communication channel, a quantum channel is characterised by a whole set of different capacities, which depend on the type of transmitted information (classical or quantum) and on additional resources used during transmission. The main characteristics of a quantum channel are considered: classical capacity, capacity assisted by entanglement between the channel input and output, quantum capacity and secret classical capacity. The unique role of the quantum entanglement property, which manifests itself, in particular, in a nonclassical phenomenon of capacity superadditivity, is emphasised.

关键词： quantum information theory quantum communication channel coding theorem capacity entanglement superadditivity

来源：评论

学校读者我要写书评

暂无评论

coding for interactive communication

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 1996年第6期42卷 1745-1756页

作者： Schulman, LJ UNIV CALIF BERKELEY DIV COMP SCI BERKELEY CA 94720 USA

Let the input to a computation problem be split between two processors connected by a communication link;and let an interactive protocol pi be known by which, on any input, the processors can solve the problem using no more than T transmissions of bits between them, provided the channel is noiseless in each direction, We study the following question: If in fact the channel is noisy, what is the effect upon the number of transmissions needed in order to solve the computation problem reliably? Technologically this concern is motivated by the increasing importance of communication as a resource in computing, and by the tradeoff in communications equipment between bandwidth, reliability, and expense. We treat a model with random channel noise. We describe a deterministic method for simulating noiseless-channel protocols on noisy channels, with only a constant slowdown. This is an analog for general interactive protocols of Shannon's coding theorem, which deals only with data transmission, i.e., one-way protocols. We cannot use Shannon's block coding method because the bits exchanged in the protocol are determined only one at a time, dynamically, in the course of the interaction, Instead, we describe a simulation protocol using a new kind of code, explicit tree codes.

关键词： interactive communication coding theorem tree code distributed computing reliable communication error correction

来源：评论

学校读者我要写书评

暂无评论

Efficient coding for Interactive Communication

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2014年第3期60卷 1899-1913页

作者： Gelles, Ran Moitra, Ankur Sahai, Amit Univ Calif Los Angeles Dept Comp Sci Los Angeles CA 90095 USA MIT Dept Math Cambridge MA 02139 USA MIT CSAIL Cambridge MA 02139 USA

We revisit the problem of reliable interactive communication over a noisy channel and obtain the first fully (randomized) efficient constant-rate emulation procedure for reliable interactive communication. Our protocol works for any discrete memoryless noisy channel with constant capacity and fails with exponentially small probability in the total length of the protocol. Following a work by Schulman (1993), our simulation uses a tree-code, yet as opposed to the nonefficient construction of absolute tree-code used by Schulman, we introduce a relaxation in the notion of goodness for a tree code and define a potent tree code. This relaxation allows us to construct an efficient emulation procedure for any two-party protocol. Our results also extend to the case of interactive multiparty communication. We show that a randomly generated tree code (with suitable constant alphabet size) is an efficiently decodable potent tree code with overwhelming probability. Furthermore, we are able to partially derandomize this result by means of epsilon-biased distributions using only O(N) random bits, where N is the depth of the tree.

关键词： Interactive communication coding theorem network coding tree code reliable communication

来源：评论

学校读者我要写书评

暂无评论

Four Limits in Probability and Their Roles in Source coding

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2011年第11期E94A卷 2073-2082页

作者： Koga, Hiroki Univ Tsukuba Grad Sch Syst & Informat Engn Tsukuba Ibaraki 3058573 Japan

In information-spectrum methods proposed by Han and Verdu, quantities defined by using the limit superior (or inferior) in probability play crucial roles in many problems in information theory. In this paper, we introduce two nonconventional quantities defined in probabilistic ways. After clarifying basic properties of these quantities, we show that the two quantities have operational meaning in the epsilon-coding problem of a general source in the ordinary and optimistic senses. The two quantities can be used not only for obtaining variations of the strong converse theorem but also establishing upper and lower bounds on the width of the entropy-spectrum. We also show that the two quantities are expressed in terms of the smooth Renyi entropy of order zero.

关键词： coding theorem information-spectrum methods optimistic coding strong converse property smooth Renyi entropy

来源：评论

学校读者我要写书评

暂无评论

Classical Capacities of Compound and Averaged Quantum Channels

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2009年第7期55卷 3360-3374页

作者： Bjelakovic, Igor Boche, Holger Tech Univ Berlin Heinrich Hertz Chair Mobile Commun D-10587 Berlin Germany Tech Univ Berlin Inst Math D-10623 Berlin Germany

We determine the capacity of compound classical-quantum channels. As a consequence, we obtain the capacity formula for the averaged classical-quantum channels. The capacity result for compound channels demonstrates, as in the classical setting, the existence of reliable universal classical-quantum codes in scenarios where the only a priori information about the channel used for the transmission of information is that it belongs to a given set of memoryless classical-quantum channels. Our approach is based on a universal classical approximation of the quantum relative entropy which in turn relies on a universal hypothesis testing result.

关键词： Averaged quantum channels capacity coding theorem compound quantum channels universal quantum codes

来源：评论

学校读者我要写书评

暂无评论

On identification capacity of infinite alphabets or continuous-time channels

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2000年第7期46卷 2407-2414页

作者： Burnashev, MV Russian Acad Sci Inst Informat Transmiss Problems Moscow 101447 Russia

Two kinds of channels are considered: 1) discrete-time channel,vith additive noise, and 2) Poisson and white Gaussian (i.e., continuous-time) channels. For the type 1) channel there are given some sufficient conditions when the Shannon and identification capacities coincide. It is shown that the identification capacity of Poisson and Gaussian channels without bandwidth constraint is infinite. Conversly, for a white Gaussian channel with bandwidth -constraint, the identification capacity coincides with the Shannon capacity.

关键词： bandwidth capacity coding theorem Gaussian channel identification Poisson channel

来源：评论

学校读者我要写书评

暂无评论

Systematic Convolutional Low Density Generator Matrix Code

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2021年第6期67卷 3752-3764页

作者： Cai, Suihua Lin, Wenchao Yao, Xinyuanmeng Wei, Baodian Ma, Xiao Sun Yat Sen Univ Sch Comp Sci & Engn Guangdong Key Lab Informat Secur Technol Guangzhou 510006 Peoples R China

In this paper, we propose a systematic low density generator matrix (LDGM) code ensemble, which is defined by the Bernoulli process. We prove that, under maximum likelihood (ML) decoding, the proposed ensemble can achieve the capacity of binary-input output symmetric (BIOS) memoryless channels in terms of bit error rate (BER). The proof technique reveals a new mechanism, different from lowering down frame error rate (FER), that the BER can be lowered down by assigning light codeword vectors to light information vectors. The finite length performance is analyzed by deriving an upper bound and a lower bound, both of which are shown to be tight in the high signal-to-noise ratio (SNR) region. To improve the waterfall performance, we construct the systematic convolutional LDGM (SysConv-LDGM) codes by a random splitting process. The SysConv-LDGM codes are easily configurable in the sense that any rational code rate can be realized without complex optimization. As a universal construction, the main advantage of the SysConv-LDGM codes is their near-capacity performance in the waterfall region and predictable performance in the error-floor region that can be lowered down to any target as required by increasing the density of the uncoupled LDGM codes. Numerical results are also provided to verify our analysis.

关键词： Systematics Generators Linear codes Iterative decoding Bit error rate Decoding Sparse matrices Capacity-achieving codes coding theorem low density generator matrix~(LDGM) codes spatial coupling systematic codes

来源：评论

学校读者我要写书评

暂无评论

STRONG CONVERSES IN SOURCE-coding RELATIVE TO A FIDELITY-CRITERION

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 1991年第2期37卷 257-262页

作者： KIEFFER, JC Department of Electrical Engineering University of Minnesota Minneapolis MN USA

Two strong converses are obtained for an abstract alphabet stationary ergodic source coded relative to an appropriate fidelity criterion. It is shown that given a distortion rate point (D, R), which lies below the rate distortion curve, 1) block codes that operate at rate level R must encode sample source blocks at a rate exceeding D with probability tending to one as block length tends to infinity, and 2) variable-rate codes that operate at distortion level D must encode sample source blocks at a rate exceeding R with probability tending to one as block length tends to infinity. The previously known weak converses guarantee only that the indicated probabilities remain bounded away from zero as block length tends to infinity. The proofs of the strong converses involve sample converses in source coding theory that are presented in a companion paper.

关键词： BLOCK AND VARIABLE-RATE SOURCE coding coding theorem STRONG CONVERSE

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：