251 research outputs found
On generalized LDPC codes for ultra reliable communication
Ultra reliable low latency communication (URLLC) is an important feature in
future mobile communication systems, as they will require high data rates, large
system capacity and massive device connectivity [11]. To meet such stringent
requirements, many error-correction codes (ECC)s are being investigated; turbo
codes, low density parity check (LDPC) codes, polar codes and convolutional codes
[70, 92, 38], among many others. In this work, we present generalized low density
parity check (GLDPC) codes as a promising candidate for URLLC.
Our proposal is based on a novel class of GLDPC code ensembles, for which
new analysis tools are proposed. We analyze the trade-o_ between coding rate and
asymptotic performance of a class of GLDPC codes constructed by including a
certain fraction of generalized constraint (GC) nodes in the graph. To incorporate
both bounded distance (BD) and maximum likelihood (ML) decoding at GC nodes
into our analysis without resorting to multi-edge type of degree distribution (DD)s,
we propose the probabilistic peeling decoding (P-PD) algorithm, which models the
decoding step at every GC node as an instance of a Bernoulli random variable with
a successful decoding probability that depends on both the GC block code as well
as its decoding algorithm. The P-PD asymptotic performance over the BEC can
be efficiently predicted using standard techniques for LDPC codes such as Density
evolution (DE) or the differential equation method. We demonstrate that the
simulated P-PD performance accurately predicts the actual performance of the
GLPDC code under ML decoding at GC nodes. We illustrate our analysis for
GLDPC code ensembles with regular and irregular DDs.
This design methodology is applied to construct practical codes for URLLC.
To this end, we incorporate to our analysis the use of quasi-cyclic (QC) structures,
to mitigate the code error floor and facilitate the code very large scale integration
(VLSI) implementation. Furthermore, for the additive white Gaussian noise
(AWGN) channel, we analyze the complexity and performance of the message
passing decoder with various update rules (including standard full-precision sum product and min-sum algorithms) and quantization schemes. The block error rate
(BLER) performance of the proposed GLDPC codes, combined with a complementary
outer code, is shown to outperform a variety of state-of-the-art codes, for
URLLC, including LDPC codes, polar codes, turbo codes and convolutional codes,
at similar complexity rates.Programa Oficial de Doctorado en Multimedia y ComunicacionesPresidente: Juan José Murillo Fuentes.- Secretario: Matilde Pilar Sánchez Fernández.- Vocal: Javier Valls Coquilla
Link level imuslations for 5G remote area scenario
Abstract. The main object of this thesis is to utilize the Vienna 5G link-level simulator and to introduce modifications which are needed to include new scenarios, such as remote area case. The Vienna 5G link-level simulator is a simulation platform for promoting 5th generation (5G) research and development for the mobile communications system. This work gives a general overview of the link-level simulator platform to evaluate the average performance of the 5G physical layer (PHY) schemes.
In many places across the world, there is no reliable internet connectivity in remote areas. Remote area connectivity is a kind of "missing scenario" of standard 5G solution, which focuses on improved data rate, latency, and massive internet of things (IoT). This work addresses views of connectivity in remote areas with 5G solutions, focusing on wireless radio technologies. The study of 5G physical layer performance evaluation is performed for downlink transmission using single-input and single-output (SISO) techniques. This thesis focused on the performance of waveforms, which can be effectively used in remote area communication systems. The analysis of the simulation results signifies that generalized frequency division multiplexing (GFDM) would be the better option for remote area communication than other waveforms investigated in this study. This work also focused on the performance of channel coding schemes in order to determine the appropriate channel coding scheme for the 5G mobile communication system for medium length message transmission in remote area communication. The polar code appears to be the best possible channel code for medium-length message data transmission in remote areas based on the study of channel coding schemes
Waveforms and channel coding for 5G
Abstract. The fifth generation (5G) communication systems are required to perform significantly better than the existing fourth generation (4G) systems in data rate, capacity, coverage, latency, energy consumption and cost. Hence, 5G needs to achieve considerable enhancements in the areas of bandwidth, spectral, energy, and signaling efficiencies and cost per bit. The new radio access technology (RAT) of 5G physical layer needs to utilize an efficient waveform to meet the demands of 5G. Orthogonal frequency division multiplexing (OFDM) is considered as a baseline for up to 30 GHz. However, a major drawback of OFDM systems is their large peak to average power ratio (PAPR). Here in this thesis, a simple selective-mapping (SLM) technique using scrambling is proposed to reduce the PAPR of OFDM signals. This technique selects symbol sequences with high PAPR and scrambles them until a PAPR sequence below a specific threshold is generated. The computational complexity of the proposed scheme is considerably lower than that of the traditional SLM. Also, performance of the system is investigated through simulations and more than 4.5 dB PAPR reduction is achieved. In addition, performance of single carrier waveforms is analyzed in multiple-input multiple-output (MIMO) systems as an alternative to OFDM. Performance of a single carrier massive MIMO system is presented for both uplink and downlink with single user and multiple user cases and the effect of pre-coding on the PAPR is studied. A variety of channel configurations were investigated such as correlated channels, practical channels and the channels with errors in channel estimate. Furthermore, the candidate coding schemes are investigated for the new RAT in the 5G standard corresponding the activities in the third generation partnership project (3GPP). The schemes are evaluated in terms of block error rate (BLER), bit error rate (BER), computational complexity, and flexibility. These parameters comprise a suitable set to assess the performance of different services and applications. Turbo, low density parity check (LDPC), and polar codes are considered as the candidate schemes. These are investigated in terms of obtaining suitable rates, block lengths by proper design for a fair comparison. The simulations have been carried out in order to obtain BLER / BER performance for various code rates and block lengths, in additive white Gaussian noise (AWGN) channel. Although polar codes perform well at short block lengths, LDPC has a relatively good performance at all the block lengths and code rates. In addition, complexity of the LDPC codes is relatively low. Furthermore, BLER/BER performances of the coding schemes in Rayleigh fading channels are investigated and found that the fading channel performance follows a similar trend as the performance in the AWGN channel
A Survey of Physical Layer Security Techniques for 5G Wireless Networks and Challenges Ahead
Physical layer security which safeguards data confidentiality based on the
information-theoretic approaches has received significant research interest
recently. The key idea behind physical layer security is to utilize the
intrinsic randomness of the transmission channel to guarantee the security in
physical layer. The evolution towards 5G wireless communications poses new
challenges for physical layer security research. This paper provides a latest
survey of the physical layer security research on various promising 5G
technologies, including physical layer security coding, massive multiple-input
multiple-output, millimeter wave communications, heterogeneous networks,
non-orthogonal multiple access, full duplex technology, etc. Technical
challenges which remain unresolved at the time of writing are summarized and
the future trends of physical layer security in 5G and beyond are discussed.Comment: To appear in IEEE Journal on Selected Areas in Communication
Short Codes with Mismatched Channel State Information: A Case Study
The rising interest in applications requiring the transmission of small
amounts of data has recently lead to the development of accurate performance
bounds and of powerful channel codes for the transmission of short-data packets
over the AWGN channel. Much less is known about the interaction between error
control coding and channel estimation at short blocks when transmitting over
channels with states (e.g., fading channels, phase-noise channels, etc...) for
the setup where no a priori channel state information (CSI) is available at the
transmitter and the receiver. In this paper, we use the mismatched-decoding
framework to characterize the fundamental tradeoff occurring in the
transmission of short data packet over an AWGN channel with unknown gain that
stays constant over the packet. Our analysis for this simplified setup aims at
showing the potential of mismatched decoding as a tool to design and analyze
transmission strategies for short blocks. We focus on a pragmatic approach
where the transmission frame contains a codeword as well as a preamble that is
used to estimate the channel (the codeword symbols are not used for channel
estimation). Achievability and converse bounds on the block error probability
achievable by this approach are provided and compared with simulation results
for schemes employing short low-density parity-check codes. Our bounds turn out
to predict accurately the optimal trade-off between the preamble length and the
redundancy introduced by the channel code.Comment: 5 pages, 5 figures, to appear in Proceedings of the IEEE
International Workshop on Signal Processing Advances in Wireless
Communications (SPAWC 2017
Low-Complexity Joint Channel Estimation and List Decoding of Short Codes
A pilot-assisted transmission (PAT) scheme is proposed for short
blocklengths, where the pilots are used only to derive an initial channel
estimate for the list construction step. The final decision of the message is
obtained by applying a non-coherent decoding metric to the codewords composing
the list. This allows one to use very few pilots, thus reducing the channel
estimation overhead. The method is applied to an ordered statistics decoder for
communication over a Rayleigh block-fading channel. Gains of up to dB as
compared to traditional PAT schemes are demonstrated for short codes with QPSK
signaling. The approach can be generalized to other list decoders, e.g., to
list decoding of polar codes.Comment: Accepted at the 12th International ITG Conference on Systems,
Communications and Coding (SCC 2019), Rostock, German
Decoding of Non-Binary LDPC Codes Using the Information Bottleneck Method
Recently, a novel lookup table based decoding method for binary low-density
parity-check codes has attracted considerable attention. In this approach,
mutual-information maximizing lookup tables replace the conventional operations
of the variable nodes and the check nodes in message passing decoding.
Moreover, the exchanged messages are represented by integers with very small
bit width. A machine learning framework termed the information bottleneck
method is used to design the corresponding lookup tables. In this paper, we
extend this decoding principle from binary to non-binary codes. This is not a
straightforward extension, but requires a more sophisticated lookup table
design to cope with the arithmetic in higher order Galois fields. Provided bit
error rate simulations show that our proposed scheme outperforms the log-max
decoding algorithm and operates close to sum-product decoding.Comment: This paper has been presented at IEEE International Conference on
Communications (ICC'19) in Shangha
- …