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

The second-order coding rate of the MIMO Quasi-Static Rayleigh Fading Channel

IEEE TRANSACTIONS ON INFORMATION THEORY 2015年第12期61卷 6591-6622页

作者： Hoydis, Jakob Couillet, Romain Piantanida, Pablo Alcatel Lucent Bell Labs F-91620 Nozay France Cent Supelec Univ Paris Sud Lab Signaux & Syst Ctr Natl Rech Sci F-91192 Gif Sur Yvette France

The second-order coding rate of the multiple-input multiple-output (MIMO) quasi-static Rayleigh fading channel is studied. We tackle this problem via an information-spectrum approach and statistical bounds based on recent random matrix theory techniques. We derive a central limit theorem (CLT) to analyze the information density in the regime where the block length n and the number of transmit and receive antennas K and N, respectively, grow simultaneously large. This result leads to the characterization of closed-form upper and lower bounds on the optimal average error probability when the coding rate is within Omicron(1/root nK) of the asymptotic capacity.

关键词： Finite block-length second-order coding rate error probability quasi-static fading channel block-fading channel MIMO information spectrum random matrix theory

来源：评论

学校读者我要写书评

暂无评论

Information Spectrum Approach to second-order coding rate in Channel coding

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2009年第11期55卷 4947-4966页

作者： Hayashi, Masahito Tohoku Univ Grad Sch Informat Sci Sendai Miyagi 9808579 Japan

In this paper, second-order coding rate of channel coding is discussed for general sequence of channels. The optimum second-order transmission rate with a constant error constraint is obtained by using the information spectrum method. We apply this result to the discrete memoryless case, the discrete memoryless case with a cost constraint, the additive Markovian case, and the Gaussian channel case with an energy constraint. We also clarify that the Gallager bound does not give the optimum evaluation in the second-order coding rate.

关键词： Additive Markovian channel central limit theorem channel coding Gallager bound information spectrum second-order coding rate

来源：评论

学校读者我要写书评

暂无评论

second-order rate Region of Constant-Composition Codes for the Multiple-Access Channel

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2015年第1期61卷 157-172页

作者： Scarlett, Jonathan Martinez, Alfonso Guillen i Fabregas, Albert Univ Cambridge Dept Engn Cambridge CB2 1PZ England Univ Pompeu Fabra Dept Informat & Commun Technol Barcelona 08018 Spain Univ Pompeu Fabra Inst Catalana Recerca & Estudis Avancats Dept Informat & Commun Technol Barcelona 08018 Spain

This paper studies the second-order asymptotics of coding rates for the discrete memoryless multiple-access channel (MAC) with a fixed target error probability. Using constant-composition random coding, coded time-sharing, and a variant of Hoeffding's combinatorial central limit theorem, an inner bound on the set of locally achievable second-order coding rates is given for each point on the boundary of the capacity region. It is shown that the inner bound for constant-composition random coding includes that recovered by independent identically distributed random coding, and that the inclusion may be strict. The inner bound is extended to the Gaussian MAC via an increasingly fine quantization of the inputs.

关键词： Multiple-access channels second-order coding rate channel dispersion constant-composition random coding combinatorial central limit theorem

来源：评论

学校读者我要写书评

暂无评论

A second-order Achievable rate Region for Gaussian Multi-Access Channels via a Central Limit Theorem for Functions

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2015年第12期61卷 6719-6733页

作者： MolavianJazi, Ebrahim Laneman, J. Nicholas Univ Notre Dame Notre Dame IN 46556 USA Univ Notre Dame Dept Elect Engn Notre Dame IN 46556 USA

Motivated by the growing application of multi-access networks with stringent delay constraints, we investigate the Gaussian multiple-access channel (MAC) in the finite blocklength regime. By applying central limit theorem (CLT) approximations to non-asymptotic information-spectrum inner bounds, we obtain second-order achievable rate regions for the Gaussian MAC with a positive average error probability and per-codeword power constraints. Our achievability results use spherical inputs uniformly distributed on the power shells, which lead to summations of dependent information random variables. However, we conduct the analysis through a convenient yet powerful form of the CLT, called the CLT for functions.

