Results 51 to 60 of about 6,674 (190)

Fast Node Polar Decoding Method Based on Hybrid Parity Check and CRC

open access: yesIEEE Access
In the case of short code, polar code demonstrates superior performance compared with Low Density Parity Check (LDPC) code. Particularly in low coding rate scenario, the complexity of Polar code encoding and decoding is significantly lower than that of ...
Zongmiao He   +5 more
doaj   +1 more source

On the Concatenations of Polar Codes and Non-Binary LDPC Codes

open access: yesIEEE Access, 2018
An interleaved concatenation scheme of polar codes with non-binary low-density parity check (NBLDPC) codes is proposed in this paper to improve the error-correcting performance of polar codes with finite code length. The information blocks of inner polar
Qingping Yu   +5 more
doaj   +1 more source

A Low-Complexity Sorting Network for a Fast List Polar Decoder

open access: yesIEEE Access, 2023
Fast list decoding algorithms for polar codes have been proposed to achieve low latency and high error correction performance. In the Rate-1 and SPC nodes of fast list decoding, a high-complexity sorter is required if multiple bits are to be decoded ...
Yongje Lee   +3 more
doaj   +1 more source

Belief Propagation Decoding of Polar Codes on Permuted Factor Graphs

open access: yes, 2018
We show that the performance of iterative belief propagation (BP) decoding of polar codes can be enhanced by decoding over different carefully chosen factor graph realizations.
Brink, Stephan ten   +3 more
core   +1 more source

Are Workplace Friendships Nothing for Older Workers? Decoding the Psychological Mechanisms Linking Age to Workplace Friendship

open access: yesJournal of Organizational Behavior, EarlyView.
ABSTRACT Given the benefits of workplace friendship, understanding its maintenance is essential. Age is particularly relevant due to the aging and increasingly age‐diverse workforce, yet its relationship with workplace friendship remains unclear, with prior studies reporting positive, negative, or null correlations. As age itself is a proxy for further
Ulrike Fasbender, Nina M. Junker
wiley   +1 more source

Error-Aware SCFlip Decoding of Polar Codes

open access: yesIEEE Access, 2020
The successive-cancellation flip (SCFlip) decoder and its variants provide a significant coding gain with the average complexity practically identical to that of the successive cancellation (SC) decoder in a wide range of signal-to-noise ratios (SNRs ...
Daeyeol Yang, Kyeongcheol Yang
doaj   +1 more source

Fast-SSC-Flip Decoding of Polar Codes

open access: yes, 2018
Polar codes are widely considered as one of the most exciting recent discoveries in channel coding. For short to moderate block lengths, their error-correction performance under list decoding can outperform that of other modern error-correcting codes ...
Burg, Andreas, Giard, Pascal
core   +1 more source

Efficient Sorting Architecture for List-Fast-SSC Decoding of Polar Codes

open access: yesIEEE Access, 2018
Polar codes have been proven to achieve the symmetric capacity of memoryless channel. Compared with a successive cancellation list decoder, list-Fast simplified-successive cancellation generates more candidate paths, which leads to more resource costs ...
Xiaojun Zhang   +4 more
doaj   +1 more source

Rate-Flexible Fast Polar Decoders

open access: yes, 2019
Polar codes have gained extensive attention during the past few years and recently they have been selected for the next generation of wireless communications standards (5G).
Condo, Carlo   +3 more
core   +1 more source

Seeing the Speaker's Face Enhances Second Language Shadowing: Neural and Behavioral Evidence

open access: yesLanguage 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

Home - About - Disclaimer - Privacy