15 research outputs found

    Write Channel Model for Bit-Patterned Media Recording

    Full text link
    We propose a new write channel model for bit-patterned media recording that reflects the data dependence of write synchronization errors. It is shown that this model accommodates both substitution-like errors and insertion-deletion errors whose statistics are determined by an underlying channel state process. We study information theoretic properties of the write channel model, including the capacity, symmetric information rate, Markov-1 rate and the zero-error capacity.Comment: 11 pages, 12 figures, journa

    Noisy channels with synchronization errors : information rates and code design

    Get PDF
    Master'sMASTER OF ENGINEERIN

    Factor Graph Based LMMSE Filtering for Colored Gaussian Processes

    Get PDF
    We propose a low complexity, graph based linear minimum mean square error (LMMSE) filter in which the non-white characteristics of a random process are taken into account. Our method corresponds to block LMMSE filtering, and has the advantage of complexity linearly increasing with the block length and the ease of incorporating the a priori information of the input signals whenever possible. The proposed method can be used with any random process with a known autocorrelation function with the help of an approximation to an autoregressive (AR) process. We show through extensive simulations that our method performs very close to the optimal block LMMSE filtering for Gaussian input signals.Comment: 5 pages, 4 figure

    Self-concatenated code design and its application in power-efficient cooperative communications

    No full text
    In this tutorial, we have focused on the design of binary self-concatenated coding schemes with the help of EXtrinsic Information Transfer (EXIT) charts and Union bound analysis. The design methodology of future iteratively decoded self-concatenated aided cooperative communication schemes is presented. In doing so, we will identify the most important milestones in the area of channel coding, concatenated coding schemes and cooperative communication systems till date and suggest future research directions

    Low-density parity-check coding for high-density magnetic recording systems.

    Get PDF
    Our strategy is to combine advanced signal processing techniques, the core of which is soft-decision iterative channel detection, with powerful low-density parity-check (LDPC) coding techniques.Magnetic recording channels (MRCs), including both longitudinal and perpendicular ones, are subject to a number of physical impairments, such as electronic/media noise, intersymbol interference (ISI), erasure, and intertrack interference (ITI). These impairments, if not appropriately handled, are barriers to achieving ultra-high densities. The goal of this dissertation is to study the impact of these multiple impairments on system performance, and to develop techniques to mitigate this impact such that the performance is as close to the theoretical limit of the channel as can be achieved by practical and implementable means.Specifically, the performance of regular LDPC codes on MRCs is first evaluated. Both randomly and structurally constructed codes are considered. Secondly, density evolution is used to analyze and design LDPC codes for MRCs. Results show that better irregular codes can be obtained. Afterwards, this algorithm is modified to include erasures, and erasure detection algorithms are studied. Fourthly, an improved algorithm for LDPC decoding, called signal-to-noise ratio (SNR) mismatch is unveiled. This algorithm may be useful for future practical applications. Finally, a channel detection algorithm for handling ITI in perpendicular recording is optimized, the eventual goal of which is to maximize the attainable track density

    Reliability information in channel decoding : practical aspects and information theoretical bounds

    Get PDF
    This thesis addresses the use of reliability information in channel decoding. The considered transmission systems comprise linear binary channel encoders, symmetric memoryless communication channels, and non-iterative or iterative symbol-by-symbol soft-output channel decoders. The notions of accurate and mismatched reliability values are introduced, and the measurement and improvement of the quality of reliability values are discussed. A criterion based on the Kullback-Leibler distance is proposed to assess the difference between accurate and mismatched reliability values. Accurate reliability values may be exploited to estimate transmission quality parameters, such as the bit-error probability or the symbol-wise mutual information between encoder input and decoder output. The proposed method is unbiased, does not require knowledge of the transmitted data, and has a smaller estimation variance than the conventional method. Symbol-by-symbol soft-output decoding may be interpreted as processing of mutual information. The behavior of a decoder may be characterized by information transfer functions, such as information processing characteristics (IPCs) or extrinsic information transfer (EXIT) functions. Bounds on information transfer functions are derived using the concept of bounding combined information. The resulting bounds are valid for all binary-input symmetric memoryless channels. Single parity-check codes, repetition codes, and the accumulator are addressed. Based on such bounds, decoding thresholds for low-density parity-check codes are analytically determined

    Resource allocation in DS-CDMA systems with side information at the transmitter

    Get PDF
    In a multiuser DS-CDMA system with frequency selectivity, each userâÂÂs spreading sequence is transmitted through a different channel and the autocorrelation and the cross correlation properties of the received sequences will not be the same as that of the transmitted sequences. The best way of designing spreading sequences for frequency selective channels is to design them at the receiver exploiting the usersâ channel characteristics. By doing so, we can show that the designed sequences outperform single user AWGN performance. In existing sequence design algorithms for frequency selective channels, the design is done in the time domain and the connection to frequency domain properties is not established. We approach the design of spreading sequences based on their frequency domain characteristics. Based on the frequency domain characteristics of the spreading sequences with unconstrained amplitudes and phases, we propose a reduced-rank sequence design algorithm that reduces the computational complexity, feedback bandwidth and improves the performance of some existing sequence design algorithms proposed for frequency selective channels. We propose several different approaches to design the spreading sequences with constrained amplitudes and phases for frequency selective channels. First, we use the frequency domain characteristics of the unconstrained spreading sequences to find a set of constrained amplitude sequences for a given set of channels. This is done either by carefully assigning an already existing set of sequences for a given set of users or by mapping unconstrained sequences onto a unit circle. Secondly, we use an information theoretic approach to design the spreading sequences by matching the spectrum of each userâÂÂs sequence to the water-filling spectrum of the userâÂÂs channel. Finally, the design of inner shaping codes for single-head and multi-head magnetic recoding channels is discussed. The shaping sequences are designed considering them as short spreading codes matched to the recoding channels. The outer channel code is matched to the inner shaping code using the extrinsic information transfer chart analysis. In this dissertation we introduce a new frequency domain approach to design spreading sequences for frequency selective channels. We also extend this proposed technique to design inner shaping codes for partial response channels

    Signal Processing for Bit-Patterned Media Recording

    Get PDF
    Ph.DDOCTOR OF PHILOSOPH

    Self-concatenated coding for wireless communication systems

    No full text
    In this thesis, we have explored self-concatenated coding schemes that are designed for transmission over Additive White Gaussian Noise (AWGN) and uncorrelated Rayleigh fading channels. We designed both the symbol-based Self-ConcatenatedCodes considered using Trellis Coded Modulation (SECTCM) and bit-based Self- Concatenated Convolutional Codes (SECCC) using a Recursive Systematic Convolutional (RSC) encoder as constituent codes, respectively. The design of these codes was carried out with the aid of Extrinsic Information Transfer (EXIT) charts. The EXIT chart based design has been found an efficient tool in finding the decoding convergence threshold of the constituent codes. Additionally, in order to recover the information loss imposed by employing binary rather than non-binary schemes, a soft decision demapper was introduced in order to exchange extrinsic information withthe SECCC decoder. To analyse this information exchange 3D-EXIT chart analysis was invoked for visualizing the extrinsic information exchange between the proposed Iteratively Decoding aided SECCC and soft-decision demapper (SECCC-ID). Some of the proposed SECTCM, SECCC and SECCC-ID schemes perform within about 1 dB from the AWGN and Rayleigh fading channels’ capacity. A union bound analysis of SECCC codes was carried out to find the corresponding Bit Error Ratio (BER) floors. The union bound of SECCCs was derived for communications over both AWGN and uncorrelated Rayleigh fading channels, based on a novel interleaver concept.Application of SECCCs in both UltraWideBand (UWB) and state-of-the-art video-telephone schemes demonstrated its practical benefits.In order to further exploit the benefits of the low complexity design offered by SECCCs we explored their application in a distributed coding scheme designed for cooperative communications, where iterative detection is employed by exchanging extrinsic information between the decoders of SECCC and RSC at the destination. In the first transmission period of cooperation, the relay receives the potentially erroneous data and attempts to recover the information. The recovered information is then re-encoded at the relay using an RSC encoder. In the second transmission period this information is then retransmitted to the destination. The resultant symbols transmitted from the source and relay nodes can be viewed as the coded symbols of a three-component parallel-concatenated encoder. At the destination a Distributed Binary Self-Concatenated Coding scheme using Iterative Decoding (DSECCC-ID) was employed, where the two decoders (SECCC and RSC) exchange their extrinsic information. It was shown that the DSECCC-ID is a low-complexity scheme, yet capable of approaching the Discrete-input Continuous-output Memoryless Channels’s (DCMC) capacity.Finally, we considered coding schemes designed for two nodes communicating with each other with the aid of a relay node, where the relay receives information from the two nodes in the first transmission period. At the relay node we combine a powerful Superposition Coding (SPC) scheme with SECCC. It is assumed that decoding errors may be encountered at the relay node. The relay node then broadcasts this information in the second transmission period after re-encoding it, again, using a SECCC encoder. At the destination, the amalgamated block of Successive Interference Cancellation (SIC) scheme combined with SECCC then detects and decodes the signal either with or without the aid of a priori information. Our simulation results demonstrate that the proposed scheme is capable of reliably operating at a low BER for transmission over both AWGN and uncorrelated Rayleigh fading channels. We compare the proposed scheme’s performance to a direct transmission link between the two sources having the same throughput

    ADVANCED SIGNAL PROCESSING FOR MAGNETIC RECORDING ON PERPENDICULARLY MAGNETIZED MEDIA

    Get PDF
    In magnetic recording channels (MRCs) the readback signal is corrupted by many kinds of impairments, such as electronic noise, media noise, intersymbol interference (ISI), inter-track interference (ITI) and different types of erasures. The growth in demand for the information storage, leads to the continuing pursuit of higher recording density, which enhances the impact of the noise contamination and makes the recovery of the user data from magnetic media more challenging. In this dissertation, we develop advanced signal processing techniques to mitigate these impairments in MRCs.We focus on magnetic recording on perpendicularly magnetized media, from the state-of-the art continuous media to bit-patterned media, which is a possible choice for the next generation of products. We propose novel techniques for soft-input soft-output channel detection, soft iterative decoding of low-density parity-check (LDPC) codes as well as LDPC code designs for MRCs.First we apply the optimal subblock-by-subblock detector (OBBD) to nonbinary LDPC coded perpendicular magnetic recording channels (PMRCs) and derive a symbol-based detector to do the turbo equalization exactly. Second, we propose improved belief-propagation (BP) decoders for both binary and nonbinary LDPC coded PMRCs, which provide significant gains over the standard BP decoder. Third, we introduce novel LDPC code design techniques to construct LDPC codes with fewer short cycles. Performance improvement is achieved by applying the new LDPC codes to PMRCs. Fourth, we do a substantial investigation on Reed-Solomon (RS) plus LDPC coded PMRCs. Finally, we continue our research on bit-patterned magnetic recording (BPMR) channels at extremely high recording densities. A multi-track detection technique is proposed to mitigate the severe ITI in BPMR channels. The multi-track detection with both joint-track and two-dimensional (2D) equalization provide significant performance improvement compared to conventional equalization and detection methods
    corecore