8,148 research outputs found

    Near-capacity iterative decoding of binary self-concatenated codes using soft decision demapping and 3-D EXIT charts

    No full text
    In 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 code design and its application in power-efficient cooperative communications

    No full text
    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

    Millimeter-wave enabled PAM-4 data transmission over hybrid FSO-MMPOF link for access networks

    No full text
    In this paper, we propose a full duplex architecture based on a hybrid link composed of free space optics (FSO) and multimode plastic optical fiber (MMPOF) for short range wireless access networks. The proposed architecture employs mode group division multiplexing (MGDM) and wavelength reuse techniques to transmit data between central unit (CU) and radio access units (RAUs). An optical frequency comb source to generate multiple optical sidebands is realized by using a single laser source to provide 60 GHz millimeter-wave (mm-wave) signals at each RAU by simultaneously transmitting PAM-4 signal on linearly polarized (LP) modes of each optical sideband. Data rate of 2x12 Gbps at mm-wave frequency of 60 GHz is achieved for both downlink (DL) and uplink (UL) transmissions. The transmission of 2x12 Gbps PAM-4 signal over hybrid FSO-MMPOF link is investigated at different values of refractive index structure parameter (C^2_n ) by employing log-normal (LN) FSO channel model to support three RAUs in a ring topology. The acceptable receiver sensitivities below -5 dBm and -0.6 dBm for DL and UL transmissions are achieved, respectively. The proposed hybrid architecture can be a potential candidate for future communication networks

    EXIT Chart Aided Design of Near-Capacity Self-Concatenated Trellis Coded Modulation Using Iterative Decoding,

    No full text
    In 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

    Pioneers of Library Movement in Pakistan

    No full text
    The paper aims to describe in brief the contribution of seven leaders of Pakistan librarianship, viz. K.B. Khalifa M. Asadullah, Prof. Dr. Abdul Moid, Dr. Abdus Subuh Qasimi, Muhammad Shafi, Fazal Elahi, Khawaja Nur Elahi and S. V. Hussain. The early library developments are given for better understanding of the role of these leaders

    Self-concatenated coding for wireless communication systems

    No full text
    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

    H.264 wireless video telephony using iteratively-detected binary self-concatenated coding

    No full text
    In 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

    Relay node selection and power allocation for distributed self-concatenated convolutional codes

    No full text
    In this contribution, the performance of a Distributed Self-Concatenated Convolutional Coding (DSECCC) scheme is analyzed by using Iterative Decoding (ID) for cooperative communications (CC) with the aid of relay selection (RS) and power allocation (PA). In the RS based DSECCC-ID scheme, where the transmit Signal to Noise power Ratio (SNR) is equal for both source and relay, we can achieve the minimum value of the required SNR at both destination and relay simultaneously by choosing a relay at an appropriate geographical location. By contrast, in the PA based DSECCC-ID scheme, where the position of the relay is in the middle, minimum required transmit SNRs are used both at the source and the relay. These schemes are analyzed with the help of binary Extrinsic Information Transfer (EXIT) charts. From our simulation results, we found that the RS based DSECCC-ID scheme outperforms the PA based DSECCC-ID scheme

    Superposition Coding Aided Bi-directional Relay Transmission Employing Iteratively Decoded Self-Concatenated Convolutional Codes

    No full text
    In 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

    Distributed Self-Concatenated Coding for Cooperative Communication

    No full text
    In 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
    corecore