Single-Symbol ML Decodable Precoded DSTBCs for Cooperative Networks

Single-symbol maximum likelihood (ML) decodable distributed orthogonal space-time block codes (DOST- BCs) have been introduced recently for cooperative networks and an upper-bound on the maximal rate of such codes along with code constructions has been presented. In this paper, we introduce a new class of distributed space-time block codes (DSTBCs) called semi-orthogonal precoded distributed single-symbol decodable space-time block codes (Semi-SSD-PDSTBCs) wherein, the source performs preceding on the information symbols before transmitting it to all the relays. A set of necessary and sufficient conditions on the relay matrices for the existence of semi-SSD- PDSTBCs is proved. It is shown that the DOSTBCs are a special case of semi-SSD-PDSTBCs. A subset of semi-SSD-PDSTBCs having diagonal covariance matrix at the destination is studied and an upper bound on the maximal rate of such codes is derived. The bounds obtained are approximately twice larger than that of the DOSTBCs. A systematic construction of Semi- SSD-PDSTBCs is presented when the number of relays K ges 4 and the constructed codes are shown to have higher rates than that of DOSTBCs.

On the duality between rate and power optimizations

Sequence design problems are considered in this paper. The problem of sum power minimization in a spread spectrum system can be reduced to the problem of sum capacity maximization, and vice versa. A solution to one of the problems yields a solution to the other. Subsequently, conceptually simple sequence design algorithms known to hold for the white-noise case are extended to the colored noise case. The algorithms yield an upper bound of 2N - L on the number of sequences where N is the processing gain and L the number of non-interfering subsets of users. If some users (at most N - 1) are allowed to signal along a limited number of multiple dimensions, then N orthogonal sequences suffice.

Sequence design for symbol-asynchronous CDMA with power or rate constraints

Sequence design and resource allocation for a symbol-asynchronous chip-synchronous code division multiple access (CDMA) system is considered in this paper. A simple lower bound on the minimum sum-power required for a non-oversized system, based on the best achievable for a non-spread system, and an analogous upper bound on the sum rate are first summarised. Subsequently, an algorithm of Sundaresan and Padakandla is shown to achieve the lower bound on minimum sum power (upper bound on sum rate, respectively). Analogous to the synchronous case, by splitting oversized users in a system with processing gain N, a system with no oversized users is easily obtained, and the lower bound on sum power (upper bound on sum rate, respectively) is shown to be achieved by using N orthogonal sequences. The total number of splits is at most N - 1.

Search for Long-Lived Massive Charged Particles in 1.96 TeV pp̅ Collisions

We performed a signature-based search for long-lived charged massive particles (CHAMPs) produced in 1.0 $\rm{fb}^{-1}$ of $\bar{p}p$ collisions at $\sqrt{s}=1.96$ TeV, collected with the CDF II detector using a high transverse-momentum ($p_T$) muon trigger. The search used time-of-flight to isolate slowly moving, high-$p_T$ particles. One event passed our selection cuts with an expected background of $1.9 \pm 0.2$ events. We set an upper bound on the production cross section, and, interpreting this result within the context of a stable scalar top quark model, set a lower limit on the particle mass of 249 GeV/$c^2$ at 95% C.L.

Minimum-Decoding-Complexity, maximum-rate Space-Time Block Codes from Clifford algebras

It is well known that Alamouti code and, in general, Space-Time Block Codes (STBCs) from complex orthogonal designs (CODs) are single-symbol decodable/symbolby-symbol decodable (SSD) and are obtainable from unitary matrix representations of Clifford algebras. However, SSD codes are obtainable from designs that are not CODs. Recently, two such classes of SSD codes have been studied: (i) Coordinate Interleaved Orthogonal Designs (CIODs) and (ii) Minimum-Decoding-Complexity (MDC) STBCs from Quasi-ODs (QODs). In this paper, we obtain SSD codes with unitary weight matrices (but not CON) from matrix representations of Clifford algebras. Moreover, we derive an upper bound on the rate of SSD codes with unitary weight matrices and show that our codes meet this bound. Also, we present conditions on the signal sets which ensure full-diversity and give expressions for the coding gain.

Limit Analysis of Slabs with Free Edge

The general method earlier developed by the writers for obtaining valid lower bound solutions to slabs under uniformly distributed load and supported along all edges is extended to the slabs with a free edge. Lower bound solutions with normal moment criterion are presented for six cases of orthotropically reinforced slabs, with one of the short edges being free and the other three edges being any combination of fixed and simply supported conditions. The expressions for moment field and collapse load are given for each slab. The lower bounds have been compared with the corresponding upper bound values obtained from the yield line theory with simple straight yield line modes of failure. They are also compared with Nielsen’s solutions available for two cases with isotropic reinforcement.

Cubicity of Interval Graphs and the Claw Number

