arXiv subjects

Jean-François Hélard

Publications and source records attributed to Jean-François Hélard.

At least 19 recordsLinked to original sources

arXiv2014

Achieving Low-Complexity Maximum-Likelihood Detection for the 3D MIMO Code

The 3D MIMO code is a robust and efficient space-time block code (STBC) for the distributed MIMO broadcasting but suffers from high maximum-likelihood (ML) decoding complexity. In this paper, we first analyze some properties of the 3D MIMO code to show that the 3D MIMO code is fast-decodable. It is proved that the ML decoding performance can be achieved with a complexity of O(M^{4.5}) instead of O(M^8) in quasi static channel with M-ary square QAM modulations. Consequently, we propose a simplified ML decoder exploiting the unique properties of 3D MIMO code. Simulation results show that the proposed simplified ML decoder can achieve much lower processing time latency compared to the classical sphere decoder with Schnorr-Euchner enumeration.

cs.IT↗

arXiv2014

Reduced-complexity maximum-likelihood decoding for 3D MIMO code

The 3D MIMO code is a robust and efficient space-time coding scheme for the distributed MIMO broadcasting. However, it suffers from the high computational complexity if the optimal maximum-likelihood (ML) decoding is used. In this paper we first investigate the unique properties of the 3D MIMO code and consequently propose a simplified decoding algorithm without sacrificing the ML optimality. Analysis shows that the decoding complexity is reduced from O(M^8) to O(M^{4.5}) in quasi-static channels when M-ary square QAM constellation is used. Moreover, we propose an efficient implementation of the simplified ML decoder which achieves a much lower decoding time delay compared to the classical sphere decoder with Schnorr-Euchner enumeration.

cs.IT↗

arXiv2014

A Fast Decodable Full-Rate STBC with High Coding Gain for 4x2 MIMO Systems

In this work, a new fast-decodable space-time block code (STBC) is proposed. The code is full-rate and full-diversity for 4x2 multiple-input multiple-output (MIMO) transmission. Due to the unique structure of the codeword, the proposed code requires a much lower computational complexity to provide maximum-likelihood (ML) decoding performance. It is shown that the ML decoding complexity is only O(M^{4.5}) when M-ary square QAM constellation is used. Finally, the proposed code has highest minimum determinant among the fast-decodable STBCs known in the literature. Simulation results prove that the proposed code provides the best bit error rate (BER) performance among the state-of-the-art STBCs.

cs.IT↗

arXiv2012

Distributed MIMO coding scheme with low decoding complexity for future mobile TV broadcasting

A novel distributed space-time block code (STBC) for the next generation mobile TV broadcasting is proposed. The new code provides efficient performance within a wide range of power imbalance showing strong adaptivity to the single frequency network (SFN) broadcasting deployments. The new code outperforms existing STBCs with equivalent decoding complexity and approaches those with much higher complexities.

cs.NI↗

arXiv2012

Enhanced Mobile Digital Video Broadcasting with Distributed Space-Time Coding

This paper investigates the distributed space-time (ST) coding proposals for the future Digital Video Broadcasting--Next Generation Handheld (DVB-NGH) standard. We first theoretically show that the distributed MIMO scheme is the best broadcasting scenario in terms of channel capacity. Consequently we evaluate the performance of several ST coding proposals for DVB-NGH with practical system specifications and channel conditions. Simulation results demonstrate that the 3D code is the best ST coding solution for broadcasting in the distributed MIMO scenario.

cs.IT↗

arXiv2012

Improved Channel Estimation Methods based on PN sequence for TDS-OFDM

An accurate channel estimation is crucial for the novel time domain synchronous orthogonal frequency-division multiplexing (TDS-OFDM) scheme in which pseudo noise (PN) sequences serve as both guard intervals (GI) for OFDM data symbols and training sequences for synchronization/channel estimation. This paper studies the channel estimation method based on the cross-correlation of PN sequences. A theoretical analysis of this estimator is conducted and several improved estimators are then proposed to reduce the estimation error floor encountered by the PN-correlation-based estimator. It is shown through mathematical derivations and simulations that the new estimators approach or even achieve the Cramer-Rao bound.

cs.IT↗

arXiv2012

A Novel Data-Aided Channel Estimation with Reduced Complexity for TDS-OFDM Systems

In contrast to the classical cyclic prefix (CP)-OFDM, the time domain synchronous (TDS)-OFDM employs a known pseudo noise (PN) sequence as guard interval (GI). Conventional channel estimation methods for TDS-OFDM are based on the exploitation of the PN sequence and consequently suffer from intersymbol interference (ISI). This paper proposes a novel dataaided channel estimation method which combines the channel estimates obtained from the PN sequence and, most importantly, additional channel estimates extracted from OFDM data symbols. Data-aided channel estimation is carried out using the rebuilt OFDM data symbols as virtual training sequences. In contrast to the classical turbo channel estimation, interleaving and decoding functions are not included in the feedback loop when rebuilding OFDM data symbols thereby reducing the complexity. Several improved techniques are proposed to refine the data-aided channel estimates, namely one-dimensional (1-D)/two-dimensional (2-D) moving average and Wiener filtering. Finally, the MMSE criteria is used to obtain the best combination results and an iterative process is proposed to progressively refine the estimation. Both MSE and BER simulations using specifications of the DTMB system are carried out to prove the effectiveness of the proposed algorithm even in very harsh channel conditions such as in the single frequency network (SFN) case.

