相关论文
2002 - The 13th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications
Space-time block coded transmit diversity for OFDM system in mobile channels

In this paper, two kinds of space-time block coded transmit diversity are proposed for OFDM system in mobile channels. One is in time domain and at least one frame (one symbol) delay is needed for the decoding algorithm; the other is in frequency domain so it also can be termed as space-frequency coded (SFC) transmit diversity more concisely, and no delay is needed for the decoding algorithm. We simulate the performance of these kinds of space-time block coded transmit diversity, the space-time trellis coded transmit diversity with 4- and 16-state are also simulated to give out a performance comparison with space-time block coded transmit diversity in this paper.

2020 - IEEE Geoscience and Remote Sensing Letters
Radio Frequency Interference Suppression for HF Surface Wave Radar Using CEMD and Temporal Windowing Methods

A common source of interference in high-frequency (HF) surface wave (HFSW) radars is radio frequency interference (RFI). Its existence inhibits the detection performance of HFSW radars since its amplitude can mask the sea echoes. On the basis of the analysis of RFI characteristics, a new RFI mitigation algorithm based on inverse temporal windowing and complex empirical mode decomposition (CEMD) is proposed in this letter. In this method, echoes containing RFI are decomposed into a number of intrinsic mode functions (IMFs) via CEMD and then the inverse temporal windowing technique is applied to each IMFs in the time domain. Test results show that the proposed method outperforms the conventional method in simulated and practical conditions and can effectively mitigate RFI without losing sea echoes.

2009 - EURASIP Journal on Advances in Signal Processing
Prefiltering-Based Interference Suppression for Time-Hopping Multiuser UWB Communications over MISO Channel

This paper proposes a prefiltering-based scheme for pulsed ultra-wideband (UWB) system by shifting the signal processing needs from the receiver at the radio terminal (RT) to the transmitter at the fixed access point (AP) where power and computational resources are plentiful. We exploit antenna array in the transmitter of AP and take advantage of the spatial and temporal diversities to mitigate the multiuser interference (MUI) as well as preequalize the channel impulse response (CIR) of a time-hopping (TH) multiple access UWB communication system. Three prefiltering schemes are developed to meet different criteria. A simple correlation receiver is proposed at the RT to combine the desired signal stemmed from all the transmitting antennas. The performances under different scenarios are extensively evaluated over multiple-input single-output (MISO) channels.

2002
Combined Beamforming and Space-Time Block Coding for High Speed Wireless Indoor Communications

The combination of a digital beamformingtechniquewith space-timeblock codingin an indoor wirelessenvironmentis the purposeof this paper . Uplink transmissionis achieved by anomnidirectionalmobileantenna,with signalsarriving at the basestationhaving relatively wide angularspread. The spatial channelresponse, an estimateof the channelangulargain pattern,is obtainedby usingan arrayantennaat the basestation. Thearraycreatesscannedmultiple beamsin azimuthand provides the effective angularspreadof the incomingsignals. Thesesignalsareassumedto bepropagatedin amicrocellradio channelwith a large numberof singlebouncemultipathcomponents.A simplealgorithmestimatesthenumberof beamsfor downlink transmission,and the transmitterbeamformingnetwork in thebasestationprovidestherequiredbeams.Basedon the numberof beams,different signalsare transmittedsimultaneously . In particular, space-timeblock codingis appliedto thebeams.Theperformanceof theproposedmethodis studied with respectto the numberof transmitedbeamsandof multipathcomponents.

2013 - IET Commun.
Cooperative decode-and-forward relaying with orthogonal space-time block code over doubly correlated Nakagami-m fading channels

