BER analysis of space-time block codes from generalized complex orthogonal designs for M-PSK

In this paper, we present an analysis for the bit error rate (BER) performance of space-time block codes (STBC) from generalized complex orthogonal designs for M-PSK modulation. In STBCs from complex orthogonal designs (COD), the norms of the column vectors are the same (e.g., Alamouti code). However, in generalized COD (GCOD), the norms of the column vectors may not necessarily be the same (e.g., the rate-3/5 and rate-7/11 codes by Su and Xia in [1]). STBCs from GCOD are of interest because of the high rates that they can achieve (in [2], it has been shown that the maximum achievable rate for STBCs from GCOD is bounded by 4/5). While the BER performance of STBCs: from COD (e.g., Alamouti code) can be simply obtained from existing analytical expressions for receive diversity with the same diversity order by appropriately scaling the SNR, this can not be done for STBCs from GCOD (because of the unequal norms of the column vectors). Our contribution in this paper is that we derive analytical expressions for the BER performance of any STBC from GCOD. Our BER analysis for the GCOD captures the performance of STBCs from COD as special cases. We validate our results with two STBCs from GCOD reported by Su and Xia in [1], for 5 and 6 transmit antennas (G(5) and G(6) in [1]) with rates 7/11 and 3/5, respectively.

A generalized equation for diffusion in liquids

The association parameter in the diffuswn equaiior, dye fo Wiike one Chong has been interpreted in deferminable properties, thus permitting easily the calculation of the same for unknown systems. The proposed eqyotion a!se holds goods for water as soiute in organic solvenfs. The over-all percentage error remains the sarrse as that of the original equation.

A Computationally Efficient Generalized Poisson Solution for Independent Double-Gate Transistors

Previous techniques used for solving the 1-D Poisson equation ( PE) rigorously for long-channel asymmetric and independent double-gate (IDG) transistors result in potential models that involve multiple intercoupled implicit equations. As these equations need to be solved self-consistently, such potential models are clearly inefficient for compact modeling. This paper reports a different rigorous technique for solving the same PE by which one can obtain the potential profile of a generalized IDG transistor that involves a single implicit equation. The proposed Poisson solution is shown to be computationally more efficient for circuit simulation than the previous solutions.

A generalized Linear Programming based approach to optimal divisible load scheduling

In this paper we propose a general Linear Programming (LP) based formulation and solution methodology for obtaining optimal solution to the load distribution problem in divisible load scheduling. We exploit the power of the versatile LP formulation to propose algorithms that yield exact solutions to several very general load distribution problems for which either no solutions or only heuristic solutions were available. We consider both star (single-level tree) networks and linear daisy chain networks, having processors equipped with front-ends, that form the generic models for several important network topologies. We consider arbitrary processing node availability or release times and general models for communication delays and computation time that account for constant overheads such as start up times in communication and computation. The optimality of the LP based algorithms is proved rigorously.

On the generalized continuum model of dipolar solvation dynamics

The continuum model of dipolar solvation dynamics is reviewed. The effects of non-spherical molecular shapes, of non-Debye dielectric relaxation of the polar solvent and of dielectric inhomogeneity of the solvent around the solute dipole are investigated. Several new theoretical results are presented. It is found that our generalized continuum model, which takes into account the dielectric inhomogeneity of the surrounding solvent, provides a description of solvation dynamics consistent with recent experimental results.

A denotational semantics for the generalized ER model and a simple ER algebra

The recent spurt of research activities in Entity-Relationship Approach to databases calls for a close scrutiny of the semantics of the underlying Entity-Relationship models, data manipulation languages, data definition languages, etc. For reasons well known, it is very desirable and sometimes imperative to give formal description of the semantics. In this paper, we consider a specific ER model, the generalized Entity-Relationship model (without attributes on relationships) and give denotational semantics for the model as well as a simple ER algebra based on the model. Our formalism is based on the Vienna Development Method—the meta language (VDM). We also discuss the salient features of the given semantics in detail and suggest directions for further work.

Generalized asymptotic expansions for coupled wavenumbers in fluid-filled cylindrical shells