cs.NI↗

arXiv2010

Robustness maximization of parallel multichannel systems

Bit error rate (BER) minimization and SNR-gap maximization, two robustness optimization problems, are solved, under average power and bit-rate constraints, according to the waterfilling policy. Under peak-power constraint the solutions differ and this paper gives bit-loading solutions of both robustness optimization problems over independent parallel channels. The study is based on analytical approach with generalized Lagrangian relaxation tool and on greedy-type algorithm approach. Tight BER expressions are used for square and rectangular quadrature amplitude modulations. Integer bit solution of analytical continuous bit-rates is performed with a new generalized secant method. The asymptotic convergence of both robustness optimizations is proved for both analytical and algorithmic approaches. We also prove that, in conventional margin maximization problem, the equivalence between SNR-gap maximization and power minimization does not hold with peak-power limitation. Based on a defined dissimilarity measure, bit-loading solutions are compared over power line communication channel for multicarrier systems. Simulation results confirm the asymptotic convergence of both allocation policies. In non asymptotic regime the allocation policies can be interchanged depending on the robustness measure and the operating point of the communication system. The low computational effort of the suboptimal solution based on analytical approach leads to a good trade-off between performance and complexity.

cs.IT↗

arXiv2010

Positioning based information technique in cooperative MIMO-OFDM systems

Future Communication networks are tending towards a diverse wireless networking world where the positioning information (PI) could be helpful in different techniques like the dynamic resource allocation. On the other hand, the PI could be widely used for cooperative techniques in the relay and/or routing selection process. In this paper, we propose to use the PI in the selection of the relays and then to apply an efficient double layer distributed space time block code (DLSTBC) scheme between the different relays. Using the amplify and forward (AF) technique, we show that the proposed code is very efficient whatever the transmitted power is. Moreover, we show that the relay selection process based on PI yields very powerful results when compared to the random relay selection (RS) process

cs.NI↗

arXiv2009

Cross-layer Resource Allocation Scheme for Multi-band High Rate UWB Systems

In this paper, we investigate the use of a cross-layer allocation mechanism for the high-rate ultra-wideband (UWB) systems. The aim of this paper is twofold. First, through the cross-layer approach that provides a new service differentiation approach to the fully distributed UWB systems, we support traffic with quality of service (QoS) guarantee in a multi-user context. Second, we exploit the effective SINR method that represents the characteristics of multiple sub-carrier SINRs in the multi-band WiMedia solution proposed for UWB systems, in order to provide the channel state information needed for the multi-user sub-band allocation. This new approach improves the system performance and optimizes the spectrum utilization with a low cost data exchange between the different users while guaranteeing the required QoS. In addition, this new approach solves the problem of the cohabitation of more than three users in the same WiMedia channel.

cs.NI↗

arXiv2008

3D MIMO Scheme for Broadcasting Future Digital TV in Single Frequency Networks

This letter introduces a 3D space-time-space block code for future digital TV systems. The code is based on a double layer structure for inter-cell and intra-cell transmission mode in single frequency networks. Without increasing the complexity of the receiver, the proposed code is very efficient for different transmission scenarios.

cs.NI↗

arXiv2008

Analysis and Performance Comparison of DVB-T and DTMB Systems for Terrestrial Digital TV

Orthogonal frequency-division multiplexing (OFDM) is the most popular transmission technology in digital terrestrial broadcasting (DTTB), adopted by many DTTB standards. In this paper, the bit error rate (BER) performance of two DTTB systems, namely cyclic prefix OFDM (CP-OFDM) based DVB-T and time domain synchronous OFDM (TDS-OFDM) based DTMB, is evaluated in different channel conditions. Spectrum utilization and power efficiency are also discussed to demonstrate the transmission overhead of both systems. Simulation results show that the performances of the two systems are much close. Given the same ratio of guard interval (GI), the DVB-T outperforms DTMB in terms of signal to noise ratio (SNR) in Gaussian and Ricean channels, while DTMB behaves better performance in Rayleigh channel in higher code rates and higher orders of constellation thanks to its efficient channel coding and interleaving scheme.

cs.NI↗

arXiv2008

A novel channel estimation based on spread pilots for terrestrial digital video broadcasting

