A New Generalized Complex Orthogonal Space-Time Block Codes

Recent research challenges in the wireless communication include the usage of diversity and efficient coding to improve data transmission quality and spectral efficiency. Space diversity uses multiple transmitting and/or receiving antennas to create independent fading channels without penalty in bandwidth efficiency. Space-time block coding is an encoding scheme for communication over Rayleigh fading channels using multiple transmitting antennas. Space-time block codes from complex orthogonal designs exist only for two transmitting antennas. This paper generalizes a new complex orthogonal space-time block code for four transmitting antennas, whose decoding complexity is very low. Simulations show that the generalized complex orthogonal space-time block code has low bit error rate, full rate and possibly large diversity.

The Related Properties of Generalized Orthogonal Group in Specific Normed Linear Spaces

Firstly, in the general normed linear space, the concepts of generalized isosceles orthogonal group, generalized Birkhoff orthogonal group, generalized Roberts orthogonal group, strong Birkhoff orthogonal group and generalized orthogonal basis are introduced. Secondly, the conclusion that any two nonzero generalized orthogonal groups must be linearly independent group is proven. And the existence of nonzero generalized orthogonal group and its linear correlation are discussed preliminarily, as well as some related properties of nonempty generalized orthogonal group in specific normed linear space namely the lp space.

Coherence Based Sufficient Condition for Support Recovery Using Generalized Orthogonal Matching Pursuit

In an underdetermined system,compressive sensing can be used to recover the support vector.Greedy algorithms will recover the support vector indices in an iterative manner.Generalized Orthogonal Matching Pursuit(GOMP)is the generalized form of the Orthogonal Matching Pursuit(OMP)algorithm where a number of indices selected per iteration will be greater than or equal to 1.To recover the support vector of unknown signal‘x’from the compressed measurements,the restricted isometric property should be satisfied as a sufficient condition.Finding the restricted isometric constant is a non-deterministic polynomial-time hardness problem due to that the coherence of the sensing matrix can be used to derive the sufficient condition for support recovery.In this paper a sufficient condition based on the coherence parameter to recover the support vector indices of an unknown sparse signal‘x’using GOMP has been derived.The derived sufficient condition will recover support vectors of P-sparse signal within‘P’iterations.The recovery guarantee for GOMP is less restrictive,and applies to OMP when the number of selection elements equals one.Simulation shows the superior performance of the GOMP algorithm compared with other greedy algorithms.

GENERALIZED WEIGHTED SOBOLEV SPACES AND APPLICATIONS TO SOBOLEV ORTHOGONAL POLYNOMIALS Ⅱ

We present a definition of general Sobolev spaces with respect to arbitrary measures, Wk,p(Ω,μ) for 1 .≤p≤∞.In [RARP] we proved that these spaces are complete under very light conditions. Now we prove that if we consider certain general types of measures, then Cτ∞(R) is dense in these spaces. As an application to Sobolev orthogonal polynomials, toe study the boundedness of the multiplication operator. This gives an estimation of the zeroes of Sobolev orthogonal polynomials.

On the Generality of Orthogonal Projections and e-Projections in Banach Algebras

In this paper we develop the orthogonal projections and e-projections in Banach algebras. We prove some necessary and sufficient conditions for them and their spectrums. We also show that the sum of two generalized orthogonal projections u and v is a generalized orthogonal projection if, uv=vu=0. Our results generalize the results obtained for bounded linear operators on Hilbert spaces.

Controlling the contributions to high-order harmonic generation from different nuclei of N_2 with an orthogonally polarized two-color laser field

The generation of high-order harmonic and the attosecond pulse of the N2 molecule with an orthogonally polarized two-color laser field are investigated by the strong-field Lewenstein model.We show that the control of contributions to high-order harmonic generation（HHG） from different nuclei is realized by properly selecting the relative phase.When the relative phase is chosen to be φ= 0.4π,the contribution to HHG from one nucleus is much more than that from another.Interference between two nuclei can be suppressed greatly; a supercontinuum spectrum of HHG appears from 40 e V to125 e V.The underlying physical mechanism is well explained by the time–frequency analysis and the semi-classical threestep model with a finite initial transverse velocity.By superposing several orders of harmonics,an isolated attosecond pulse with a duration of 80 as can be generated.

A Multivariate Empirical Orthogonal Function-Based Scheme for the Balanced Initial Ensemble Generation of an Ensemble Kalman Filter

