A VERTICAL LAYERED SPACE-TIME CODE AND ITS CLOSED-FORM BLIND SYMBOL DETECTION

Vertical layered space-time codes have demonstrated the enormous potential to accommodate rapid flow data. Thus far, vertical layered space-time codes assumed that perfect estimates of current channel fading conditions are available at the receiver. However, increasing the number of transmit antennas increases the required training interval and reduces the available time in which data may be transmitted before the fading coefficients change. In this paper, a vertical layered space-time code is proposed. By applying the subspace method to the layered space-time code, the symbols can be detected without training symbols and channel estimates at the transmitter or the receiver. Monte Carlo simulations show that performance can approach that of the detection method with the knowledge of the channel.

WATER-FILLING SPACE-TIME CODE IN CORRELATED FLAT RAYLEIGH FADING MISO CHANNELS

In this paper, STC with water-filling transmit power distribution in MISO system is proposed when the partial channel information feedback is possible, for example, at slow fading scenario. The performances of the water-filling STC including water-filling STTC and water-filling STBC are analyzed. Performance comparison of the Ungerboeck's 2/3 trellis coded 8PSK modulated 2-STBC and 2-STTCs with QPSK is given out in different channel correlation.

REDUCED-COMPLEXITY DECODING ALGORITHMS FOR UNITARY SPACE-TIME CODES

Two reduced-complexity decoding algorithms for unitary space-time codes based on tree-structured constellation are presented. In this letter original unitary space-time constellation is divided into several groups. Each one is treated as the leaf nodes set of a subtree. Choosing the unitary signals that represent each group as the roots of these subtrees generates a tree-structured constellation. The proposed tree search decoder decides to which sub tree the receive signal belongs by searching in the set of subtree roots. The final decision is made after a local search in the leaf nodes set of the se-lected sub tree. The adjacent subtree joint decoder performs joint search in the selected sub tree and its “surrounding” subtrees,which improves the Bit Error Rate (BER) performance of purely tree search method. The exhaustively search in the whole constellation is avoided in our proposed decoding al-gorithms,a lower complexity is obtained compared to that of Maximum Likelihood (ML) decoding. Simulation results have also been provided to demonstrate the feasibility of these new methods.

Performance of Cross-Layer Design with Power Allocation in Space-Time Coded MIMO Systems

A cross-layer design(CLD)scheme with combination of power allocation,adaptive modulation(AM)and automatic repeat request(ARQ)is presented for space-time coded MIMO system under imperfect feedback,and the corresponding system performance is investigated in a Rayleigh fading channel.Based on imperfect feedback information,a suboptimal power allocation(PA)scheme is derived to maximize the average spectral efficiency(SE)of the system.The scheme is based on a so-called compressed SNR criterion,and has a closed-form expression for positive power allocation,thus being computationally efficient.Moreover,it can improve SE of the presented CLD.Besides,due to better approximation,it obtains the performance close to the existing optimal approach which requires numerical search.Simulation results show that the proposed CLD with PA can achieve higher SE than the conventional CLD with equal power allocation scheme,and has almost the same performance as CLD with optimal PA.However,it has lower calculation complexity.

A simple channel estimator for space-time coded OFDM systems in rapid fading channels

A simple channel estimator for space-time coded orthogonal frequency division multiplexing (OFDM) systems in rapid fading channels is proposed. The channels at the training bauds are estimated using the EM (expectation-maximization) algorithm, while the channels at the data bauds are estimated based on the method for modelling the time-varying channel as the linear combination of several time-invariant " Doppler channels". Computer simulations showed that this estimator outperforms the decision-directed tracking in rapid fading channels and that the performance of this method can be improved by iteration.

CLOSED-FORM SPACE-TIME CHANNEL BLIND ESTIMATION FOR SPACE-TIME CODED MC-CDMA SYTEMS WITH UNIFORM LINEAR ARRAY

This paper proposes a closed-form joint space-time channel and Direction Of Arrival （DOA） blind estimation algorithm for space-thne coded Multi-Carrier Code Division Multiple Access （MC-CDMA） systems equipped with a Uniform Linear Array （ULA） at the base station in frequency-selective fading environments. The algorithm uses an ESPRIT-like method to separate multiple co-channel users with different impinging DOAs. As a result, the DOAs for multiple users are obtained. In particular, a set of signal subspaces, every one of which is spanned by the space-time vector channels of an individual user, are also obtained. From these signal subspaces, the space-time channels of multiple users are estimated using the subspace method. Computer simulations illustrate both the validity and the overall performance of the proposed scheme.

A Design Method of Noncoherent Unitary Space-Time Codes

We generalized an constructing method of noncoherent unitary space time codes (N-USTC) over Rayleigh flat fading channels. A family of N-USTCs with T symbol peroids, M transmit and N receive antennas was constructed by the exponential mapping method based on the tangent subspace of the Grassmann manifold. This exponential mapping method can transform the coherent space time codes (C-STC) into the N-USTC on the Grassmann manifold. We infered an universal framework of constructing a C-STC that is designed by using the algebraic number theory and has full rate and full diversity (FRFD) for t symbol periods and same antennas, where M, N, T, t are general positive integer. We discussed the constraint condition that the exponential mapping has only one solution, from which we presented a approach of searching the optimum adjustive factor αopt that can generate an optimum noncoherent codeword. For different code parameters M, N, T, t and the optimum adjustive factor αopt, we gave the simulation results of the several N-USTCs.