In this paper, we propose a novel channel estimation technique based on spread pilots for digital video broadcasting. This technique consists in adding a linear preceding function before the OFDM modulation and dedicating one of the preceding sequence to transmit the pilot symbols for the channel estimation. The merits of this technique are its simplicity, its flexibility, and the gains in terms of spectral efficiency and useful bit rate obtained compared to the classical pilot based estimation schemes used in DVB standards. The performance evaluated over realistic channel models, shows the efficiency of this technique which turns out to be a promising channel estimation technique for the future terrestrial video broadcasting systems.

cs.NI↗

arXiv2008

2D Linear Precoded OFDM for future mobile Digital Video Broadcasting

In this paper, we propose a novel channel estimation technique based on 2D spread pilots. The merits of this technique are its simplicity, its flexibility regarding the transmission scenarios, and the spectral efficiency gain obtained compared to the classical pilot based estimation schemes used in DVB standards. We derive the analytical expression of the mean square error of the estimator and show it is a function of the autocorrelation of the channel in both time and frequency domains. The performance evaluated over a realistic channel model shows the efficiency of this technique which turns out to be a promising channel estimation for the future mobile video broadcasting systems.

cs.NI↗

arXiv2008

Coded Adaptive Linear Precoded Discrete Multitone Over PLC Channel

Discrete multitone modulation (DMT) systems exploit the capabilities of orthogonal subcarriers to cope efficiently with narrowband interference, high frequency attenuations and multipath fadings with the help of simple equalization filters. Adaptive linear precoded discrete multitone (LP-DMT) system is based on classical DMT, combined with a linear precoding component. In this paper, we investigate the bit and energy allocation algorithm of an adaptive LP-DMT system taking into account the channel coding scheme. A coded adaptive LPDMT system is presented in the power line communication (PLC) context with a loading algorithm which accommodates the channel coding gains in bit and energy calculations. The performance of a concatenated channel coding scheme, consisting of an inner Wei's 4-dimensional 16-states trellis code and an outer Reed-Solomon code, in combination with the proposed algorithm is analyzed. Theoretical coding gains are derived and simulation results are presented for a fixed target bit error rate in a multicarrier scenario under power spectral density constraint. Using a multipath model of PLC channel, it is shown that the proposed coded adaptive LP-DMT system performs better than coded DMT and can achieve higher throughput for PLC applications.

cs.IT↗

arXiv2008

A Coded Bit-Loading Linear Precoded Discrete Multitone Solution for Power Line Communication

Linear precoded discrete multitone modulation (LP-DMT) system has been already proved advantageous with adaptive resource allocation algorithm in a power line communication (PLC) context. In this paper, we investigate the bit and energy allocation algorithm of an adaptive LP-DMT system taking into account the channel coding scheme. A coded adaptive LP-DMT system is presented in the PLC context with a loading algorithm which ccommodates the channel coding gains in bit and energy calculations. The performance of a concatenated channel coding scheme, consisting of an inner Wei's 4-dimensional 16-states trellis code and an outer Reed-Solomon code, in combination with the roposed algorithm is analyzed. Simulation results are presented for a fixed target bit error rate in a multicarrier scenario under power spectral density constraint. Using a multipath model of PLC channel, it is shown that the proposed coded adaptive LP-DMT system performs better than classical coded discrete multitone.

cs.IT↗

arXiv2008

On the Influence of Carrier Frequency Offset and Sampling Frequency Offset in MIMO-OFDM Systems for Future Digital TV

This paper investigates the impact of carrier frequency offset (CFO) and sampling frequency offset (SFO) on the performance of different MIMO-OFDM schemes with high spectral efficiency for next generation of terrestrial digital TV. We analyze particularly orthogonal Alamouti scheme, and non-orthogonal (NO) schemes like VBLAST, linear dispersion (LD) code and Golden code. This analysis gives a global view on the best suitable MIMO-OFDM scheme with respect to CFO and SFO. We show that for high spectral efficiency, Alamouti is more sensitive to CFO and SFO. Moreover, we show that all studied MIMO-OFDM schemes are sensitive to CFO when it is greater than 1% of inter-carrier spacing. Their sensitivity due to SFO is less than that due to CFO.

cs.NI↗

arXiv2008

Efficient MIMO-OFDM Schemes for Future Terrestrial Digital TV with Unequal Received Powers

This article investigates the effect of equal and unequal received powers on the performances of different MIMO-OFDM schemes for terrestrial digital TV. More precisely, we focus on three types of non-orthogonal schemes: the BLAST scheme, the Linear Dispersion (LD) code and the Golden code, and we compare their performances to that of Alamouti scheme. Using two receiving antennas, we show that for moderate attenuation on the second antenna and high spectral efficiency, Golden code outperforms other schemes. However, Alamouti scheme presents the best performance for low spectral efficiency and equal received powers or when one antenna is dramatically damaged. When three antennas are used, we show that Golden code offers the highest robustness to power unbalance at the receiving side

cs.NI↗