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.
Partial response signaling (PRS) codes with maximal minimum Euclidean distance have previously been found by linear programming. These perform very well in the narrowband-high energy region, but they were not optimized for minimal bit error rate (BER), so they are only optimal in the limit of infinite signal to noise ratio. Here we search for codes that perform better for more practical signal to...
The cutoff rate R0(W) of a discrete memoryless channel (DMC) W is often used as a figure of merit, alongside the channel capacity C(W). Given a channel W consisting of two possibly correlated subchannels W1, W2, the capacity function always satisfies C(W1) + C(W2) les C(W), while there are examples for which R0(W1) + R0(W 2) > R0(W). This fact that the cutoff rate can be "created" by...
In this paper a union bound on the bit error probability of bit-interleaved coded modulation (BICM) is derived. In the derivation we assume that the bit errors in a codeword are uniformly distributed over the transmitted symbols. We derive the bound for BICM systems over AWGN, Rician and Nakagami fading channels. The proposed bound is general to any signal constellation and coding scheme with a known...
This paper presents a general methodology to extend Gallager bounds on the maximum-likelihood decoding error probability to arbitrary binary-input output-symmetric memoryless channels. Based on the log-likelihood ratios, a new space is constructed in which the signals naturally lie on a sphere, and for which geometric analysis is straightforward. In particular, we focus on Poltyrev's tangential-sphere...
This paper provides details about experiments in realistic, urban, and frequency flat channels with space-time coding that specifically examines the impact of the number of receive antennas and the design criteria for code selection on the performance. Also the performance characteristics are examined of the coded modulations in the presence of finite size array geometries. This paper gives some insight...
Using high rate recursive systematic convolutional code (RSCC) as the basic element and the trace criteria as the design principle, a new kind of high rate recursive space-time trellis code (HR-RSTTC) is designed for serial concatenation. By making the number of RSCCs and the coding rate of each RSCC be variable, our designed HR-RSTTC can adjust the data rate according to the transmit antenna number...
In this paper, we characterize the decoding region of algebraic soft decoding (ASD) [4] of Reed-Solomon (RS) codes over erasure channels and binary symmetric channel (BSC). Optimal multiplicity assignment strategies (MAS) are investigated and tight bounds are derived to show the ASD can significantly outperform conventional Berlekamp Massey (BM) decoding over these channels for a wide code rate range...
It is known that in an OFDM system using Hadamard transform or phase alteration before the IDFT operation can reduce the peak-to-average power ratio (PAPR). Both these techniques can be viewed as constellation preceding for PAPR reduction. In general, using non-diagonal transforms, like Hadamard transform, increases the ML decoding complexity. In this paper we propose the use of block-IDFT matrices...
The number of encoder states is a key measure of complexity of a finite-state constrained code. In this paper, we derive analytically the relationship between the number of encoder states and the size of capacity approaching d = 1 codes. By defining the number of encoder states as (generalized) Fibonacci numbers, we obtain the optimum encoder states, which maximize the size of the designed code with...
A 180deg carrier phase ambiguity is inevitable in digital communication systems employing binary phase-shift keying modulation and non-data-aided carrier phase recovery. Here, we propose a simple modification to standard regular RA codes by exploiting differential encoding inherent to inner encoder of RA codes resulting in a 180deg rotationally invariant RA code
We present a method to combine error-correction coding and spectral-efficient modulation for transmission over the additive white Gaussian noise (AWGN) channel. The code employs signal shaping which can provide a so-called shaping gain. The code belongs to the family of sparse graph codes for which efficient decoding algorithms can be derived. Simulation results show that the performance of the code...
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.