Results 131 to 140 of about 71,496 (178)

Performance evaluation of the ACTIVE 7 MAX benchtop preclinical PET scanner in accordance with the NEMA NU 4-2008 standard. [PDF]

EJNMMI Phys
Wang H, Wang K, Yuan Z, Li C, Liao R, Hou Y, Hua J, Tang Y, Ruan Q, Han D, Jiang J.   +10 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Iterative decoder architectures

IEEE Communications Magazine, 2003
Implementation constraints on iterative decoders applying message-passing algorithms are investigated. Serial implementations similar to traditional microprocessor datapaths are compared against architectures with multiple processing elements that exploit the inherent parallelism in the decoding algorithm. Turbo codes and low-density parity check codes,
null Engling Yeo, B. Nikolic, V. Anantharam   +2 more
openaire   +1 more source

Deriving the PCC iterative decoder from the SCC iterative decoder

2010 6th International Symposium on Turbo Codes & Iterative Information Processing, 2010
In this paper, we show that the iterative decoder for parallel concatenated codes can be derived from the iterative decoder for serially concatenated codes. In order to show this, we use the observation that any parallel concatenated code (PCC) may be regarded as a serially concatenated code (SCC) with certain code constraints satisfied.
Anders Nilsson, Tor M. Aulin
openaire   +1 more source

Iterative decoding beyond belief propagation

2010 Information Theory and Applications Workshop (ITA), 2010
At the heart of modern coding theory lies the fact that low-density parity-check (LDPC) codes can be efficiently decoded by belief propagation (BP). The BP is an inference algorithm which operates on a graphical model of a code, and lends itself to low-complexity and high-speed implementations, making it the algorithm of choice in many applications. It
Planjery, Shiva, Chilappagari, Shashi Kiran, Vasic, Bane, Declercq, David, Danjean, Ludovic   +4 more
openaire   +1 more source

Iterative Decoding With Replicas

IEEE Transactions on Information Theory, 2007
Replica shuffled versions of iterative decoders for low-density parity-check (LDPC) codes and turbo codes are presented. The proposed schemes can converge faster than standard and plain shuffled approaches. Two methods, density evolution and extrinsic information transfer (EXIT) charts, are used to analyze the performance of the proposed algorithms ...
Juntan Zhang, Yige Wang, Marc P. C. Fossorier, Jonathan S. Yedidia   +3 more
openaire   +1 more source

Iterative Decoding using Eigenmessages

IEEE Transactions on Communications, 2009
The eigenmessage approach to iterative decoding introduces a degree of nonlocality into a belief propagation decoder by representing an entire set of messages around a cycle of the Tanner graph as a linear operator. The eigenvector for the operator represents a fixed point of the belief propagation algorithm around a cycle, with incident messages fixed.
Todd Moon, John Crockett, Jacob Gunther, Ojas Chauhan   +3 more
openaire   +1 more source

Iterative sequential decoding

IEEE Transactions on Information Theory, 1969
It is shown that use of a two-stage decoding procedure consisting simply of an inner stage of block decoding and an outer stage employing a single sequential decoder does not result in an improvement in the computational overflow problem for the sequential decoder.
openaire   +2 more sources

Soft Iterative Decoding for Overloaded CDMA

Proceedings. (ICASSP '05). IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005., 2006
The probabilistic association algorithm (PDA) is proposed as a quasi-optimal solution for synchronous overloaded CDMA detection. Overloaded CDMA is useful in applications in which the band is a limited resource and more users are to be conveyed on the same channel.
ROMANO, Gianmarco, PALMIERI, Francesco, P. K. WILLETT   +2 more
openaire   +1 more source