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

Multi-Player Multi-Armed Bandits With Collision-Dependent Reward Distributions

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2021年 69卷 4385-4402页

作者： Shi, Chengshuai Shen, Cong Univ Virginia Charles L Brown Dept Elect & Comp Engn Charlottesville VA 22904 USA

We study a new stochastic multi-player multi-armed bandits (MP-MAB) problem, where the reward distribution changes if a collision occurs on the arm. Existing literature always assumes a zero reward for involved players if collision happens, but for applications such as cognitive radio, the more realistic scenario is that collision reduces the mean reward but not necessarily to zero. We focus on the more practical no-sensing setting where players do not perceive collisions directly, and propose the error-correction Collision Communication (EC3) algorithm that models implicit communication as a reliable communication over noisy channel problem, for which random coding error exponent is used to establish the optimal regret that no communication protocol can beat. Finally, optimizing the tradeoff between code length and decoding error rate leads to a regret that approaches the centralized MP-MAB regret, which represents a natural lower bound. Experiments with practical error-correction codes on both synthetic and real-world datasets demonstrate the superiority of EC3. In particular, the results show that the choice of coding schemes has a profound impact on the regret performance.

关键词： Encoding Protocols Signal processing algorithms Games Uncertainty Stochastic processes Reliability Multi-armed bandits (MAB) multi-player bandits regret analysis error-correction coding

来源：评论

学校读者我要写书评

暂无评论

Robust transmission of MELP-compressed speech: An illustrative example of joint source-channel decoding

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2003年第6期51卷 973-982页

作者： Fazel, T Fuja, T Hughes Network Syst Germantown MD 20876 USA Univ Notre Dame Dept Elect Engn Notre Dame IN 46556 USA

A mixed-excitation linear predictive (MELP) speech coder was selected as the U.S. federal standard for 2400 b/s speech compression. This paper examines the quality of MELP-compressed speech when transmitted over noisy communication channels in conjunction with a variety of error-control schemes. The focus is on channel decoders that exploit the "residual redundancy" inherent in the MELP bitstream. This residual redundancy, which is manifested by the correlation in time and the nonuniform distribution of various MELP parameters, can be quantified by modeling the parameters as one-step Markov chains and computing the entropy rate of the Markov chains based on the relative frequencies of transitions. Moreover, this residual redundancy can be exploited by an appropriately "tuned" channel decoder to provide substantial coding gain when compared with decoders that do not exploit it. Channel coding schemes include conventional binary convolutional codes and iteratively-decoded parallel concatenated convolutional (turbo) codes.

关键词： error-correction coding joint source-channel coding speech coding turbo codes

来源：评论

学校读者我要写书评

暂无评论

Probabilistic 16-QAM Shaping in WDM Systems

引用

JOURNAL OF LIGHTWAVE TECHNOLOGY 2016年第18期34卷 4285-4292页

作者： Pan, Chunpo Kschischang, Frank R. Univ Toronto Dept Elect & Comp Engn Toronto ON M5S 3G4 Canada

This work proposes a probabilistic shaping scheme for optical WDM systems, where nonlinear interference noise depends on the input optical signal power distribution. With 16-QAM, a white Gaussian channel analysis shows that the shaped constellation is able to achieve a reach improvement of up to 7%, while split-step Fourier method simulations suggest that even higher gains are possible in practice. An example system is developed for a transmission distance around 3280 km. A constellation mapping and a low-density parity-check code are developed for this regime to show a reach improvement of 7.1%. These shaping schemes can also be extended to 64-QAM, where a reach improvement of over 10% is expected.

关键词： Communication system nonlinearities error-correction coding optical fiber communication probabilistic shaping

来源：评论

学校读者我要写书评

暂无评论

An Information-Theoretic Security Evaluation of a Class of Randomized Encryption Schemes

引用

IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY 2014年第2期9卷 158-168页

作者： Oggier, Frederique Mihaljevic, Miodrag J. Nanyang Technol Univ Div Math Sci Singapore 639798 Singapore Serbian Acad Sci Math Inst Belgrade 11000 Serbia Chuo Univ Res & Dev Initiat IMAI Lab Tokyo 1120003 Japan

