Constant weight codes based on ideals of commutative rings

We present a construction of constant weight codes based on the prime ideals of a Noetherian commutative ring. The coding scheme is based on the uniqueness of the primary decomposition of ideals in Noetherian rings. The source alphabet consists of a set of radical ideals constructed from a chosen subset of the prime spectrum of the ring. The distance function between two radical ideals is taken to be the Hamming metric based on the symmetric distance between sets. As an application we construct codes for random networks employing SAF routing.

Maximum rate of 3- and 4-real-symbol ML decodable unitary weight STBCs

It has been shown recently that the maximum rate of a 2-real-symbol (single-complex-symbol) maximum likelihood (ML) decodable, square space-time block codes (STBCs) with unitary weight matrices is 2a/2a complex symbols per channel use (cspcu) for 2a number of transmit antennas [1]. These STBCs are obtained from Unitary Weight Designs (UWDs). In this paper, we show that the maximum rates for 3- and 4-real-symbol (2-complex-symbol) ML decodable square STBCs from UWDs, for 2a transmit antennas, are 3(a-1)/2a and 4(a-1)/2a cspcu, respectively. STBCs achieving this maximum rate are constructed. A set of sufficient conditions on the signal set, required for these codes to achieve full-diversity are derived along with expressions for their coding gain.

A general construction of space-time trellis codes for PSK signal sets

The diversity order and coding gain are crucial for the performance of a multiple antenna communication system. It is known that space-time trellis codes (STTC) can be used to achieve these objectives. In particular, we can use STTCs to obtain large coding gains. Many attempts have been made to construct STTCs which achieve full-diversity and good coding gains, though a general method of construction does not exist. Delay diversity code (rate-1) is known to achieve full-diversity, for any number of transmit antennas and any signal set, but does not give a good coding gain. A product distance code based delay diversity scheme (Tarokh, V. et al., IEEE Trans. Inform. Theory, vol.44, p.744-65, 1998) enables one to improve the coding gain and construct STTCs for any given number of states using coding in conjunction with delay diversity; it was stated as an open problem. We achieve such a construction. We assume a shift register based model to construct an STTC for any state complexity. We derive a sufficient condition for this STTC to achieve full-diversity, based on the delay diversity scheme. This condition provides a framework to do coding in conjunction with delay diversity for any signal constellation. Using this condition, we provide a formal rate-1 STTC construction scheme for PSK signal sets, for any number of transmit antennas and any given number of states, which achieves full-diversity and gives a good coding gain.

Maximum Rate of Unitary-Weight, Single-Symbol Decodable STBCs

It is well known that the space-time block codes (STBCs) from complex orthogonal designs (CODs) are single-symbol decodable/symbol-by-symbol decodable (SSD). The weight matrices of the square CODs are all unitary and obtainable from the unitary matrix representations of Clifford Algebras when the number of transmit antennas n is a power of 2. The rate of the square CODs for n = 2(a) has been shown to be a+1/2(a) complex symbols per channel use. However, SSD codes having unitary-weight matrices need not be CODs, an example being the minimum-decoding-complexity STBCs from quasi-orthogonal designs. In this paper, an achievable upper bound on the rate of any unitary-weight SSD code is derived to be a/2(a)-1 complex symbols per channel use for 2(a) antennas, and this upper bound is larger than that of the CODs. By way of code construction, the interrelationship between the weight matrices of unitary-weight SSD codes is studied. Also, the coding gain of all unitary-weight SSD codes is proved to be the same for QAM constellations and conditions that are necessary for unitary-weight SSD codes to achieve full transmit diversity and optimum coding gain are presented.

New approach to distance relays with quadrilateral polar characteristic for e.h.v.-line protection

A new technique is presented using principles of multisignal relaying for the synthesis of a universal-type quadrilateral polar characteristic. The modus operandi consists in the determination of the phase sequence of a set of voltage phasors and the provision of a trip signal for one sequence while blocking for the other. Two versions, one using ferrite-core logic and another using transistor logic, are described in detail. The former version has the merit of simplicity and has the added advantage of not requiring any d.c. supply. The unit is flexible, as it permits independent control of the characteristic along the resistance and reactance axis through suitable adjustments of replica impedance angles. The maximum operating time is about 20ms for all switching angles, and with faults within 95% of the protected section. The maximum transient overreach is about 8%.

Effectiveness of Series Capacitors in Long Distance Transmission Lines

