210 research outputs found
Advances in Syndrome Coding based on Stochastic and Deterministic Matrices for Steganography
Steganographie ist die Kunst der vertraulichen Kommunikation. Anders als in der Kryptographie, wo der Austausch vertraulicher Daten für Dritte offensichtlich ist, werden die vertraulichen Daten in einem steganographischen System in andere, unauffällige Coverdaten (z.B. Bilder) eingebettet und so an den Empfänger übertragen.
Ziel eines steganographischen Algorithmus ist es, die Coverdaten nur geringfügig zu ändern, um deren statistische Merkmale zu erhalten, und möglichst in unauffälligen Teilen des Covers einzubetten. Um dieses Ziel zu erreichen, werden verschiedene Ansätze der so genannten minimum-embedding-impact Steganographie basierend auf Syndromkodierung vorgestellt. Es wird dabei zwischen Ansätzen basierend auf stochastischen und auf deterministischen Matrizen unterschieden. Anschließend werden die Algorithmen bewertet, um Vorteile der Anwendung von Syndromkodierung herauszustellen
Bandwidth efficient CCSDS coding standard proposals
The basic concatenated coding system for the space telemetry channel consists of a Reed-Solomon (RS) outer code, a symbol interleaver/deinterleaver, and a bandwidth efficient trellis inner code. A block diagram of this configuration is shown. The system may operate with or without the outer code and interleaver. In this recommendation, the outer code remains the (255,223) RS code over GF(2 exp 8) with an error correcting capability of t = 16 eight bit symbols. This code's excellent performance and the existence of fast, cost effective, decoders justify its continued use. The purpose of the interleaver/deinterleaver is to distribute burst errors out of the inner decoder over multiple codewords of the outer code. This utilizes the error correcting capability of the outer code more efficiently and reduces the probability of an RS decoder failure. Since the space telemetry channel is not considered bursty, the required interleaving depth is primarily a function of the inner decoding method. A diagram of an interleaver with depth 4 that is compatible with the (255,223) RS code is shown. Specific interleaver requirements are discussed after the inner code recommendations
Estimation and detection techniques for doubly-selective channels in wireless communications
A fundamental problem in communications is the estimation of the channel.
The signal transmitted through a communications channel undergoes distortions
so that it is often received in an unrecognizable form at the receiver.
The receiver must expend significant signal processing effort in order to be
able to decode the transmit signal from this received signal. This signal processing
requires knowledge of how the channel distorts the transmit signal,
i.e. channel knowledge. To maintain a reliable link, the channel must be
estimated and tracked by the receiver.
The estimation of the channel at the receiver often proceeds by transmission
of a signal called the 'pilot' which is known a priori to the receiver.
The receiver forms its estimate of the transmitted signal based on how this
known signal is distorted by the channel, i.e. it estimates the channel from
the received signal and the pilot. This design of the pilot is a function of the
modulation, the type of training and the channel. [Continues.
Proceedings of the Second International Mobile Satellite Conference (IMSC 1990)
Presented here are the proceedings of the Second International Mobile Satellite Conference (IMSC), held June 17-20, 1990 in Ottawa, Canada. Topics covered include future mobile satellite communications concepts, aeronautical applications, modulation and coding, propagation and experimental systems, mobile terminal equipment, network architecture and control, regulatory and policy considerations, vehicle antennas, and speech compression
Recommended from our members
The development of an error-correcting scheme for use with a six-tone HF modem
This thesis describes the development of an error correcting system for a H.F. modem employing 6-tone Multi-Frequency Shift Keying (MFSK) as its modulation scheme. The modulation scheme was chosen to be compatible with equipment already in service and to eliminate the need to modify the existing communications infrastructure. A convolutional code together with either Viterbi decoding or Fano decoding is chosen to provide the error correction because of the potential power of such codes and because it is possible for these combinations of code and decoding method to work with any alphabet size. To detect whether correction has been successful a Cyclic Redundancy Check (CRC) is embedded within the data block before encoding.A method of using a convolutional code to provide variable rate is presented. The method uses a systematic code so that it is possible for the scheme to have a quick look to see if the first data transmission has been received error free. A search for good codes is undertaken and the effect the alphabet size has on the code spectra discussed. It is shown that a good generator sequence for a binary code is also a good generator sequence for non-binary codes.To decode the convolutional code both the Viterbi maximum likelihood decoder and the Fano sequential decoder are studied. It is argued that the Fano sequential decoder
is the better choice for this application because it makes better use of system resources which will be limited in the field equipment. It is also shown that the performance of multi-level codes is better than binary codes and that an alphabet size of around 6 is optimum.The throughput of the variable rate scheme and a number of fixed rate schemes is examined. It is shown that the variable rate scheme provides the best throughput at all data rates and that the throughput improvement at the higher data rates is greatest. The effect of interleaving is also examined and results presented.To support the variable rate scheme a protocol is developed that can be used on practical H.F. channels. The potential problems with errors on both the forward
and return channel are analysed and mechanisms to deal with these built-in
Contribution to the construction of fingerprinting and watermarking schemes to protect mobile agents and multimedia content
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
Telemetry coding study for the international magnetosphere explorers, mother/daughter and heliocentric missions. Volume 2: Final report
A convolutional coding theory is given for the IME and the Heliocentric spacecraft. The amount of coding gain needed by the mission is determined. Recommendations are given for an encoder/decoder system to provide the gain along with an evaluation of the impact of the system on the space network in terms of costs and complexity
Proceedings of the Mobile Satellite Conference
A satellite-based mobile communications system provides voice and data communications to mobile users over a vast geographic area. The technical and service characteristics of mobile satellite systems (MSSs) are presented and form an in-depth view of the current MSS status at the system and subsystem levels. Major emphasis is placed on developments, current and future, in the following critical MSS technology areas: vehicle antennas, networking, modulation and coding, speech compression, channel characterization, space segment technology and MSS experiments. Also, the mobile satellite communications needs of government agencies are addressed, as is the MSS potential to fulfill them
The application of forward error correction techniques in wireless ATM
Bibliography: pages 116-121.The possibility of providing wireless access to an ATM network promises nomadic users a communication tool of unparalleled power and flexibility. Unfortunately, the physical realization of a wireless A TM system is fraught with technical difficulties, not the least of which is the problem of supporting a traditional ATM protocol over a non-benign wireless link. The objective of this thesis, titled "The Application of Forward Error Correction Techniques in Wireless ATM' is to examine the feasibility of using forward error correction techniques to improve the perceived channel characteristics to the extent that the channel becomes transparent to the higher layers and allows the use of an unmodified A TM protocol over the channel. In the course of the investigation that this dissertation describes, three possible error control strategies were suggested for implementation in a generic wireless channel. These schemes used a combination of forward error correction coding schemes, automatic repeat request schemes and interleavers to combat the impact of bit errors on the performance of the link. The following error control strategies were considered : 1. A stand alone fixed rate Reed-Solomon encoder/decoder with automatic repeat request. 2. A concatenated Reed-Solomon, convolution encoder/decoder with automatic request and convolution interleaving for the convolution codec. 3. A dynamic rate encoder/decoder using either a concatenated Reed-Solomon, convolution scheme or a Reed-Solomon only scheme with variable length Reed-Solomon words
A likelihood ratio analysis of digital phase modulation
Bibliography: p. 180-188.Although the likelihood ratio forms the theoretical basis for maximum likelihood (ML) detection in coherent digital communication systems, it has not been applied directly to the problem of designing good trellis-coded modulation (TOM) schemes. The remarkably simple optimal receiver of minimum shift keying (MSK) has been shown to result from the mathematical simplification of its likelihood ratio into a single term. The log-likelihood ratio then becomes a linear sum of metrics which can be implemented as a so-called simplified receiver, comprising only a few adders and delay elements. This thesis project investigated the possible existence of coded modulation schemes with similarly simplifying likelihood ratios, which would have almost trivially simple receivers compared to the Viterbi decoders which are typically required for maximum likelihood sequence estimation (MLSE). A useful notation, called the likelihood transform, was presented to aid the analysis of likelihood ratios. The work concentrated initially on computer-aided searches, first for trellis codes which may give rise to simplifying likelihood ratios for continuous phase modulation (CPM), and then for mathematical identities which may aid in the simplification of generic likelihood ratios for equal-energy modulation. The first search yielded no simplified receivers, and all the identities produced by the second search had structures similar to the likelihood ratio of MSK. These observations prompted a formal proof of the non-existence of simplified receivers which use information from more than two symbols in their observation period. This result strictly bounds the error performance that is possible with a simplified receiver. It was also proved that simplified receivers are only optimal for modulation schemes which use no more than two pairs of antipodal signals, and that only binary modulation schemes can have simplified receivers which use information from all the symbols in their observation period
- …