Randomized encryption techniques, where randomness is used for security enhancement, are considered. We focus on the case where the encrypted data experiences noise, e. g., is transmitted over a noisy channel, within the encoding-encryption paradigm, where the data is first encoded for error correction, before being encrypted for security. We assume that the cipher-text is subject to a corruption equivalent to its transmission through a binary symmetric channel with known probability of error. The enhanced security is based on a dedicated wire-tap channel coding that introduces extra randomness, combined with that of the communication channel noise. The encryption is based on a block-by-block modulo 2 addition between an encoded message vector and a pseudorandom vector. The goal is to enhance the protection of the secret key employed in the encryption algorithm. Security evaluations of the model are performed employing an information-theoretic approach. Assuming both a passive and an active attacker, we show that there is a threshold before which the wire-tap encoder guarantees an information-theoretic security (during which the equivocation of the secret key is increased), and after which the uncertainty reduces, entering a regime in which a computational security analysis is needed for estimating the complexity resistance against the secret key recovery.

关键词： Randomized encryption error-correction coding homophonic coding wire-tap channel coding information-theoretic security evaluation

来源：评论

学校读者我要写书评

暂无评论

Extrinsic information transfer functions: Model and erasure channel properties

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2004年第11期50卷 2657-2673页

作者： Ashikhmin, A Kramer, G ten Brink, S Bell Labs Lucent Technol Murray Hill NJ 07974 USA

Extrinsic information transfer (EXIT) charts are a tool for predicting the convergence behavior of iterative processors for a variety of communication problems. A model is introduced that applies to decoding problems, including the iterative decoding of parallel concatenated (turbo) codes, serially concatenated codes, low-density parity-check (LDPC) codes, and repeat-accumulate (RA) codes. EXIT functions are defined using the model, and several properties of such functions are proved for erasure channels. One property expresses the area under an EXIT function in terms of a conditional entropy. A useful consequence of this result is that the design of capacity-approaching codes reduces to a curve-fitting problem for all the aforementioned codes. A second property relates the EXIT function of a code to its Helleseth-Klove-Levenshtein information functions, and thereby to the support weights of its subcodes. The relation is via a refinement of information functions called split information functions, and via a refinement of support weights called split support weights. Split information functions are used to prove a third property that relates the EXIT function of a linear code to the EXIT function of its dual.

关键词： concatenated codes duality error-correction coding iterative decoding mutual information

来源：评论

学校读者我要写书评

暂无评论

Minimal trellis modules and equivalent convolutional codes

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2006年第8期52卷 3738-3746页

作者： Tang, Hung-Hua Lin, Mao-Chao Uchoa Filho, Bartolorneu F. Lunghwa Univ Sci & Technol Dept Elect Engn Taoyuan 333 Taiwan Natl Taiwan Univ Dept Elect Engn Taipei 106 Taiwan Univ Fed Santa Catarina Commun Res Grp Dept Elect Engn BR-88040900 Florianopolis SC Brazil

In this correspondence, it is shown that some convolutional codes with distinct memory sizes of minimal encoders are equivalent in the sense that the minimal trellises of these codes are the shifted versions of one another. For an (n, k) binary convolutional code, the weight spectrum obtained from the minimal trellis may be slightly different from that obtained from the conventional code trellis with n-bit branches. Code search is conducted to find some good (n, n-1) binary convolutional codes. Bounds on the trellis complexity, measured by the number of states and the number of branches in the minimal trellis module, of any convolutional code and its equivalent codes are also derived.

关键词： error-correction coding convolutional codes minimal trellis minimal trellis module trellis complexity

来源：评论

学校读者我要写书评

暂无评论

The Read Channel

引用

PROCEEDINGS OF THE IEEE 2008年第11期96卷 1761-1774页

作者： Kavcic, Aleksandar Patapoutian, Ara Univ Hawaii Dept Elect Engn Honolulu HI 96822 USA Seagate Technol Shrewsbury MA 01545 USA

