Other
-
LanguagesFrench, English, Italian
Publications (55) View all
-
Article: Achieving the AWGN Channel Capacity With Lattice Gaussian Distribution
[show abstract] [hide abstract]
ABSTRACT: We propose a new coding scheme using only one lattice that, under lattice decoding, achieves the $1/2\log(1+\SNR)$ capacity of the additive white Gaussian noise (AWGN) channel. The scheme applies a discrete Gaussian distribution over an AWGN-good lattice, but does not require a shaping lattice or dither. Thus, it significantly simplifies the default lattice coding scheme of Erez and Zamir which additionally involves a quantization-good lattice. Using the flatness factor, we show that the error probability of the proposed scheme under minimum mean-square error (MMSE) lattice decoding is almost the same as that of Poltyrev's coding over an infinite lattice, for any rate up to the AWGN channel capacity.02/2013; -
Conference Proceeding: Physical Layer Network Coding for Bridge Wireless Monitoring
[show abstract] [hide abstract]
ABSTRACT: Structural Health Monitoring of bridges has aroused the interest of many researchers on various disciplines. Our purpose in this paper is to make an overview on SHM of bridges from two different research areas: Civil and Communication Engineering. For the former part, we provide some insights into the objectives and the ways SHM of bridges is made. For the Communication Engineering side, we provide some background on the used technologies in SHM of bridges. We distinguish the wired and Wireless Sensor Networks (WSNs). We focus on communication limitations in WSNs, mainly the interference problem occurring when the sensors broadcast their measurements and resulting in performance degradation. In this paper we review basic tools existing in literature based on the Physical Layer Network Coding approaches. We focus on the Compute-and-Forward protocol known to provide significant gains. Our main contribution concerns the implementation of this protocol and discussion of its practical challenges.6th International Conference on Bridge Maintenance, Safety and Management, Stresa, Italy; 02/2013 -
Conference Proceeding: Lattice Decoding for the Compute-and-Forward Protocol
[show abstract] [hide abstract]
ABSTRACT: In this work we focus exclusively on the Compute-and-Forward (C&F) protocol as a channel coding-based approach for Physical Layer Network Coding. The Core principle of this relaying strategy is based on using Nested Lattice Codes. The source nodes in a relay network encode their messages into lattice codewords and transmit them to the relay. The latter receives a noisy mixing of these codewords and decodes an integer linear combination of them for sequential transmission. To the best of our knowledge, all existent works related to the Compute-and-Forward protocol study only its theoretical limits and no experimental analysis has been proposed so far. Our contribution through this work concerns a plethora of practical aspects, related to lattice decoding for the C&F, that need to be solved to achieve the promising potential of this strategy. We propose practical decoding approaches and investigate the achieved diversity order and identify the relevant parameters that may influence it. We provide simulation results to compare the performance of the different proposed decoding approaches and to link theoretical results with practical aspects.Third International Conference on Communications and Networking, Tunisia; 02/2013 -
Article: Semantically Secure Lattice Codes for the Gaussian Wiretap Channel
[show abstract] [hide abstract]
ABSTRACT: We prove that nested lattice codes can achieve semantic security and strong secrecy over the Gaussian wiretap channel. The key tool in our proof is the flatness factor which characterizes the convergence of the conditional output distributions corresponding to different messages and leads to an upper bound on the information leakage. We not only show the existence of lattice codes that are good for secrecy, but also propose the {flatness factor} as a new design criterion. Both the modulo-lattice Gaussian channel and the genuine Gaussian channel are considered. In the latter case, we propose a new secrecy coding scheme based on the discrete Gaussian distribution over a lattice, which achieves the secrecy capacity to within a half nat under mild conditions. No \textit{a priori} distribution of the message is assumed, and no dither is used in our proposed schemes.10/2012; -
Article: Practical Encoders and Decoders for Euclidean Codes from Barnes-Wall Lattices
[show abstract] [hide abstract]
ABSTRACT: In this paper, we address the design of high spectral-efficiency Barnes-Wall (BW) lattice codes which are amenable to low-complexity decoding in additive white Gaussian noise (AWGN) channels. We propose a new method of constructing complex BW lattice codes from linear codes over polynomial rings, and show that the proposed construction provides an explicit method of bit-labeling complex BW lattice codes. To decode the code, we adapt the low-complexity sequential BW lattice decoder (SBWD) recently proposed by Micciancio and Nicolosi. First, we study the error performance of SBWD in decoding the infinite lattice, wherein we analyze the noise statistics in the algorithm, and propose a new upper bound on its error performance. We show that the SBWD is powerful in making correct decisions well beyond the packing radius. Subsequently, we use the SBWD to decode lattice codes through a novel noise-trimming technique. This is the first work that showcases the error performance of SBWD in decoding BW lattice codes of large block lengths.03/2012;
