Results 61 to 70 of about 344 (172)
Decoding Algorithms for Binary U-UV Codes: A Unified Survey of Performance and Complexity
IEEE AccessU-UV codes, based on the Plotkin (U, U + V) construction, provide a unified framework that includes polar and Reed–Muller codes and enables flexible design through the choice of component codes.
Feodosii Kotov, Fedor Ivanov
doaj +1 more source
Seeing the Speaker's Face Enhances Second Language Shadowing: Neural and Behavioral Evidence
Language Learning, EarlyView.Abstract This functional magnetic resonance imaging (fMRI) study investigated how facial cues influence second language (L2) shadowing among 42 Japanese learners of English. Participants completed four conditions that varied by task type (listening vs. shadowing) and visual input (face vs. mosaic).
Hyeonjeong Jeong +7 more
wiley +1 more source
IEEE AccessThis paper focuses on low-complexity design of polar codes with high error-correction capability for 6G networks. We propose a novel frozen set design approach for polar codes with dynamic frozen bits that guarantees the best possible trade-offs between ...
Vera Miloslavskaya
doaj +1 more source
SC-Fano Decoding of Polar Codes
IEEE Access, 2019 For finite-length polar codes, the standard successive cancellation (SC) decoding has been improved, such as SC-List (SCL), SC-Stack (SCS), and SC-Flip (SCF) decodings.
Min-Oh Jeong, Song-Nam Hong
doaj +1 more source
Judgement of error frames using frozen bits and its applications in decoding of polar codes
IET Communications, 2023 Polar codes have received widespread attention because of their excellent performance. However, although successive cancellation (SC)‐based decoding algorithms have achieved excellent error correction performance, they still encounter large time delays ...
Dong Yang, Yinyou Mao, Xingcheng Liu
doaj +1 more source
A Split-Reduced Successive Cancellation List Decoder for Polar Codes [PDF]
IEEE Journal on Selected Areas in Communications, 2016 This paper focuses on low complexity successive cancellation list (SCL) decoding of polar codes. In particular, using the fact that splitting may be unnecessary when the reliability of decoding the unfrozen bit is sufficiently high, a novel splitting rule is proposed.
Zhaoyang Zhang 0001 +4 more
openaire +2 more sources
Becoming Dostoevsky (how Rowan Williams opens up Bakhtin)
Modern Theology, EarlyView.Abstract With the end of Communism in Russia, non‐materialist contexts were enthusiastically restored to Mikhail Bakhtin's globally famous ideas of carnival, dialogism, and polyphony. This essay surveys Rowan Williams's 2008 study Dostoevsky: Language, Faith + Fiction as a major contribution to this effort, concentrating on those general philosophical ...
Caryl Emerson
wiley +1 more source
Alluvial ridge morphology on avulsing rivers
Sedimentology, EarlyView.ABSTRACT Alluvial ridges are built by preferential channel‐belt deposition and control river avulsions, yet a systematic analysis of their morphology has been missing. To address this gap, we analyse a globally distributed dataset of 8970 alluvial ridge flanks on 14 different rivers.
James H. Gearon, Douglas A. Edmonds
wiley +1 more source
Low Complexity List Decoding for Polar Codes with Multiple CRC Codes
Entropy, 2017 Polar codes are the first family of error correcting codes that provably achieve the capacity of symmetric binary-input discrete memoryless channels with low complexity.
Jong-Hwan Kim +3 more
doaj +1 more source
Fast Simplified Successive-Cancellation List Decoding of Polar Codes [PDF]
2017 IEEE Wireless Communications and Networking Conference Workshops (WCNCW), 2017 Polar codes are capacity achieving error correcting codes that can be decoded through the successive-cancellation algorithm. To improve its error-correction performance, a list-based version called successive-cancellation list (SCL) has been proposed in the past, that however substantially increases the number of time-steps in the decoding process. The
Seyyed Ali Hashemi +2 more
openaire +2 more sources