Results 61 to 70 of about 638 (196)

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

IEEE 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, Zhiping Shi, Xingwang Li, Jianhe Du, Jiayi Zhang, Khaled M. Rabie   +5 more
doaj   +1 more source

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

IEEE 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, Jae Hong Roh, Useok Lee, Myung Hoon Sunwoo   +3 more
doaj   +1 more source

AI‐Assisted IoT‐Enabled ECG Monitoring: Integrating Foundational and Generative AI Tools for Sustainable Smart Healthcare—Recent Trends

AI &Innovation, EarlyView.
ABSTRACT The rapid evolution of the Internet of Things (IoT) has significantly advanced the field of electrocardiogram (ECG) monitoring, enabling real‐time, remote, and patient‐centric cardiac care. This paper presents a comprehensive survey of AI assisted IoT‐based ECG monitoring systems, focusing on the integration of emerging technologies such as ...
Amrita Choudhury, Kandarpa Kumar Sarma, Lachit Dutta   +2 more
wiley   +1 more source

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

IEEE 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, Rongquan Sui, Jianming Cui, Dexue Zhang, Qingtian Zeng   +4 more
doaj   +1 more source

Error-Aware SCFlip Decoding of Polar Codes

IEEE 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

Towards an ‘absolute’ timing of biostratigraphic and environmental phases from the Saalian late glacial to the Weichselian pleniglacial in central Europe—Insights from a lacustrine succession in Lichtenberg, northern Germany

Boreas, EarlyView.
Palynological records are central to the biostratigraphic subdivision of the Late Pleistocene in central Europe. Yet many interglacial and interstadial phases—such as the Eemian, Brörup and Odderade—remain only poorly constrained in time due to limited numerical dating.
Michael Hein, Thomas Kasper, Alexis Badai Samudra, Martin Theuerkauf, Markus Lothar Fischer, Neda Rahimzadeh, Maria Sekar Proborukmi, Sonja Rigterink, Agnieszka Gruszczyńska, Christian Zeeden, Simon Parfitt, David John Horne, Lucy Roberts, Dustin White, Lisa Brogmus, Hans von Suchodoletz, Tobias Lauer, Marcel Weiss, David Colin Tanner, Brigitte Urban   +19 more
wiley   +1 more source

Successive Syndrome-Check Decoding of Polar Codes

, 2021
A two-part successive syndrome-check decoding of polar codes is proposed with the first part successively refining the received codeword and the second part checking its syndrome.
Marco Mondelli, Cioffi, John, Andrea Goldsmith, John Cioffi, Goldsmith, Andrea, Seyyed Ali Hashemi, Hashemi, Seyyed Ali, Mondelli, Marco ; https://orcid.org/   +7 more
core   +1 more source

Complexity-Constrained D-SCFlip Decoding

IEEE Open Journal of the Communications Society
Dynamic successive cancellation flip (D-SCFlip) decoding has emerged as a low-complexity alternative to successive cancellation list (SCL) decoding for polar codes, bridging the performance gap between conventional successive cancellation (SC) and SCL ...
Anna Fominykh, Daria Ustinova, Alexey Frolov, Kirill Shabunov   +3 more
doaj   +1 more source

Establishing Shape Correspondences: A Survey

Computer Graphics Forum, EarlyView.
Abstract Shape correspondence between surfaces in 3D is a central problem in geometry processing, concerned with establishing meaningful relations between surfaces. While all correspondence problems share this goal, specific formulations can differ significantly: Downstream applications require certain properties that correspondences must satisfy ...
A. Heuschling, H. Meinhold, L. Kobbelt
wiley   +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, Carlo Condo, Warren J. Gross   +2 more
openaire   +2 more sources