Results 41 to 50 of about 212 (168)

Soft-Output Successive Cancellation List Decoding

open access: yesIEEE Transactions on Information Theory
We introduce an algorithm for approximating the codebook probability that is compatible with all successive cancellation (SC)-based decoding algorithms, including SC list (SCL) decoding. This approximation is based on an auxiliary distribution that mimics the dynamics of decoding algorithms with an SC decoding schedule.
Peihong Yuan   +2 more
openaire   +2 more sources

Belief Propagation Bit-Flip Decoder for Polar Codes

open access: yesIEEE Access, 2019
The bit-flip method has been successfully applied to the successive cancellation (SC) decoder to improve the block error rate (BLER) performance for polar codes in the finite code length region.
Yongrun Yu   +3 more
doaj   +1 more source

Organic Materials of Tomorrow: Horizons of Artificial Intelligence

open access: yesAdvanced Materials, EarlyView.
This review examines machine learning techniques accelerating the discovery of organic semiconductors by linking molecular structure to properties. Key methods include graph neural networks, generative models, and active learning. Applications to organic photovoltaics demonstrate practical impact.
Harold Mena   +3 more
wiley   +1 more source

Rate‐compatible systematic polar codes

open access: yesIET Communications, 2021
Puncturing and shortening are two common ways to achieve rate‐compatible non‐systematic polar codes (NSPCs). Systematic polar codes (SPCs) have been shown to outperform NSPCs with the same encoding and decoding complexity.
Hongfei Zhu   +3 more
doaj   +1 more source

SPADE: A Deep Learning Framework for Spatial Mapping and Quantitative Cell–Cell Interaction Inference

open access: yesAdvanced Science, EarlyView.
SPADE integrates spatial transcriptomics with single‐cell RNA sequencing by using cell–cell communications (CCC) as a guide for spatial mapping. It improves cell‐type localization, enhances sparse gene‐expression signals, and reveals CCC programs at single‐spot resolution.
Xinyi Li, Ning Zhang, Zijie Jin
wiley   +1 more source

Judgement of error frames using frozen bits and its applications in decoding of polar codes

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

StackingNet: Collective Inference Across Independent AI Foundation Models

open access: yesAdvanced Science, EarlyView.
ABSTRACT Artificial intelligence (AI) built on large foundation models has transformed language understanding, computer vision, and reasoning, yet these systems remain isolated and cannot readily share their capabilities. Coordinating the complementary strengths of independently developed, black‐box foundation models is essential for trustworthy ...
Siyang Li   +4 more
wiley   +1 more source

Polar Codes With Repeating Bits and the Construction by Cluster Pairwise Error Probability

open access: yesIEEE Access, 2019
A polar code with repeating bits (RB polar code), where a part of frozen bits only repeat their preceding information bits, is proposed. In the code construction, we propose cluster pairwise error probability (CPEP) to measure the competitiveness of the ...
Tao Wang, Daiming Qu, Tao Jiang
doaj   +1 more source

Application research of polar coded OFDM underwater acoustic communications

open access: yesEURASIP Journal on Wireless Communications and Networking, 2023
To further accelerate the practical process of polar codes in underwater acoustic communication (UWC) and improve the reliability and efficiency of underwater data transmission, we first propose a polar code construction method suitable for the ...
Yushuang Zhai   +3 more
doaj   +1 more source

List successive cancellation decoding of polar codes

open access: yesElectronics Letters, 2012
A list successive cancellation (LSC) decoding algorithm to boost the performance of polar codes is proposed. Compared with traditional successive cancellation decoding algorithms, LSC simultaneously produces at most L locally best candidates during the decoding process to reduce the chance of missing the correct codeword.
K. Chen, K. Niu, J.R. Lin
openaire   +1 more source

Home - About - Disclaimer - Privacy