ONE5G (E2E-aware Optimizations and advancements for the Network Edge of 5G New Radio) is an European funded collaborative project, aiming at designing Radio Access Network (RAN) enhancements to address the multiplicity of services and deployment scenarios for 5G. The project will build upon the specification already defined in 3GPP to propose advanced link techniques and optimization schemes taking into account an end-to-end (E2E) performance view. This paper describes the scenarios considered in the project and the set of uses cases considered, as well as the approach to define Key Performance Indicators reflecting the E2E performance. The technical areas investigated in the project are presented, as well as the planned prototypes.

mmMAGIC (Millimetre-Wave Based Mobile Radio Access Network for Fifth Generation Integrated Communications) is an EU funded 5G-PPP project, whose overall objective is to design and pre-develop a mobile radio access technology (RAT) operating in the 6–100 GHz range, capable of impacting standards and other relevant fora. The focus of the project is on extreme Mobile Broadband, which is expected to drive the 5G requirements for massive increase in capacity and data-rates. This paper elaborates on some 5G key research areas such as: identification of the most compelling use-cases and Key Performance Indicators (KPIs) for future 5G systems, advantages and challenges of millimeter-wave (mmWave) technologies, channel measurements and channel modeling, network architecture; and the design of a new mobile radio interface including multi-node and multi-antenna transceiver architecture.

Non-binary LDPC codes are promising error correcting techniques with very good performance, especially for high order fields. Using higher order fields enhances performance but, at the same time, increases decoding complexity. Several methods have been proposed to reduce this complexity, such as sub-optimal decoding algorithms or techniques aiming at reducing the number of iterations. In this paper, a technique for selective check nodes update is presented enabling a complexity reduction at the level of iteration in the non-binary case. More than 35% of complex updates can be saved in a large SNR region, with parameters that can be tuned according to the desired complexity/performance ratio.

Power Line Communications (PLC) are usually subject to severe degradations, partly due to the channel time dispersion. OFDM is a widely used multicarrier modulation scheme (MCM) for such frequency selective channels, because of the simplicity of the required equalization, and also because of its robustness toward Inter Symbol Interference (ISI), thanks to Cyclic Prefix (CP) insertion. However, other MCM schemes such as OFDM/OQAMcan sometimes be preferred to OFDM, for specific reasons, e.g. time or frequency localization. But, unlike CP-OFDM, OFDM/OQAM exhibits extra ISI and Inter-Carrier Interference (ICI) terms. This paper provides a comparison between both modulation schemes, including coding, for transmission cases where these interference terms cannot be neglected. An accurate Log-Likelihood Ratio calculation is derived for OFDM/OQAM in the case of a transmission through a PLC channel being also impaired by an impulsive noise. Simulation results are reported for a double binary turbo code considering two different block lengths.

Amplitude clipping is one of the ways to fight against transmission impairments due to impulsive noise. In a recent study, in order to cope with empirical threshold determination, we used a Receiver Operating Characteristic (ROC) analysis to derive a closed form expression of the optimal threshold. In this paper we show that this ROC analysis also corresponds to a maximum likelihood (ML) criterion. Then, we evaluate, over power line channels, the efficiency of the clipping operation based on this ML decision. Furthermore, an adaptive scheme is proposed for automatic impulse mitigation over such channels. The adaptive procedure consists in estimating the impulsive noise parameters and updating the clipping threshold through ML optimization. The proposed scheme is finally evaluated over HomePlug AV (HPAV) physical layer.

Non-binary LDPC codes are promising error correcting codes for short and moderate block lengths. These codes demonstrate interesting performances in high order fields, though are more complex to decode. As for binary LDPC codes, decoding scheduling can be optimized to improve performance. In this paper, a simulation-based approach is used for different scheduling policies in the non-binary case in order to point out possible performance gains for these codes. An optimization of decoding scheduling is also proposed and exhibits about 20% complexity reduction in error-floor region, thus promising interesting gains if combined with advanced dynamic scheduling strategies.

