1,721,205 research outputs found
Classical coherent receivers for differentially encoded M-PSK are optimal
No full textIn this letter, we show that classical coherent receivers for differentially encoded M-PSK are optimal in the sense of the maximum a posteriori (MAP) sequence detection criterion
Faster-than-Nyquist and beyond: How to improve spectral efficiency by accepting interference
No full textSchemi di codifica basati su codici convoluzionali con decodifica a scambio di messaggi e relativi codificatori e decodificatori
No full textOn LDPC codes over channels with memory
No full textThe problem of detection and decoding of low-density parity-check (LDPC) codes transmitted over channels with memory is addressed. A new general method to build a factor graph which takes into account both the code constraints and the channel behavior is proposed and the a posteriori probabilities of the information symbols, necessary to implement maximum a posteriori (MAP) symbol detection, are derived by using the sum-product algorithm. With respect to the case of a LDPC code transmitted on a memoryless channel, the derived factor graphs have additional factor nodes taking into account the channel behavior and not the code constraints. It is shown that the function associated to the generic factor node modeling the channel is related to the basic branch metric used in the Viterbi algorithm when MAP sequence detection is applied or in the BCJR algorithm implementing MAP symbol detection. This fact suggests that all the previously proposed solutions for those algorithms can be systematically extended to LDPC codes and graph-based detection.
When the sum-product algorithm works on the derived factor graphs, the most demanding computation is in general that performed at factor nodes modeling the channel. In fact, the complexity of the computation at these factor nodes is in general exponential in a suitably defined channel memory parameter. In these cases, a technique for complexity reduction is illustrated. In some particular cases of practical relevance, the above mentioned complexity becomes linear in the channel memory. This does not happen in the same cases when detection is performed by using the Viterbi algorithm or the BCJR algorithm, suggesting that the use of factor graphs and the sum-product algorithm might be computationally more appealing. As an example of application of the described framework, the cases of noncoherent and flat fading channels are considered
Communications over phase-noise channels: a tutorial review
No full textIn this tutorial paper, we first review the main information-theoretic results on channels affected by a time-varying phase noise. The main maximum a posteriori symbol detection algorithms to be employed in such a challenging scenario are then described considering linear modulations and advanced coding schemes based on iterative detection and decoding. The role of pilot symbols will be also discussed
Conditioned pilots for ISI channels
Full text linkOne of the proposals to increase the spectral efficiency of the DVB-S2 standard is based on time-frequency packing. This technique causes intersymbol and interchannel interferences to arise, requiring a significant growth of the number of pilots used to carry out frequency and phase synchronization. Therefore, a new pilot design will be introduced and suited optimal and suboptimal reduced-complexity algorithms derived. We will show that the proposed pilot strategy may outperform the classical one in terms of bit error rate and spectral efficiency
Improved differential detection of chip-level differentially encoded direct-sequence spread-spectrum signals
No full textIn a paper by Cavallini et al. (see IEEE Trans. Commun., vol. 45, p.456-63, Apr. 1997), chip-level differential encoding/detection for direct-sequence spread-spectrum signals was proposed to cope with frequency-nonselective fast fading channels. It was shown that, unlike in the additive white Gaussian noise channel, in time-varying fading channels the system performance may be considerably improved, especially when the spreading factor is increased. In this paper, noncoherent sequence detection, recently proposed by the authors, is the starting point for the derivation of receivers with improved performance with respect to that of standard differential detection. For M-ary phase-shift keying signals, a theoretical analysis is performed and the results are confirmed by means of computer simulation. The performance advantage of taking into account a larger phase memory, with respect to the minimum accounted for by differential detection, is demonstrated. In particular, the amount of phase memory is optimized as a function of the Doppler spread for a Rayleigh frequency-nonselective fading channel. The robustness in the presence of phase noise is also investigated by means of computer simulation
Noncoherent sequence detection of continuous phase modulations
No full textIn this paper, noncoherent sequence detection, proposed in a companion paper by Colavolpe and Raheli (see ibid. vol.47, no.9, p.1376-85, 1999), is extended to the case of continuous phase modulations (CPMs). The results in the companion paper on linear modulations with intersymbol interference (ISI) are used here because a CPM signal is mathematically equivalent to a sum of ISI-affected linearly modulated components, according to the Laurent decomposition. The proposed suboptimal detection schemes have a performance which approaches that of coherent detection with acceptable complexity, allow for time-varying phase models, and compare favorably with previously proposed solutions
- …
