3,367 research outputs found
Interleaving Gains for Receive Diversity Schemes of Distributed Turbo Codes in Wireless Half–Duplex Relay Channels
This paper proposes the interleaving gain in two different distributed turbo-coding schemes: Distributed Turbo Codes (DTC) and Distributed Multiple Turbo Codes (DMTC) for half-duplex relay system as an extension of our previous work on turbo coding interleaver design for direct communication channel. For these schemes with half-duplex constraint, the source node transmits its information with the parity bit sequence(s) to both the relay and the destination nodes during the first phase. The relay received the data from the source and process it by using decode and forward protocol. For the second transmission period, the decoded systematic data at relay is interleaved and re-encoded by a Recursive Systematic Convolutional (RSC) encoder and forwarded to the destination. At destination node, the signals received from the source and relay are processed by using turbo log-MAP iterative decoding for retrieving the original information bits. We demonstrate via simulations that the interleaving gain has a large effect with DTC scheme when we use only one RSC encoder at both the source and relay with best performance when using Modified Matched S-Random (MMSR) interleaver. Furthermore, by designing a Chaotic Pseudo Random Interleaver (CPRI) as an outer interleaver at the source node instead of classical interleavers, our scheme can add more secure channel conditions
Design of One-Coincidence Frequency Hopping Sequence Sets for FHMA Systems
Department of Electrical EngineeringIn the thesis, we discuss frequency hopping multiple access (FHMA) systems and construction of optimal frequency hopping sequence and applications. Moreover, FHMA is widely used in modern communication systems such as Bluetooth, ultrawideband (UWB), military, etc. For these systems, it is desirable to employ frequency-hopping sequences (FHSs) having low Hamming correlation in order to reduce the multiple-access interference.
In general, optimal FHSs with respect to the Lempel-Greenberger bound do not always exist for all lengths and frequency set sizes. Therefore, it is an important problem to verify whether an optimal FHS with respect to the Lempel-Greenberger bound exists or not for a given length and a given frequency set size.
I constructed FHS satisfying optimal with respect to the Lempel-Greenberger bound and Peng-Fan bound for efficiency of available frequency. Parameters of a new OC-FHS set are length p^2-p over Z_(p^2 ) by using a primitive element of Z_p. The new OC-FHS set with H_a (X)=0 and H_c (X)=1 can be applied to several recent applications using ISM band (e.g. IoT) based on BLE and Zigbee.
In the construction and theorem, I used these mathematical back grounds in preliminaries (i.e., finite field, primitive element, primitive polynomial, frequency hopping sequence, multiple frequency shift keying, DS/CDMA) in order to prove mathematically.
The outline of thesis is as follows. In preliminaries, we explain algorithm for minimal polynomial for sequence, linear complexities, Hamming correlation and bounds for FHSs and some applications are presented. In section ???, algorithm for complexity, correlation and bound for FHSs and some applications are presented. In section ???, using information in section ??? and ???, a new construction of OC-FHS is presented. In order to prove the optimality of FHSs, all cases of Hamming autocorrelation and Hamming cross-correlation are mathematically calculated.
Moreover, in order to raise data rate or the number of users, a new method is presented. Using this method, sequences are divided into two times of length and satisfies Lempel-Greenberger bound and Peng-Fan bound.clos
Detection and robustness of digital image watermarking signals : a communication theory approach
The detection and robustness of the watermark signal is studied from a communications point of view. The contributions of this dissertation are presented in two parts. The first part, which covers the detection aspect, introduces a new digital image watermarking approach that embeds meaningful information in a copyright protection watermark signal; demonstrates the need to approach the watermark signal as a power-constrained signal; studies the relationship between the watermark signal dimension and the image capacity to the signal; explains the similarities and differences between detecting the watermark signal and detecting a signal over a spread-spectrum communication channel; and analyzes the application of sequence detection techniques (MAPSD and MLSD) to the watermark signal. The second part, which covers the robustness aspect, introduces a novel multidimensional interleaving algorithm that increases the signal\u27s robustness against burst errors; presents, analyzes, and compares two techniques for implementing the algorithm (a sliding window technique and a successive partitioning technique); and demonstrates the increase in watermark signal robustness as a result of applying this multidimensional interleaving. This increase of the signal\u27s robustness is shown in the 2-D case by applying the 2-D version of the interleaving algorithm to watermark signals embedded in still images (where the signal layout is in 2-D), and in the 3-D case by applying the 3-D version of the interleaving algorithm to watermark signals embedded in video sequences (where the signal layout is in 3-D)
Error-Correction in Flash Memories via Codes in the Ulam Metric
We consider rank modulation codes for flash memories that allow for handling
arbitrary charge-drop errors. Unlike classical rank modulation codes used for
correcting errors that manifest themselves as swaps of two adjacently ranked
elements, the proposed \emph{translocation rank codes} account for more general
forms of errors that arise in storage systems. Translocations represent a
natural extension of the notion of adjacent transpositions and as such may be
analyzed using related concepts in combinatorics and rank modulation coding.
Our results include derivation of the asymptotic capacity of translocation rank
codes, construction techniques for asymptotically good codes, as well as simple
decoding methods for one class of constructed codes. As part of our exposition,
we also highlight the close connections between the new code family and
permutations with short common subsequences, deletion and insertion
error-correcting codes for permutations, and permutation codes in the Hamming
distance
A Novel Data-Aided Channel Estimation with Reduced Complexity for TDS-OFDM Systems
In contrast to the classical cyclic prefix (CP)-OFDM, the time domain
synchronous (TDS)-OFDM employs a known pseudo noise (PN) sequence as guard
interval (GI). Conventional channel estimation methods for TDS-OFDM are based
on the exploitation of the PN sequence and consequently suffer from intersymbol
interference (ISI). This paper proposes a novel dataaided channel estimation
method which combines the channel estimates obtained from the PN sequence and,
most importantly, additional channel estimates extracted from OFDM data
symbols. Data-aided channel estimation is carried out using the rebuilt OFDM
data symbols as virtual training sequences. In contrast to the classical turbo
channel estimation, interleaving and decoding functions are not included in the
feedback loop when rebuilding OFDM data symbols thereby reducing the
complexity. Several improved techniques are proposed to refine the data-aided
channel estimates, namely one-dimensional (1-D)/two-dimensional (2-D) moving
average and Wiener filtering. Finally, the MMSE criteria is used to obtain the
best combination results and an iterative process is proposed to progressively
refine the estimation. Both MSE and BER simulations using specifications of the
DTMB system are carried out to prove the effectiveness of the proposed
algorithm even in very harsh channel conditions such as in the single frequency
network (SFN) case
- …