Results 51 to 60 of about 344 (172)

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

On Path Memory in List Successive Cancellation Decoder of Polar Codes [PDF]

2018 IEEE International Symposium on Circuits and Systems (ISCAS), 2018
Polar code is a breakthrough in coding theory. Using list successive cancellation decoding with large list size L, polar codes can achieve excellent error correction performance. The L partial decoded vectors are stored in the path memory and updated according to the results of list management.
ChenYang Xia, YouZhe Fan, Ji Chen, Chi-Ying Tsui   +3 more
openaire   +2 more sources

Triboelectric nanogenerators for vehicle intelligent cockpits

FlexMat, EarlyView.
Converting mechanical stimuli from drivers and vehicle motion into electrical signals, triboelectric nanogenerators provide promising interfaces toward passive, flexible, distributed and intelligent sensing for next‐generation automotive cockpits to support three core functional dimensions: driver state monitoring, vehicle state monitoring, and human ...
Haiqiu Tan, Shiquan Lü, Xiangwei Meng, Huiying Zhang, Wenxing Zhang, Dongxian Sun, Xiao Lu, Lei Wang, Haodong Zhang, William W. Yu   +9 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

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

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

Simplified Successive Cancellation List Decoding of PAC Codes

CoRR
7 pages, 3 ...
Hamid Saber, Homayoon Hatami, Jung Hyun Bae   +2 more
openaire   +2 more sources

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

Survey on Compositional 3D Indoor Scene Generation

Computer Graphics Forum, EarlyView.
This survey provides a comprehensive overview of compositional 3D indoor scene generation, introducing a unified framework for categorizing existing methods, comparing their strengths and limitations and identifying key challenges and future research directions.
H. I. I. Tam, H. I. D. Pun, A. T. Wang, X. Sun, Q. Wu, H. Lee, A. X. Chang, M. Savva   +7 more
wiley   +1 more source