اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدVariable-length Feedback Codes with Several Decoding Times for the Gaussian Channel
125
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We investigate variable-length feedback (VLF) codes for the Gaussian point-to-point channel under maximal power, average error probability, and average decoding time constraints. Our proposed strategy chooses $K < infty$ decoding times $n_1, n_2, dots, n_K$ rather than allowing decoding at any time $n = 0, 1, 2, dots$. We consider stop-feedback, which is one-bit feedback transmitted from the receiver to the transmitter at times $n_1, n_2, ldots$ only to inform her whether to stop. We prove an achievability bound for VLF codes with the asymptotic approximation $ln M approx frac{N C(P)}{1-epsilon} - sqrt{N ln_{(K-1)}(N) frac{V(P)}{1-epsilon}}$, where $ln_{(K)}(cdot)$ denotes the $K$-fold nested logarithm function, $N$ is the average decoding time, and $C(P)$ and $V(P)$ are the capacity and dispersion of the Gaussian channel, respectively. Our achievability bound evaluates a non-asymptotic bound and optimizes the decoding times $n_1, ldots, n_K$ within our code architecture.
قيم البحث
اقرأ أيضاً
We propose a new scheme of wiretap lattice coding that achieves semantic security and strong secrecy over the Gaussian wiretap channel. The key tool in our security proof is the flatness factor which characterizes the convergence of the conditional o
utput distributions corresponding to different messages and leads to an upper bound on the information leakage. We not only introduce the notion of secrecy-good lattices, but also propose the {flatness factor} as a design criterion of such lattices. Both the modulo-lattice Gaussian channel and the genuine Gaussian channel are considered. In the latter case, we propose a novel secrecy coding scheme based on the discrete Gaussian distribution over a lattice, which achieves the secrecy capacity to within a half nat under mild conditions. No textit{a priori} distribution of the message is assumed, and no dither is used in our proposed schemes.
We exploit the redundancy of the language-based source to help polar decoding. By judging the validity of decoded words in the decoded sequence with the help of a dictionary, the polar list decoder constantly detects erroneous paths after every few b
its are decoded. This path-pruning technique based on joint decoding has advantages over stand-alone polar list decoding in that most decoding errors in early stages are corrected. In order to facilitate the joint decoding, we first propose a construction of dynamic dictionary using a trie and show an efficient way to trace the dictionary during decoding. Then we propose a joint decoding scheme of polar codes taking into account both information from the channel and the source. The proposed scheme has the same decoding complexity as the list decoding of polar codes. A list-size adaptive joint decoding is further implemented to largely reduce the decoding complexity. We conclude by simulation that the joint decoding schemes outperform stand-alone polar codes with CRC-aided successive cancellation list decoding by over 0.6 dB.
Polar codes are a class of {bf structured} channel codes proposed by Ar{i}kan based on the principle of {bf channel polarization}, and can {bf achieve} the symmetric capacity of any Binary-input Discrete Memoryless Channel (B-DMC). The Soft CANcellat
ion (SCAN) is a {bf low-complexity} {bf iterative} decoding algorithm of polar codes outperforming the widely-used Successive Cancellation (SC). Currently, in most cases, it is assumed that channel state is perfectly {bf known} at the decoder and remains {bf constant} during each codeword, which, however, is usually unrealistic. To decode polar codes for {bf slowly-varying} channel with {bf unknown} state, on the basis of SCAN, we propose the Weighted-Window SCAN (W$^2$SCAN). Initially, the decoder is seeded with a coarse estimate of channel state. Then after {bf each} SCAN iteration, the decoder progressively refines the estimate of channel state with the {bf quadratic programming}. The experimental results prove the significant superiority of W$^2$SCAN to SCAN and SC. In addition, a simple method is proposed to verify the correctness of SCAN decoding which requires neither Cyclic Redundancy Check (CRC) checksum nor Hash digest.
In this paper, we propose capacity-achieving communication schemes for Gaussian finite-state Markov channels (FSMCs) subject to an average channel input power constraint, under the assumption that the transmitters can have access to delayed noiseless
output feedback as well as instantaneous or delayed channel state information (CSI). We show that the proposed schemes reveals connections between feedback communication and feedback control.
We show that Reed-Muller codes achieve capacity under maximum a posteriori bit decoding for transmission over the binary erasure channel for all rates $0 < R < 1$. The proof is generic and applies to other codes with sufficient amount of symmetry as
well. The main idea is to combine the following observations: (i) monotone functions experience a sharp threshold behavior, (ii) the extrinsic information transfer (EXIT) functions are monotone, (iii) Reed--Muller codes are 2-transitive and thus the EXIT functions associated with their codeword bits are all equal, and (iv) therefore the Area Theorem for the average EXIT functions implies that RM codes threshold is at channel capacity.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