The initial ensemble perturbations for an ensemble data assimilation system are expected to reasonably sample model uncertainty at the time of analysis to further reduce analysis uncertainty. Therefore, the careful choice of an initial ensemble perturbation method that dynamically cycles ensemble perturbations is required for the optimal performance of the system. Based on the multivariate empirical orthogonal function (MEOF) method, a new ensemble initialization scheme is developed to generate balanced initial perturbations for the ensemble Kalman filter (EnKF) data assimilation, with a reasonable consideration of the physical relationships between different model variables. The scheme is applied in assimilation experiments with a global spectral atmospheric model and with real observations. The proposed perturbation method is compared to the commonly used method of spatially-correlated random perturbations. The comparisons show that the model uncertainties prior to the first analysis time, which are forecasted from the balanced ensemble initial fields, maintain a much more reasonable spread and a more accurate forecast error covariance than those from the randomly perturbed initial fields. The analysis results are further improved by the balanced ensemble initialization scheme due to more accurate background information. Also, a 20-day continuous assimilation experiment shows that the ensemble spreads for each model variable are still retained in reasonable ranges without considering additional perturbations or inflations during the assimilation cycles, while the ensemble spreads from the randomly perturbed initialization scheme decrease and collapse rapidly.

THE EQUATIONS OF COMPLETE DEPTH-AVERAGED TURBULENCE MODEL IN GENERAL ORTHOGONAL COORDINATES

For shallow water flow, the depth-averaged governing equations are derived by depth-averaging of the mean equations for three-dimensional turbulent flows. The influences of free water surface and of topography of river bed are taken into account.The depth-averaged equations of k-εturbulence model are also obtained. Because it Accounts for the three-dimensional effect, this model is named as the complete Depth-averaged model.The boundaries of natural water bodies are usually curved.In this work, the derived equations in Cartesian coordinates are transformed into orthogonal coordinates. The obtained equations can be applied directly to numerical computation of practical problems.

THEORETICAL BASIS AND GENERAL OPTIMAL FORMULATIONS OF ISOPARAMETRIC GENERALIZED HYBRID/MIXED ELEMENT MODEL FOR IMPROVED STRESS ANALYSIS

By the modified three-field Hu-Washizu principle, this paper establishes a theoretical founda- tion and general convenient formulations to generate convergent stable generalized hybrid/mixed cle- ment (GH/ME) model which is invariant with respect to coordinate, insensitive to geometric distortion and suitable for improved stress computation. In the two proposed formulations, the stress equilibrium and orthogonality constraints are imposed through incompatible displacement and internal strain modes respectively. The proposed model by the general formulations in this paper is characterized by including as- sumed stress/strain, assumed stress, variable-node, singular, compatible and incompatible GH/ME models. When using regular meshes or the constant values of the isoparametric Jacobian Det in the assumed strain in- terpolation, the incompatible GH/ME model degenerates to the hybrid/mixed element model. Both general and concrete guidelines for the optimal selection of element shape functions are suggested. By means of the GH/ME theory in this paper, a family of new GH/ME can be and have been easily constructed. The software can also be developed conveniently because all the standard subroutines for the corresponding isoparametric displacement elements can be utilized directly.

GENERALIZED FINITE SPECTRAL METHOD FOR 1D BURGERS AND KDV EQUATIONS

A generalized finite spectral method is proposed. The method is of highorder accuracy. To attain high accuracy in time discretization, the fourth-order AdamsBashforth-Moulton predictor and corrector scheme was used. To avoid numerical oscillations caused by the dispersion term in the KdV equation, two numerical techniques were introduced to improve the numerical stability. The Legendre, Chebyshev and Hermite polynomials were used as the basis functions. The proposed numerical scheme is validated by applications to the Burgers equation （nonlinear convection- diffusion problem） and KdV equation（single solitary and 2-solitary wave problems）, where analytical solutions are available for comparison. Numerical results agree very well with the corresponding analytical solutions in all cases.

ORTHOGONAL POLYNOMIALS AND DETERMINANT FORMULAS OF FUNCTION-VALUED PADE-TYPE APPROXIMATION USING FOR SOLUTION OF INTEGRAL EQUATIONS

To solve Fredholm integral equations of the second kind, a generalized linear functional is introduced and a new function-valued Padé-type approximation is defined. By means of the power series expansion of the solution, this method can construct an approximate solution to solve the given integral equation. On the basis of the orthogonal polynomials, two useful determinant expressions of the numerator polynomial and the denominator polynomial for Padé-type approximation are explicitly given.

Blind CFO estimation algorithm for OFDM systems by using generalized precoding and trilinear model

This paper discusses the blind carrier frequency offset （CFO） estimation for orthogonal frequency division multiplexing （OFDM） systems by utilizing trilinear decomposition and genera- lized preceding. Firstly, the generalized precoding is employed to obtain multiple covariance matrices which are requisite for the trilinear model, and then a novel CFO estimation algorithm is proposed for the OFDM system. Compared with both the joint diagonalizer and estimation of signal parameters via rotational invariant technique （ESPRIT）, the proposed algorithm enjoys a better CFO estimation performance. Furthermore, the proposed algorithm can work well without virtual carriers. Simulation results illustrate the performance of this algorithm,

A Family of Asymmetrical Orthogonal Arrays with Run Sizes 4p^2

