185 research outputs found

    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

    Space-Time Codes Concatenated with Turbo Codes over Fading Channels

    Get PDF
    The uses of space-time code (STC) and iterative processing have enabled robust communications over fading channels at previously unachievable signal-to-noise ratios. Maintaining desired transmission rate while improving the diversity from STC is challenging, and the performance of the STC suffers considerably due to lack of channel state information (CSI). This dissertation research addresses issues of considerable importance in the design of STC with emphasis on efficient concatenation of channel coding and STC with theoretical bound derivation of the proposed schemes, iterative space-time trellis coding (STTC), and differential space-time codes. First, we concatenate space-time block code (STBC) with turbo code for improving diversity gain as well as coding gain. Proper soft-information sharing is indispensable to the iterative decoding process. We derive the required soft outputs from STBC decoders for passing to outer turbo code. Traditionally, the performance of STBC schemes has been evaluated under perfect channel estimation. For fast time-varying channel, obtaining the CSI is tedious if not impossible. We introduce a scheme of calculating the CSI at the receiver from the received signal without the explicit channel estimation. The encoder of STTC, which is generally decoded using Viterbi like algorithm, is based on a trellis structure. This trellis structure provides an inherent advantage for the STTC scheme that an iterative decoding is feasible with the minimal addition computational complexity. An iteratively decoded space-time trellis coding (ISTTC) is proposed in this dissertation, where the STTC schemes are used as constituent codes of turbo code. Then, the performance upper bound of the proposed ISTTC is derived. Finally, for implementing STBC without channel estimation and maintaining trans- mission rate, we concatenate differential space-time block codes (DSTBC) with ISTTC. The serial concatenation of DSTBC or STBC with ISTTC offers improving performance, even without an outer channel code. These schemes reduce the system complexity com- pared to the standalone ISTTC and increase the transmission rate under the same SNR condition. Detailed design procedures of these proposed schemes are analyzed

    Iteratively Decoded Irregular Variable Length Coding and Sphere-Packing Modulation-Aided Differential Space-Time Spreading

    No full text
    In this paper we consider serially concatenated and iteratively decoded Irregular Variable Length Coding (IrVLC) combined with precoded Differential Space-Time Spreading (DSTS) aided multidimensional Sphere Packing (SP) modulation designed for near-capacity joint source and channel coding. The IrVLC scheme comprises a number of component Variable Length Coding (VLC) codebooks having different coding rates for the sake of encoding particular fractions of the input source symbol stream. The relative length of these source-stream fractions can be chosen with the aid of EXtrinsic Information Transfer (EXIT) charts in order to shape the EXIT curve of the IrVLC codec, so that an open EXIT chart tunnel may be created even at low Eb/N0 values that are close to the capacity bound of the channel. These schemes are shown to be capable of operating within 0.9 dB of the DSTS-SP channel’s capacity bound using an average interleaver length of 113, 100 bits and an effective bandwidth efficiency of 1 bit/s/Hz, assuming ideal Nyquist filtering. By contrast, the equivalent-rate regular VLC-based benchmarker scheme was found to be capable of operating at 1.4 dB from the capacity bound, which is about 1.56 times the corresponding discrepancy of the proposed IrVLC-aided scheme

    Hybrid ARQ with parallel and serial concatenated convolutional codes for next generation wireless communications

    Get PDF
    This research focuses on evaluating the currently used FEC encoding-decoding schemes and improving the performance of error control systems by incorporating these schemes in a hybrid FEC-ARQ environment. Beginning with an overview of wireless communications and the various ARQ protocols, the thesis provides an in-depth explanation of convolutional encoding and Viterbi decoding, turbo (PCCC) and serial concatenated convolutional (SCCC) encoding with their respective MAP decoding strategies.;A type-II hybrid ARQ scheme with SCCCs is proposed for the first time and is a major contribution of this thesis. A vast improvement is seen in the BER performance of the successive individual FEC schemes discussed above. Also, very high throughputs can be achieved when these schemes are incorporated in an adaptive type-II hybrid ARQ system.;Finally, the thesis discusses the equivalence of the PCCCs and the SCCCs and proposes a technique to generate a hybrid code using both schemes

    Residue number system coded differential space-time-frequency coding.

    Get PDF
    Thesis (Ph.D.)-University of KwaZulu-Natal, Durban, 2007.The rapidly growing need for fast and reliable transmission over a wireless channel motivates the development of communication systems that can support high data rates at low complexity. Achieving reliable communication over a wireless channel is a challenging task largely due to the possibility of multipaths which may lead to intersymbol interference (ISI). Diversity techniques such as time, frequency and space are commonly used to combat multipath fading. Classical diversity techniques use repetition codes such that the information is replicated and transmitted over several channels that are sufficiently spaced. In fading channels, the performance across some diversity branches may be excessively attenuated, making throughput unacceptably small. In principle, more powerful coding techniques can be used to maximize the diversity order. This leads to bandwidth expansion or increased transmission power to accommodate the redundant bits. Hence there is need for coding and modulation schemes that provide low error rate performance in a bandwidth efficient manner. If diversity schemes are combined, more independent dimensions become available for information transfer. The first part of the thesis addresses achieving temporal diversity through employing error correcting coding schemes combined with interleaving. Noncoherent differential modulation does not require explicit knowledge or estimate of the channel, instead the information is encoded in the transitions. This lends itself to the possibility of turbo-like serial concatenation of a standard outer channel encoder with an inner modulation code amenable to noncoherent detection through an interleaver. An iterative approach to joint decoding and demodulation can be realized by exchanging soft information between the decoder and the demodulator. This has been shown to be effective and hold hope for approaching capacity over fast fading channels. However most of these schemes employ low rate convolutional codes as their channel encoders. In this thesis we propose the use of redundant residue number system codes. It is shown that these codes can achieve comparable performance at minimal complexity and high data rates. The second part deals with the possibility of combining several diversity dimensions into a reliable bandwidth efficient communication scheme. Orthogonal frequency division multiplexing (OFDM) has been used to combat multipaths. Combining OFDM with multiple-input multiple-output (MIMO) systems to form MIMO-OFDM not only reduces the complexity by eliminating the need for equalization but also provides large channel capacity and a high diversity potential. Space-time coded OFDM was proposed and shown to be an effective transmission technique for MIMO systems. Spacefrequency coding and space-time-frequency coding were developed out of the need to exploit the frequency diversity due to multipaths. Most of the proposed schemes in the literature maximize frequency diversity predominantly from the frequency-selective nature of the fading channel. In this thesis we propose the use of residue number system as the frequency encoder. It is shown that the proposed space-time-frequency coding scheme can maximize the diversity gains over space, time and frequency domains. The gain of MIMO-OFDM comes at the expense of increased receiver complexity. Furthermore, most of the proposed space-time-frequency coding schemes assume frequency selective block fading channels which is not an ideal assumption for broadband wireless communications. Relatively high mobility in broadband wireless communications systems may result in high Doppler frequency, hence time-selective (rapid) fading. Rapidly changing channel characteristics impedes the channel estimation process and may result in incorrect estimates of the channel coefficients. The last part of the thesis deals with the performance of differential space-time-frequency coding in fast fading channels

    MIMO-aided near-capacity turbo transceivers: taxonomy and performance versus complexity

    No full text
    In this treatise, we firstly review the associated Multiple-Input Multiple-Output (MIMO) system theory and review the family of hard-decision and soft-decision based detection algorithms in the context of Spatial Division Multiplexing (SDM) systems. Our discussions culminate in the introduction of a range of powerful novel MIMO detectors, such as for example Markov Chain assisted Minimum Bit-Error Rate (MC-MBER) detectors, which are capable of reliably operating in the challenging high-importance rank-deficient scenarios, where there are more transmitters than receivers and hence the resultant channel-matrix becomes non-invertible. As a result, conventional detectors would exhibit a high residual error floor. We then invoke the Soft-Input Soft-Output (SISO) MIMO detectors for creating turbo-detected two- or three-stage concatenated SDM schemes and investigate their attainable performance in the light of their computational complexity. Finally, we introduce the powerful design tools of EXtrinsic Information Transfer (EXIT)-charts and characterize the achievable performance of the diverse near- capacity SISO detectors with the aid of EXIT charts

    Dispensing with channel estimation: differentially modulated cooperative wireless communications

    No full text
    As a benefit of bypassing the potentially excessive complexity and yet inaccurate channel estimation, differentially encoded modulation in conjunction with low-complexity noncoherent detection constitutes a viable candidate for user-cooperative systems, where estimating all the links by the relays is unrealistic. In order to stimulate further research on differentially modulated cooperative systems, a number of fundamental challenges encountered in their practical implementations are addressed, including the time-variant-channel-induced performance erosion, flexible cooperative protocol designs, resource allocation as well as its high-spectral-efficiency transceiver design. Our investigations demonstrate the quantitative benefits of cooperative wireless networks both from a pure capacity perspective as well as from a practical system design perspective

    Single-RF spatial modulation requires single-carrier transmission: frequency-domain turbo equalization for dispersive channels

    No full text
    In this paper, we propose a broadband single-carrier (SC) spatial-modulation (SM) based multiple-input multipleoutput (MIMO) architecture relying on a soft-decision (SoD) frequency-domain equalization (FDE) receiver. We demonstrate that conventional orthogonal frequency-division multiplexing (OFDM)-based broadband transmissions are not readily suitable for the single–radio frequency (RF) assisted SM-MIMO schemes, since this scheme does not exhibit any substantial performance advantage over single-antenna transmissions. To circumvent this limitation, a low-complexity soft-decision (SoD) FDE algorithm based on the minimum mean-square error (MMSE) criterion is invoked for our broadband SC-based SM-MIMO scheme, which is capable of operating in a strongly dispersive channel having a long channel impulse response (CIR) at a moderate decoding complexity. Furthermore, our SoD FDE attains a near-capacity performance with the aid of a three-stage concatenated SC-based SM architecture
    corecore