The impulsive noise is one of the main reasons for bit or burst errors in power line transmission. The use of a level limiter is a simple and intuitive technique to mitigate the noxious effect of impulsive noise in such channels. However the appropriate threshold determination remains empirical. In this paper, a suitable calculation of the log-likelihood ratio (LLR) for Turbo codes (TC) in an impulsive environment is performed both for BPSK and OFDM systems. As main results of the present work, we first determine the LLR channel value when using a limiter. Furthermore, based on a receiver operating characteristic (ROC) analysis, we derive the optimal detection threshold of the limiter. Finally, the results are validated by simulation with HomePlug AV physical layer specification.

This paper describes a pragmatic approach on the up-conversion of WiMedia compliant UWB signals into the 60 GHz band. This dual band concept is based on propagation measurements at {3.1-10.6} and 60 GHz. Due to stringent frequency regulation, UWB systems operating in the 3.1 to 10.6 GHz bands are both bandwidth limited and power limited. Therefore, many potential users hesitate to deploy this technology. Up-conversion to the 60 GHz band and enhanced baseband parameters can make UWB technology more reliable and hence, more attractive. An experimental system based on a commercially available UWB development kit and IHPpsilas 60 GHz chip-set has been developed. The system architecture is described. Measurement results indicate that this combination may be interesting for many applications.

In this paper we address the problem of flexibility of LDPC decoders in terms of coding rates. The paper introduces a code construction based on structured LDPC codes. The design of the code is performed in close relation with a targeted architecture in order to facilitate implementation at later stage. The proposed solution is based on the transformation of the parity check matrix resulting in a generic representation. This new representation can be used for different codes with distinct coding rates. This concept is illustrated through an example: a multiple-rate decoder is implemented on an hardware prototype and performance results are provided.

In this paper we propose a decoding architecture for turbo-like decoding algorithm of a particular class of Low-Density Parity Check codes. We define a methodology to design codes. In a first step a hardware architecture and the decoding scheduling are first selected. Then rules for the design of these codes are derived, aiming at improving the convergence of the decoding algorithm, while fitting with the proposed architecture. Last, performance results and details on the decoder implementation are provided to illustrate the interest of the approach.

For decades, the de facto standard for forward error correction was a convolutional code decoded with the Viterbi algorithm, often concatenated with another code (e.g., a Reed-Solomon code). But since the introduction of turbo codes in 1993, much more powerful codes referred to collectively as turbo and turbo-like codes have eclipsed classical methods. These powerful error-correcting techniques achieve excellent error-rate performance that can closely approach Shannon's channel capacity limit. The lure of these large coding gains has resulted in their incorporation into a widening array of telecommunications standards and systems. This paper will briefly characterize turbo and turbo-like codes, examine their implications for physical layer system design, and discuss standards and systems where they are being used. The emphasis will be on telecommunications applications, particularly wireless, though others are mentioned. Some thoughts on the use of turbo and turbo-like codes in the future will also be given.

This paper proposes a code design method for a particular class of serial concatenated codes named systematic with serially concatenated parity (S-SCP) codes. Using a particular family of S-SCP codes based on quasi cyclic code, we propose a code design taking into account both implementation and performance requirements. This design enables a particular scheduling of the decoding process enabling the reduction of the number of parallelized processes required to meet a target throughput.

Low-Density Parity Check codes have been widely investigated over the past few years, and construction of Low-Density Parity Check code enabling efficient implementation design represents one of the main topics of interest. This article proposes a new code family, based on a structures code construction with an inherent parallelism. This construction divides the parity check matrix into layers which can be processed simultaneously, improving encoding throughput and latency. Possible optimizations and example are proposed and illustrated.

In this paper, we investigate the performance-complexity trade-off for two leading-edge channel coding techniques, namely duo-binary turbo-codes (DBTC) and block LDPC codes (BLDPCC). We assess their respective decoding complexity in terms power consumption and cycle delays, as a function of both the code rate and packet length, to derive a domain of suitability for both techniques. We also compare their capabilities to serve as mother codes for rate-compatible punctured codes (RCPC) and finally analyze their achievable throughput, as a function of the degree of parallelism.

In this letter, we investigate the design of adaptive space-time codes that exploit partial transmitter channel state information (CSI). We introduce the adaptive space-time parsing paradigm as a generalization of the transmitter selection-diversity approach. We then use this new framework to construct full-diversity adaptive space-time codes for delay-limited applications with fixed-rate transmission. The proposed codes allow for reduced-complexity decoders and are robust to inaccuracies in the transmitter CSI.