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

Sequential Transmission Over Binary Asymmetric Channels With Feedback

IEEE TRANSACTIONS ON INFORMATION THEORY 2022年第11期68卷 7023-7042页

作者： Yang, Hengjie Pan, Minghao Antonini, Amaael Wesel, Richard D. Univ Calif Los Angeles Dept Elect & Comp Engn Los Angeles CA 90095 USA Univ Calif Los Angeles Dept Math Los Angeles CA 90095 USA

In this paper, we consider variable-length coding over the memoryless binary asymmetric channel (BAC) with full noiseless feedback, including the binary symmetric channel (BSC) as a special case. In 2012, Naghshvar et al. introduced a coding scheme, which we refer to as the small-enough-difference (SED) coding scheme. For symmetric binary-input channels, the deterministic variable-length feedback (VLF) code constructed with the SED coding scheme asymptotically achieves both capacity and Burnashev's optimal error exponent. Building on the work of Naghshvar et al., this paper extends the SED coding scheme to the BAC and develops a non-asymptotic VLF achievability bound that is shown to achieve both capacity and the optimal error exponent. For the specific case of the BSC, we develop an additional non-asymptotic VLF achievability bound using a two-phase analysis that leverages both a submartingale synthesis and a Markov chain time of first passage analysis. Numerical evaluations show that both new VLF achievability bounds outperform Polyanskiy's achievability bound for variable-length stop-feedback codes.

关键词： Encoding Codes Upper bound Memoryless systems Symbols Markov processes Monte Carlo methods Binary asymmetric channel binary symmetric channel non-asymptotic analysis submartingales variable-length coding

来源：评论

学校读者我要写书评

暂无评论

Errors-and-Erasures Decoding for Block Codes With Feedback

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2012年第1期58卷 24-49页

作者： Nakiboglu, Baris Zheng, Lizhong MIT Dept Elect Engn & Comp Sci Cambridge MA 02139 USA

Inner and outer bounds are derived on the optimal performance of fixed-length block codes on discrete memoryless channels with feedback and errors-and-erasures decoding. First, an inner bound is derived using a two-phase encoding scheme with communication and control phases together with the optimal decoding rule for the given encoding scheme, among decoding rules that can be represented in terms of pairwise comparisons between the messages. Then, an outer bound is derived using a generalization of the straight-line bound to errors-and-erasures decoders and the optimal error-exponent tradeoff of a feedback encoder with two messages. In addition, upper and lower bounds are derived, for the optimal erasure exponent of error-free block codes in terms of the rate. Finally, a proof is provided for the fact that the optimal tradeoff between error exponents of a two-message code does not improve with feedback on discrete memoryless channels (DMCs).

关键词： Decision feedback discrete memoryless channels (DMCs) error exponent errors-and-erasures decoding feedback feedback encoding schemes soft decoding two-phase encoding schemes variable-length coding

来源：评论

学校读者我要写书评

暂无评论

Extended synchronizing codewords for binary prefix codes

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 1996年第3期42卷 984-987页

作者： Lam, WM Kulkarni, SR PRINCETON UNIV DEPT ELECT ENGNPRINCETONNJ 08544

