The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We consider polar coded BPSK receiver performance improvement based on the concepts of channel log-likelihood ratio (LLR) approximation and the maximum achievable transmission rate on fading channel. Based on symmetry condition of random variables, uniform scaling factors are applied to correct soft messages at the absence of channel state information (CSI) at the receiver side. The searching method...
In this paper, we present a nonuniform quantizer based on the condition of maximum information rate achieved over uncorrelated Rayleigh fading channel and when successive cancellation (SC) decoding algorithm of polar codes is applied. Based on symmetry condition of random variables, we start with theoretical model where uniform scaling factors are applied to correct soft messages at the absence of...
A class of burst noise-erasure channels which incorporate both errors and erasures during transmission is studied. The channel, whose output is explicitly expressed in terms of its input and a stationary ergodic noise-erasure process, is shown to satisfy a so-called “quasi-symmetry” condition under certain invertibility conditions. As a result, it is proved that a uniformly distributed input process...
Sparse regression codes (SPARCs) are a recent class of codes for reliable communication over the AWGN channel at rates approaching the channel capacity. Approximate message passing (AMP) decoding, a computationally efficient technique for decoding SPARCs, has been proven to be asymptotically capacity-achieving for the AWGN channel. In this paper, we refine the asymptotic results by deriving a large...
A concatenated coding scheme using a polarization transformation followed by outer sub-codes is analyzed. Achievable error exponents and upper bounds on the error rate are derived. The first bound is obtained using outer codes which are typical linear codes from the ensemble of parity check matrices whose elements are chosen independently and uniformly. As a byproduct of this bound, it determines...
A binary-input binary-output (BIBO) channel is investigated in the presence of feedback and input constraints. The feedback capacity and the optimal input distribution of this setting are presented for the case where the input sequence contains no consecutive ones. A simple coding scheme is designed based on the principle of posterior matching, which was introduced by Shayevitz and Feder for memoryless...
One of the main challenges of communication in the absence of transmitter channel knowledge is codebook universality, i.e., the existence of a single codebook that guarantees a given rate for all channel states. We address this problem for a class of ergodic fading multiple-input multiple-output (MIMO) channels, whose fading distribution is not necessarily isotropic. It is shown that a universal codebook...
Every channel can be expressed as a convex combination of deterministic channels with each deterministic channel corresponding to one particular intrinsic state. Such convex combinations are in general not unique, each giving rise to a specific intrinsic-state distribution. In this paper we study the maximum and the minimum capacities of a channel when the realization of its intrinsic state is causally...
We analyse families of codes for classical data transmission over quantum channels that have both a vanishing probability of error and a code rate approaching capacity as the code length increases. To characterise the fundamental tradeoff between decoding error, code rate and code length for such codes we introduce a quantum generalisation of the moderate deviation analysis proposed by Altŭg and Wagner...
Two independent data streams — the “zero-error stream” and the “rare-error stream” — are to be transmitted over a noisy discrete memoryless channel with feedback. Errors are tolerated only in the rare-error stream, provided that their probability tends to zero. Clearly the rate of the error-free stream cannot exceed the channel's zero-error feedback capacity, and the sum of the streams' rates cannot...
We prove a new, improved upper bound on the size of codes C ⊆{1, 2, 3, 4}n with the property that every four distinct codewords in C have a coordinate where they all differ. Specifically, we show that such a code has size at most 26n/19 +o(n), or equivalently has rate bounded by 6/19 ≤ 0.3158 (measured in bits). This improves the previous best upper bound of 0.3512 due to (Arikan 1994), which in turn...
In this paper we show how to attain the capacity of discrete symmetric channels with polynomial time decoding complexity by considering iterated (U | U + V) constructions with algebraic geometry (AG) code components. These codes are decoded with a recursive computation of the a posteriori probabilities of the code symbols together with decoding the AG components with the Koetter-Vardy algorithm. We...
In this paper, we investigate a binary two-way diffusion channel from an information theoretical perspective. Molecule harvesting is considered by which molecules can be reused by the receiver for subsequent transmissions. An outer bound of the capacity region for the general case and inner bounds for specific cases are derived. With the proposed outer bound, we show that no signaling rate is achievable...
Physical-layer security is emerging as a promising paradigm of securing wireless communications against eavesdropping, with the purpose of improving the transmission reliability of the main link. We propose a best relay selection scheme with multi-eavesdropper cooperation, and deduce the corresponding outage probability and the intercept probability. The simulation results show that he proposed scheme...
In this paper we obtain capacity region for discrete memoryless 2-receiver less noisy broadcast channel when channel state is known only at the receivers, then; this region is possibly extended to discrete time and continuous alphabet fading Gaussian 2-receiver less noisy broadcast channel and ergodic capacity of this fading channel is obtained.
The capacity of the AWGN broadcast is achieved by superposition coding, but superposition of individual coded modulations does not in general obey a predefined constellation. We propose a coded modulation broadcast with strict channel input modulation constraint via multilevel coding (MLC). For a degraded broadcast channel, conditions of optimality of the multilevel decomposition of a superposition...
In this paper we investigate the impact of puncturing on a given information set. This study is necessary to design a good rate-compatible puncturing pattern for hybrid automatic repeat request based on incremental redundancy (HARQ-IR) since an information set should be unchanged during retransmission. We first identify that for an information set, there exist the so-called catastrophic puncturing...
In this paper, we propose the encoding and list decoding method of polar codes based on the four-dimensional Reed-Solomon (RS-4) kernel. In specific, an encoding table based method is employed to reduce the computational complexity of both encoder and decoder. In addition, a simplified method to update log-likelihood ratios (LLRs) which employs additions instead of exponential calculations is also...
Recently, sequences of error-correcting codes with doubly-transitive permutation groups were shown to achieve capacity on erasure channels under symbol-wise maximum a posteriori (MAP) decoding. From this, it follows that Reed-Muller and primitive narrow-sense BCH codes achieve capacity in the same setting. In this article, we extend this result to a large family of cyclic codes by considering codes...
A new frequency switching receiver structure is proposed for simultaneous wireless information and power transfer in multi-carrier communication systems. Each subcarrier is switched to either the energy harvesting unit or the information decoding unit, according to the optimal subcarrier allocation. To implement the system, one-bit feedback is required for each subcarrier. Two optimization problems...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.