Search

Reconciliation is a mechanism allowing to weed out the discrepancies between two correlated variables. It has great role in every Quantum Key Distribution protocol where the key has to be transmitted through a noisy channel or as in our case of study in presence of an eavesdropping. In this paper, we show that for discrete-variable QKD protocols, this problem can be advantageously solved with Turbo codes. In particular, we demonstrate that our method leads to a significant improvement of Bit Error Rate, may divide it by three in presence of a eavesdropper even with great eavesdropping capability., Comment: 4 pages, 8 figures, conference. arXiv admin note: substantial text overlap with arXiv:2002.04887, arXiv:2002.07778; text overlap with arXiv:0901.2140 by other authors

This paper investigates a new information reconciliation method for quantum key distribution in the case where two parties exchange key in the presence of a malevolent eavesdropper. We have observed that reconciliation is a special case of channel coding and for that existing techniques can be adapted for reconciliation. We describe an explicit reconciliation method based on Turbo codes. We believe that the proposed method can improve the efficiency of quantum key distribution protocols based on discrete quantum states., Comment: 4 pages, 7 figures, conference. arXiv admin note: text overlap with arXiv:2002.04887; text overlap with arXiv:quant-ph/0406001 by other authors

This paper investigates a reconciliation method in order to establish an errorless secret key in a QKD protocol. Classical key distribution protocols are no longer unconditionally secure because computational complexity of mathematical problems forced hardships. In this context, QKD protocols offer a highest level of security because they are based on the quantum laws of physics. But, the protocol performances can be lowered by multiples errors. It appears clearly that reconciliation should be performed in such a situation in order to remove the errors as for the legitimate partners. The proposed method accomplishes reconciliation by using QTC in the special problem of sideinformation source coding (Slepian-Wolf coding model). Our theoretical hypothesis are sustained by experimental results that confirm the advantage of our method in resolving reconciliation problem compared to a recent related work. Indeed, the integration of our method generates an important progess in security and a large decrease of the QBER. The gain is obtained with a reasonable complexity increase. Also, the novelty of our work is that it tested the reconciliation method on a real photonic system under VPItransmissionMaker., Comment: 6 pages, 9 figures, conference

It has been proven in the literature that the main technological factors limiting the communication rates of quantum cryptography systems by single photon are mainly related to the choice of the encoding method. In fact, the efficiency of the used sources is very limited, at best of the order of a few percent for the single photon sources and the photon counters can not be operated beyond a certain speed and with a low order of detection efficiency. In order to overcome partially these drawbacks, it is advantageous to use continuous quantum states as an alternative to standard encodings based on quantum qubits. In this context, we propose a new reconciliation method based on Turbo codes. Our theoretical model assumptions are supported by experimental results. Indeed, our method leads to a significant improvement of the protocol security and a large decrease of the QBER. The gain is obtained with a reasonable complexity increase. Also, the novelty of our work is that it tested the reconciliation method on a real photonic system under VPItransmissionMaker.

In this paper, we propose how to construct a reconciliation method for the BB84 Quantum Key Distribution (QKD) protocol. Theoretically, it is unconditionally secure because it is based on the quantum laws of physics, rather than the assumed computational complexity of mathematical problems. BB84 protocol performances can be reduced by various errors and information leakages such as limited intrinsic efficiency of the protocol, imperfect devices and eavesdropping. The proposed reconciliation method allowed to weed out these errors by using Turbo codes. Since their high error correction capability implies getting low errors, this method has high performance especially when compared to the last method presented in the literature based on Low- Density Parity Check codes (LDPC). In particular, we demonstrate that our method leads to a significant improvement of the protocol security and of the Bit Error Rate (BER) even with great eavesdropping capability., Comment: 12 pages, 9 figures, journal