The effectiveness of series capacitors used with long distance transmission lines in improving system stability is analyzed. Compensation efficiency is defined as the effectiveness of series capacitors. The influence of various factors on compensation efficiency such as capacitor location, line length, and degree of series compensation is investigated. Proper use of shunt reactors with series capacitors, in addition to limiting power frequency over- voltages, increases the maximum power transfer. Analytical expressions are included to aid in the calculation of compensation efficiency for a few typical cases. Curves are also presented indicating the critical value of shunt Mvar required for various degrees of series compensation and line lengths.

Modulation Diversity in Fading Channels with a Quantized Receiver

In this paper, we address the design of codes which achieve modulation diversity in block fading single-input single-output (SISO) channels with signal quantization at the receiver. With an unquantized receiver, coding based on algebraic rotations is known to achieve maximum modulation coding diversity. On the other hand, with a quantized receiver, algebraic rotations may not guarantee gains in diversity. Through analysis, we propose specific rotations which result in the codewords having equidistant component-wise projections. We show that the proposed coding scheme achieves maximum modulation diversity with a low-complexity minimum distance decoder and perfect channel knowledge. Relaxing the perfect channel knowledge assumption we propose a novel channel training/estimation technique to estimate the channel. We show that our coding/training/estimation scheme and minimum distance decoding achieves an error probability performance similar to that achieved with perfect channel knowledge.

Anomalous Stress Profile in a Sheared Granular Column

We present measurements of the stress as a function of vertical position in a column of granular material sheared in a cylindrical Couette device. All three components of the stress tensor on the outer cylinder were measured as a function of distance from the free surface at shear rates low enough that the material was in the dense, slow flow regime. We find that the stress profile differs fundamentally from that of fluids, from the predictions of plasticity theories, and from intuitive expectation. We argue that the anomalous stress profile is due to an anisotropic fabric caused by the combined action of gravity and shear.

On the height of fall of dropping mass in SASW measurements for asphaltic road pavements

A number of spectral analysis of surface waves (SASW) tests were performed on asphaltic road pavements by dropping a metallic 6.5 kg sphere, from a height (H) ranging from 1 to 3 m. Various combinations of source to first receiver distance (S) and receiver spacing (X) were employed. By increasing the height of the fall of the dropping mass, the maximum wavelength (lambda(max)), up to which the shear wave velocity profile can be predicted with the usage of the SASW measurements, was found to increase continuously. The height of fall of the dropping mass also seems to affect the admissible range of the wavelength for given combinations of X and S. Irrespective of different chosen combinations of S, X and H, a unique combined dispersion curve was generated in all the cases for a given pavement site as long as the threshold minimum value of the coherence function is greater than 0.90.

Complexity of distance paired-domination problem in graphs