Synchronizing codewords (SC's) have been previously studied as a means to stop error propagation in variable-length codes, However, SC's retain one disadvantage: the symbols after the SC may be put in the wrong positions since the number of decoded symbols before the SC can be different from the original number due to channel errors, Thus we propose the idea of extended synchronizing codewords (ESC's) which can overcome the drawback of SC's. After the decoder receives an ESC, the decoder correctly knows it is in synchronization, regardless of the preceding slippage, We derive some of the essential properties of ESC's and provide several upper bounds on the amount of overhead needed in designing a code with an ESC.

关键词： variable-length coding prefix codes errors synchronization synchronizing codewords markers

来源：评论

学校读者我要写书评

暂无评论

Common-Message Broadcast Channels With Feedback in the Nonasymptotic Regime: Full Feedback

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2018年第12期64卷 7719-7741页

作者： Trillingsgaard, Kasper Floe Yang, Wei Durisi, Giuseppe Popovski, Petar Aalborg Univ Dept Eletron Syst DK-9220 Aalborg Denmark Qualcomm Technol Inc San Diego CA 92121 USA Chalmers Univ Technol Dept Elect Engn S-41296 Gothenburg Sweden

We investigate the maximum coding rate achievable on a two-user broadcast channel for the case where a common message is transmitted with feedback using either fixed-blocklength codes or variable-length codes. For the fixed-blocklength-code setup, we establish nonasymptotic converse and achievability bounds. An asymptotic analysis of these bounds reveals that feedback improves the second-order term compared to the no-feedback case. In particular, for a certain class of antisymmetric broadcast channels, we show that the dispersion is halved. For the variable-length-code setup, we demonstrate that the channel dispersion is zero.

关键词： Broadcast channel with common-message finite blocklength regime full feedback channel dispersion variable-length coding

来源：评论

学校读者我要写书评

暂无评论

Distributed Distortion-Rate Optimized Compressed Sensing in Wireless Sensor Networks

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2018年第4期66卷 1609-1623页

作者： Leinonen, Markus Codreanu, Marian Juntti, Markku Univ Oulu Ctr Wireless Commun Radio Technol Oulu 90014 Finland

This paper addresses lossy distributed source coding for acquiring correlated sparse sources via compressed sensing (CS) in wireless sensor networks. Noisy CS measurements are separately encoded at a finite rate by each sensor, followed by the joint reconstruction of the sources at the decoder. We develop a novel complexity-constrained distributed variable-rate quantized CS method, which minimizes a weighted sum between the mean square error signal reconstruction distortion and the average encoding rate. The encoding complexity of each sensor is restrained by pre-quantizing the encoder input, i.e., the CS measurements, via vector quantization. Following the entropy-constrained design, each encoder is modeled as a quantizer followed by a lossless entropy encoder, and variable-rate coding is incorporated via rate measures of an entropy bound. For a two-sensor system, necessary optimality conditions are derived, practical training algorithms are proposed, and complexity analysis is provided. Numerical results show that the proposed method achieves superior compression performance as compared with baseline methods, and lends itself to versatile setups with different performance requirements.

关键词： Distributed lossy source coding joint sparsity entropy-constrained vector quantization variable-length coding rate measure

来源：评论

学校读者我要写书评

暂无评论

variable-length Sparse Feedback Codes for Point-to-Point, Multiple Access, and Random Access Channels

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2024年第4期70卷 2367-2394页

作者： Yavas, Recep Can Kostina, Victoria Effros, Michelle CALTECH Dept Elect Engn Pasadena CA 91125 USA CNRS CREATE Singapore 138602 Singapore

This paper investigates variable-length stop-feedback codes for memoryless channels in point-to-point, multiple access, and random access communication scenarios. The proposed codes employ L decoding times n(1),n(2),& mldr;,n(L) for the point-to-point and multiple access channels and KL+1 decoding times for the random access channel with at most K active transmitters. In the point-to-point and multiple access channels, the decoder uses the observed channel outputs to decide whether to decode at each of the allowed decoding times n(1),& mldr;,n(L), at each time telling the encoder whether or not to stop transmitting using a single bit of feedback. In the random access scenario, the decoder estimates the number of active transmitters at time n0 and then chooses among decoding times n(k,1),& mldr;,n(k,L) if it believes that there are k active transmitters. In all cases, the choice of allowed decoding times is part of the code design;given fixed value L, allowed decoding times are chosen to minimize the expected decoding time for a given codebook size and target average error probability. The number L in each scenario is assumed to be constant even when the blocklength is allowed to grow;the resulting code therefore requires only sparse feedback. The central results are asymptotic approximations of achievable rates as a function of the error probability, the expected decoding time, and the number of decoding times. A converse for variable-length stop-feedback codes with uniformly-spaced decoding times is included for the point-to-point channel.

关键词： variable-length coding multiple-access random-access feedback codes sparse feedback second-order analysis channel dispersion moderate deviations sequential hypothesis testing

来源：评论

学校读者我要写书评

暂无评论

Overflow Probability of variable-length Codes With Codeword Cost

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2019年第12期65卷 8194-8206页

作者： Nomura, Ryo Waseda Univ Ctr Data Sci Tokyo 1620042 Japan

Lossless variable-length source coding with codeword cost is considered for general sources. The problem setting, where we impose on unequal costs on code symbols, is called the variable-length coding with codeword cost. In this problem, the infimum of average codeword cost have already been determined for general sources. On the other hand, the overflow probability, which is defined as the probability of codeword cost being above a threshold, have not been considered yet. In this paper, we first determine the infimum of achievable threshold in the first-order sense and the second-order sense for general sources with additive memoryless codeword cost. Then, we compute it for some special sources such as i.i.d. sources and mixed sources. A generalization of the codeword cost is also discussed.

关键词： Codeword cost general source information-spectrum overflow probability variable-length coding

来源：评论

学校读者我要写书评

暂无评论

Optimal Reliability over a Class of Binary-Input Channels with Feedback

Optimal Reliability over a Class of Binary-Input Channels wi...

引用

IEEE Information Theory Workshop (ITW)

作者： Naghshvar, Mohammad Wigger, Michele Javidi, Tara Univ Calif San Diego Dept Elect & Comp Engn La Jolla CA 92093 USA Telecom ParisTech Dept Communicat & Elect ics Paris France

ISBN: (纸本)9781467302234;9781467302241

This paper considers the problem of variable-length coding over a binary-input channel with noiseless feedback. A deterministic sequential coding scheme is proposed and shown to attain the optimal error exponent for any binary-input channel whose capacity is achieved by the uniform input distribution. The proposed scheme is deterministic and has only one phase of operation, in contrast to all previous coding schemes that achieve the optimal error exponent.

关键词： Binary-input channel reliability function optimal error exponent variable-length coding

来源：评论

学校读者我要写书评

暂无评论

An architecture of embedded decompressor with reconfigurability for test compression

An architecture of embedded decompressor with reconfigurabil...

引用

7th Workshop on RTL and High Level Testing

作者： Ichihara, Hideyuki Saiki, Tomoyuki Inoue, Tomoo Hiroshima City Univ Grad Sch Informat Sci Hiroshima 7313194 Japan

Test compression / decompression scheme for reducing the test application time and memory requirement of an LSI tester has been proposed. In the scheme, the employed coding algorithms are tailored to a given test data, so that the tailored coding algorithm can highly compress the test data. However, these methods have some drawbacks, e.g., the coding algorithm is ineffective in extra test data except for the given test data. In this paper, we introduce an embedded decompressor that is reconfigurable according to coding algorithms and given test data. Its reconfigurability can overcome the drawbacks of conventional decompressors with keeping high compression ratio. Moreover, we propose an architecture of reconfigurable decompressors for four variable-length codings. In the proposed architecture, the common functions for four codings are implemented as fixed (or non-reconfigurable) components so as to reduce the configuration data, which is stored on an ATE and sent to a CUT. Experimental results show that (1) the configuration data size becomes reasonably small by reducing the configuration part of the decompressor, (2) the reconfigurable decompressor is effective for SoC testing in respect of the test data size, and (3) it can achieve an optimal compression of test data by Huffman coding.

关键词： test compression ATE reconfigurability variable-length coding test application

来源：评论

学校读者我要写书评

暂无评论

Two-Hop Network with Multiple Decision Centers under Expected-Rate Constraints

Two-Hop Network with Multiple Decision Centers under Expecte...

引用

IEEE Global Communications Conference (GLOBECOM)

作者： Hamad, Mustapha Wigger, Michele Sarkiss, Mireille IP Paris Telecom Paris LTCI F-91120 Palaiseau France IP Paris Telecom SudParis SAMOVAR F-91011 Evry France

ISBN: (纸本)9781728181042

The paper studies distributed binary hypothesis testing over a two-hop relay network where both the relay and the receiver decide on the hypothesis. Both communication links are subject to expected rate constraints, which differs from the classical assumption of maximum rate constraints. We exactly characterize the set of type-II error exponent pairs at the relay and the receiver when both type-I error probabilities are constrained by the same value epsilon > 0. No tradeoff is observed between the two exponents, i.e., one can simultaneously attain maximum type-II error exponents both at the relay and at the receiver. For epsilon(1) not equal epsilon(2), we present an achievable exponents region, which we obtain with a scheme that applies different versions of a basic two-hop scheme that is optimal under maximum rate constraints. We use the basic twohop scheme with two choices of parameters and rates, depending on the transmitter's observed sequence. For epsilon(1) = epsilon(2), a single choice is shown to be sufficient. Numerical simulations indicate that extending to three or more parameter choices is never beneficial.

关键词： Multi-hop distributed hypothesis testing error exponents expected rate constraints variable-length coding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：