İçeriğe geç
akaturk Akademik ölçüm

OpenAlex konusu

Error Correcting Code Techniques

Bu sayfa OpenAlex konu etiketine göre çalışmaları ve o konuda görünen akademisyenleri listeler. YÖKSİS temel alan / yan dal değildir.

OpenAlex 468 eser 13 yazar konusu

Çalışmalar

468 eser

  1. OpenAlex üst %10 OpenAlex 97.0%

    The channel estimation techniques for OFDM systems based on pilot arrangement are investigated. The channel estimation based on comb type pilot arrangement is studied through different algorithms for both estimating channel at pilot frequencies and interpolating the channel. The estimation of channel at pilot frequenc…

  2. YÖKSİS SJR Q1 JCR Q1 OpenAlex üst %1 OpenAlex 99.0%

    For the first time Boolean functions on 9 variables having nonlinearity$241$are discovered, that remained as an open question in literature for almost three decades. Such functions are found by heuristic search in the space of rotation symmetric Boolean functions (RSBFs). This shows that there exist Boolean functions…

  3. YÖKSİS SJR Q1 JCR Q1 OpenAlex üst %10 OpenAlex 98.1%

    Potentially large storage requirements and long initial decoding delays are two practical issues related to the decoding of low-density parity-check (LDPC) convolutional codes using a continuous pipeline decoder architecture. In this paper, we propose several reduced complexity decoding strategies to lessen the storag…

  4. YÖKSİS SJR Q1 JCR Q1 OpenAlex üst %10 OpenAlex 98.9%

    Low-density parity-check (LDPC) convolutional codes are capable of achieving excellent performance with low encoding and decoding complexity. In this paper, we discuss several graph-cover-based methods for deriving families of time-invariant and time-varying LDPC convolutional codes from LDPC block codes and show how…

  5. YÖKSİS SJR Q1 JCR Q1 OpenAlex üst %10 OpenAlex 97.5%

    Schalkwijk and Kailath (1966) developed a class of block codes for Gaussian channels with ideal feedback for which the probability of decoding error decreases as a second-order exponent in block length for rates below capacity. This well-known but surprising result is explained and simply derived here in terms of a re…

  6. YÖKSİS SJR Q1 JCR Q1 OpenAlex üst %10 OpenAlex 97.0%

    An information-theoretic framework for unequal error protection is developed in terms of the exponential error bounds. The fundamental difference between thebit-wiseandmessage-wiseunequal error protection (UEP) is demonstrated, for fixed-length block codes on discrete memoryless channels (DMCs) without feedback. Effec…

  7. OpenAlex üst %10 OpenAlex 97.5%

    A general information theoretic framework for unequal error protection is developed in terms of exponential error bounds. The qualitative difference between the bit-wise and message-wise unequal error protection (UEP) is demonstrated, for fixed length block codes on DMCs without feedback. Effect of feedback is investi…

  8. YÖKSİS SJR Q1 JCR Q1 OpenAlex üst %10 OpenAlex 97.1%

    Low-density parity-check (LDPC) convolutional codes have been shown to be capable of achieving capacity-approaching performance with iterative message-passing decoding. In the first part of this paper, using asymptotic methods to obtain lower bounds on the free distance to constraint length ratio, we show that several…

  9. YÖKSİS SJR Q3 JCR Q2 OpenAlex 79.8%

    Özet henüz yok.

  10. YÖKSİS SJR Q1 JCR Q1 OpenAlex üst %10 OpenAlex 95.7%

    In a remarkable paper published in 1976, Burnashev determined the reliability function of variable-length block codes over discrete memoryless channels (DMCs) with feedback. Subsequently, an alternativeachievabilityproof was obtained by Yamamoto and Itoh via a particularly simple and instructive scheme. Their idea is…

  11. YÖKSİS OpenAlex üst %10 OpenAlex 98.2%

    The original design of standard digital fountain codes assumes that the coded information symbols are equally important. In many applications, some source symbols are more important than others, and they must be recovered prior to the rest. Unequal Error Protection (UEP) designs are attractive solutions for such sourc…

  12. YÖKSİS SJR Q1 JCR Q1 OpenAlex üst %10 OpenAlex 96.6%

    We introduce an importance sampling (IS) method that successfully simulates the performance of Low density Parity Check (LDPC) Codes in an AWGN channel at very low bit error rates (BERs). By effectively finding and biasing bit node combinations that are the dominant sources of error events, called trapping sets, the d…

Akademisyenler

13 akademisyen