The Error-Pattern-Correcting Turbo Equalizer

The error-pattern correcting code (EPCC) is incorporated in the design of a turbo equalizer (TE) with aim to correct dominant error events of the inter-symbol interference (ISI) channel at the output of its matching Viterbi detector. By targeting the low Hamming-weight interleaved errors of the outer convolutional code, which are responsible for low Euclidean-weight errors in the Viterbi trellis, the turbo equalizer with an error-pattern correcting code (TE-EPCC) exhibits a much lower bit-error rate (BER) floor compared to the conventional non-precoded TE, especially for high rate applications. A maximum-likelihood upper bound is developed on the BER floor of the TE-EPCC for a generalized two-tap ISI channel, in order to study TE-EPCC's signal-to-noise ratio (SNR) gain for various channel conditions and design parameters. In addition, the SNR gain of the TE-EPCC relative to an existing precoded TE is compared to demonstrate the present TE's superiority for short interleaver lengths and high coding rates.Comment: This work has been submitted to the special issue of the IEEE Transactions on Information Theory titled: "Facets of Coding Theory: from Algorithms to Networks". This work was supported in part by the NSF Theoretical Foundation Grant 0728676

Graph-Based Decoding in the Presence of ISI

We propose an approximation of maximum-likelihood detection in ISI channels based on linear programming or message passing. We convert the detection problem into a binary decoding problem, which can be easily combined with LDPC decoding. We show that, for a certain class of channels and in the absence of coding, the proposed technique provides the exact ML solution without an exponential complexity in the size of channel memory, while for some other channels, this method has a non-diminishing probability of failure as SNR increases. Some analysis is provided for the error events of the proposed technique under linear programming.Comment: 25 pages, 8 figures, Submitted to IEEE Transactions on Information Theor

A New Approach to Time Domain Classification of Broadband Noise in Gravitational Wave Data

Broadband noise in gravitational wave (GW) detectors, also known as triggers, can often be a deterrant to the efficiency with which astrophysical search pipelines detect sources. It is important to understand their instrumental or environmental origin so that they could be eliminated or accounted for in the data. Since the number of triggers is large, data mining approaches such as clustering and classification are useful tools for this task. Classification of triggers based on a handful of discrete properties has been done in the past. A rich information content is available in the waveform or 'shape' of the triggers that has had a rather restricted exploration so far. This paper presents a new way to classify triggers deriving information from both trigger waveforms as well as their discrete physical properties using a sequential combination of the Longest Common Sub-Sequence (LCSS) and LCSS coupled with Fast Time Series Evaluation (FTSE) for waveform classification and the multidimensional hierarchical classification (MHC) analysis for the grouping based on physical properties. A generalized k-means algorithm is used with the LCSS (and LCSS+FTSE) for clustering the triggers using a validity measure to determine the correct number of clusters in absence of any prior knowledge. The results have been demonstrated by simulations and by application to a segment of real LIGO data from the sixth science run.Comment: 16 pages, 16 figure

An Accurate and Efficient Analysis of a MBSFN Network

A new accurate analysis is presented for an OFDM-based multicast-broadcast single-frequency network (MBSFN). The topology of the network is modeled by a constrained random spatial model involving a fixed number of base stations placed over a finite area with a minimum separation. The analysis is driven by a new closed-form expression for the conditional outage probability at each location of the network, where the conditioning is with respect to the network realization. The analysis accounts for the diversity combining of signals transmitted by different base stations of a given MBSFN area, and also accounts for the interference caused by the base stations of other MBSFN areas. The analysis features a flexible channel model, accounting for path loss, Nakagami fading, and correlated shadowing. The analysis is used to investigate the influence of the minimum base-station separation and provides insight regarding the optimal size of the MBSFN areas. In order to highlight the percentage of the network that will fail to successfully receive the broadcast, the area below an outage threshold (ABOT) is here used and defined as the fraction of the network that provides an outage probability (averaged over the fading) that meets a threshold.Comment: 5 pages, 4 figures, IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2014, to appea