arXiv subjects

Onurcan İşcan

Publications and source records attributed to Onurcan İşcan.

6 recordsLinked to original sources

arXiv2020

Secure and Reliable Key Agreement with Physical Unclonable Functions

Different transforms used in binding a secret key to correlated physical-identifier outputs are compared. Decorrelation efficiency is the metric used to determine transforms that give highly-uncorrelated outputs. Scalar quantizers are applied to transform outputs to extract uniformly distributed bit sequences to which secret keys are bound. A set of transforms that perform well in terms of the decorrelation efficiency is applied to ring oscillator (RO) outputs to improve the uniqueness and reliability of extracted bit sequences, to reduce the hardware area and information leakage about the key and RO outputs, and to maximize the secret-key length. Low-complexity error-correction codes are proposed to illustrate two complete key-binding systems with perfect secrecy, and better secret-key and privacy-leakage rates than existing methods. A reference hardware implementation is also provided to demonstrate that the transform-coding approach occupies a small hardware area.

cs.CR↗

arXiv2019

Sign-Bit Shaping Using Polar Codes

A new polar coding scheme for higher order modulation is presented. The proposed scheme is based on multi-level coding (MLC) with natural labeling, where the bit-level corresponding to the sign-bit is generated in dependence on the previous bit-levels, such that the modulated symbols are distributed according to a target non-uniform distribution resulting in a shaping gain. This is realized by replacing the polar encoder in the sign-bit level by a successive cancellation (SC) decoder, such that the overall complexity is not increased compared to a conventional MLC scheme with polar codes. Numerical simulations show significant performance improvements of the proposed approach compared to conventional transmission schemes with uniform symbol distribution. By using more complex decoders (e.g. SC list decoder), the proposed scheme outperforms Gallager's random coding bound.

cs.IT↗

arXiv2019

Code Constructions for Physical Unclonable Functions and Biometric Secrecy Systems

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-storage regions of the generated-secret and chosen-secret models. The second construction uses nested polar codes for vector quantization during enrollment and for error correction during reconstruction. Simulations show that the nested polar codes achieve privacy-leakage and storage rates that improve on existing code designs. One proposed code achieves a rate tuple that cannot be achieved by existing methods.

cs.IT↗

arXiv2018

Probabilistically Shaped Multi-Level Coding with Polar Codes for Fading Channels

A probabilistic shaping method for multi-level coding (MLC) is presented, where the transmitted symbols are forced to have a shaped non-uniform distribution. It is shown that shaping only a single bit-level suffices to compensate for most of the shaping loss on the fading channels. A polar code based implementation of the proposed scheme is presented, where shaping is performed by using a precoder at the transmitter without increasing the decoding complexity. Simulation results show that performance improvements can be obtained compared to BICM- and MLC-based polar coding without shaping on Rayleigh fading channels.

cs.IT↗

arXiv2018

Polar Codes with Integrated Probabilistic Shaping for 5G New Radio

A modification to 5G New Radio (NR) polar code is proposed, which improves the error correction performance with higher order modulation through probabilistic shaping. The presented scheme mainly re-uses existing hardware at the transmitter, and modifications at the receiver are small. Simulation results show that the presented approach can improve the performance by up to 1dB for 256-QAM on AWGN channels

cs.IT↗

arXiv2018

Polar Code Construction for List Decoding

A heuristic construction of polar codes for successive cancellation list (SCL) decoding with a given list size is proposed to balance the trade-off between performance measured in frame error rate (FER) and decoding complexity. Furthermore, a construction based on dynamically frozen bits with constraints among the "low weight bits" (LWB) is presented. Simulation results show that the LWB-polar codes outperform the CRC-polar codes and the eBCH-polar codes under SCL decoding.

cs.IT↗