Analytical expressions are found for the coupled wavenumbers in an infinite fluid-filled cylindrical shell using the asymptotic methods. These expressions are valid for any general circumferential order (n).The shallow shell theory (which is more accurate at higher frequencies)is used to model the cylinder. Initially, the in vacua shell is dealt with and asymptotic expressions are derived for the shell wavenumbers in the high-and the low-frequency regimes. Next, the fluid-filled shell is considered. Defining a relevant fluid-loading parameter p, we find solutions for the limiting cases of small and large p. Wherever relevant, a frequency scaling parameter along with some ingenuity is used to arrive at an elegant asymptotic expression. In all cases.Poisson's ratio v is used as an expansion variable. The asymptotic results are compared with numerical solutions of the dispersion equation and the dispersion relation obtained by using the more general Donnell-Mushtari shell theory (in vacuo and fluid-filled). A good match is obtained. Hence, the contribution of this work lies in the extension of the existing literature to include arbitrary circumferential orders(n). (C) 2010 Elsevier Ltd. All rights reserved.

Generalized Burgers equations and Euler–Painlevé transcendents. III

It was proposed earlier [P. L. Sachdev, K. R. C. Nair, and V. G. Tikekar, J. Math. Phys. 27, 1506 (1986); P. L. Sachdev and K. R. C. Nair, ibid. 28, 977 (1987)] that the Euler–Painlevé equations  y(d2y/dη2)+a(dy/dη)2 +f(η)y(dy/dη)+g(η)y2+b(dy/dη) +c=0 represent generalized Burgers equations (GBE’s) in the same way as Painlevé equations represent the Korteweg–de Vries type of equations. The earlier studies were carried out in the context of GBE’s with damping and those with spherical and cylindrical symmetry. In the present paper, GBE’s with variable coefficients of viscosity and those with inhomogeneous terms are considered for their possible connection to Euler–Painlevé equations. It is found that the Euler–Painlevé equation, which represents the GBE ut+uβux=(δ/2)g(t)uxx, g(t)=(1+t)n, β>0, has solutions, which either decay or oscillate at η=±∞, only when −1

Generalized Equation for Compression Ratio

For highly compressible normally consolidated saturated soil the compression index, Cc, is not constant over the entire pressure range. However, the ratio of the compression index and the initial specific volume, generally known as the compression ratio, appears to be constant. Thus settlement seems to depend on Cc/(1 + e) rather than Cc alone. Using the theoretical zero air voids line and the generalized compressibility equation for normally consolidated saturated soils, a generalized and simple equation for compression has been derived in the form: C'c = 0.003wL.

Noise minimization in RC-active filters using generalized impedance converters

A procedure has been given for minimizing the total output noise of a Generalized Impedance Converter (GIC), subject to constraints dictated by signal handling capability of the Operational Amplifiers and ease of microcircuit fabrication. The noise reduction is achieved only by the adjustment of RC elements of the GIC, and the total output noise after optimization in the example cited is close to the theoretical lower limit. The output noise of a higher-order filter can be reduced by RC-optimizing the individual GIC's of the active realization. Experimental results on a 20–24 kHz channel bank band-pass filter demonstrate the effectiveness of the above procedure.

Simultaneous display of image and spectrum in the same plane: a generalized analysis

A generalized analysis, using the Vander Lugt operational notation, of the building block optical system comprising a single holographic optical element (HOE) for achieving simultaneous display of the spectrum and the image of an object in a single plane, has been carried out. The salient features of this analysis are: (1) it allows comprehensive characterization of the HOE, (2) it provides insights into the many possible configurations for the system, and (3) it explains the existing results in a consistent manner.

An integer arithmetic method to compute generalized matrix inverse and solve linear equations exactly

An algorithm that uses integer arithmetic is suggested. It transforms anm ×n matrix to a diagonal form (of the structure of Smith Normal Form). Then it computes a reflexive generalized inverse of the matrix exactly and hence solves a system of linear equations error-free.

Brownian motion of spins; generalized spin Langevin equation

We derive the Langevin equations for a spin interacting with a heat bath, starting from a fully dynamical treatment. The obtained equations are non-Markovian with multiplicative fluctuations and concommitant dissipative terms obeying the fluctuation-dissipation theorem. In the Markovian limit our equations reduce to the phenomenological equations proposed by Kubo and Hashitsume. The perturbative treatment on our equations lead to Landau-Lifshitz equations and to other known results in the literature.

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