In this study, the authors investigate the performance of cooperative decode-and-forward multiple-input multiple-output relaying system with orthogonal space–time block code transmissions over doubly correlated Nakagami-m fading channels, where the source, relay and destination nodes are all equipped with multiple antennas. They also include correlated and independent Rayleigh fading channels as special cases. Only when the relay node could receive the signal from the source correctly, it will forward source information to the destination. For two types of receivers at the destination, maximal ratio combining and selection combining, the authors provide the compact closed-form expressions for cumulative distribution function (CDF) and probability density function of the instantaneous end-to-end signal-to-noise ratio (SNR). Besides, the exact analytical expressions are also derived for the outage probability (OP) and symbol error rate (SER) relying on CDF. Furthermore, they present the asymptotic expressions for OP and SER in the high SNR regime, from which they gain an insight into the system performance and derive the achievable diversity order and array gain. The analytical expressions are validated by Monte-Carlo simulations.

2007 - IEEE Transactions on Wireless Communications
Extended Space-Time Block Coding with Transmit Antenna Selection over Correlated Fading Channels

A new space-time block coded transmit antenna selection scheme over spatially correlated fading channels is presented. This scheme allows two or more transmit antennas to simultaneously use one radio frequency frontend. A system with four transmit antennas is considered in particular. The four antennas are selectively grouped into two subsets. Alamouti code is then applied on top of the subsets as if each was a single antenna. This scheme is shown to be more efficient than the conventional transmit antenna selection combined with Alamouti code in correlated channels. Moreover, it lowers the bitrate of the feedback channel.

2004 - International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.
On optimal cyclotomic lattices and diagonal-single-layer space-time block codes

An optimization of cyclotomic lattices based diagonal/single-layer space-time block codes is discussed. The concrete full diversity cyclotomic generating matrices are used to generalize the lattices and also studies the optimality in the sense that for a fixed diversity product and thus the transmission signal power is minimized.

2008 - IEEE Communications Letters
A new sub-optimal decoder for quasi-orthogonal space-time block codes

This letter addresses the sub-optimal decoding of quasi-orthogonal space-time block codes. First, decoding using a simple linear receiver is considered in terms of the complexity versus error performance trade off. A new Chase-type sub- optimal decoding algorithm is proposed using the inner products in the metric expression as reliability measures.

2013 - IET Commun.
Performance analysis of randomised space-time block codes for amplify-and-forward cooperative relaying

In recent studies (Verde et al.), capitalising on randomised space–time block coding (STBC), a decentralised coding method has been developed for amplify-and-forward (A&F) relays, which can closely achieve the performance of a centralised A&F linear dispersion coding (LDC) scheme and notebly outperform the decentralised A&F LDC counterpart, by requiring a reduced amount of signalling and processing overhead. However, A&F relaying process introduces correlation among the noise samples at the destination which, along with the non-Gaussian nature of the relaying channel and the fact that the relays are located in different positions, significantly complicates the performance analysis of the system. In this study, a theoretical performance analysis of the randomised STBC A&F rule is carried out in terms of average pairwise error probability to evaluate its attainable diversity order. Numerical results are provided to corroborate the analytical findings.

2004 - IEEE Transactions on Wireless Communications
Bit-interleaved space-time coded modulation with iterative decoding

Bit-interleaved space-time coded modulation (BI-STC), which combines serial concatenation of bit-interleaved coded modulation (BICM) with space-time block codes, can effectively exploit the available diversity in space and time under various fading conditions. In this letter, we propose to use iterative decoding to further improve the performance of BI-STC by exploiting the concatenating structure of the codes. The decoding metric is therefore modified to fit for the iterative process, and the derived error bounds suggest that set-partition labeling instead of gray labeling should be used when considering iterative decoding.

2010 - 2010 European Wireless Conference (EW)
Performance of space-time block codes with transmit antenna selection in Nakagami-m fading channels

In this paper, multiple-input multiple-output (MIMO) systems employing orthogonal space-time block codes (STBCs) with transmit antenna selection (TAS) are examined for uncorrelated flat Nakagami-m fading channels. Exact symbol error rate (SER) expressions for M-ary modulation techniques are derived by using the moment generating function (MGF)-based analysis method. In the SER analysis, the receiver antennas are assumed to use maximal ratio combining (MRC) whereas a subset of transmit antennas that maximizes the instantaneous received signal-to-noise ratio (SNR) is selected for STBC transmission. The derived SER results for different numbers of receive and transmit antennas are validated by Monte Carlo simulations and it is shown that the investigated systems achieve full diversity orders at high SNRs.

