Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 69 for “"Transfer/exit"”.

  1. Complexity constrained design of sparse graph codes

    … of sparse graph codes with limited decoding complexity. The powerful and versatile tool of extrinsic information transfer (EXIT) charts is employed for code analysis and design throughout the thesis.

    adelaide Repository record for Complexity constrained design of sparse graph codes (opens in a new tab)

  2. Low complexity turbo equalization for coded intersymbol interference channels

    … of a turbo equalizer requires low complexity alternatives to the Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm while yet maintains comparable BER performances. In this thesis, we proposed a heuristic-based equalizer based on local search (LS) algorithm as utilized in a turbo setup. Through …

    nus Repository record for Low complexity turbo equalization for coded intersymbol interference channels (opens in a new tab) Download file for Low complexity turbo equalization for coded intersymbol interference channels (opens in a new tab)

  3. Coarsely quantized Massive MU-MIMO uplink with iterative decision feedback receiver

    … convergence behaviour, an Extrinsic Information Transfer (EXIT) chart method is utilized to visualize the performance of the iterative receiver.

    uvic Repository record for Coarsely quantized Massive MU-MIMO uplink with iterative decision feedback receiver (opens in a new tab)

  4. Iterative equalization and decoding using reduced-state sequence estimation based soft-output algorithms

    … error rate simulations and extrinsic information transfer (EXIT) charts to study and compare the performances of M-BCJR and BCJR equalizers on precoded and non-precoded channels. Using EXIT charts, the achievable channel capacities with IED using the BCJR, M-BCJR and MMSE LE equalizers are also …

    tamu Repository record for Iterative equalization and decoding using reduced-state sequence estimation based soft-output algorithms (opens in a new tab)

  5. Transmit and receive techniques for MIMO-OFDM systems

    … the processing delay. The extrinsic information transfer (EXIT) chart of the proposed Bayesian turbo receiver is derived and compared with the conventional turbo receivers, which verify the superior performance of the proposed Bayesian turbo receiver over the conventional receivers. The preamble …

    nus Repository record for Transmit and receive techniques for MIMO-OFDM systems (opens in a new tab) Download file for Transmit and receive techniques for MIMO-OFDM systems (opens in a new tab)

  6. Iterative Initial Synchronization in Wireless Communications

    … with the aid of EXtrinsic Information Transfer (EXIT) charts.<br/>Finally, as a further refinement we introduced an Automatic Gain Control (AGC) scheme into our RSSE arrangements, which substantially improved its performance.

    soton Download PDF for Iterative Initial Synchronization in Wireless Communications (opens in a new tab)

  7. Design and analysis of iteratively decodable codes for ISI channels

    … close to capacity limits withmanageable complexity.For manychannels such as the AWGN and flat fading channels, codes that perform only a fraction of a dB from the capacity have been designed in the literature. In this dissertation, we will focus on the design and analysis of near-capacity …

    tamu Repository record for Design and analysis of iteratively decodable codes for ISI channels (opens in a new tab)

  8. Reliability information in channel decoding : practical aspects and information theoretical bounds

    … of a decoder may be characterized by information transfer functions, such as information processing characteristics (IPCs) or extrinsic information transfer (EXIT) functions. Bounds on information transfer functions are derived using the concept of bounding combined information. The resulting …

    cau-kiel Repository record for Reliability information in channel decoding : practical aspects and information theoretical bounds (opens in a new tab)

  9. Design of rate-compatible punctured repeat-accumulate codes

    … coding schemes that are simple in terms of complexity but give good performance. Recently a special class of turbo-like codes called repeat accumulate (RA) codes were proposed. These codes are extremely simple in terms of complexity compared to turbo or LDPC codes and have been shown to have …

    uvic Repository record for Design of rate-compatible punctured repeat-accumulate codes (opens in a new tab)

  10. Capacity -based parameter optimization of bandwidth constrained CPM

    … parameters under bandwidth and receiver complexity constraints. The cost function used to drive the optimization is the information-theoretic minimum ratio of energy-per-bit to noise-spectral density found by evaluating the constrained channel capacity. The capacity can be reliably estimated …

    wvu Repository record for Capacity -based parameter optimization of bandwidth constrained CPM (opens in a new tab)

  11. Coded modulation techniques with bit interleaving and iterative processing for impulsive noise channels

    … asymptotic performance. Extrinsic information transfer (EXIT) chart analysis is performed to illustrate the convergence properties of different mappings. The superior performance of BICMID compared to orthogonal frequency-division multiplexing (OFDM) is also clearly demonstrated.Motivated by …

    sask Repository record for Coded modulation techniques with bit interleaving and iterative processing for impulsive noise channels (opens in a new tab)

  12. Low-complexity iterative receivers for multiuser space-time block coding systems

    … space-time block coding (STBC) systems. The complexity and efficiency of an iterative receiver depend heavily on how the log-likelihood ratios (LLRs) of the coded bits are computed and exchanged at the receiver among its three major components, namely the multiuser detector, the maximum a …

    sask Repository record for Low-complexity iterative receivers for multiuser space-time block coding systems (opens in a new tab)

  13. Minimum error rate beamforming transceivers

    … (MUD) and channel decoder. Most reduced-complexity methods in this area use the Minimum Mean Squared Error (MMSE) MUD. Since the desired output of Binary Phase Shift Keying (BPSK) modulated sys- tems is real-valued, minimising the Mean Squared Error, (MSE) between the beamformer's desired …

    soton Download PDF for Minimum error rate beamforming transceivers (opens in a new tab)

  14. Single-carrier time-domain space-time equalization algorithms for the SDMA uplink

    … Furthermore, both the computational complexity and the achievable turbo-coded Bit Error Rate (BER) performance are characterized. </p> <p>In Chapter 3 I extend the narrowband detection strategies discussed in Chapter 2 to Space-Time Equalization (STE) algorithms, which also may benefit …

    soton Download PDF for Single-carrier time-domain space-time equalization algorithms for the SDMA uplink (opens in a new tab)

  15. Bounds on the map threshold of iterative decoding systems with erasure noise

    … evolution (DE), and extrinsic information transfer (EXIT) functions, introduced by ten Brink. Following their work, this thesis considers the MAP decoding thresholds of three iterative decoding systems. First, irregular repeat-accumulate (IRA) and accumulaterepeataccumulate (ARA) code …

    tamu Repository record for Bounds on the map threshold of iterative decoding systems with erasure noise (opens in a new tab)

  16. Turbo and LDPC coding for the AWGN and space-time channel

    … analysed via the use extrinsic information transfer (EXIT) techniques. The modified codes are simulated over an AWGN channel using BPSK modulation for a number of different block lengths.

    adelaide Repository record for Turbo and LDPC coding for the AWGN and space-time channel (opens in a new tab)

  17. Iterative decoding of multilevel and bit-interleaved coded modulation

    … block length, number of iterations and complexity, quantified by the number of trellis states as well as the EXtrinsic Information Transfer (EXIT) charts are used for analysing their decoding convergence and Bit Error Ratio (BER). A three- Dimensional (3-D) EXIT chart is introduced for …

    soton Download PDF for Iterative decoding of multilevel and bit-interleaved coded modulation (opens in a new tab)

  18. Iterative source decoding, channel decoding and channel equalisation

    <p>In this thesis, we apply EXtrinsic Information Transfer (EXIT) charts for analysing iterative decoding and detection schemes. We first consider a two-stage iterative source/channel decoding scheme, which is then extended to a three-stage serially concatenated turbo equalisation scheme. As a …

    soton Download PDF for Iterative source decoding, channel decoding and channel equalisation (opens in a new tab)

  19. Channel estimation for OFDM in fast fading channels

    … of channel estimation, a novel low-complexity iterative joint channel estimation and symbol detection procedure is developed for fast fading channels with a small number of pilots and low pilot power to achieve the bit error rate (BER) performance close to when the CSI is known perfectly. …

    uvic Repository record for Channel estimation for OFDM in fast fading channels (opens in a new tab)

  20. Fountain codes for the wireless Internet

    … (BER) performance using EXtrinsic Information Transfer (EXIT) charts. SLT codes using different degree distributions and random integer packet index generation algorithms for creating the parity and information part of the SLT codeword are also investigated in this thesis. For the sake of …

    soton Download PDF for Fountain codes for the wireless Internet (opens in a new tab)

Page 1 of 4