Proceedings Article10.1109/ICSAI.2017.8248431
Modified decoding algorithm of LDPC codes for physical-layer key reconciliation
Ying-wei Lu,Ze-liang Zheng,Xiao-yun Hou +2 more
- 01 Nov 2017
- pp 996-1000
3
TL;DR: The modified decoding algorithm of LDPC codes that combine traditional decoding algorithm and Offset-base decoding algorithm is proposed that can reduce the computational complexity efficiently, and improve the efficiency of key reconciliation.
read more
Abstract: Key extraction based on wireless channel-characteristics (Physical-Layer Key) is the new technology to ensure communication security. To solve the problem that the channel characteristics are not completely consistent in the process of key generation, low density parity check (LDPC) codes was proposed. But due to the process of the traditional decoding algorithm of LDPC codes, the computation of check nodes renew is too high and the efficiency of key reconciliation is too low. To overcome this problem, we propose the modified decoding algorithm of LDPC codes that combine traditional decoding algorithm and Offset-base decoding algorithm. This algorithm can reduce the computational complexity efficiently, and improve the efficiency of key reconciliation. Finally, the simulation results demonstrate that, the BER and success ratio of the key reconciliation is improving.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Hardware Efficient Architectural Design for Physical Layer Security in Wireless Communication
R. Pradeep,R. Kanimozhi +1 more
TL;DR: A Hardware Efficient Secure Channel Coding Scheme for Physical Layer Security (HESCC-PLS) is designed to be incorporated and use a method named Extended Difference Family (EDF) Semi-Cyclic Low-Density Parity-Check (SC LDPC) code.
19
Conceiving Extrinsic Information Transfer Charts for Stochastic Low-Density Parity-Check Decoders
TL;DR: A novel extrinsic information transfer chart technique is proposed for characterizing the iterative decoding convergence of all the sequences involved in the SLDPC, which takes into consideration not only the sequences exchanged between the decoders but also the sequences generated inside the variable-node decoder (those which are stored in the edge memories).
A VT-Code-Based Information Reconciliation Scheme for Secret Key Generation Using RSS
Honghai Tang,Guyue Li,Tao Guo,Aiqun Hu +3 more
TL;DR: This letter models the misalignment problem as an insertion/deletion problem for the first time and proposes an information reconciliation scheme based on the Varshamov-Tenengolts (VT) code, which significantly reduces the key disagreement ratio.
References
•Book
Low-Density Parity-Check Codes
Robert G. Gallager
- 01 Jan 1963
TL;DR: A simple but nonoptimum decoding scheme operating directly from the channel a posteriori probabilities is described and the probability of error using this decoder on a binary symmetric channel is shown to decrease at least exponentially with a root of the block length.
Compression of binary sources with side information at the decoder using LDPC codes
TL;DR: Low-density parity-check (LDPC) codes can be used to compress close to the Slepian-Wolf limit for correlated binary sources with side information at the decoder based on viewing the correlation as a channel and applying the syndrome concept.
741
Compression of binary sources with side information at the decoder using ldpc code
A D Liveris,Xiong Z.Ch.,C N Georghiades +2 more
- 01 Jan 2002
TL;DR: In this paper, low-density parity-check (LDPC) codes were used to compress close to the Slepian-Wolf limit for correlated binary sources with side information at the decoder.
619
Secure wireless communications: Secret keys through multipath
Akbar M. Sayeed,A. Perrig +1 more
- 12 May 2008
TL;DR: This work proposes a protocol that exploits the inherent randomness in multipath wireless channels for generating secret keys through channel estimation and quantization and shows that the resulting keys are distinct for distinct pairwise links with a probability that increases exponentially with the key-size/channel DoF.
291
Optimized Message Passing Schedules for LDPC Decoding
Predrag Radosavljevic,A. de Baynast,Joseph R. Cavallaro +2 more
- 01 Nov 2005
TL;DR: It is shown analytically that the convergence rate for this type of scheduling is about two times increased for most of the regular LDPC codes, and it is proved that `turbo-scheduling' applied on the rows of the parity check matrix is identical belief propagation algorithm as standard message passing algorithm.
Related Papers (5)
Cornelius T. Healy,Rodrigo C. de Lamare +1 more
- 08 Jun 2015
Sanae El Hassani,Marie-Helene Hamon,Pierre Penard +2 more
- 16 May 2010