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

A random coding bound FOR FIXED CONVOLUTIONAL-CODES OF RATE 1/N

IEEE TRANSACTIONS ON INFORMATION THEORY 1994年第5期40卷 1668-1670页

作者： SEGUIN, G Department of Electrical and Computer Engineering Royal Military College of Canada Kingston ONT Canada

We show that the ensemble average of the block error probability for the ensemble of terminated rate 1/n fixed convolutional codes, used on the binary symmetric channel with a maximum likelihood decoder, is bounded by exp(2) - NE(r)(1 - K/N), where N = (L + m)n is the block length, L being the message length, K the constraint length, and E(r)() is the random coding exponent for block codes. Hence, E(r)(1 - K/N) > 0 for H(p) < K/N less than or equal to 1, where H() is the binary entropy function and p is the cross-over probability of the binary symmetric channel.

关键词： CONVOLUTIONAL CODES random coding bound BINARY SYMMETRICAL CHANNEL

来源：评论

学校读者我要写书评

暂无评论

random coding bound for E-capacity Region of the Broadcast Channel With Two Confidential Messages

Random Coding Bound for <i>E</i>-capacity Region of the Broa...

引用

20th Telecommunications Forum

作者： Afshar, Nasrin Haroutunian, Evgueni Natl Acad Sci Inst Informat & Automat Problems Yerevan Armenia

ISBN: (纸本)9781467329842;9781467329835

The discrete memoryless broadcast channel with two independent confidential messages (BC-2CM) involves three sources, one encoder and two receivers. A common message is sent to both receivers and each private message is transmitted to the intended receiver, while keeping the other receiver as ignorant of it as possible. The level of ignorance is measured by the equivocation rate. We derived a random coding bound for E-capacity region of the BC-2CM. When error probability exponents are going to zero, this bound converges to the inner bound of the capacity region of the BC-2CM obtained by Xu, Cao and Chen.

关键词： Broadcast channel with confidential messages E-capacity equivocation rate error probability exponent method of types random coding bound

来源：评论

学校读者我要写书评

暂无评论

Refinement of the random coding bound

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2014年第10期60卷 6005-6023页

作者： Altug, Yuecel Wagner, Aaron B. Cornell Univ Sch Elect & Comp Engn Ithaca NY 14853 USA

The problem of deriving refined bounds on the sub-exponential factor in the random coding bound for discrete memoryless channels is considered. In particular, for independent identically distributed random code ensembles and for rates above the critical rate, we prove that if a regularity condition is satisfied (respectively, not satisfied), then for any epsilon > 0 a sub-exponential factor of O(N-0.5(1-epsilon+(rho) over bar *R)) respectively, O(N-0.5)) is achievable, where N and R are the blocklength and rate, respectively. The term (rho) over bar*(R) is related to the slope of the random coding exponent at rate R.

关键词： Channel coding error exponents random coding bound sub-exponential factor

来源：评论

学校读者我要写书评

暂无评论

Physical-layer Network coding: A random coding Error Exponent Perspective

Physical-layer Network Coding: A Random Coding Error Exponen...

引用

2017 IEEE Information Theory Workshop (ITW)

作者： Ullah, Shakeel Salamat Liva, Gianluigi Liew, Soung Chang Chinese Univ Hong Kong Dept Informat Engn Hong Kong Hong Kong Peoples R China German Aerosp Ctr DLR Inst Commun & Networking Cologne Germany

ISBN: (纸本)9781509030972

In this work, we derive the random coding error exponent for the uplink phase of a two-way relay system where physical layer network coding (PNC) is employed. The error exponent is derived for the practical (yet sub-optimum) XOR channel decoding setting. We show that the random coding error exponent under optimum (i.e., maximum likelihood) PNC channel decoding can be achieved even under the sub-optimal XOR channel decoding. The derived achievability bounds provide us with valuable insight and can be used as a benchmark for the performance of practical channel-coded PNC systems employing low complexity decoders when finite-length codewords are used.

关键词： random coding bound random coding error exponent degraded channel XOR channel decoding physicallayer network coding

来源：评论

学校读者我要写书评

暂无评论

Almost cover-free codes and designs

引用