2009 - IEEE Trans. Inf. Theory
On full diversity space-time block codes with partial interference cancellation group decoding

In this paper, we propose a partial interference cancellation (PIC) group decoding strategy/scheme for linear dispersive space-time block codes (STBC) and a design criterion for the codes to achieve full diversity when the PIC group decoding is used at the receiver. A PIC group decoding decodes the symbols embedded in an STBC by dividing them into several groups and decoding each group separately after a linear PIC operation is implemented. It can be viewed as an intermediate decoding between the maximum likelihood (ML) receiver that decodes all the embedded symbols together, i.e., all the embedded symbols are in a single group, and the zero-forcing (ZF) receiver that decodes all the embedded symbols separately and independently, i.e., each group has and only has one embedded symbol, after the ZF operation is implemented. The PIC group decoding provides a framework to adjust the complexity-performance tradeoff by choosing the sizes of the information symbol groups. Our proposed design criterion (group independence) for the PIC group decoding to achieve full diversity is an intermediate condition between the loosest ML full rank criterion of codewords and the strongest ZF linear independence condition of the column vectors in the equivalent channel matrix. We also propose asymptotic optimal (AO) group decoding algorithm which is an intermediate decoding between the MMSE decoding algorithm and the ML decoding algorithm. The design criterion for the PIC group decoding can be applied to the AO group decoding algorithm because of its asymptotic optimality. It is well-known that the symbol rate for a full rank linear STBC can be full, i.e., nt, for nt transmit antennas. It has been recently shown that its rate is upper bounded by 1 if a code achieves full diversity with a linear receiver. The intermediate criterion proposed in this paper provides the possibility for codes of rates between nt and 1 that achieve full diversity with the PIC group decoding. This therefore provides a complexity-performance-rate tradeoff. Some design examples are given.

2009 - IEEE Transactions on Vehicular Technology
Set-Membership Adaptive Algorithms Based on Time-Varying Error Bounds for CDMA Interference Suppression

This paper presents set-membership (SM) adaptive algorithms based on time-varying error bounds for code-division multiple-access (CDMA) interference suppression. We introduce a modified family of SM adaptive algorithms for parameter estimation with time-varying error bounds. The considered algorithms include modified versions of the SM normalized least mean square (SM-NLMS), the affine projection (SM-AP), and the bounding ellipsoidal adaptive constrained (BEACON) recursive least-square technique. The important issue of error-bound specification is addressed in a new framework that takes into account parameter estimation dependency, multiaccess, and intersymbol interference (ISI) for direct-sequence CDMA (DS-CDMA) communications. An algorithm for tracking and estimating the interference power is proposed and analyzed. This algorithm is then incorporated into the proposed time-varying error bound mechanisms. Computer simulations show that the proposed algorithms are capable of outperforming previously reported techniques with a significantly lower number of parameter updates and a reduced risk of overbounding or underbounding.

2011 - IEEE Transactions on Communications
High-Rate and Full-Diversity Space-Time Block Codes with Low Complexity Partial Interference Cancellation Group Decoding

In this letter, we propose a systematic design of space-time block codes (STBC) which can achieve high rate and full diversity when the partial interference cancellation (PIC) group decoding is used at receivers. The proposed codes can be applied to any number of transmit antennas and admit a low decoding complexity while achieving full diversity. For M transmit antennas, in each codeword real and imaginary parts of PM complex information symbols are parsed into P diagonal layers and then encoded, respectively. With PIC group decoding, it is shown that the decoding complexity can be reduced to a joint decoding of M/2 real symbols. In particular, for 4 transmit antennas, the code has real symbol pairwise (i.e., single complex symbol) decoding that achieves full diversity and the code rate is 4/3. Simulation results demonstrate that the full diversity is offered by the newly proposed STBC with the PIC group decoding.

