1,720,977 research outputs found
Self-concatenated code design and its application in power-efficient cooperative communications
No full textIn 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
Near-capacity iterative decoding of binary self-concatenated codes using soft decision demapping and 3-D EXIT charts
Full text linkIn this paper 3-D Extrinsic Information Transfer (EXIT) charts are used to design binary Self-Concatenated Convolutional Codes employing Iterative Decoding (SECCC-ID), exchanging extrinsic information with the soft-decision demapper to approach the channel capacity. Recursive Systematic Convolutional (RSC) codes are selected as constituent codes, an interleaver is used for randomising the extrinsic information exchange of the constituent codes, while a puncturer helps to increase the achievable bandwidth efficiency. The convergence behaviour of the decoder is analysed with the aid of bit-based 3-D EXIT charts, for accurately calculating the operating EbN0 threshold, especially when SP based soft demapper is employed. Finally, we propose an attractive system configuration, which is capable of operating within about 1 dB from the channel capacity
Self-concatenated coding for wireless communication systems
No full textIn 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
Distributed Self-Concatenated Coding for Cooperative Communication
No full textIn this paper, we propose a power-efficient distributed binary self-concatenated coding scheme using iterative decoding (DSECCC-ID) for cooperative communications. The DSECCC-ID scheme is designed with the aid of binary extrinsic information transfer (EXIT) charts. The source node transmits self-concatenated convolutional coded (SECCC) symbols to both the relay and destination nodes during the first transmission period. The relay performs SECCC-ID decoding, where it mayor may not encounter decoding errors. It then reencodes the information bits using a recursive systematic convolutional (RSC) code during the second transmission period. 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 node, three-component DSECCC-ID decoding is performed. The EXIT chart gives us an insight into operation of the distributed coding scheme, which enables us to significantly reduce the transmit power by about 3.3 dB in signal-to-noise ratio (SNR) terms, as compared with a noncooperative SECCC-ID scheme at a bit error rate (BER) of 10-5. Finally, the proposed system is capable of performing within about 1.5 dB from the two-hop relay-aided network’s capacity at a BER of 10-5 , even if there may be decoding errors at the relay
EXIT Chart Aided Design of Near-Capacity Self-Concatenated Trellis Coded Modulation Using Iterative Decoding,
Full text linkIn this contribution we design the Iteratively Decoded Self-Concatenated Convolutional Codes (SECCC-ID) using Extrinsic Information Transfer (EXIT) charts. Good constituent Trellis Coded Modulation (TCM) codes are selected for communicating over both uncorrelated Rayleigh fading and Additive White Gaussian Noise (AWGN) channels. At the receiver iterative decoding is invoked for exchanging extrinsic information between the hypothetical decoder components. The convergence behaviour of the decoder is analysed with the aid of symbol-based EXIT charts. Similarly, the search for the best TCM constituent codes is also based on EXIT chart analysis. Finally, we demonstrate that the selected codes are capable of operating within 1 dB from the maximum achievable rate
H.264 wireless video telephony using iteratively-detected binary self-concatenated coding
Full text linkIn this contribution we propose a robust H.264 coded wireless video transmission scheme using iteratively decoded self-concatenated convolutional coding (SECCC). The proposed SECCC scheme is composed of constituent recursive systematic convolutional (RSC) codes and an interleaver is used to randomise the extrinsic information exchanged between the constituent RSC codes. Additionally, a puncturer is used to increase the achievable bandwidth efficiency. At the receiver self-iterative decoding is invoked between the hypothetical decoder components. The performance of the system was evaluated using the H.264/AVC source codec for interactive video telephony. Furthermore, EXIT charts were utilised in order to analyse the convergence behaviour of the SECCC scheme advocated. We demonstrate the efficiency of this approach by showing that the video quality is significantly improved, when using the binary SECCC scheme. More explicitly, the proposed system exhibits an Eb /N0 gain of 6 dB at the PSNR degradation point of 2 dB in comparison to the identical-rate benchmarker carrying out RSC coding and puncturing, while communicating over correlated Rayleigh fading channels
Superposition Coding Aided Bi-directional Relay Transmission Employing Iteratively Decoded Self-Concatenated Convolutional Codes
No full textIn this paper, we consider coding schemes designed for two nodes communicating with each other with the aid of a relay node, which receives information from the two nodes in the first time slot. At the relay node we combine a powerful Superposition Coding (SPC) scheme with Iteratively Decoded Self-Concatenated Convolutional Codes (SECCC-ID), which exchange mutual information between each other. It is assumed that decoding errors may be encountered at the relay node. The relay node then broadcasts this information in the second time slot after re-encoding it, again, using a SECCC encoder. At the destination, an amalgamated SPC-SECCC block 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. Additionally, the SPC-SECCC system achieves a low BER even for realistic error-infested relaying
Performance analysis of high throughput MAP decoder for turbo codes and self concatenated convolutional codes
No full textThe effect of parallelism on Bit Error Rate (BER) performance of Turbo Code (TC) and Self Concatenated Convolutional Code (SECCC) with different levels of parallelism and frame sizes is investigated. Next Iteration Initialization (NII) method is employed for mitigating the BER degradation resulting from increased parallelism. In order to analyze and compare the architectural performance of both schemes, this paper presents the Very High Speed Integrated Circuit Hardware Description Language (VHDL) design of Maximum Aposteriori Probability (MAP) decoder for TC and SECCC, both employing the same constituent code. The simulation results show that for BER of 10−4, without parallelism, TC is 0.4 dB superior to SECCC, whereas, with parallelism of 64, the difference in performance between both schemes reduces to 0.25 dB. It is found that SECCC outperforms TC for frame sizes less than or equal to 2048 bits, when invoking a parallelism of 16, 32 and 64. The BER performance of both schemes shows that SECCC outperforms TC at parallelism of 256 by 0.3 dB at BER of 10−4. Hence, for high throughput architectures employing higher parallelism (beyond 64 and 128) without significant degradation in BER performance, SECCC performs better than TC. The synthesis results of VHDL design of the MAP decoder obtained using Xilinx ISE verify that both schemes have equal clock frequency and resource consumption. It is demonstrated that the MAP decoder achieves the clock frequency of 86.3 MHz which is capable of producing a throughput of 691 Mbps using parallelism of 64
Analog radio over fiber aided C-RAN: optical aided beamforming for multi-user adaptive MIMO design
No full textGiven the increasing demand for high data-rate, high-performance wireless communications services, the demand on the radio access networks (RAN) has been increasing significantly, where optical fiber has been widely used both for the backhaul and fronthaul. Additionally, advances in signal processing such as multiple-input multiple-output (MIMO) techniques, have improved the performance as well as transmission rate of communications networks. Beamforming has been used as an efficient MIMO technique for providing a signal to noise ratio (SNR) gain as well as reducing the multi-user interference. However, beamforming requires the employment of phase-shifters, which suffers from reduced phase resolutions, degraded noise figures as well as beam-squinting in addition to the implementation challenges. Hence, in this paper we employ an analogue radio over fiber (A-RoF) aided architecture for supporting the requirements of the current and future mobile networks, where we design a photonics aided beamforming technique in order to eliminate the bulky electronic phase-shifters and the beam-squinting effect, while also providing a low-cost RAN solution. Additionally, this photonics aided beamforming is combined with a reconfigurable multi-user MIMO technique, where users can communicate with one or multiple remote radio heads (RRHs), while employing stand-alone beamforming, beamforming combined with diversity or with multiplexing depending on the available resources and the user channel information as well as the quality of service requirements
- …