DESIGNS CODES AND CRYPTOGRAPHY 2017年第1-2期82卷 231-247页

作者： D'yachkov, Arkadii Vorobyev, Ilya Polyanskii, Nikita Shchukin, Vladislav Lomonosov Moscow State Univ Fac Mech & Math Dept Probabil Theory Moscow 119992 Russia

An s-subset of codewords of a binary code X is said to be -bad in X if the code X contains a subset of other codewords such that the conjunction of the codewords is covered by the disjunctive sum of the s codewords. Otherwise, the s-subset of codewords of X is called -good in X. A binary code X is said to be a cover-free (CF) -code if the code X does not contain -bad subsets. In this paper, we introduce a natural probabilistic generalization of CF -codes, namely: a binary code X is said to be an almost CF -code if the relative number of its -good s-subsets is close to 1. We develop a random coding method based on the ensemble of binary constant weight codes to obtain lower bounds on the capacity of such codes. Our main result shows that the capacity for almost CF -codes is essentially greater than the rate for ordinary CF -codes.

关键词： Almost cover-free codes Designs Capacity random coding bound

来源：评论

学校读者我要写书评

暂无评论

boundS ON THE DEcoding ERROR-PROBABILITY OF BINARY LINEAR CODES VIA THEIR SPECTRA

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 1994年第4期40卷 1284-1292页

作者： POLTYREV, G Tel-Aviv Univ Tel-Aviv Isr

bounds on the error probability of maximum likelihood decoding of a binary linear code are considered. The bounds derived use the weight spectrum of the code and they are tighter than the conventional union bound in the case of large noise in the channel. The bounds we derive are applied to a code with an average spectrum, and the result is compared to the random coding exponent. We show that the bound considered here for the BSC case coincides asymptotically with the random coding bound. For the case of AWGN channel we show that Berlekamp's tangential bound can be improved, but even this improved bound does not coincide with the random coding bound, although it can be very close to it.

关键词： BINARY LINEAR CODE SPECTRUM OF CODE ERROR PROBABILITY BINARY SYMMETRICAL CHANNEL ADDITIVE WHITE GAUSSIAN NOISE random coding bound

来源：评论

学校读者我要写书评

暂无评论

Performance of truncated type-II hybrid ARQ schemes with noisy feedback over block fading channels

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2000年第9期48卷 1477-1487页

作者： Malkamäki, E Leib, H Helsinki Univ Technol IRC Commun Lab Helsinki Finland McGill Univ Dept Elect Engn Montreal PQ H3A 2A7 Canada

This paper considers truncated type-II hybrid automatic repeat-request (ARQ) schemes with noisy feedback over block fading channels. With these ARQ techniques, the number of retransmissions is limited, and, similar to forward error correction (FEC), error-free delivery of data packets cannot he guaranteed. bounds on the average number of transmissions, the average coding rate as well as the reliability of the schemes are derived using random coding techniques, and the performance is compared with FEC. The random coding bounds reveal the achievable performance with block codes and maximum-likelihood soft-decision decoding. Union upper bounds and simulation results show that over block fading channels, these bounds can be closely approached with simple terminated convolutional codes and soft-decision Viterbi decoding. Truncated type-II hybrid ARQ and the corresponding FEC schemes have the same probability of packet erasure;however, the truncated ARQ schemes offer a trade-off between the average coding rate and the probability of undetected error. Truncated ARQ schemes have significantly higher average coding rates than FEC at high and medium signal-to-noise ratio even with noisy feedback. Truncated ARQ can he viewed as adaptive FEC that adapts to the instantaneous channel conditions.

关键词： block fading channel error control noisy feedback random coding bound truncated ARQ union bound

来源：评论

学校读者我要写书评

暂无评论

Weighted Superimposed Codes and Constrained Integer Compressed Sensing

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2009年第5期55卷 2215-2229页

作者： Dai, Wei Milenkovic, Olgica Univ Illinois Dept Elect & Comp Engn Urbana IL 61801 USA