2013 - 2013 IEEE Global Communications Conference (GLOBECOM)
An efficient algorithm for space-time block code classification

This paper proposes a novel and efficient algorithm for space-time block code (STBC) classification, when a single antenna is employed at the receiver. The algorithm exploits the discriminating features provided by the discrete Fourier transform (DFT) of the fourth-order lag products (FOLPs) of the received signal. It does not require estimation of the channel, signal-to-noise ratio (SNR), and modulation of the transmitted signal. Computer simulations are conducted to evaluate the performance of the proposed algorithm. The results show the validity of the algorithm, its robustness to carrier frequency offset, and low sensitivity to timing offset.

2003 - Electronics Letters
Combining ideal beamforming and Alamouti space-time block codes

The simplest Alamouti space-time block code is coupled with a larger number of transmit antennas via ideal beamforming to achieve higher diversity gain. It is shown that the combined system can remain both full diversity and full code rate without orthogonality loss. Simulation results show a significant performance gain over the conventional space-time block codes.

2003 - 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484)
Constellation space invariance of space-time block codes with application to optimal ML decoding

We prove an interesting property of space-time block codes (STBCs) that are based on generalized orthogonal designs. It is shown that, for flat block-fading channels with an arbitrary number of transmit and receive antennas, the internal structure of the inner product space of the input constellation remains invariant to the combined effect of the STBC and the channel, except for a scaling factor. The established constellation space invariance property sheds a new light on the mechanism of ML decoding of STBCs and, in particular, provides a simple explanation of why the optimal decoding can be reduced to symbol-by-symbol decoding. New simple expressions for the ML decoder are obtained which clarify its intrinsic structure.

2008 - 2008 5th IEEE Sensor Array and Multichannel Signal Processing Workshop
A low complexity decoding scheme for quasi-orthogonal space-time block coding

In this paper, we propose a decoding approach for quasi-orthogonal space-time block code (QO-STBC) based on array processing. This approach works with single symbol and can deduce delay generated by the decoder as well as the decoding computational load. In this scheme, signals transmitted via different antennas are separated by null space, and then they are decoded linearly. Numerical results show that with the proposed decoding method the decoding complexity of quasi- orthogonal space-time block code can be greatly deduced. With 256-QAM modulation scheme, the computational complexity of the new decoder can be lower than that of the traditional decoder with 16-QAM.

2006 - IEEE Transactions on Signal Processing
Blind ML detection of orthogonal space-time block codes: efficient high-performance implementations

Orthogonal space-time block codes (OSTBCs) have attracted much attention owing to their simple code construction, maximal diversity gain, and low maximum-likelihood (ML) detection complexity when channel state information (CSI) is available at the receiver. This paper addresses the problem of ML OSTBC detection with unknown CSI. Focusing on the binary and quaternary PSK constellations, we show that blind ML OSTBC detection can be simplified to a Boolean quadratic program (BQP). From an optimization viewpoint the BQP is still a computationally hard problem, and we propose two alternatives for dealing with this inherent complexity. First, we consider the semidefinite relaxation (SDR) approach, which leads to a suboptimal, but accurate, blind ML detection algorithm with an affordable worst-case computational cost. We also consider the sphere decoding approach, which leads to an exact blind ML detection algorithm that remains computationally expensive in the worst case, but generally incurs a reasonable average computational cost. For the two algorithms, we study implementation methods that can significantly reduce the computational complexity. Simulation results indicate that the two blind ML detection algorithms are competitive, in that the bit error performance of the two algorithms is almost the same and is noticeably better than that of some other existing blind detectors. Moreover, numerical studies show that the SDR algorithm provides better complexity performance than the sphere decoder in the worst-case sense, and vice versa in the average sense.

2004 - IEEE Transactions on Communications
Equalization concepts for Alamouti's space-time block code