Nowadays orthogonal arrays play important roles in statistics, computer science, coding theory and cryptography. The usual difference matrices are essential for the construction of many mixed orthogonal arrays. But there are also many orthogonal arrays, especially mixed-level or asymmetrical which can not be obtained by the usual difference matrices. In order to construct these asymmetrical orthogonal arrays, a class of special matrices, so-called generalized difference matrices, were discovered by Zhang（1989, 1990, 1993） by the orthogonal decompositions of projective matrices. In this article, an interesting equivalent relationship between the orthogonal arrays and the generalized difference matrices is presented. As an application, a family of orthogonal arrays of run sizes 4p2, such as L36（6^13^42^10）, are constructed.

Parabolic Wave Propagation Modelling in Orthogonal Coordinate Systems

This paper presents a numerical model study of the propagation of water waves using the parabolic approximation of the mild slope equation in the orthogonal coordinate system. Two types of coordinate systems are studied: (a) a general form of orthogonal coordinate system and (b) the conformal system, a special form of orthogonal coordinate system. Two typical examples, namely, expanded breakwaters and a circular channel, are studied to validate the model. First, the examples are studied by use of the general orthogonal coordinates. Then the same examples are computed by use of the conformal system. The computational results show that the conformal coordinate system generally gives better predictions than the general orthogonal system. A numerical technique for generating the conformal grid is combined with the numerical model to improve the practicability of the model. The comparison between the result from the numerical grid system and that from the analytical grid system shows that reliable computational results can be obtained by use of the numerical conformal grid system.

ON A GENERALIZED GEOMETRIC CONSTANT AND SUFFICIENT CONDITIONS FOR NORMAL STRUCTURE IN BANACH SPACES

In this paper, we introduce a new geometric constant C;（a, X） of a Banach space X, which is closely related to the generalized von Neumann-Jordan constant and analyze some properties of the constant. Subsequently, we present several sufficient conditions for normal structure of a Banach space in terms of this new constant, the generalized James constant, the generalized Garc′?a-Falset coefficient and the coefficient of weak orthogonality of Sims. Our main results of the paper generalize some known results in the recent literature.

Jacobi-Sobolev Orthogonal Polynomialsand Spectral Methods for Elliptic Boundary Value Problems

Generalized Jacobi polynomials with indexes α,β∈ R are introduced and some basic properties are established. As examples of applications,the second- and fourth-order elliptic boundary value problems with Dirichlet or Robin boundary conditions are considered,and the generalized Jacobi spectral schemes are proposed. For the diagonalization of discrete systems,the Jacobi-Sobolev orthogonal basis functions are constructed,which allow the exact solutions and the approximate solutions to be represented in the forms of infinite and truncated Jacobi series. Error estimates are obtained and numerical results are provided to illustrate the effectiveness and the spectral accuracy.

Some Applications of Orthogonal Projections in Generalized Frames

Using operator-theoretic-methods, we give some characterizations for a dual generalized frame of a generalized frame in a separable Hilbert space H. We also prove a result concerning two strongly disjiont generalized frames.

Orthogonal arrays obtained by generalized difference matrices with g levels

Nowadays orthogonal arrays play important roles in statistics, computer science, coding theory and cryptography. The usual difference matrices are essential for the construction for many mixed orthogonal arrays. But there are also orthogonal arrays which cannot be obtained by the usual difference matrices, such as mixed orthogonal arrays of run size 60. In order to construct these mixed orthogonal arrays, a class of special so-called generalized difference matrices were discovered by Zhang (1989,1990,1993,2006) from the orthogonal decompositions of projection matrices. In this article, an interesting equivalent relationship between orthogonal arrays and the generalized difference matrices is presented and proved. As an application, a lot of new orthogonal arrays of run size 60 have been constructed.

CNC FLEXIBLE GENERATING SPECIFIC GEAR TOOTH PROFILE BASED ON STANDARD INVOLUTE GEAR HOB

A new method named orthogonal two-way link-shift here has been proposed.Based on the method and a standard involute gear hob, a specific gear tooth profile (including anarbitrary gear tooth profile and a modified involute gear tooth profile) can be generated on aCNC(computer numerical control) bobbing machine. Computer simulation has been carried out, and theresults prove that the method is right and practicable. So, the fabrication costs can be greatlydecreased than before. The new method has momentous significance to realize gear's optimizedmodification under different work conditions.

Generalized Latin Matrix and Construction of Orthogonal Arrays

In this paper, generalized Latin matrix and orthogonal generalized Latin matrices are proposed. By using the property of orthogonal array, some methods for checking orthogonal generalized Latin matrices are presented. We study the relation between orthogonal array and orthogonal generalized Latin matrices and obtain some useful theorems for their construction. An example is given to illustrate applications of main theorems and a new class of mixed orthogonal arrays are obtained.