Results 21 to 30 of about 651,619 (74)

Performance and analysis of Quadratic Residue Codes of lengths less than 100 [PDF]

arXiv, 2014
In this paper, the performance of quadratic residue (QR) codes of lengths within 100 is given and analyzed when the hard decoding, soft decoding, and linear programming decoding algorithms are utilized. We develop a simple method to estimate the soft decoding performance, which avoids extensive simulations.
arxiv  

Deep learning of fMRI big data: a novel approach to subject-transfer decoding [PDF]

arXiv, 2015
As a technology to read brain states from measurable brain activities, brain decoding are widely applied in industries and medical sciences. In spite of high demands in these applications for a universal decoder that can be applied to all individuals simultaneously, large variation in brain activities across individuals has limited the scope of many ...
arxiv  

The generalized likelihood decoder: random coding and expurgated bounds [PDF]

, 2015
The likelihood decoder is a stochastic decoder that selects the decoded message at random, using the posterior distribution of the true underlying message given the channel output. In this work, we study a generalized version of this decoder where the posterior is proportional to a general function that depends only on the joint empirical distribution ...
arxiv   +1 more source

Fast Decoding of Low Density Lattice Codes [PDF]

arXiv, 2018
Low density lattice codes (LDLC) are a family of lattice codes that can be decoded efficiently using a message-passing algorithm. In the original LDLC decoder, the message exchanged between variable nodes and check nodes are continuous functions, which must be approximated in practice.
arxiv  

XJ-BP: Express Journey Belief Propagation Decoding for Polar Codes [PDF]

arXiv, 2015
This paper presents a novel propagation (BP) based decoding algorithm for polar codes. The proposed algorithm facilitates belief propagation by utilizing the specific constituent codes that exist in the factor graph, which results in an express journey (XJ) for belief information to propagate in each decoding iteration.
arxiv  

A Gated Hypernet Decoder for Polar Codes [PDF]

arXiv, 2019
Hypernetworks were recently shown to improve the performance of message passing algorithms for decoding error correcting codes. In this work, we demonstrate how hypernetworks can be applied to decode polar codes by employing a new formalization of the polar belief propagation decoding scheme. We demonstrate that our method improves the previous results
arxiv  

Balancing Cost and Benefit with Tied-Multi Transformers [PDF]

arXiv, 2020
We propose and evaluate a novel procedure for training multiple Transformers with tied parameters which compresses multiple models into one enabling the dynamic choice of the number of encoder and decoder layers during decoding. In sequence-to-sequence modeling, typically, the output of the last layer of the N-layer encoder is fed to the M-layer ...
arxiv  

Finite Alphabet Fast List Decoders for Polar Codes [PDF]

arXiv
The so-called fast polar decoding schedules are meant to improve the decoding speed of the sequential-natured successive cancellation list decoders. The decoding speedup is achieved by replacing various parts of the serial decoding process with efficient special-purpose decoder nodes.
arxiv  

Joint Successive Cancellation Decoding of Polar Codes over Intersymbol Interference Channels [PDF]

arXiv, 2014
Polar codes are a class of capacity-achieving codes for the binary-input discrete memoryless channels (B-DMCs). However, when applied in channels with intersymbol interference (ISI), the codes may perform poorly with BCJR equalization and conventional decoding methods. To deal with the ISI problem, in this paper a new joint successive cancellation (SC)
arxiv  

Decoding spike timing: The differential reverse-correlation method [PDF]

, 2008
Gašper Tkačik, Marcelo O. Magnasco
openalex   +1 more source