In this paper, we develop receiver concepts for transmission with space-time block codes (STBCs) over frequency-selective fading channels. The focus lies on Alamouti's space-time block-coding scheme, but the results may be generalized to other STBCs as well. We show that a straightforward combination of conventional equalizers and a space-time block decoder is only possible if at least as many receive antennas as transmit antennas are employed, but not for the practically interesting case of pure transmit diversity, for which space-time coding had been originally developed. This restriction is circumvented by our approach. Here, the structural properties of the transmit signal of space-time block coding, which is shown to be improper (rotationally variant), are fully used. For this, equalizers with widely linear (WL) processing are designed, such as a WL equalizer, a decision-feedback equalizer with WL feedforward and feedback filtering, and a delayed decision-feedback sequence estimator with WL prefiltering. Simulation results demonstrate that the proposed concepts may be successfully employed in an enhanced data rates for GSM evolution (EDGE) receiver, especially for pure transmit diversity. Here, significant gains can be observed, compared with a conventional single-input single-output transmission.

Applications of space-time block codes and interference suppression for high capacity and high data rate wireless systems

A.R. Calderbank
|
A.F. Naguib
|
N. Seshadri
|
A. Calderbank
|
A. Naguib
|
N. Seshadri

Abstract:This paper presents a combined interference suppression and ML decoding scheme for space-time block codes that can effectively suppress interference from other co-channel users while providing each user with a diversity benefit. We consider a multiuser environment with K synchronous co-channel users, each is equipped with N transmit antennas and uses the space-time block coding. By exploiting the temporal and spatial structure of these codes, we develop a minimum mean-squared error (MMSE) interference suppression technique. Assuming that the receiver uses M/spl ges/K receive antennas, these technique will perfectly suppress the interference from the K-1 co-channel space-time users and provide a diversity order of N/spl times/(M-K+1) to each of the K users. Moreover, this MMSE solution tends itself to an adaptive implementation and does not require any explicit knowledge about the interference. In conjunction with this interference suppression technique, we show how space-time block codes can be used to increasing the capacity and/or data rate of wireless communication systems.

参考文献

[1]  Gerard J. Foschini,et al.  Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas , 1996, Bell Labs Technical Journal.

[2]  Jack H. Winters,et al.  On the Capacity of Radio Communication Systems with Diversity in a Rayleigh Fading Environment , 1987, IEEE J. Sel. Areas Commun..

[3]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[4]  A. Wittneben,et al.  A new bandwidth efficient transmit antenna modulation diversity scheme for linear digital modulation , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[5]  A. Robert Calderbank,et al.  Space-time codes for high data rate wireless communication: performance criteria in the presence of channel estimation errors, mobility, and multiple paths , 1999, IEEE Trans. Commun..

[6]  Gregory J. Pottie,et al.  Channel coding for cochannel interference suppression in wireless communication systems , 1995, 1995 IEEE 45th Vehicular Technology Conference. Countdown to the Wireless Twenty-First Century.

[7]  M. J. Gans,et al.  On Limits of Wireless Communications in a Fading Environment when Using Multiple Antennas , 1998, Wirel. Pers. Commun..

[8]  A. Robert Calderbank,et al.  A space-time coding modem for high-data-rate wireless communications , 1998, IEEE J. Sel. Areas Commun..

[9]  J. H. Winters.  The diversity gain of transmit diversity in wireless systems with Rayleigh fading , 1998 .

[10]  Jack M. Winters,et al.  Optimum Combining in Digital Mobile Radio with Cochannel Interference , 1984, IEEE Journal on Selected Areas in Communications.

[11]  Jack Salz,et al.  Optimum diversity combining and equalization in digital data transmission with applications to cellular mobile radio. I. Theoretical considerations , 1992, IEEE Trans. Commun..

[12]  P. Balaban,et al.  Optimum diversity combining and equalization in digital data transmission with applications to cellular mobile radio II. Numerical results , 1992, IEEE Trans. Commun..

[13]  D.J. Goodman,et al.  Trends in cellular and cordless communications , 1991, IEEE Communications Magazine.

[14]  J. Guey,et al.  Signal design for transmitter diversity wireless communication systems over Rayleigh fading channels , 1996, Proceedings of Vehicular Technology Conference - VTC.