关键词： Random coding and threshold decoding mutual information random variable power shell input change of measure delta method dispersion matrix second-order coding rate non-asymptotic achievability bounds low-latency communications

来源：评论

学校读者我要写书评

暂无评论

Position-based coding and convex splitting for private communication over quantum channels

引用

QUANTUM INFORMATION PROCESSING 2017年第10期16卷 1-35页

作者： Wilde, Mark M. Louisiana State Univ Hearne Inst Theoret Phys Ctr Computat & Technol Dept Phys & Astron Baton Rouge LA 70803 USA

The classical-input quantum-output (cq) wiretap channel is a communication model involving a classical sender X, a legitimate quantum receiver B, and a quantum eavesdropper E. The goal of a private communication protocol that uses such a channel is for the sender X to transmit a message in such a way that the legitimate receiver B can decode it reliably, while the eavesdropper E learns essentially nothing about which message was transmitted. The epsilon-one-shot private capacity of a cq wiretap channel is equal to the maximum number of bits that can be transmitted over the channel, such that the privacy error is no larger than epsilon is an element of (0, 1). The present paper provides a lower bound on the epsilon-one-shot private classical capacity, by exploiting the recently developed techniques of Anshu, Devabathini, Jain, and Warsi, called position-based coding and convex splitting. The lower bound is equal to a difference of the hypothesis testing mutual information between X and B and the "alternate" smooth max-information between X and E. The one-shot lower bound then leads to a non-trivial lower bound on the second-order coding rate for private classical communication over a memoryless cq wiretap channel.

关键词： Private classical communication Quantum wiretap channel second-order coding rate Hypothesis testing mutual information Smooth max-mutual information

来源：评论

学校读者我要写书评

暂无评论

Mismatched Decoding: Error Exponents, second-order rates and Saddlepoint Approximations

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2014年第5期60卷 2647-2666页

This paper considers the problem of channel coding with a given (possibly suboptimal) maximum-metric decoding rule. A cost-constrained random-coding ensemble with multiple auxiliary costs is introduced, and is shown to achieve error exponents and second-order coding rates matching those of constant-composition random coding, while being directly applicable to channels with infinite or continuous alphabets. The number of auxiliary costs required to match the error exponents and second-order rates of constant-composition coding is studied, and is shown to be at most two. For independent identically distributed random coding, asymptotic estimates of two well-known non-asymptotic bounds are given using saddlepoint approximations. Each expression is shown to characterize the asymptotic behavior of the corresponding random-coding bound at both fixed and varying rates, thus unifying the regimes characterized by error exponents, second-order rates, and moderate deviations. For fixed rates, novel exact asymptotics expressions are obtained to within a multiplicative 1 + o(1) term. Using numerical examples, it is shown that the saddlepoint approximations are highly accurate even at short block lengths.

关键词： Mismatched decoding random coding error exponents second-order coding rate channel dispersion normal approximation saddlepoint approximation exact asymptotics maximum-likelihood decoding finite-length performance

来源：评论

学校读者我要写书评

暂无评论

First- and second-order coding Theorems for Mixed Memoryless Channels With General Mixture

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2016年第8期62卷 4395-4412页

作者： Yagi, Hideki Han, Te Sun Nomura, Ryo Univ Electrocommun Dept Commun Engn & Informat Tokyo 1828585 Japan Natl Inst Informat & Commun Technol Tokyo 1848795 Japan Senshu Univ Sch Network & Informat Kawasaki Kanagawa 2148580 Japan

This paper investigates the first-and second-order maximum achievable rates of codes with/without cost constraints for mixed channels whose channel law is characterized by a general mixture of (at most) uncountably many stationary and memoryless discrete channels. These channels are referred to as mixed memoryless channels with general mixture and include the class of mixed memoryless channels of finitely or countably memoryless channels as a special case. For the mixed memoryless channels with general mixture, the first-order coding theorem which gives a formula for the e-capacity is established, and then a direct part of the second-order coding theorem is provided. A subclass of mixed memoryless channels whose component channels can be ordered according to their capacity is introduced, and the first-and second-order coding theorems are established. It is shown that the established formulas reduce to several known formulas for restricted scenarios.

关键词： Channel coding cost constraint epsilon-capacity second-order coding rate mixed channel information spectrum

来源：评论

学校读者我要写书评

暂无评论

On Gaussian Channels With Feedback Under Expected Power Constraints and With Non-Vanishing Error Probabilities

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2017年第3期63卷 1746-1765页

作者： Truong, Lan V. Fong, Silas L. Tan, Vincent Y. F. Natl Univ Singapore Dept Elect & Comp Engn Singapore 117583 Singapore NUS Dept Math Singapore 117583 Singapore

In this paper, we consider single-and multi-user Gaussian channels with feedback under expected power constraints and with non-vanishing error probabilities. In the first of two contributions, we study asymptotic expansions for the additive white Gaussian noise (AWGN) channel with feedback under the average error probability formalism. By drawing ideas from Gallager and Nakiboglu's work for the direct part and the meta-converse for the converse part, we establish the e-capacity and show that it depends on epsilon in general and so the strong converse fails to hold. Furthermore, we provide bounds on the second-order term in the asymptotic expansion. We show that for any positive integer L, the second-order term is bounded between a term proportional to -ln(L)n (where ln(L)(center dot) is the L-fold nested logarithm function) and a term proportional to +(n ln n)(1/2), where n is the blocklength. The lower bound on the second-order term shows that feedback does provide an improvement in the maximal achievable rate over the case where no feedback is available. In our second contribution, we establish the e-capacity region for the AWGN multiple access channel with feedback under the expected power constraint by combining ideas from hypothesis testing, information spectrum analysis, Ozarow's coding scheme, and power control.

关键词： Feedback AWGN channel multiple access channel expected power constraint strong converse second-order coding rate finite blocklength regime

来源：评论

学校读者我要写书评

暂无评论

A New Method for Employing Feedback to Improve coding Performance

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2020年第11期66卷 6660-6681页

作者： Wagner, Aaron B. Shende, Nirmal V. Altug, Yucel Cornell Univ Sch Elect & Comp Engn Ithaca NY 14853 USA Marvell Semicond Santa Clara CA 95054 USA Natera Inc San Carlos CA 94070 USA

We introduce a novel mechanism, called timid/bold coding, by which feedback can be used to improve coding performance. For a certain class of DMCs, called compound-dispersion channels, we show that timid/bold coding allows for an improved second-order coding rate compared with coding without feedback. For DMCs that are not compound dispersion, we show that feedback does not improve the second-order coding rate. Thus we completely determine the class of DMCs for which feedback improves the second-order coding rate. An upper bound on the second-order coding rate is provided for compound-dispersion DMCs. We also show that feedback does not improve the second-order coding rate for very noisy DMCs. The main results are obtained by relating feedback codes to certain controlled diffusions.

关键词： Encoding Monte Carlo methods Standards Compounds Dispersion Decoding Noise measurement Channel coding diffusions feedback communications second-order coding rate stochastic control

来源：评论

学校读者我要写书评

暂无评论

On the Dispersions of the Gel'fand-Pinsker Channel and Dirty Paper coding

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2015年第9期61卷 4569-4586页

作者： Scarlett, Jonathan Univ Cambridge Dept Engn Cambridge CB2 1PZ England

This paper studies the second-order coding rates for memoryless channels with a state sequence known non-causally at the encoder. In the case of finite alphabets, an achievability result is obtained using constant-composition random coding, and by using a small fraction of the block to transmit the empirical distribution of the state sequence. For error probabilities less than 0.5, it is shown that the second-order rate improves on an existing one based on independent and identically distributed random coding. In the Gaussian case (dirty paper coding) with an almost-sure power constraint, an achievability result is obtained using random coding over the surface of a sphere, and using a small fraction of the block to transmit a quantized description of the state power. It is shown that the second-order asymptotics are identical to the single-user Gaussian channel of the same input power without a state.

关键词： Channels with state Gel'fand-Pinsker channel dirty paper coding channel dispersion second-order coding rate

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：