In this paper, we implement hybrid Woodward-Lawson-Neural Networks and weighted Fourier method to synthesize antenna arrays. The neural networks (NN) is applied here to simplify the modeling of MIMO antenna arrays by assessing phases. The main problem is obviously to find optimal weights of the linear antenna array elements giving radiation pattern with minimum sidelobe level (SLL) and hence ameliorating the antenna array performance. To attain this purpose, an antenna array for reliable Multiple-Input Multiple-Output (MIMO) applications with frequency at 2.45 GHz is implemented. To validate the suggested method, many examples of uniformly excited array patterns with the main beam are put in the direction of the useful signal. The Woodward-Lawson-Neural Networks synthesis method permits to find out interesting analytical equations for the synthesis of an antenna array and highlights the flexibility between the system parameters in input and those in output. The performance of this hybrid optimization underlines how well the system is suitable for a wireless communication and how it participates in reducing interference, as well., Comment: Accepted at the IEEE SMC 2017

Nowadays the radio interface of several standards is enhanced with advanced technologies such as OFDMA and extension technology such as relay. By using those promising transmission technology for the next generation wireless communications, scheduling problem becomes more crucial and challenging. In our work, we aim to maximize the overall system capacity while selecting the most suitable relay station under fairness constraint among both users and relay station by proposing a Gap- based scheduling. This one considers the channel state information and the unbalanced rate capacity of the two hops links. Simulations results show the effectiveness of our approach in terms of fairness and the overall system performance., Comment: 6 pages 4 figures

The aim of this work is to model the nodes battery discharge in wireless ad hoc networks. Many work focus on the energy consumption in such networks. Even, the research in the highest layers of the ISO model, takes into account the energy consumption and efficiency. Indeed, the nodes that form such network are mobiles, so no instant recharge of battery. Also with special type of ad hoc networks are wireless sensors networks using non-rechargeable batteries. All nodes with an exhausted battery are considered death and left the network. To consider the energy consumption, in this work we model using a Markov chain, the discharge of the battery considering of instant activation and deactivation distribution function of these nodes., Comment: 11 pages 5 figures results found after publication of a paper in IJWMN; (2012),"Power Control in reactive routing protocol for mobile ad hoc network", International Journal of Wireless & Mobile Networks (IJWMN)

Differential system for ultra wide band (UWB) transmission is a very attractive solution from a practical point of view. In this paper, we present a new direct sequence (DS) UWB system based on the conversion of the received signal from time domain to frequency domain that's why we called FDR receiver. Simulation results show that the proposed receiver structure outperforms the classical differential one for both low and high data rate systems., Comment: 14 pages,5 figures, journal paper

Blind synchronization constitutes a major challenge in realizing highly efficient ultra wide band (UWB) systems because of the short pulse duration which requires a fast synchronization algorithm to accommodate several asynchronous users. In this paper, we present a new Code Block Synchronization Algorithm (CBSA) based on a particular code design for a non coherent transmission. Synchronization algorithm is applied directly on received signal to estimate timing offset, without needing any training sequence. Different users can share the available bandwidth by means of different spreading codes with different lengths. This allows the receiver to separate users, and to recover the timing information of the transmitted symbols. Simulation results and comparisons validate the promising performance of the proposed scheme even in a multi user scenario. In fact, the proposed algorithm offers a gain of about 3 dB in comparison with reference [5]., Comment: 16 pages, 9 figures

This paper introduces a novel blind carrier phase recovery estimator for general 2{\Pi}/M-rotationally symmetric constellations. This estimation method is a generalization of the non-data-aided (NDA) nonlinear Phase Metric Method (PMM) estimator already designed for general quadrature amplitude constellations. This unbiased estimator is seen here as a fourth order PMM then generalized to Mth order (Mth PMM) in such manner that it covers general 2{\Pi}/M-rotationally symmetric constellations such as PAM, QAM, PSK. Simulation results demonstrate the good performance of this Mth PMM estimation algorithm against competitive blind phase estimators already published for various modulation systems of practical interest., Comment: 14 pages, 12 figures, International Journal of Wireless & Mobile Networks (IJWMN)