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 8 of 8 for “"Maximum likelihood decoder"”.

  1. Applications of jump processes in epidemiology and neuroscience

    … processes. Based on this insight, we propose a maximum likelihood decoder. The proposed decoder can decode non-stationary neural responses in real time. We also propose a model for binaural hearing, which can be used to extend the maximum likelihood decoder to arbitrary stimuli.

    uiuc Repository record for Applications of jump processes in epidemiology and neuroscience (opens in a new tab)

  2. Quantized Guessing Random Additive Noise Decoding - A Universal Quantized Soft-Decoder

    … Decoding (GRAND) has proven to be a universal, maximum likelihood decoder. Multiple extensions of GRAND have been introduced, giving way to a class of universal decoders. GRAND itself describes a hard-detection decoder, so a natural extension was to incorporate the use of soft-information. The …

    mit Repository record for Quantized Guessing Random Additive Noise Decoding - A Universal Quantized Soft-Decoder (opens in a new tab)

  3. Spinal codes

    … decode spinal codes, we develop an approximate maximum-likelihood decoder, called the bubble decoder, which runs in time polynomial in the message size and achieves the Shannon capacity over both additive white Gaussian noise (AWGN) and binary symmetric channel (BSC) models. The decoder trades …

    mit Repository record for Spinal codes (opens in a new tab)

  4. Space-Time Coding with Offset Modulations

    … relative to the optimum detector. Three decoders for STC encoded OQPSK are presented. One decoder has a bit error rate performance that matches the SISO case but with much higher complexity than that of the QPSK decoder. A second decoder matches the simplicity of the decoder for STC …

    byu Repository record for Space-Time Coding with Offset Modulations (opens in a new tab)

  5. A hardware implementation of a Viterbi decoder for a (3,2/3) TCM code

    … report details the design of a dedicated Viterbi decoder chip set for an Ungerboek (3,2/3) Trellis Coded Modulation code. It was the specific intention of the thesis to design a system that could be implemented on standard Field Programmable Gate Arrays (FPGA) yet still be able to cope with high …

    cape-town Repository record for A hardware implementation of a Viterbi decoder for a (3,2/3) TCM code (opens in a new tab)

  6. Robust Wireless Communications with Applications to Reconfigurable Intelligent Surfaces

    … theoretically achievable and outperforms the maximum likelihood decoder at low SNR while exhibiting the smallest possible latency. I designed a Bayesian minimum mean square error estimator for decoding high-dimensional JSCC codes achieving 99.96% accuracy. With the recent introduction of …

    vt Repository record for Robust Wireless Communications with Applications to Reconfigurable Intelligent Surfaces (opens in a new tab)

  7. Mismatched Decoding: Capacity and Error Exponent Upper Bounds

    … problem in scenarios where a sub-optimal decoder is used. These situations arise when optimal maximum-likelihood decoding cannot be used: i) the channel transition is unknown and imperfectly estimated or, ii) when, for complexity reasons, the channel likelihood is too difficult to compute …

    cambridge Repository record for Mismatched Decoding: Capacity and Error Exponent Upper Bounds (opens in a new tab)

  8. High dimensional information processing

    … wrong sparsity pattern is identified by the maximum-likelihood estimator. We find that this probability depends (inversely) exponentially on the difference of kXβk2 and the ℓ2-norm of Xβ projected onto the range of columns of X indexed by the wrong sparsity pattern. Second, when X is randomly …

    columbia-diss Repository record for High dimensional information processing (opens in a new tab)