We present the analysis of between 50 and 100 h of coincident interferometric strain data used to search for and establish an upper limit on a stochastic background of gravitational radiation. These data come from the first LIGO science run, during which all three LIGO interferometers were operated over a 2-week period spanning August and September of 2002. The method of cross correlating the outputs of two interferometers is used for analysis. We describe in detail practical signal processing issues that arise when working with real data, and we establish an observational upper limit on a f Ϫ3 power spectrum of gravitational waves. Our 90% confidence limit is ⍀ 0 h 100 2 р23Ϯ4.6 in the frequency band 40-314 Hz, where h 100 is the Hubble constant in units of 100 km/sec/Mpc and ⍀ 0 is the gravitational wave energy density per logarithmic frequency interval in units of the closure density. This limit is approximately 10 4 times better than the previous, broadband direct limit using interferometric detectors, and nearly 3 times better than the best narrow-band bar detector limit. As LIGO and other worldwide detectors improve in sensitivity and attain their design goals, the analysis procedures described here should lead to stochastic background sensitivity levels of astrophysical interest.

A framework for linear-programming (LP) decoding of nonbinary linear codes over rings is developed. This framework facilitates linear-programming based reception for coded modulation systems which use direct modulation mapping of coded symbols. It is proved that the resulting LP decoder has the 'maximum-likelihood certificate' property. It is also shown that the decoder output is the lowest cost pseudocodeword. Equivalence between pseudocodewords of the linear program and pseudocodewords of graph covers is proved. It is also proved that if the modulator-channel combination satisfies a particular symmetry condition, the codeword error rate performance is independent of the transmitted codeword. Two alternative polytopes for use with linear-programming decoding are studied, and it is shown that for many classes of codes these polytopes yield a complexity advantage for decoding. These polytope representations lead to polynomial-time decoders for a wide variety of classical nonbinary linear codes. LP decoding performance is illustrated for the [11,6] ternary Golay code with ternary PSK modulation over AWGN, and in this case it is shown that the performance of the LP decoder is comparable to codeword-error-rate-optimum hard-decision based decoding. LP decoding is also simulated for medium-length ternary and quaternary LDPC codes with corresponding PSK modulations over AWGN.Comment: To appear in the IEEE Transactions on Information Theory. 54 pages, 5 figure

Abstract-In this paper, an expression for the asymptotic growth rate of the number of small linear-weight codewords of irregular doubly-generalized LDPC (D-GLDPC) codes is derived. The expression is compact and generalizes existing results for LDPC and generalized LDPC (GLDPC) codes. Assuming that there exist check and variable nodes with minimum distance 2, it is shown that the growth rate depends only on these nodes. An important connection between this new result and the stability condition of D-GLDPC codes over the BEC is highlighted. Such a connection, previously observed for LDPC and GLDPC codes, is now extended to the case of D-GLDPC codes.

Linear Programming (LP) decoding of Low-Density Parity-Check (LDPC) codes has attracted much attention in the research community in the past few years. LP decoding has been derived for binary and nonbinary linear codes. However, the most important problem with LP decoding for both binary and nonbinary linear codes is that the complexity of standard LP solvers such as the simplex algorithm remains prohibitively large for codes of moderate to large block length. To address this problem, two low-complexity LP (LCLP) decoding algorithms for binary linear codes have been proposed by Vontobel and Koetter, henceforth called the basic LCLP decoding algorithm and the subgradient LCLP decoding algorithm. In this paper, we generalize these LCLP decoding algorithms to nonbinary linear codes. The computational complexity per iteration of the proposed nonbinary LCLP decoding algorithms scales linearly with the block length of the code. A modified BCJR algorithm for efficient check-node calculations in the nonbinary basic LCLP decoding algorithm is also proposed, which has complexity linear in the check node degree. Several simulation results are presented for nonbinary LDPC codes defined over Z_4, GF(4), and GF(8) using quaternary phase-shift keying and 8-phase-shift keying, respectively, over the AWGN channel. It is shown that for some group-structured LDPC codes, the error-correcting performance of the nonbinary LCLP decoding algorithms is similar to or better than that of the min-sum decoding algorithm.Comment: To appear in IEEE Transactions on Communications, 201

Abstract-The design of low-density parity-check (LDPC) code ensembles optimized for a finite number of decoder iterations is investigated. Our approach employs EXIT chart analysis and differential evolution to design such ensembles for the binary erasure channel and additive white Gaussian noise channel. The error rates of codes optimized for various numbers of decoder iterations are compared and it is seen that in the cases considered, the best performance for a given number of decoder iterations is achieved by codes which are optimized for this particular number. The design of generalized LDPC (GLDPC) codes is also considered, showing that these structures can offer better performance than LDPC codes for low-iteration-number designs. Finally, it is illustrated that LDPC codes which are optimized for a small number of iterations exhibit significant deviations in terms of degree distribution and weight enumerators with respect to LDPC codes returned by more conventional design tools.

In this paper, we investigate, for the first time, the performance of a full-duplex (FD) relaying protocol, where a single-RF Spatial Modulation (SM) Multiple-Input Multiple-Output (MIMO) system is employed at the relay node. We refer to this protocol as SM-aided FD relaying (SM-FDR). At the destination, a demodulator that takes advantage of the direct connectivity between the source and destination is developed in order to maximize its performance. Based on this demodulator, we introduce a mathematical framework for computing the average error-probability of SM-FDR in the presence of residual Self-Interference (SI). Furthermore, we derive mathematical expressions for computing the achievable rate of SM-FDR. With the aid of these achievable rate expressions, we provide an estimate on the quality of SI cancellation required for the suitability of FD transmission. In addition, we develop and evaluate three relay selection policies specifically designed for the SM-FDR protocol. The mathematical analysis is substantiated with the aid of extensive Monte Carlo simulations. Finally, we also assess the performance of SM-FDR against traditional FD relaying protocols.

No abstract

This paper presents a technique to estimate the time skew in time-interleaved ADCs. The proposed method estimates all of the time skew parameters jointly based on observations from a bank of correlators. The proposed method works for an arbitrary number of sub-ADCs. For implementation of the correlator bank, we propose the use of Mitchell's logarithmic multiplier and a hardware reuse mechanism, thereby reducing the complexity and power consumption. Also, we explain why blind estimation techniques alone (including the proposed one) are not always sufficient for time skew estimation for certain classes of input signal; for the proposed approach, however, a simple modification to the analogue circuit (suitable for SAR ADCs) is shown to successfully deal with such problems, with only a minor penalty in power and area. The technique is verified by extensive simulations including a spectrally rich input signal in which an MTPR (multi-tone power ratio) improvement from 29dB to 62dB was achieved for a TIADC system having 16 sub-ADCs.