In this paper, we provide a survey of the novel read channel technologies that found their implementation in products over the past decade, and we outline possible technology directions for the future of read channels. Recently, magnetic recording read channels have undergone several changes. in addition to switching from longitudinal to perpendicular recording channels, detectors tuned to media noise sources are now readily implemented in read channel chips. Powerful numerical techniques have emerged to evaluate the capacity of the magnetic recording channel. Further, improved coding/decoding methods have surfaced both for the incumbent Reed-Solomon codes and the promising low-density parity-check codes. The paper is a tutorial-like survey of these emerging technologies with the aim to propel the reader to the forefront of research and development in the areas of signal processing and coding for magnetic recording channels.

关键词： Autoregressive processes codes decoding disk drives error-correction coding information rates information theory jitter Kalman filtering magnetic recording magnetic recording noise maximum likelihood detection modeling pulse modulation Reed-Solomon codes servosystems signal processing synchronization Viterbi detection

来源：评论

学校读者我要写书评

暂无评论

CONSTRUCTION TECHNIQUES FOR error-CONTROL RUNLENGTH-LIMITED BLOCK-CODES

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 1993年第3期E76A卷 453-458页

作者： SAITOH, Y OHNO, T IMAI, H Yokohama National Univ Yokohama Japan

A technique is presented for constructing (d, k) block codes capable of detecting single bit errors and single peak-shift errors in consecutive two runs. This constrains the runlengths in the code sequences to odd numbers. The capacities and the cardinalities for finite code length of these codes are described. A technique is also proposed for constructing (d, k) block codes capable of correcting single peak-shift errors.

关键词： coding THEORY (D, K) CONSTRAINTS error-correction coding error-DETECTION coding MODULATION coding RECORDING CODE

来源：评论

学校读者我要写书评

暂无评论

A new modulation scheme using asymmetric error-correcting codes embedded in optical orthogonal codes for optical CDMA

引用

JOURNAL OF LIGHTWAVE TECHNOLOGY 2001年第12期19卷 1839-1850页

作者： Kamakura, K Sasase, I Keio Univ Dept Informat & Comp Sci Kohoku Ku Yokohama Kanagawa 2238522 Japan

An embedded-modulation scheme is proposed for optical code division multiple access (CDMA). In this scheme, codewords in an asymmetric error-correcting (AEC) code is embedded in a signature sequence in an optical orthogonal code (OOC) used for identification. We classify the codewords of the AEC code according to the number of "1"s in each codeword, and then derive the bit error rate (BER) of the embedded-modulation scheme. Numerical results show that although the performance has the error floor, for achieving the floor value, the embedded-modulation scheme requires less optical energy per bit than the traditional modulation scheme with the correlation and chip-level receivers. The error floor is primarily due to multiaccess interference (MAI), we furthermore apply Reed-Solomon (RS) coding to the embedded-modulation scheme. Consequently, RS coding reduces the floor value to be negligibly small.

关键词： channel coding code division multiple access (CDMA) error-correction coding multiple access communication optical fiber communication optical modulation Reed-Solomon (RS) codes

来源：评论

学校读者我要写书评

暂无评论

Rateless coding on Experimental Temporally Correlated FSO Channels

引用

JOURNAL OF LIGHTWAVE TECHNOLOGY 2010年第7期28卷 990-1002页

作者： Anguita, Jaime A. Neifeld, Mark A. Hildner, Bjoern Vasic, Bane Univ Los Andes Coll Engn & Appl Sci Santiago 7620001 Chile Univ Arizona Dept Elect & Comp Engn Tucson AZ 85719 USA Univ Arizona Coll Opt Sci Tucson AZ 85719 USA

We present a demonstration of two error-correction coding schemes that can successfully operate on a free-space optical (FSO) communication channel subject to atmospheric turbulence. The codes (a puntured Low-density parity-check code and a Raptor code) operate by continuously adapting the information rate to accommodate the varying channel conditions. Because these coding schemes require the use of a feedback channel, we evaluate the bandwidth cost incurred. The evaluation of the codes is performed offline and uses experimental optical signals recorded from an FSO link. We analyze the temporal characteristics of the experimental channels and compare the performance of the codes for different bit rates to asses the effect of temporal correlation and imperfect channel state information.

关键词： Atmospheric turbulence error-correction coding free-space optical (FSO) communication laser applications optical communication rateless coding soft decoding time-varying channels

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：