Optimal transmissions for space-time coded OFDM UWB systems

The emerging ultra-wideband (UWB) system offers a great potential for the design of high-speed short-range communications.Compared with great progress at physical layer,the corresponding medium access control (MAC) layer designs are naturally placed on the schedules.We focus on the optimal power load scheme,which is an integral part of the MAC layer protocol design,for UWB space-time coded (STC) orthogonal frequency-division multiplexing (OFDM) transmissions.Assumed the transmitter has perfect or partial channel stage information (CSI).Based on the optimization criteria of maximizing capacity,three kinds of power load schemes were presented with different tradeoff among performance,complexity and feedback bandwidth overhead.The proposed schemes are verified and compared under the channel prototype proposed by IEEE 802.15.3a Task Group.

Performance of Block Space-Time Code in Wireless Channel Dynamics

In this work, we observe the behavior of block space-time code in wireless channel dynamics. The block space-time code is optimally constructed in slow fading. The block code in quasistatic fading channels provides affordable complexity in design and construction. Our results show that the performance of the block space-time code may not be as good as conventionally convolutional coding with serial transmission for some channel features. As channel approaches fast fading, a coded single antenna scheme can collect as much diversity as desired by correctly choosing the free distance of code. The results also point to the need for robust space-time code in dynamic wireless fading channels. We expect that self-encoded spread spec-trum with block space-time code will provide a robust performance in dynamic wireless fading channels.

Noncoherent Unitary Space-Time Codes： Constellation Design and Decoding Algorithm

Two novel schemes of unitary space-time constellations generation based on zero vectors adding are proposed for the multiple-antenna communication system. In the first scheme, T2 zero row vectors are added into conventional unitary matrices directly, and the number of new unitary matrices obtained by different positions of the added zero vectors in T symbol duration is [T / T2 ] times larger than that of conventional unitary matrices. In the second scheme, one part of the required constellations is created by the first scheme and the other part is obtained by the conventional design. This means that more information bits can be transmitted by the new constellations. According to their special construction, two corresponding decoding algorithms are proposed with low complexity in flat fading channel, respectively. At the same time, the probability of miss detection is deduced for the decoding algorithms. Performance analysis and simulation results show that the proposed constellations outperform the conventional constellations and the proposed decoding algorithms are efficient and simple.

BER Performance of Space-Time Coded MMSE DFE for Wideband Code Division Multiple Access (WCDMA)

In recent times, there has been growing interests in integration of voice, data and video traffic in wireless communication networks. With these growing interests, WCDMA has immerged as an attractive access technique. The performance of WCDMA system is deteriorated in presence of multipath fading environment. The paper presents space-time coded minimum mean square error (MMSE) Decision Feedback Equalizer (DFE) for wideband code division multiple access (WCDMA) in a frequency selective channel. The filter coefficients in MMSE DFE are optimized to suppress noise, intersymbol interference (ISI), and multiple access interference (MAI) with reasonable system complexity. For the above structure, we have presented the estimation of BER for a MMSE DFE using computer simulation experiments. The simulation includes the effects of additive white Gaussian noise, multipath fading and multiple access interference (MAI). Furthermore, the performance is compared with standard linear equalizer (LE) and RAKE receiver. Numerical and simulation results show that the MMSE DFE exhibits significant performance improvement over the standard linear equalizer (LE) and RAKE receiver.

ESTIMATION OF AVERAGE DIFFERENTIAL ENTROPY FOR A STATIONARY ERGODIC SPACE-TIME RANDOM FIELD ON A BOUNDED AREA

In this paper,we mainly discuss a discrete estimation of the average differential entropy for a continuous time-stationary ergodic space-time random field.By estimating the probability value of a time-stationary random field in a small range,we give an entropy estimation and obtain the average entropy estimation formula in a certain bounded space region.It can be proven that the estimation of the average differential entropy converges to the theoretical value with a probability of 1.In addition,we also conducted numerical experiments for different parameters to verify the convergence result obtained in the theoretical proofs.

Robust Space-Time Adaptive Track-Before-Detect Algorithm Based on Persymmetry and Symmetric Spectrum