[15]  P. Balaban,et al.  Dual diversity combining and equalization in digital cellular mobile radio , 1991 .

[16]  A. Robert Calderbank,et al.  Space-time codes for high data rate wireless communication: mismatch analysis , 1997, Proceedings of ICC'97 - International Conference on Communications.

[17]  Michael P. Fitz,et al.  Signal design for transmitter diversity wireless communication systems over Rayleigh fading channels , 1999, IEEE Trans. Commun..

[18]  A. Wittneben.  Basestation modulation diversity for digital simulcast , 1991, [1991 Proceedings] 41st IEEE Vehicular Technology Conference.

[19]  Jack H. Winters,et al.  Optimum Combining for Indoor Radio Systems with Multiple Users , 1987, IEEE Trans. Commun..

[20]  Jack H. Winters,et al.  Two signaling schemes for improving the error performance of frequency division duplex (FDD) transmission systems using transmitter antenna diversity , 1994, Int. J. Wirel. Inf. Networks.

[21]  Vahid Tarokh,et al.  Space-time coded modulation for high data rate wireless communications , 1997, GLOBECOM 97. IEEE Global Telecommunications Conference. Conference Record.

[22]  A. Robert Calderbank,et al.  Space-Time Codes for High Data Rate Wireless Communications : Performance criterion and Code Construction , 1998, IEEE Trans. Inf. Theory.

引用
Super-orthogonal double space-time trellis code
Phys. Commun.
2020
MIMO-Assisted Handoff Scheme for Communication-Based Train Control Systems
IEEE Transactions on Vehicular Technology
2015
Improved linear group detection for combined spatial multiplexing/STBC systems
IEEE Transactions on Communications
2009
Multiple-Antenna Interference Cancellation and Detection for Two Users Using Quantized Feedback
IEEE Transactions on Wireless Communications
2011
Using Quantized Feedback to Cancel Interference in Multiple Access Channels
2010 IEEE Global Telecommunications Conference GLOBECOM 2010
2010
On the capacity of stacked orthogonal space-time architecture over MIMO channels
Proceedings. 2005 International Conference on Communications, Circuits and Systems, 2005.
2005
Diversity coding with interference avoidance
2005 IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications
2005
Interference Cancellation at the Relay for Multi-User Wireless Cooperative Networks
IEEE Transactions on Wireless Communications
2011
Multicell Optimization for Diversity and Interference Mitigation
IEEE Transactions on Signal Processing
2008
Space-time codes for multiple access systems with low MMSE decoding complexity
IEEE Transactions on Wireless Communications
2009
Asynchronous Orthogonal Differential Decoding for Multiple Access Channels
IEEE Transactions on Wireless Communications
2014
On the Combination of Receive Beamforming with Alamouti Decoders
2006 IEEE 63rd Vehicular Technology Conference
2006
Outage analysis and optimization of a stacked orthogonal space-time architecture and near-outage codes
GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)
2003
Single-carrier frequency-domain equalization for space-time-coded transmissions over broadband wireless channels
12th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications. PIMRC 2001. Proceedings (Cat. No.01TH8598)
2001
Adaptive beamforming for multiuser space-time block coded systems
Eighth IEEE International Symposium on Spread Spectrum Techniques and Applications - Programme and Book of Abstracts (IEEE Cat. No.04TH8738)
2004
A generalized linear quasi-ML decoder of OSTBCs for wireless communications over time-selective fading channels
IEEE Transactions on Wireless Communications
2004
Blind Multiuser Detection for Synchronous High Rate Space-Time Block Coded Transmission
IEEE Transactions on Wireless Communications
2011
Asynchronous orthogonal differential modulation for MAC systems
2014 IEEE Global Communications Conference
2014
Space-time processing for broadband wireless access
IEEE Communications Magazine
2002
Interference suppression of asynchronous multi-user space-time block coded transmissions
2004 IEEE International Conference on Acoustics, Speech, and Signal Processing
2004