Let G(V, E) be a simple, undirected graph where V is the set of vertices and E is the set of edges. A b-dimensional cube is a Cartesian product l(1) x l(2) x ... x l(b), where each l(i) is a closed interval of unit length on the real line. The cub/city of G, denoted by cub(G), is the minimum positive integer b such that the vertices in G can be mapped to axis parallel b-dimensional cubes in such a way that two vertices are adjacent in G if and only if their assigned cubes intersect. An interval graph is a graph that can be represented as the intersection of intervals on the real line-i.e. the vertices of an interval graph can be mapped to intervals on the real line such that two vertices are adjacent if and only if their corresponding intervals overlap. Suppose S(m) denotes a star graph on m+1 nodes. We define claw number psi(G) of the graph to be the largest positive integer m such that S(m) is an induced subgraph of G. It can be easily shown that the cubicity of any graph is at least log(2) psi(G)]. In this article, we show that for an interval graph G log(2) psi(G)-]<= cub(G)<=log(2) psi(G)]+2. It is not clear whether the upper bound of log(2) psi(G)]+2 is tight: till now we are unable to find any interval graph with cub(G)> (log(2)psi(G)]. We also show that for an interval graph G, cub(G) <= log(2) alpha], where alpha is the independence number of G. Therefore, in the special case of psi(G)=alpha, cub(G) is exactly log(2) alpha(2)]. The concept of cubicity can be generalized by considering boxes instead of cubes. A b-dimensional box is a Cartesian product l(1) x l(2) x ... x l(b), where each I is a closed interval on the real line. The boxicity of a graph, denoted box(G), is the minimum k such that G is the intersection graph of k-dimensional boxes. It is clear that box(G)<= cub(G). From the above result, it follows that for any graph G, cub(G) <= box(G)log(2) alpha]. (C) 2010 Wiley Periodicals, Inc. J Graph Theory 65: 323-333, 2010

Remark on factorials that are products of factorials

In a paper published in 1993, Erdos proved that if n! = a! b!, where 1 < a a parts per thousand currency sign b, then the difference between n and b does not exceed 5 log log n for large enough n. In the present paper, we improve this upper bound to ((1 + epsilon)/ log 2) log log n and generalize it to the equation a (1)!a (2)! ... a (k) ! = n!. In a recent paper, F. Luca proved that n - b = 1 for large enough n provided that the ABC-hypothesis holds.

Boxicity and Poset Dimension

Let G be a simple, undirected, finite graph with vertex set V(G) and edge set E(C). A k-dimensional box is a Cartesian product of closed intervals a(1), b(1)] x a(2), b(2)] x ... x a(k), b(k)]. The boxicity of G, box(G) is the minimum integer k such that G can be represented as the intersection graph of k-dimensional boxes, i.e. each vertex is mapped to a k-dimensional box and two vertices are adjacent in G if and only if their corresponding boxes intersect. Let P = (S, P) be a poset where S is the ground set and P is a reflexive, anti-symmetric and transitive binary relation on S. The dimension of P, dim(P) is the minimum integer l such that P can be expressed as the intersection of t total orders. Let G(P) be the underlying comparability graph of P. It is a well-known fact that posets with the same underlying comparability graph have the same dimension. The first result of this paper links the dimension of a poset to the boxicity of its underlying comparability graph. In particular, we show that for any poset P, box(G(P))/(chi(G(P)) - 1) <= dim(P) <= 2box(G(P)), where chi(G(P)) is the chromatic number of G(P) and chi(G(P)) not equal 1. The second result of the paper relates the boxicity of a graph G with a natural partial order associated with its extended double cover, denoted as G(c). Let P-c be the natural height-2 poset associated with G(c) by making A the set of minimal elements and B the set of maximal elements. We show that box(G)/2 <= dim(P-c) <= 2box(G) + 4. These results have some immediate and significant consequences. The upper bound dim(P) <= 2box(G(P)) allows us to derive hitherto unknown upper bounds for poset dimension. In the other direction, using the already known bounds for partial order dimension we get the following: (I) The boxicity of any graph with maximum degree Delta is O(Delta log(2) Delta) which is an improvement over the best known upper bound of Delta(2) + 2. (2) There exist graphs with boxicity Omega(Delta log Delta). This disproves a conjecture that the boxicity of a graph is O(Delta). (3) There exists no polynomial-time algorithm to approximate the boxicity of a bipartite graph on n vertices with a factor of O(n(0.5-epsilon)) for any epsilon > 0, unless NP=ZPP.

Growing pseudo-eigenmodes and positive logarithmic norms in rotating shear flows

Rotating shear flows, when angular momentum increases and angular velocity decreases as functions of radiation coordinate, are hydrodynamically stable under linear perturbation. The Keplerian flow is an example of such a system, which appears in an astrophysical context. Although decaying eigenmodes exhibit large transient energy growth of perturbation which could govern nonlinearity in the system, the feedback of inherent instability to generate turbulence seems questionable. We show that such systems exhibiting growing pseudo-eigenmodes easily reach an upper bound of growth rate in terms of the logarithmic norm of the involved non-normal operators, thus exhibiting feedback of inherent instability. This supports the existence of turbulence of hydrodynamic origin in the Keplerian accretion disc in astrophysics. Hence, this answers the question of the mismatch between the linear theory and experimental/observed data and helps in resolving the outstanding question of the origin of turbulence therein.

