Search

In this paper, we propose a structured peer-to-peer (P2P) distribution scheme based on Fast Fourier Transform (FFT) graphs. We build a peer-to-peer network that reproduces the FFT graph initially designed for hardware FFT codecs. This topology allows content delivery with a maximum diversity level for a minimum global complexity. The resulting FFTbased network is a structured architecture with an adapted network coding that brings flexibility upon content distribution and robustness upon the dynamic nature of the network. This structure can achieve optimal capacity in terms of content recovery while solving the problem of last remaining blocks, even for large networks., Comment: Submitted to ICC 2010

This paper presents a new construction of Maximum-Distance Separable (MDS) Reed-Solomon erasure codes based on Fermat Number Transform (FNT). Thanks to FNT, these codes support practical coding and decoding algorithms with complexity O(n log n), where n is the number of symbols of a codeword. An open-source implementation shows that the encoding speed can reach 150Mbps for codes of length up to several 10,000s of symbols. These codes can be used as the basic component of the Information Dispersal Algorithm (IDA) system used in a several P2P systems., Comment: submitted in CCNC'10

International audience; The ”SoftWare Radio (SWR)” concept has become a topic of widespread interest for reconfigurable mobile architecture design. It is seen as the next evolutionary step in the mobile communications. In this context of SWR, a way to decrease the runtime of the software reconfiguration and to optimize the sharing between the software and the hardware of the execution platform called ”parametrization” was introduced. This technique is based on two approaches, the first one is called the Common Function approach, the second one is called the Common Operator approach. Being interested on the second parametrization technique, we propose in this paper a reconfigurable FFT (Fast Fourier Transform) operator. This operator can be reconfigured to switch from an operator dedicated to compute the FFT in the complex field (i.e for OFDM modulation or frequential equalization) to an operator which computes the FFT in the Galois Field in order to perform Reed-Solomon (RS) encoding and two steps of the decoding process.