We introduce a new family of codes, termed weighted superimposed codes (WSCs). This family generalizes the class of Euclidean superimposed codes (ESCs), used in multiuser identification systems. WSCs allow for discriminating all bounded, integer-valued linear combinations of real-valued codewords that satisfy prescribed norm and nonnegativity constraints. By design, WSCs are inherently noise tolerant. Therefore, these codes can be seen as special instances of robust compressed sensing schemes. The main results of the paper are lower and upper bounds on the largest achievable code rates of several classes of WSCs. These bounds suggest that, with the codeword and weighting vector constraints at hand, one can improve the code rates achievable by standard compressive sensing techniques.

关键词： Code exponent compressive sensing random coding bound sphere-packing bound superimposed codes

来源：评论

学校读者我要写书评

暂无评论

Cloud Radio random-Access Networks With Multi-Packet Reception Capability

引用

IEEE ACCESS 2024年 12卷 89384-89393页

作者： Shin, Cheolkyu Park, Seok-Hwan Kim, Junghyun Park, Hyuncheol Hallym Univ Div AI Convergence Chunchon 24252 South Korea Jeonbuk Natl Univ Div Elect Engn Jeonju 54896 South Korea Sejong Univ Dept Artificial Intelligence Seoul 05006 South Korea Korea Adv Inst Sci & Technol Dept Elect & Elect Engn Daejeon 34141 South Korea

Cloud Radio Access Network (C-RAN) refers to the virtualization of base station functionalities by means of cloud computing. With centralized processing at the cloud, the amount of hardware and infrastructure in a network can be reduced and it allows for operators to save expenses needed to deploy and maintain the network. Along with high spectral and energy efficiency, C-RAN becomes a key technology evolving to 5G network and it is also expected to play a critical role in the next generation of wireless network. In this paper, theoretical expressions are derived for throughput performance at Medium Access Control (MAC) layer with and without Cloud Radio random-Access (CRRA). We first develop a CRRA protocol by accounting for the Multi-Packet Reception (MPR) capabilities afforded thanks to the deployment of C-RAN. We then analyze the throughput performance based on error exponent analysis. Numerical results show the performance advantages of C-RAN and verify theoretical expressions.

关键词： Protocols Decoding Throughput Cloud computing Vectors Media Access Protocol Encoding Radio access networks Multiaccess communication Automata Markov processes Cloud radio access network multi-packet reception capability random-access protocol finite-state discrete Markov chain random coding bound

来源：评论

学校读者我要写书评

暂无评论

Short-Packet Physical-Layer Network coding

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2020年第2期68卷 737-751页

作者： Ullah, Shakeel Salamat Liew, Soung Chang Liva, Gianluigi Wang, Taotao CU Coding Hong Kong Peoples R China Chinese Univ Hong Kong Dept Informat Engn Hong Kong Peoples R China German Aerosp Ctr DLR Inst Commun & Networking D-82234 Wessling Germany Shenzhen Univ Guangdong Lab Artificial Intelligence & Digital E Shenzhen 518060 Peoples R China

This paper explores the application of physical-layer network coding (PNC) for short-packet transmissions. PNC can potentially reduce the communication delay in relay-assisted wireless networks and can thus be instrumental in realizing short-packet communication systems with stringent delay requirements. In this work, first, we first derive an achievability bound for channel-coded short-packet PNC systems. Based on the random-coding error-exponent, the bound serves as a benchmark for short-packet PNC operating with traditional preamble-aided channel estimation and XOR channel decoding. Second, we design a blind channel estimation algorithm and a code-aided channel estimation algorithm for short-packet PNC systems. Both outperform the traditional preamble-aided channel estimation for PNC systems operating with mismatched channel-state-information. As a case study, we compare the three algorithms for packets of 128 symbols over a two-way relay channel. The results show that the blind algorithm outperforms the code-aided algorithm and preamble-aided algorithm by almost 0.2 and 1.5 dB respectively. Furthermore, the blind algorithm achieves the target packet error rate of 10(-4) within 0.5 dB of the random coding bound of an imaginary system in which perfect channel-state-information is available at the relay at no cost (i.e., channel estimation is not required in the imaginary system). The bound and the algorithms give us a fundamental framework for applying PNC to short-packet transmissions.

关键词： Channel estimation Decoding Delays Relays Uplink Estimation Benchmark testing Physical-layer network coding short-packet transmissions random coding bound mismatched channel-state-information expectation-maximization belief-propagation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：