Results 31 to 40 of about 176,435 (273)

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

The Polar Code Construction Method in Free Space Optical Communication

open access: yesPhotonics, 2022
In order to solve the problem of the high complexity of polarization code construction under free-space optical communication, this paper proposes a segmented turbulent partial order construction method, which effectively reduces the complexity of ...
Yang Cao   +4 more
doaj   +1 more source

A Multi-Kernel Multi-Code Polar Decoder Architecture [PDF]

open access: yes, 2018
Polar codes have received increasing attention in the past decade, and have been selected for the next generation of wireless communication standard.
Condo, Carlo   +3 more
core   +2 more sources

Code Constructions for Physical Unclonable Functions and Biometric Secrecy Systems [PDF]

open access: yes, 2019
The two-terminal key agreement problem with biometric or physical identifiers is considered. Two linear code constructions based on Wyner-Ziv coding are developed. The first construction uses random linear codes and achieves all points of the key-leakage-
Günlü, Onur   +3 more
core   +2 more sources

Computing tight upper bounds for Bhattacharyya parameters of binary polar code kernels with arbitrary dimension

open access: yesEURASIP Journal on Wireless Communications and Networking, 2021
Multi-kernel polar codes have recently received considerable attention since they can provide more flexible code lengths than do the original ones. The construction process of them can be simplified by obtaining the Bhattacharyya parameter bounds of the ...
Tikui Zhang, Sensen Li, Bin Yu
doaj   +1 more source

Efficient Implementation of Density Evolution for Punctured Polar Codes

open access: yesIEEE Access, 2019
Polar codes asymptotically achieve the symmetric capacity of arbitrary binary-input discrete memoryless channels under low-complexity sequential decoding algorithms such as successive cancellation decoding.
Christopher Schnelling   +4 more
doaj   +1 more source

A Fast Polar Code Construction Method Based on Monte Carlo [PDF]

open access: yesJisuanji gongcheng, 2019
In order to construct high-dimensional core matrix polar codes quickly,a two-stage polar code construction method TPMC based on Monte Carlo(MC) is proposed.In the first stage,the most reliable and unreliable bits are obtained by using the Gauss ...
ZHANG Shiyi, HUANG Zhiliang, ZHOU Shuihong, ZHONG Farong
doaj   +1 more source

Does Gaussian Approximation Work Well for the Long-Length Polar Code Construction?

open access: yesIEEE Access, 2017
Gaussian approximation (GA) is widely used to construct polar codes. However, when the code length is long, the subchannel selection inaccuracy due to the calculation error of conventional approximate GA (AGA), which uses a two-segment approximation ...
Jincheng Dai   +4 more
doaj   +1 more source

Low-Latency Multi-Kernel Polar Decoders

open access: yesIEEE Access, 2022
Polar codes have been receiving increased attention for application in beyond 5G networks. They offer low-complexity decoding algorithm and can achieve symmetric channel capacity.
Hossein Rezaei   +2 more
doaj   +1 more source

Practical polar code construction using generalised generator matrices [PDF]

open access: yesIET Communications, 2014
Polar coding is a recently proposed coding technique that can provably achieve the channel capacity. The polar code structure, which is based on the original 2 × 2 generator matrix, polarises the channels, that is, a portion of the channel capacities approach 1, whereas the remaining channel capacities approach 0.
Serbetci, Berksan, Pusane, Ali Emre
openaire   +2 more sources

Home - About - Disclaimer - Privacy