نتایج جستجو برای: maximum likelihood decoding
تعداد نتایج: 379084 فیلتر نتایج به سال:
Soft-decision decoding offers a means of bridging the performance gap between a block error-control system that uses hard-decision boundeddistance decoding, and one that uses maximum-likelihood decoding. Existing algorithms, however, tend to be complex in terms of hardware requirement. This paper presents a new class of soft-decision decoding algorithms, based on error-trapping decoding, which ...
OFDM, power, Reed-Muller code, decoding, algorithms, error correction Recently a class of generalised Reed-Muller codes has been suggested for use in power-controlled OFDM modulation. A number of approaches to decoding these codes have already been developed. Here we present low complexity alternatives which are inspired by the classical Reed decoding algorithm for binary Reed-Muller codes. We ...
Many machine learning tasks can be formulated in terms of predicting structured outputs. In frameworks such as the structured support vector machine (SVM-Struct) and the structured perceptron, discriminative functions are learned by iteratively applying efficient maximum a posteriori (MAP) decoding. However, maximum likelihood estimation (MLE) of probabilistic models over these same structured ...
An expression for the probability distribution of the interspike interval of a leaky integrate-and-fire (LIF) model neuron is rigorously derived, based on recent theoretical developments in the theory of stochastic processes. This enables us to find for the first time a way of developing maximum likelihood estimates (MLE) of the input information (e.g., afferent rate and variance) for an LIF ne...
In communication systems, specifically wireless mobile communication applications, Size and Speed are dominant factors while meeting the performance requirements. Turbo codes play an important role in such practical applications due to their better error-correcting capability. In Turbo decoders, Maximum A Posterior probability (MAP) algorithm has been widely used for its optimum error correctin...
On the Optimality of the Hamming Metric for Decoding Block Codes over Binary Additive Noise Channels
Most of the basic concepts of algebraic coding theory are derived for the memoryless binary symmetric channel. These concepts do not necessarily hold for time-varying channels or for channels with memory. However, errors in real-life channels seem to occur in bursts rather than independently, suggesting that these channels exhibit some statistical dependence or memory. Nonetheless, the same alg...
This paper considers an uplink multiuser multipleinput-multiple-output (MU-MIMO) system with one-bit analogto-digital converters (ADCs), in which K users with a single transmit antenna communicate with one base station (BS) with Nr receive antennas. In this system, a novel MU-MIMO detection method, named weighted minimum distance (wMD) decoding, was recently proposed, as a practical approximati...
We suggest new decoding techniques for diversity channels employing space time codes (STC) when the channel coefficients are unknown to both transmitter and receiver. Most of the existing decoders for unknown diversity channels employ training sequence in order to estimate the channel. These decoders use the estimates of the channel coefficients in order to perform maximum likelihood (ML) decod...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید