Results 41 to 50 of about 1,191 (179)
An optimized initialization for LDPC decoding over GF(q) in impulsive noise environments.
PLoS ONE, 2021 Modern navigation satellite communication has the characteristic of high transmitting rate. To avoid bit errors in data transmission, low density parity check (LDPC) codes are widely recognized as efficient ways for navigation communication ...
Haoqiang Liu +3 more
doaj +1 more source
Tanner
IEEE Access, 2019 Girth plays an important role in the design of low-density parity-check (LDPC) codes. Motivated by the works on the girth of some classes of Tanner quasi-cyclic (QC) LDPC codes, e.g., Tanner (3, 5), (3, 7), (3, 11), and (5, 7) codes, we, in this paper ...
Hengzhou Xu +4 more
doaj +1 more source
ANALYSIS OF CORRECTIVE PROPERTIES OF ULTRA-LONG LDPC CODES
Information and Telecommunication Sciences, 2013 The ultra-long LPDC codes are examined. The errors correction by ultra-long LDPC codes is analyzed. The error-correcting capability research method for ultra-long LDPC codes is described in details. The main results in table and graph representations are
Leonid Uryvskyi, Serhii Osypchuk
doaj +1 more source
A Scalable and Resource‐Efficient Pipelined p‐Computer for Probabilistic Ising Machines
Advanced Intelligent Systems, EarlyView.(a) Block diagram of the portfolio optimization problem: given M assets, the goal is to determine the optimal weights w that maximize the expected return (based on the mean historical assets return u), while minimizing the risk, quantified by the assets covariance matrix S.
Deborah Volpe +9 more
wiley +1 more source
International Journal of Satellite Communications and Networking, Volume 44, Issue 6, Page 689-699, November/December 2026.ABSTRACT In this paper, the correlation learning estimation and adaptive reduction (CLEAR) of interference, an adaptive, blind and transparent interference compensation method applied in a wideband dual‐channel receiver, is studied for a pair of independent satellite multi‐connectivity links, using the same carrier frequency and signal bandwidth in use
Svilen Dimitrov
wiley +1 more source
2022 IEEE International Symposium on Information Theory (ISIT), 2022 LDPC codes based on multiple-edge protographs potentially have larger minimum distances compared to their counterparts, single-edge protographs. However, considering different features of their Tanner graph, such as short cycles, girth and other graphical structures, is harder than for Tanner graphs from single-edge protographs.
Farzane Amirzade 0001 +2 more
openaire +2 more sources
An unequal error protection scheme for non-binary LDPC using statistical QAM and prioritized mapping [PDF]
Serbian Journal of Electrical Engineering, 2018 Low Density Parity Check (LDPC) codes are among the most popular channel codes used nowadays because of their ability to achieve near channel capacity performances.
Indoonundon Madhavsingh +1 more
doaj +1 more source
HELIOS ‐ Highly rEliable Links durIng sOlar conjunctionS
Radio Science, Volume 61, Issue 8, August 2026.Abstract During deep space missions, maintaining reliable communication between a spacecraft and Earth becomes particularly challenging during superior solar conjunctions, when the spacecraft passes behind the Sun relative to Earth. The highly ionized solar corona and solar wind create plasma inhomogeneities that severely affect radio signals, leading ...
A. Zeqaj +8 more
wiley +1 more source
On Sparse Regression LDPC Codes
2023 IEEE International Symposium on Information Theory (ISIT), 2023 Belief propagation applied to iterative decoding and sparse recovery through approximate message passing (AMP) are two research areas that have seen monumental progress in recent decades. Inspired by these advances, this article introduces sparse regression LDPC codes and their decoding.
Jamison R. Ebert +2 more
openaire +4 more sources
A Resource Efficient Ising Model‐Based Quantum Sudoku Solver
Software: Practice and Experience, Volume 56, Issue 6, Page 643-657, June 2026.ABSTRACT Background Quantum algorithms exploit superposition and parallelism to address complex combinatorial problems, many of which fall into the non‐polynomial (NP) class. Sudoku, a widely known logic‐based puzzle, is proven to be NP‐complete and thus presents a suitable testbed for exploring quantum optimization approaches.
Wen‐Li Wang +5 more
wiley +1 more source