Suppose G = (V, E) is a simple graph and k is a fixed positive integer. A subset D subset of V is a distance k-dominating set of G if for every u is an element of V. there exists a vertex v is an element of D such that d(G)(u, v) <= k, where d(G)(u, v) is the distance between u and v in G. A set D subset of V is a distance k-paired-dominating set of G if D is a distance k-dominating set and the induced subgraph GD] contains a perfect matching. Given a graph G = (V, E) and a fixed integer k > 0, the MIN DISTANCE k-PAIRED-DOM SET problem is to find a minimum cardinality distance k-paired-dominating set of G. In this paper, we show that the decision version of MIN DISTANCE k-PAIRED-DOM SET iS NP-complete for undirected path graphs. This strengthens the complexity of decision version Of MIN DISTANCE k-PAIRED-DOM SET problem in chordal graphs. We show that for a given graph G, unless NP subset of DTIME (n(0)((log) (log) (n)) MIN DISTANCE k-PAIRED-Dom SET problem cannot be approximated within a factor of (1 -epsilon ) In n for any epsilon > 0, where n is the number of vertices in G. We also show that MIN DISTANCE k-PAIRED-DOM SET problem is APX-complete for graphs with degree bounded by 3. On the positive side, we present a linear time algorithm to compute the minimum cardinality of a distance k-paired-dominating set of a strongly chordal graph G if a strong elimination ordering of G is provided. We show that for a given graph G, MIN DISTANCE k-PAIRED-DOM SET problem can be approximated with an approximation factor of 1 + In 2 + k . In(Delta(G)), where Delta(G) denotes the maximum degree of G. (C) 2012 Elsevier B.V All rights reserved.

Optimal Linear Codes with a Local-Error-Correction Property

Motivated by applications to distributed storage, Gopalan et al recently introduced the interesting notion of information-symbol locality in a linear code. By this it is meant that each message symbol appears in a parity-check equation associated with small Hamming weight, thereby enabling recovery of the message symbol by examining a small number of other code symbols. This notion is expanded to the case when all code symbols, not just the message symbols, are covered by such ``local'' parity. In this paper, we extend the results of Gopalan et. al. so as to permit recovery of an erased code symbol even in the presence of errors in local parity symbols. We present tight bounds on the minimum distance of such codes and exhibit codes that are optimal with respect to the local error-correction property. As a corollary, we obtain an upper bound on the minimum distance of a concatenated code.

SASW evaluation of asphaltic and cement concrete pavements using different heights of fall for a spherical mass

A number of spectral analysis of surface wave tests were performed on asphaltic and cement concrete pavements by dropping freely a 6.5kg spherical mass, having a radius of 5.82cm, from a height (h) of 0.51.5m. The maximum wavelength ((max)), up to which the shear wave velocity profile can be detected with the usage of surface wave measurements, increases continuously with an increase in h. As compared to the asphaltic pavement, the values of (max) and (min) become greater for the chosen cement concrete pavement, where (min) refers to the minimum wavelength. With h=0.5m, a good assessment of the top layers of both the present chosen asphaltic and the cement concrete pavements, including soil subgrade, can be made. For a given h, as compared to the selected asphaltic pavement, the first receiver in case of the chosen cement concrete pavement needs to be placed at a greater distance from the source. Inverse analysis has also been performed to characterise the shear wave velocity profile of different layers of the pavements.

Generalized distributive law for ML decoding of space-time block codes

The problem of designing good space-time block codes (STBCs) with low maximum-likelihood (ML) decoding complexity has gathered much attention in the literature. All the known low ML decoding complexity techniques utilize the same approach of exploiting either the multigroup decodable or the fast-decodable (conditionally multigroup decodable) structure of a code. We refer to this well-known technique of decoding STBCs as conditional ML (CML) decoding. In this paper, we introduce a new framework to construct ML decoders for STBCs based on the generalized distributive law (GDL) and the factor-graph-based sum-product algorithm. We say that an STBC is fast GDL decodable if the order of GDL decoding complexity of the code, with respect to the constellation size, is strictly less than M-lambda, where lambda is the number of independent symbols in the STBC. We give sufficient conditions for an STBC to admit fast GDL decoding, and show that both multigroup and conditionally multigroup decodable codes are fast GDL decodable. For any STBC, whether fast GDL decodable or not, we show that the GDL decoding complexity is strictly less than the CML decoding complexity. For instance, for any STBC obtained from cyclic division algebras which is not multigroup or conditionally multigroup decodable, the GDL decoder provides about 12 times reduction in complexity compared to the CML decoder. Similarly, for the Golden code, which is conditionally multigroup decodable, the GDL decoder is only half as complex as the CML decoder.

Codes with local regeneration

Regenerating codes and codes with locality are schemes recently proposed for a distributed storage network. While regenerating codes minimize the data downloaded for node repair, codes with locality minimize the number of nodes accessed during repair. In this paper, we provide some constructions of codes with locality, in which the local codes are regenerating codes, thereby combining the advantages of both classes of codes. The proposed constructions achieve an upper bound on minimum distance and are hence optimal. The constructions include both the cases when the local regenerating codes correspond to the MSR point as well as the MBR point on the storage repair-bandwidth tradeoff curve.

Intensity profile of light scattered from a rough surface

We present in this paper, approximate analytical expressions for the intensity of light scattered by a rough surface, whose elevation. xi(x,y) in the z-direction is a zero mean stationary Gaussian random variable. With (x,y) and (x',y') being two points on the surface, we have h. = 0 with a correlation, = sigma(2)g(r), where r = (x - x')(2) + ( y - y')(2)](1/2) is the distance between these two points. We consider g(r) = exp-r/l)(beta)] with 1 <= beta <= 2, showing that g(0) = 1 and g(r) -> 0 for r >> l. The intensity expression is sought to be expressed as f(v(xy)) = {1 + (c/2y)v(x)(2) + v(y)(2)]}(-y), where v(x) and v(y) are the wave vectors of scattering, as defined by the Beckmann notation. In the paper, we present expressions for c and y, in terms of sigma, l, and beta. The closed form expressions are verified to be true, for the cases beta = 1 and beta = 2, for which exact expressions are known. For other cases, i.e., beta not equal 1, 2 we present approximate expressions for the scattered intensity, in the range, v(xy) = (v(x)(2) + v(y)(2))(1/2) <= 6.0 and show that the relation for f(v(xy)), given above, expresses the scattered intensity quite accurately, thus providing a simple computational methods in situations of practical importance.