Results 251 to 260 of about 765,447 (285)
Some of the next articles are maybe not open access.
Error floors in narrowband digital FM systems
Proceedings IEEE SOUTHEASTCON '97. 'Engineering the New Century', 2002A digital FM system in the presence of simulcast interference and/or Rayleigh fading exhibits performance floors, where increased signal strength does not reduce the error rate. The mechanism which generates FM clicks even in the region of high SNRs, in simulcast as well as in multipath, is suggested.
R. Petrovic, S. Filipovic
openaire +1 more source
Lowering Error Floors Using Dithered Belief Propagation
2010 IEEE Global Telecommunications Conference GLOBECOM 2010, 2010We propose dithered belief propagation decoding algorithms to reduce the number of decoding failures of a belief propagation decoder and lower the error floor. The random nature of the algorithms enables a low hardware complexity compared to previously reported techniques. We introduce two dithering methods that target check node operations and channel
Francois Leduc-Primeau +3 more
openaire +1 more source
Error floors of non-binary LDPC codes
2010 IEEE International Symposium on Information Theory, 2010In this paper, we analyze (2, k)-regular non-binary low-density parity-check codes over the binary erasure channels. We propose a method to improve the error floors by optimizing labels in zigzag cycles in the Tanner graph. We analyze the error floors for codes designed by the proposed optimization method and show that the error floors are decreasing ...
Takayuki Nozaki +2 more
openaire +1 more source
On error floor and free distance of turbo codes
ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240), 2002Turbo codes have excellent performance at low and medium signal-to-noise ratios (SNR) very close to the Shannon limit, and are at the basis of their success. However, a turbo code performance curve can change its slope at high SNR if the code free distance is small.
GARELLO, Roberto +4 more
openaire +1 more source
2009
Introduction In the previous chapter we analyzed the performance of iterative codes by calculating their threshold and thus comparing their performance in high-noise channels with the channel's capacity. In that analysis we considered the iterative decoding of code ensembles with given component codes, averaging over all possible interleaver–edge ...
openaire +1 more source
Introduction In the previous chapter we analyzed the performance of iterative codes by calculating their threshold and thus comparing their performance in high-noise channels with the channel's capacity. In that analysis we considered the iterative decoding of code ensembles with given component codes, averaging over all possible interleaver–edge ...
openaire +1 more source
In-service testing OFDM error floor by constellation analysis
2017 25th International Conference on Software, Telecommunications and Computer Networks (SoftCOM), 2017Residual BER – error floor is the ultimate metrics for the end-to-end transmission performance, but in practice can be assessed only by out-of-service tests, which network operators in particular try to avoid best they can, preferring in-service practical test methods. In this regard, constellation analysis is an excellent tool to not only identify and
Lipovac, Adriana +2 more
openaire +2 more sources
Short Low-Error-Floor Tanner Codes with Hamming Nodes
MILCOM 2005 - 2005 IEEE Military Communications Conference, 2006While it is fairly easy to design good low-density parity-check codes with medium or large block lengths, and with code rates 1/2 or greater, much more effort is required for short lengths and low rates. We propose a code structure which incorporates Hamming codes into a code's graph, leading to a type of a Tanner code.
Liva, Gianluigi, Ryan, William E.
openaire +2 more sources
Rate Variable, Multi-Binary Turbo Codes with Controlled Error-Floor
IEEE Transactions on Communications, 2009In this letter we propose rate variable turbo codes based on the parallel concatenation of tailbiting Recursive Systematic multi-binary (m-ary) convolutional codes. Rate variability is not achieved by puncturing, which can have adverse effects on the minimum distance of the code.
FERRARI M, BELLINI, SANDRO
openaire +4 more sources
Protograph Based Low Error Floor LDPC Coded Modulation
MILCOM 2005 - 2005 IEEE Military Communications Conference, 2006In this paper we propose an innovative LDPC coded modulation scheme. We design binary low density parity check (LDPC) codes that are combined with high level modulations such as 8PSK and 16QAM with and without a channel interleaver. At the receiver a demapper transforms the received inphase and quadrature samples to produce reliability information that
D. Divsalar, C. Jones
openaire +1 more source
A survey of error floor of LDPC codes
2011 6th International ICST Conference on Communications and Networking in China (CHINACOM), 2011The research about error floor of finite-length LDPC code is a very hot topic recently. This survey briefly introduces the existing works in lowering and estimating error floor of LDPC codes, and sheds some light on some potential future research areas.
null Yejun He +2 more
openaire +1 more source

