Results 51 to 60 of about 1,096,634 (365)
Coded cooperation in wireless communications: space-time transmission and iterative decoding
IEEE Transactions on Signal Processing, 2004 When mobiles cannot support multiple antennas due to size or other constraints, conventional space-time coding cannot be used to provide uplink transmit diversity.
M. Janani +3 more
semanticscholar +1 more source
Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels
, 2007 We solve the problem of designing powerful low-density parity-check (LDPC) codes with iterative decoding for the block-fading channel. We first study the case of maximum-likelihood decoding, and show that the design criterion is rather straightforward ...
, +4 more
core +6 more sources
Incidence structures from the blown-up plane and LDPC codes [PDF]
, 2011 In this article, new regular incidence structures are presented. They arise from sets of conics in the affine plane blown-up at its rational points. The LDPC codes given by these incidence matrices are studied. These sparse incidence matrices turn out to
Couvreur, Alain
core +5 more sources
Error-and-erasure Decoding of Product and Staircase Codes with Simplified Extrinsic Message Passing [PDF]
arXiv, 2022 The decoding performance of product codes and staircase codes based on iterative bounded-distance decoding (iBDD) can be improved with the aid of a moderate amount of soft information, maintaining a low decoding complexity. One promising approach is error-and-erasure (EaE) decoding, whose performance can be reliably estimated with density evolution (DE)
arxiv
Belief Propagation List Decoding of Polar Codes [PDF]
IEEE Communications Letters, vol. 22, no. 8, pp. 1536-1539, Aug.
2018, 2018 We propose a belief propagation list (BPL) decoder with comparable performance to the successive cancellation list (SCL) decoder of polar codes, which already achieves the maximum likelihood (ML) bound of polar codes for sufficiently large list size $L$.
arxiv +1 more source
Low-Complexity Approaches to Slepian–Wolf Near-Lossless Distributed Data Compression [PDF]
, 2006 This paper discusses the Slepian–Wolf problem of distributed near-lossless compression of correlated sources. We introduce practical new tools for communicating at all rates in the achievable region.
Anna H. Lee +6 more
core +3 more sources
Parallel Iterative Edit Models for Local Sequence Transduction [PDF]
Conference on Empirical Methods in Natural Language Processing, 2019 We present a Parallel Iterative Edit (PIE) model for the problem of local sequence transduction arising in tasks like Grammatical error correction (GEC).
Abhijeet Awasthi +4 more
semanticscholar +1 more source
Binary Message Passing Decoding of Product Codes Based on Generalized Minimum Distance Decoding [PDF]
, 2019 We propose a binary message passing decoding algorithm for product codes based on generalized minimum distance decoding (GMDD) of the component codes, where the last stage of the GMDD makes a decision based on the Hamming distance metric.
Amat, Alexandre Graell i +2 more
core +3 more sources
Joint Source and Channel Decoding for Variable Length Encoded Turbo Codes
EURASIP Journal on Advances in Signal Processing, 2007 Joint source and channel decoding (JSCD) has been proved to be an effective technique which can improve decoding performance by exploiting residual source redundancy.
Yang Yang +3 more
doaj +1 more source
American Journal of Community Psychology, Volume 70, Issue 3-4, Page 365-378, December 2022., 2022 Abstract While implementation and dissemination of research is a rapidly growing area, critical questions remain about how, why, and under what conditions everyday people integrate and utilize research evidence. This mixed‐methods study investigates how participants of Promoting Community Conversations About Research to End Suicide (PC CARES) make ...
Lauren A. White +7 more
wiley +1 more source