Decorrelation of broad band signals by toeplitz-block-toeplitz structuring

We propose F-norm of the cross-correlation part of the array covariance matrix as a measure of correlation between the impinging signals and study the performance of different decorrelation methods in the broadband case using this measure. We first show that dimensionality of the composite signal subspace, defined as the number of significant eigenvectors of the source sample covariance matrix, collapses in the presence of multipath and the spatial smoothing recovers this dimensionality. Using an upper bound on the proposed measure, we then study the decorrelation of the broadband signals with spatial smoothing and the effect of spacing and directions of the sources on the rate of decorrelation with progressive smoothing. Next, we introduce a weighted smoothing method based on Toeplitz-block-Toeplitz (TBT) structuring of the data covariance matrix which decorrelates the signals much faster than the spatial smoothing. Computer simulations are included to demonstrate the performance of the two methods.

Seismic horizontal pullout capacity of vertical anchors in sands

The problem of finding the horizontal pullout capacity of vertical anchors embedded in sands with the inclusion of pseudostatic horizontal earthquake body forces, was tackled in this note. The analysis was carried out using an upper bound limit analysis, with the consideration of two different collapse mechanisms: bilinear and composite logarithmic spiral rupture surfaces. The results are presented in nondimensional form to find the pullout resistance with changes in earthquake acceleration for different combinations of embedment ratio of the anchor (lambda), friction angle of the soil (phi), and the anchor-soil interface wall friction angle (delta). The pullout resistance decreases quite substantially with increases in the magnitude of the earthquake acceleration. For values of delta up to about 0.25-0.5phi, the bilinear and composite logarithmic spiral rupture surfaces gave almost identical answers, whereas for higher values of delta, the choice of the logarithmic spiral provides significantly smaller pullout resistance. The results compare favorably with the existing theoretical data.

Surfaces of Bounded Mean Curvature In Riemannian Manifolds

Consider a sequence of closed, orientable surfaces of fixed genus g in a Riemannian manifold M with uniform upper bounds on the norm of mean curvature and area. We show that on passing to a subsequence, we can choose parametrisations of the surfaces by inclusion maps from a fixed surface of the same genus so that the distance functions corresponding to the pullback metrics converge to a pseudo-metric and the inclusion maps converge to a Lipschitz map. We show further that the limiting pseudo-metric has fractal dimension two. As a corollary, we obtain a purely geometric result. Namely, we show that bounds on the mean curvature, area and genus of a surface F subset of M, together with bounds on the geometry of M, give an upper bound on the diameter of F. Our proof is modelled on Gromov's compactness theorem for J-holomorphic curves.

An adaptive cascade compensator for a wide class of stable minimum or nonminimum phase plants through time moment estimation

Model Reference Adaptive Control (MRAC) of a wide repertoire of stable Linear Time Invariant (LTI) systems is addressed here. Even an upper bound on the order of the finite-dimensional system is unavailable. Further, the unknown plant is permitted to have both minimum phase and nonminimum phase zeros. Model following with reference to a completely specified reference model excited by a class of piecewise continuous bounded signals is the goal. The problem is approached by taking recourse to the time moments representation of an LTI system. The treatment here is confined to Single-Input Single-Output (SISO) systems. The adaptive controller is built upon an on-line scheme for time moment estimation of a system given no more than its input and output. As a first step, a cascade compensator is devised. The primary contribution lies in developing a unified framework to eventually address with more finesse the problem of adaptive control of a large family of plants allowed to be minimum or nonminimum phase. Thus, the scheme presented in this paper is confined to lay the basis for more refined compensators-cascade, feedback and both-initially for SISO systems and progressively for Multi-Input Multi-Output (MIMO) systems. Simulations are presented.

Rainbow Connection Number and Radius

Rainbow connection number, rc(G), of a connected graph G is the minimum number of colours needed to colour its edges, so that every pair of vertices is connected by at least one path in which no two edges are coloured the same. In this note we show that for every bridgeless graph G with radius r, rc(G) <= r(r+2). We demonstrate that this bound is the best possible for rc(G) as a function of r, not just for bridgeless graphs, but also for graphs of any stronger connectivity. It may be noted that, for a general 1-connected graph G, rc(G) can be arbitrarily larger than its radius (K_{1,n} for instance). We further show that for every bridgeless graph G with radius r and chordality (size of a largest induced cycle) k, rc(G) <= rk. Hitherto, the only reported upper bound on the rainbow connection number of bridgeless graphs is 4n/5 - 1, where n is order of the graph [Caro et al., 2008]