356 research outputs found
Self-concatenated coding for wireless communication systems
In this thesis, we have explored self-concatenated coding schemes that are designed for transmission over Additive White Gaussian Noise (AWGN) and uncorrelated Rayleigh fading channels. We designed both the symbol-based Self-ConcatenatedCodes considered using Trellis Coded Modulation (SECTCM) and bit-based Self- Concatenated Convolutional Codes (SECCC) using a Recursive Systematic Convolutional (RSC) encoder as constituent codes, respectively. The design of these codes was carried out with the aid of Extrinsic Information Transfer (EXIT) charts. The EXIT chart based design has been found an efficient tool in finding the decoding convergence threshold of the constituent codes. Additionally, in order to recover the information loss imposed by employing binary rather than non-binary schemes, a soft decision demapper was introduced in order to exchange extrinsic information withthe SECCC decoder. To analyse this information exchange 3D-EXIT chart analysis was invoked for visualizing the extrinsic information exchange between the proposed Iteratively Decoding aided SECCC and soft-decision demapper (SECCC-ID). Some of the proposed SECTCM, SECCC and SECCC-ID schemes perform within about 1 dB from the AWGN and Rayleigh fading channels’ capacity. A union bound analysis of SECCC codes was carried out to find the corresponding Bit Error Ratio (BER) floors. The union bound of SECCCs was derived for communications over both AWGN and uncorrelated Rayleigh fading channels, based on a novel interleaver concept.Application of SECCCs in both UltraWideBand (UWB) and state-of-the-art video-telephone schemes demonstrated its practical benefits.In order to further exploit the benefits of the low complexity design offered by SECCCs we explored their application in a distributed coding scheme designed for cooperative communications, where iterative detection is employed by exchanging extrinsic information between the decoders of SECCC and RSC at the destination. In the first transmission period of cooperation, the relay receives the potentially erroneous data and attempts to recover the information. The recovered information is then re-encoded at the relay using an RSC encoder. In the second transmission period this information is then retransmitted to the destination. The resultant symbols transmitted from the source and relay nodes can be viewed as the coded symbols of a three-component parallel-concatenated encoder. At the destination a Distributed Binary Self-Concatenated Coding scheme using Iterative Decoding (DSECCC-ID) was employed, where the two decoders (SECCC and RSC) exchange their extrinsic information. It was shown that the DSECCC-ID is a low-complexity scheme, yet capable of approaching the Discrete-input Continuous-output Memoryless Channels’s (DCMC) capacity.Finally, we considered coding schemes designed for two nodes communicating with each other with the aid of a relay node, where the relay receives information from the two nodes in the first transmission period. At the relay node we combine a powerful Superposition Coding (SPC) scheme with SECCC. It is assumed that decoding errors may be encountered at the relay node. The relay node then broadcasts this information in the second transmission period after re-encoding it, again, using a SECCC encoder. At the destination, the amalgamated block of Successive Interference Cancellation (SIC) scheme combined with SECCC then detects and decodes the signal either with or without the aid of a priori information. Our simulation results demonstrate that the proposed scheme is capable of reliably operating at a low BER for transmission over both AWGN and uncorrelated Rayleigh fading channels. We compare the proposed scheme’s performance to a direct transmission link between the two sources having the same throughput
Efficient systematic turbo polar decoding based on optimized scaling factor and early termination mechanism
In this paper, an efficient early termination (ET) mechanism for systematic turbo-polar code (STPC) based on optimal estimation of scaling factor (SF) is proposed. The gradient of the regression line which best fits the distance between a priori and extrinsic information is used to estimate the SF. The multiplication of the extrinsic information by the proposed SF presents effectiveness in resolving the correlation issue between intrinsic and extrinsic reliability information traded between the two typical parallel concatenated soft-cancellation (SCAN) decoders. It is shown that the SF has improved the conventional STPC by about 0.3 dB with an interleaver length of 64 bits, and about 1 dB over the systematic polar code (SPC) at a bit error rate (BER) of . A new scheme is proposed as a stopping criterion, which is mainly based on the estimated value of SF at the second component decoder and the decoded frozen bits for each decoding iteration. It is shown that the proposed ET results in halving the average number of iterations (ANI) without adding considerable complexity. Moreover, the modified codes present comparable results in terms of BER to the codes that utilize fix number of iterations
Uplink CoMP under a Constrained Backhaul and Imperfect Channel Knowledge
Coordinated Multi-Point (CoMP) is known to be a key technology for next
generation mobile communications systems, as it allows to overcome the burden
of inter-cell interference. Especially in the uplink, it is likely that
interference exploitation schemes will be used in the near future, as they can
be used with legacy terminals and require no or little changes in
standardization. Major drawbacks, however, are the extent of additional
backhaul infrastructure needed, and the sensitivity to imperfect channel
knowledge. This paper jointly addresses both issues in a new framework
incorporating a multitude of proposed theoretical uplink CoMP concepts, which
are then put into perspective with practical CoMP algorithms. This
comprehensive analysis provides new insight into the potential usage of uplink
CoMP in next generation wireless communications systems.Comment: Submitted to IEEE Transactions on Wireless Communications in February
201
Exploiting 2-Dimensional Source Correlation in Channel Decoding with Parameter Estimation
Traditionally, it is assumed that source coding is perfect and therefore, the redundancy of the source encoded bit-stream is zero. However, in reality, this is not the case as the existing source encoders are imperfect and yield residual redundancy at the output. The residual redundancy can be exploited by using Joint Source Channel Coding (JSCC) with Markov chain as the source. In several studies, the statistical knowledge of the sources has been assumed to be perfectly available at the receiver. Although the result was better in terms of the BER performance, practically, the source correlation knowledge were not always available at the receiver and thus, this could affect the reliability of the outcome. The source correlation on all rows and columns of the 2D sources were well exploited by using a modified Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm in the decoder. A parameter estimation technique was used jointly with the decoder to estimate the source correlation knowledge. Hence, this research aims to investigate the parameter estimation for 2D JSCC system which reflects a practical scenario where the source correlation knowledge are not always available. We compare the performance of the proposed joint decoding and estimation technique with the ideal 2D JSCC system with perfect knowledge of the source correlation knowledge. Simulation results reveal that our proposed coding scheme performs very close to the ideal 2D JSCC system
Self-concatenated code design and its application in power-efficient cooperative communications
In this tutorial, we have focused on the design of binary self-concatenated coding schemes with the help of EXtrinsic Information Transfer (EXIT) charts and Union bound analysis. The design methodology of future iteratively decoded self-concatenated aided cooperative communication schemes is presented. In doing so, we will identify the most important milestones in the area of channel coding, concatenated coding schemes and cooperative communication systems till date and suggest future research directions
Channel Coding in Molecular Communication
This dissertation establishes and analyzes a complete molecular transmission system from
a communication engineering perspective. Its focus is on diffusion-based molecular communication
in an unbounded three-dimensional fluid medium. As a basis for the investigation
of transmission algorithms, an equivalent discrete-time channel model (EDTCM) is developed
and the characterization of the channel is described by an analytical derivation, a
random walk based simulation, a trained artificial neural network (ANN), and a proof of
concept testbed setup. The investigated transmission algorithms cover modulation schemes
at the transmitter side, as well as channel equalizers and detectors at the receiver side.
In addition to the evaluation of state-of-the-art techniques and the introduction of orthogonal
frequency-division multiplexing (OFDM), the novel variable concentration shift
keying (VCSK) modulation adapted to the diffusion-based transmission channel, the lowcomplex
adaptive threshold detector (ATD) working without explicit channel knowledge,
the low-complex soft-output piecewise linear detector (PLD), and the optimal a posteriori
probability (APP) detector are of particular importance and treated. To improve the
error-prone information transmission, block codes, convolutional codes, line codes, spreading
codes and spatial codes are investigated. The analysis is carried out under various
approaches of normalization and gains or losses compared to the uncoded transmission are
highlighted. In addition to state-of-the-art forward error correction (FEC) codes, novel line
codes adapted to the error statistics of the diffusion-based channel are proposed. Moreover,
the turbo principle is introduced into the field of molecular communication, where extrinsic
information is exchanged iteratively between detector and decoder. By means of an extrinsic
information transfer (EXIT) chart analysis, the potential of the iterative processing is
shown and the communication channel capacity is computed, which represents the theoretical
performance limit for the system under investigation. In addition, the construction of an
irregular convolutional code (IRCC) using the EXIT chart is presented and its performance
capability is demonstrated. For the evaluation of all considered transmission algorithms the
bit error rate (BER) performance is chosen. The BER is determined by means of Monte
Carlo simulations and for some algorithms by theoretical derivation
- …