243 research outputs found

    Dynamic Code Selection Method for Content Transfer in Deep Space Network

    Get PDF
    Space communications feature large round-trip time delays (for example, between 6.5 and 44 minutes for Mars to Earth and return, depending on the actual distance between the two planets) and highly variable data error rates, for example, bit error rate (BER) of 10−5 is very comand even higher BERs on the order of 10−1 is observed in the deep- space environment. We develop a new content transfer protocol based on RaptorQ codes and turbo codes together with a real-time channel prediction model to maximize file transfer from space vehicles to the Earth stations. While turbo codes are used to correct channel errors, RaptorQ codes are applied to eliminate the need for negative-acknowledgment of the loss of any specific packet. To reduce the effect of channel variation, we develop a practical signal-to-noise ratio (SNR) prediction model that is used to periodically adjust the turbo encoder in distant source spacecraft. This new protocol, termed as dynamic code selection method (DCSM), is compared with two other methods: turbo based genie method (upper bound of DCSM performance) assuming that the channel condition is perfectly known in advance and a static method in which a fixed turbo encoder is used throughout a communication pass. Simulation results demonstrate that the genie can increase telemetry channel throughput expressed in terms of the total number of successfully delivered files during a communication pass by about 20.3 % and DCSM achieves more than 99 % of genie, compared to the static approach being used currently

    Contribution to the construction of fingerprinting and watermarking schemes to protect mobile agents and multimedia content

    Get PDF
    The main characteristic of fingerprinting codes is the need of high error-correction capacity due to the fact that they are designed to avoid collusion attacks which will damage many symbols from the codewords. Moreover, the use of fingerprinting schemes depends on the watermarking system that is used to embed the codeword into the content and how it honors the marking assumption. In this sense, even though fingerprinting codes were mainly used to protect multimedia content, using them on software protection systems seems an option to be considered. This thesis, studies how to use codes which have iterative-decoding algorithms, mainly turbo-codes, to solve the fingerprinting problem. Initially, it studies the effectiveness of current approaches based on concatenating tradicioanal fingerprinting schemes with convolutional codes and turbo-codes. It is shown that these kind of constructions ends up generating a high number of false positives. Even though this thesis contains some proposals to improve these schemes, the direct use of turbo-codes without using any concatenation with a fingerprinting code as inner code has also been considered. It is shown that the performance of turbo-codes using the appropiate constituent codes is a valid alternative for environments with hundreds of users and 2 or 3 traitors. As constituent codes, we have chosen low-rate convolutional codes with maximum free distance. As for how to use fingerprinting codes with watermarking schemes, we have studied the option of using watermarking systems based on informed coding and informed embedding. It has been discovered that, due to different encodings available for the same symbol, its applicability to embed fingerprints is very limited. On this sense, some modifications to these systems have been proposed in order to properly adapt them to fingerprinting applications. Moreover the behavior and impact over a video produced as a collusion of 2 users by the YouTube’s s ervice has been s tudied. We have also studied the optimal parameters for viable tracking of users who have used YouTube and conspired to redistribute copies generated by a collusion attack. Finally, we have studied how to implement fingerprinting schemes and software watermarking to fix the problem of malicious hosts on mobile agents platforms. In this regard, four different alternatives have been proposed to protect the agent depending on whether you want only detect the attack or avoid it in real time. Two of these proposals are focused on the protection of intrusion detection systems based on mobile agents. Moreover, each of these solutions has several implications in terms of infrastructure and complexity.Els codis fingerprinting es caracteritzen per proveir una alta capacitat correctora ja que han de fer front a atacs de confabulació que malmetran una part important dels símbols de la paraula codi. D'atra banda, la utilització de codis de fingerprinting en entorns reals està subjecta a que l'esquema de watermarking que gestiona la incrustació sigui respectuosa amb la marking assumption. De la mateixa manera, tot i que el fingerprinting neix de la protecció de contingut multimèdia, utilitzar-lo en la protecció de software comença a ser una aplicació a avaluar. En aquesta tesi s'ha estudiat com aplicar codis amb des codificació iterativa, concretament turbo-codis, al problema del rastreig de traïdors en el context del fingerprinting digital. Inicialment s'ha qüestionat l'eficàcia dels enfocaments actuals en la utilització de codis convolucionals i turbo-codis que plantegen concatenacions amb esquemes habituals de fingerprinting. S'ha demostrat que aquest tipus de concatenacions portaven, de forma implícita, a una elevada probabilitat d'inculpar un usuari innocent. Tot i que s'han proposat algunes millores sobre aquests esquemes , finalment s'ha plantejat l'ús de turbocodis directament, evitant així la concatenació amb altres esquemes de fingerprinting. S'ha demostrat que, si s'utilitzen els codis constituents apropiats, el rendiment del turbo-descodificador és suficient per a ser una alternativa aplicable en entorns amb varis centenars d'usuaris i 2 o 3 confabuladors . Com a codis constituents s'ha optat pels codis convolucionals de baix ràtio amb distància lliure màxima. Pel que fa a com utilitzar els codis de fingerprinting amb esquemes de watermarking, s'ha estudiat l'opció d'utilitzar sistemes de watermarking basats en la codificació i la incrustació informada. S'ha comprovat que, degut a la múltiple codificació del mateix símbol, la seva aplicabilitat per incrustar fingerprints és molt limitada. En aquest sentit s'ha plantejat algunes modificacions d'aquests sistemes per tal d'adaptar-los correctament a aplicacions de fingerprinting. D'altra banda s'ha avaluat el comportament i l'impacte que el servei de YouTube produeix sobre un vídeo amb un fingerprint incrustat. A més , s'ha estudiat els paràmetres òptims per a fer viable el rastreig d'usuaris que han confabulat i han utilitzat YouTube per a redistribuir la copia fruït de la seva confabulació. Finalment, s'ha estudiat com aplicar els esquemes de fingerprinting i watermarking de software per solucionar el problema de l'amfitrió maliciós en agents mòbils . En aquest sentit s'han proposat quatre alternatives diferents per a protegir l'agent en funció de si és vol només detectar l'atac o evitar-lo en temps real. Dues d'aquestes propostes es centren en la protecció de sistemes de detecció d'intrusions basats en agents mòbils. Cadascuna de les solucions té diverses implicacions a nivell d'infrastructura i de complexitat.Postprint (published version

    Mcmc- Based Optimization And Application

    Get PDF
    In the thesis, we study the theory of Markov Chain Monte Carlo (MCMC) and its application in statistical optimization. The MCMC method is a class of evolutionary algorithms for generating samples from given probability distributions. In the thesis, we first focus on the methods of slice sampling and simulated annealing. While slice sampling has a merit to generate samples based on the underlying distribution with adjustable step size, simulated annealing can facilitate samples to jump out of local optima and converge quickly to the global optimum. With this MCMC method, we then solve two practical optimization problems. The first problem is image transmission over varying channels. Existing work in media transmission generally assumes that channel condition is stationary. However, communication channels are often varying with time in practice. Adaptive design needs frequent feedback for channel updates, which is often impractical due to the complexity and delay. In this application, we design an unequal error protection scheme for image transmission over noisy varying channels based on MCMC. First, the problem cost function is mapped into a multi-variable probability distribution. Then, with the “detailed balance , MCMC is used to generate samples from the mapped stationary distribution so that the optimal solution is the one that gives the lowest data distortion. We also show that the final rate allocation designed with this method works better than a conventional design that considers the mean value of the channel. In the second application, we consider a terminal-location-planning problem for intermodal transportation systems. With a given number of potential locations, it needs to find the most appropriate number of terminals and their locations to provide the economically most efficient operation when multiple service pairs exist simultaneously. The problem also has an inherent issue that for a particular planning, the optimal route paths must be determined for the co-existing service pairs. To solve this NP-hard problem, we design a MCMC-based two-layer method. The lower-layer is an optimal routing design for all service pairs given a particular planning that considers both efficiency and fairness. The upper-layer is finding the optimal planning based on MCMC with the stationary distribution that is mapped from the cost function. The effectiveness of this method is demonstrated through computer simulations and comparison with one state-of-the-art method. The work of this thesis has shown that a MCMC-method, consisting of both slice sampling and simulated annealing, can be successfully applied to solving practical optimization problems. Particularly, the method has advantages in dealing with high-dimensional problems with large searching spaces

    Optimisation de la transmission de phonie et vidéophonie sur les réseaux à larges bandes PMR

    Get PDF
    Cet exposé analyse les perspectives large bande des réseaux PMR, à travers l'évaluation du candidat LTE, et la proposition d'une possible évolution du codage canal, la solution brevetée des codes turbo à protection non uniforme. Une première étude dans le chapitre 2 se concentre sur l'analyse multi-couche et l'identification des problèmes clé des communications de voix et de vidéo sur un réseau LTE professionnel. Les capacités voix et vidéo sont estimées pour les liens montant et descendant de la transmission LTE, et l'efficacité spectrale de la voix en lien descendant est comparée à celle de PMR et GSM. Ce chapitre souligne certains points clé de l'évolution de LTE. S'ils étaient pas résolus par la suite, LTE se verrait perdre de sa crédibilité en tant que candidat à l'évolution de la PMR. Une telle caractéristique clé des réseaux PMR est le codage canal à protection non uniforme, qui pourrait être adapté au système LTE pour une évolution aux contraintes de la sécurité publique. Le chapitre 3 introduit cette proposition d'évolution, qui a été brevetée: les turbo codes à protection non uniforme intégrée. Nous proposons une nouvelle approche pour le codage canal à protection non uniforme à travers les codes turbo progressives hiérarchiques. Les configurations parallèles et séries sont analysées. Les mécanismes de protection non uniformes sont intégrés dans la structure de l'encodeur même à travers l'insertion progressif et hiérarchique de nouvelles données de l'utilisateur. Le turbo décodage est modifié pour exploiter de façon optimale l'insertion progressive de données dans le processus d'encodage et estimer hiérarchiquement ces données. Les propriétés des structures parallèles et séries sont analysées à l'aide d'une analogie aux codes pilotes, ainsi qu'en regardant de plus près leurs caractéristiques de poids de codage. Le taux de transmission virtuel et les représentations des graphs factor fournissent une meilleure compréhension de ces propriétés. Les gains de codage sont évalués à l'aide de simulations numériques, en supposant des canaux de transmission radio statiques et dynamiques, et en utilisant des codes de référence. Enfin, dans le chapitre 4, l'idée breveté du code turbo parallal progressif et hiérarchique (PPHTC) est évaluée sur la plateforme LTE. Une description détaillée de l'architecture des bearers de LTE est donnée, et ses conséquences sont discutées. Le nouveau codage canal est inséré et évalué sur cette plateforme, et ses performances sont comparées avec des schémas de transmission typique à LTE. L'analyse de la qualité de la voix aide à conclure sur l'efficacité de la solution proposée dans un système de transmission réel. Pourtant, même si cette dernière donne les meilleurs résultats, d'avantage d'optimisations devraient être envisagées pour obtenir des gains améliorés et mieux exploiter le potentiel du codage proposé. L'exposé se conclut dans le chapitre 5 et une courte discussion présente les futures perspectives de rechercheThis dissertation analyzes the PMR broadband perspectives, through the evaluation of the preferred candidate, LTE, and the proposal of a possible channel coding evolution, the patented solution of unequal error protection embedded turbo codes. A first study in chapter 2 focuses on the multi-layer analysis and the identification of key issues for professional-like LTE for voice and video communications. The voice and video capacities are estimated for both downlink and uplink LTE transmissions, and the downlink LTE voice system efficiency is compared with that of the PMR and Global System for Mobile Communications (GSM). This chapter helps highlighting some of the key points. If not resolved, the latter could lead to the LTE downfall as a candidate for the PMR evolution. One such key characteristic of PMR systems is the unequal error protection channel coding technique, which might be adapted to the LTE technology for its evolution to public safety requirements. Chapter 3 further introduces the proposed evolution patented ideas: the unequal error protection embedded turbo codes. We propose a new approach for the unequal error protection channel coding through the progressive hierarchical turbo codes. Both parallel and serial turbo configurations are closely studied. The unequal error protection mechanisms are embedded in the encoder s structure itself through the progressive and hierarchical insertion of new data. The turbo decoding is modified as to optimally exploit the progressive insertion of information in the encoding process and hierarchically estimate the corresponding data. Both parallel and serial configurations properties are analyzed using an analogy with a pilot code behavior, as well as a zoom on the weight error functions coefficients. The virtual code rate and factor graph interpretations also provide a better insight on the code properties. The code possible gains are highlighted through computer simulations in both static and dynamic transmission environments, by using carefully chosen benchmarks. Finally, in chapter 4, the patented idea of parallel progressive hierarchical turbo codes (PPHTC) is evaluated over the LTE platform. A detailed description is given of the voice transmission bearer architecture over LTE, and its consequences are discussed. The new channel code is inserted and evaluated over this platform and its performances compared with the existent LTE transmission schemes. The voice quality results help concluding on the efficiency of the proposed solution in a real transmission scenario. However, even though the newly presented solution gives the best results, further system optimizations should be envisaged for obtaining better gains and exploit the parallel progressive hierarchical turbo codes potential. The dissertation concludes in chapter 5 and a short discussion is given on future research perspectivesEVRY-INT (912282302) / SudocSudocFranceF

    Advanced digital and analog error correction codes

    Get PDF

    Joint Source-Channel Coding for Image Transmission over Underlay Multichannel Cognitive Radio Networks

    Get PDF
    The increasing prominence of wireless applications exacerbates the problem of radio spectrum scarcity and promotes the usage of Cognitive Radio (CR) in wireless networks. With underlay dynamic spectrum access, CRs can operate alongside Primary Users, the incumbent of a spectrum band, as long as they limit the interference to the Primary Users below a certain threshold. Multimedia streaming transmissions face stringent Quality of Services constraints on top of the CR interference constraints, as some packets in the data stream have higher levels of importance and are the most vulnerable to packet loss over the channel. This raises a need for Unequal Error Protection (ULP) for multimedia streams transmissions, in which the channel encoder assigns different amount of error correction to different parts of the data stream, thereby protecting more the most valuable parts of the stream from packet loss problems. This research presents an end-to-end system setup for image transmission, utilizing ULP as part of a Joint Source-Channel Coding scheme over a multichannel CR network operating through underlay dynamic spectrum access. The setup features a Set Partitioning in Hierarchical Trees (SPIHT) source encoder, and Reed-Solomon forward error correction channel coding, and uses their properties to devise an ULP framework that maximizes the quality of the received image

    Mapping Design for 2M -Ary Bit-Interleaved Polar Coded Modulation

    Get PDF
    This paper proposes a mapping design for bit-interleaved polar coded modulation (BIPCM) systems with belief propagation (BP) decoding. We first introduce a two-layer bipartite graph to represent BIPCM, where a new mapping graph linking polar graph to modulator is added to the conventional factor graph. Then, a mapping design is proposed and the design paradigm is to separate sub-channels with lower reliability to different stopping trees of polar codes, aiming to make sure that each stopping tree receives reliable extrinsic information from demodulator. The proposed mapping algorithm is employed for BIPCM with traditional polar codes over 16-quadrature amplitude modulation (QAM) and 256-QAM. Numerical results show that our scheme can improve the error-correcting performance compared to the conventional scheme with a random mapping. Furthermore, to meet code-length requirement of different modulation orders, we propose an efficient method to construct flexible-length polar code (FLPC) by coupling several short length polar codes with a repeat-accumulate (RA) code. Also, the proposed FLPC is employed in the BIPCM system, with the designed mapping algorithm, simulation result also reveals that the block error rate performance of proposed BIPCM scheme with BP decoding outperforms the one with successive cancellation decoding by providing a gain up to 1 dB
    • …
    corecore