Results 21 to 30 of about 455,922 (292)
Complexity of Multi-Value Byzantine Agreement [PDF]
, 2010 In this paper, we consider the problem of maximizing the throughput of Byzantine agreement, given that the sum capacity of all links in between nodes in the system is finite.
Liang, Guanfeng, Vaidya, Nitin
core +1 more source
Outage and Bit Error Probability Analysis in Energy Harvesting Wireless Cooperative Networks
Elektronika ir Elektrotechnika, 2019 This study focuses on a wireless powered cooperative communication network (WPCCN), which includes a hybrid access point (HAP), a source and a relay. The considered source and relay are installed without embedded energy supply (EES), thus are dependent ...
Ly Tran Thai Hoc +6 more
doaj +1 more source
Adaptive Bit-Labeling Design for Probabilistic Shaping Based on Residual Source Redundancy
Entropy, 2023 By using the residual source redundancy to achieve the shaping gain, a joint source-channel coded modulation (JSCCM) system has been proposed as a new solution for probabilistic amplitude shaping (PAS).
Chen Chen +3 more
doaj +1 more source
A study of pattern recovery in recurrent correlation associative memories [PDF]
, 2003 In this paper, we analyze the recurrent correlation associative memory (RCAM) model of Chiueh and Goodman. This is an associative memory in which stored binary memory patterns are recalled via an iterative update rule.
Hancock, E.R., Wilson, R.C.
core +2 more sources
Binary Polar Codes Based on Bit Error Probability
2022 IEEE International Symposium on Information Theory (ISIT), 2022 This paper introduces techniques to construct binary polar source/channel codes based on the bit error probability of successive-cancellation decoding. The polarization lemma is reconstructed based on the bit error probability and then techniques to compute the bit error probability are introduced. These techniques can be applied to the construction of
openaire +2 more sources
On the Asymptotic Performance of Bit-Wise Decoders for Coded Modulation [PDF]
, 2013 Two decoder structures for coded modulation over the Gaussian and flat fading channels are studied: the maximum likelihood symbol-wise decoder, and the (suboptimal) bit-wise decoder based on the bit-interleaved coded modulation paradigm. We consider a 16-
Agrell, Erik +3 more
core +2 more sources
Applied Sciences, 2018 The satellite-to-ground optical communication system suffers from atmosphere turbulence severely. It is well-known that the coherent detection can increase the receiver sensitivity and performing aperture averaging can reduce the scintillation caused by ...
Hongwei Li +5 more
doaj +1 more source
Performance and Construction of Polar Codes: The Perspective of Bit Error Probability
CoRR, 2022 Most existing works of polar codes focus on the analysis of block error probability. However, in many scenarios, bit error probability is also important for evaluating the performance of channel codes. In this paper, we establish a new framework to analyze the bit error probability of polar codes.
Bolin Wu, Kai Niu 0001, Jincheng Dai
openaire +2 more sources
Error Rates of the Maximum-Likelihood Detector for Arbitrary Constellations: Convex/Concave Behavior and Applications [PDF]
, 2009 Motivated by a recent surge of interest in convex optimization techniques, convexity/concavity properties of error rates of the maximum likelihood detector operating in the AWGN channel are studied and extended to frequency-flat slow-fading channels ...
François Gagnon +4 more
core +4 more sources
Deterministic Constructions for Large Girth Protograph LDPC Codes
, 2013 The bit-error threshold of the standard ensemble of Low Density Parity Check (LDPC) codes is known to be close to capacity, if there is a non-zero fraction of degree-two bit nodes.
Pradhan, Asit Kumar +2 more
core +1 more source