Underwater monopulse space-time adaptive track-before-detect method,which combines space-time adaptive detector(STAD)and the track-before-detect algorithm based on dynamic programming(DP-TBD),denoted as STAD-DP-TBD,can effectively detect low-speed weak targets.However,due to the complexity and variability of the underwater environment,it is difficult to obtain sufficient secondary data,resulting in a serious decline in the detection and tracking performance,and leading to poor robustness of the algorithm.In this paper,based on the adaptive matched filter(AMF)test and the RAO test,underwater monopulse AMF-DP-TBD algorithm and RAO-DP-TBD algorithm which incorporate persymmetry and symmetric spectrum,denoted as PSAMF-DP-TBD and PS-RAO-DP-TBD,are proposed and compared with the AMF-DP-TBD algorithm and RAO-DP-TBD algorithm based on persymmetry array,denoted as P-AMF-DP-TBD and P-RAO-DP-TBD.The simulation results show that the four methods can work normally with sufficient secondary data and slightly insufficient secondary data,but when the secondary data is severely insufficient,the P-AMF-DP-TBD and P-RAO-DP-TBD algorithms has failed while the PSAMF-DP-TBD and PS-RAO-DP-TBD algorithms still have good detection and tracking capabilities.

Curved Space-Time at the Planck Scale

This paper presents a physically plausible and somewhat illuminating first step in extending the fundamental principles of mechanical stress and strain to space-time. Here the geometry of space-time, encoded in the metric tensor, is considered to be made up of a dynamic lattice of extremely small, localized fields that form a perfectly elastic Lorentz symmetric space-time at the global (macroscopic) scale. This theoretical model of space-time at the Planck scale leads to a somewhat surprising result in which matter waves in curved space-time radiate thermal gravitational energy, as well as an equally intriguing relationship for the anomalous dispersion of light in a gravitational field.

Virtually coupled train set control subject to space-time separation:A distributed economic MPC approach with emergency braking configuration

The emerging virtual coupling technology aims to operate multiple train units in a Virtually Coupled Train Set(VCTS)at a minimal but safe distance.To guarantee collision avoidance,the safety distance should be calculated using the state-of-the-art space-time separation principle that separates the Emergency Braking(EB)trajectories of two successive units during the whole EB process.In this case,the minimal safety distance is usually numerically calculated without an analytic formulation.Thus,the constrained VCTS control problem is hard to address with space-time separation,which is still a gap in the existing literature.To solve this problem,we propose a Distributed Economic Model Predictive Control(DEMPC)approach with computation efficiency and theoretical guarantee.Specifically,to alleviate the computation burden,we transform implicit safety constraints into explicitly linear ones,such that the optimal control problem in DEMPC is a quadratic programming problem that can be solved efficiently.For theoretical analysis,sufficient conditions are derived to guarantee the recursive feasibility and stability of DEMPC,employing compatibility constraints,tube techniques and terminal ingredient tuning.Moreover,we extend our approach with globally optimal and distributed online EB configuration methods to shorten the minimal distance among VCTS.Finally,experimental results demonstrate the performance and advantages of the proposed approaches.

A construction of fully diverse unitary space-time codes

Fully diverse unitary space-time codes are useful in multiantenna communications, especially in multiantenna differential modulation. Recently, two constructions of parametric fully diverse unitary space-time codes for three antennas system have been introduced. We propose a new construction method based on the constructions. In the present paper, fully diverse codes for systems of odd prime number antennas are obtained from this construction. Space-time codes from present construction are found to have better error performance than many best known ones.

CONSTRUCTIONS OF UNITARY SPACE-TIME CODES WITH FULL DIVERSITY

The problem of constructing unitary space-time codes with high diversity product has been studied in many prior works.Recently,constructions of parametric fully diverse unitary space-time codes for prime number antennas system have been introduced.In this paper,the authors propose new construction methods based on these constructions.And fully diverse codes of any number antennas are obtained from these constructions.Unitary space-time codes from present constructions are found to have better error performance than many best known ones.

CONSTRUCTIONS OF THREE-TRANSMIT-ANTENNA SPACE-TIME CODES

In this paper, we give design methods for three-transmit-antenna space-time codes which have reasonable parameters. A few examples are given to show that some unitary space-time codes constructed with our methods are better than the previously best-known ones.

Non-coherent space-time code based on full diversity space-time block coding

A non-unitary non-coherent space-time code which is capable of achieving full algebraic diversity is proposed based on full diversity space-time block coding, The error performance is optimized by transforming the non-unitary space-time code into unitary space-time code, By exploiting the desired structure of the proposed code, a grouped generalized likelihood ratio test decoding algorithm is presented to overcome the high complexity of the optimal algorithm, Simulation results show that the proposed code possesses high spectrum efficiency in contrast to the unitary space-time code despite slight loss in the SNR, and besides, the proposed grouped decoding algorithm provides good tradeoff between performance and complexity,

Design of super-orthogonal space-time trellis codes based on trace criterion

A design of super-orthogonal space-time trellis codes （SOSTTCs） based on the trace criterion （TC） is proposed for improving the design of SOSTTCs. The shortcomings of the rank and determinant criteria based design and the advantages of the TC-based design are analyzed. The optimization principle of four factors is presented, which includes the space-time block coding （STBC） scheme, set partitioning, trellis structure, and the assignment of signal subsets and STBC schemes in the trellis. According to this principle, systematical and handcrafted design steps are given in detail. By constellation expansion, the code performance can be further improved. The code design results are given, and the new codes outperform others in the simulation.