异步协同系统频选信道下基于线性预处理的DSTC结构设计

在协同中继系统中,应用分布式空时码(Distributed Space Time Coding, DSTC),可以在有效提高系统效率的同时获得全协同分集。但是,各中继节点的异步传输和节点间的多径衰落会破坏空时码字的结构,使之不能获得全分集。本文针对两中继的异步协同系统,提出了一种频率选择性信道下的基于线性预处理的DSTC传输结构。在此传输结构中,源节点对发送数据块进行预处理后发送给中继节点,中继节点对接收信号进行简单的共轭重排等处理,使得在目的节点形成DSTC的结构。其中,为抵抗异步传输和多径衰落引入的符号间干扰(Inter-symbol Interference, ISI),在源节点处和中继节点处均加入循环前缀(Cyclic Prefix, CP)。于是目的节点对接收到的信号进行DFT处理后,可以运用ML算法对数据信息进行检测。理论分析和仿真表明,当存在定时误差和节点间为频率选择性信道时,目的节点运用ML检测算法该传输结构可获得全空间分集和全多径分集。然后,本文考虑了信道各径延迟为整数倍符号周期的情况,并且证明了该传输结构的分集增益只与节点间信道的有效信道长度有关。      

Lattice-reduction aided equalization for OFDM systems

Orthogonal Frequency Division Multiplexing (OFDM) is an effective technique to deal with frequency-selective channels since it facilitates low complexity equalization and decoding. Many existing OFDM designs successfully exploit the multipath diversity offered by frequency-selective channels. However, most of them require maximum likelihood (ML) or near-ML detection at the receiver, which is of high complexity. On the other hand, empirical results have shown that linear detectors have low complexity but offer inferior performance. In this paper, we analytically quantify the diversity orders of linear equalizers for linear precoded OFDM systems, and prove that they are unable to collect full diversity. To improve the performance of linear equalizers, we further propose to use a lattice reduction (LR) technique to help collect diversity. The LR-aided linear equalizers are shown to achieve maximum diversity order (i.e., the one collected by the ML detector), but with low complexity that is comparable to that of conventional linear equalizers. The theoretical findings are corroborated by simulation results.     

Space-Code CS-CDMA Systems over MISO Frequency-Selective Rayleigh Fading Channels

We propose a transmit diversity CDMA scheme which is a combination of convolutional spreading (CS) and space-time spreading (STS) over multiple-input single-output (MISO) multipath Rayleigh fading channels. With our scheme, multiuser detection over an MISO multipath channel is transformed to single-user detection over a single-input single-output (SISO) multipath channel as the scheme by Petre et al. Because of its simple configuration, it is immediate to see that our scheme realizes full transmit- and path-diversity for two transmit antennas. We extend the system to four transmit antennas employing quasi-orthogonal construction and show a necessary and sufficient condition for full transmit- and path-diversity to be realized. The proposed scheme requires less hardware complexity and less latency than the one by Petre et al.     

Low complexity LMMSE turbo equalization for combined error control coded and linearly precoded OFDM

The turbo equalization approach is studied for Orthogonal Frequency Division Multiplexing （OFDM） system with combined error control coding and linear precoding. While previous literatures employed linear precodcr of small size for complexity reasons, this paper proposes to use a linear precoder of size larger than or equal to the maximum length of the equivalent discrete-time channel in order to achieve full frequency diversity and reduce complexities of the error control coder/decoder. Also a low complexity Linear Minimum Mean Square Error （LMMSE） turbo equalizer is derived for the receiver. Through simulation and performance analysis, it is shown that the performance of the proposed scheme over frequency selective fading channel reaches the matched filter bound; compared with the same coded OFDM without linear precoding, the proposed scheme shows an Signal-to-Noise Ratio （SNR） improvement of at least 6dB at a bit error rate of 10 6 over a multipath channel with exponential power delay profile. Convergence behavior of the proposed scheme with turbo equalization using various type of linear precoder/transformer, various interleaver size and error control coder of various constraint length is also investigated.     

一种超宽带模拟合并转发协作通信系统

针对频率选择性衰弱信道下协作通信系统信道估计复杂的问题,提出了一种模拟合并放大转发超宽带(UWB)协作通信方案.该方案在源节点处对发送符号进行实数分布式空时编码并附加传输参考,在中继节点处利用传输参考对多径分量进行模拟合并,从而构建了一种改进型非正交放大转发协作通信系统.仿真结果证明,相对于无协作通信系统,模拟合并转发...     

Time-Domain Block and Per-Tone Equalization for MIMO–OFDM in Shallow Underwater Acoustic Communication

Shallow underwater acoustic (UWA) channel exhibits rapid temporal variations, extensive multipath spreads, and severe frequency-dependent attenuations. So, high data rate communication with high spectral efficiency in this challenging medium requires efficient system design. Multiple-input multiple-output orthogonal frequency-division multiplexing (MIMO–OFDM) is a promising solution for reliable transmission over highly dispersive channels. In this paper, we study the equalization of shallow UWA channels when a MIMO–OFDM transmission scheme is used. We address simultaneously the long multipath spread and rapid temporal variations of the channel. These features lead to interblock interference (IBI) along with intercarrier interference (ICI), thereby degrading the system performance. We describe the underwater channel using a general basis expansion model (BEM), and propose time-domain block equalization techniques to jointly eliminate the IBI and ICI. The block equalizers are derived based on minimum mean-square error and zero-forcing criteria. We also develop a novel approach to design two time-domain per-tone equalizers, which minimize bit error rate or mean-square error in each subcarrier. We simulate a typical shallow UWA channel to demonstrate the desirable performance of the proposed equalization techniques in Rayleigh and Rician fading channels.     

Full-Diversity Codes for MISO Systems Equipped With Linear or ML Detectors

In this paper, a general criterion for space-time block codes (STBC) to achieve full diversity with a linear receiver is proposed for a wireless communication system having multiple transmitter and single receiver antennas [multiple-input–single-output (MISO)]. Particularly, the STBC with Toeplitz structure satisfies this criterion, and therefore, enables full diversity. Further examination of this Toeplitz STBC reveals the following important properties: 1) the symbol transmission rate can be made to approach unity; 2) applying the Toeplitz code to any signalling scheme having nonzero distance between the nearest constellation points results in a nonvanishing determinant. In addition, if quadratic-amplitude modulation (QAM) is used as the signalling scheme, then for independent MISO flat-fading channels, the Toeplitz codes is proved to approach the optimal diversity-versus-multiplexing tradeoff with a zero-forcing (ZF) receiver when the number of channel uses is large. This is, so far, the first nonorthogonal STBC shown to achieve the optimal tradeoff for such a receiver. On the other hand, when maximum-likelihood (ML) detection is employed in a MISO system, the Toeplitz STBC achieves the maximum coding gain for independent channels. When the channel fading coefficients are correlated, the inherent transmission matrix in the Toeplitz STBC can be designed to minimize the average worst case pairwise error probability.      

Channel equalization for block transmission systems

In a block transmission system the information symbols are arranged in the form of blocks separated by known symbols. Such a system is suitable for communication over time-dispersive channels subject to fast time-variations, e,g., the HF channel. The known reliable receiver for this system is the nonlinear data-directed estimator (NDDE). This paper presents appropriate equalization methods for this system. A nonstationary innovations representation based on Cholesky factorization is used in order to define a noise whitener and a maximum-likelihood block detector. Also block linear equalizers and block decision-feedback equalizers are derived. For each type we give the zero-forcing and the minimum-mean-squared-error versions. Performance evaluations and comparisons are given. We show that they perform better than conventional equalizers. As compared to the NDDE, the derived block decision-feedback equalizers perform better and are much less complex. Whereas the NDDE uses the Levinson algorithm to solve M/2 Toeplitz systems of decreasing order (where M is the number of symbols per block), the derived equalizers need to process only one Toeplitz system. Moreover, the Schur algorithm, proposed for Cholesky factorization allows us to further reduce the complexity     

DFT-modulated filterbank transceivers for multipath fading channels

The orthogonal frequency division multiplexing (OFDM) transceiver has enjoyed great success in many wideband communication systems. It has low complexity and robustness against multipath channels. It is also well-known that the OFDM transceiver has poor frequency characteristics. To get transceivers with better frequency characteristics, filterbank transceivers with overlapping-block transmission are often considered. However these transceivers in general suffer from severe intersymbol interference (ISI) and high complexity. Moreover costly channel dependent post processing techniques are often needed at the receiving end to mitigate ISI. We design discrete Fourier transform (DFT) modulated filterbank transceivers for multipath fading channels. The DFT modulated filterbanks are known to have the advantages of low design and implementation cost. Although the proposed transceiver belongs to the class of overlapping-block transmission, the only channel dependent part is a set of one-tap equalizers at the receiver, like the OFDM system. We show that for a fixed set of transmitting or receiving filters, the design problem of maximizing signal-to-interference ratio (SIR) can be formulated into an eigenvector problem. Experiments are carried out for transmission over random multipath channels, and the results show that satisfactory SIR performance can be obtained.     

一种基于信道特征参数的无线通信密钥生成方法

无线通信由于自身传输信道的开放性,其安全问题相对于有线通信更为突出。物理层安全技术利用无线通信信道天然的多径时变特性,可为无线传输提供物理层加密,因而近年来得到快速发展。针对传统物理层安全中密钥生成速率低、频分双工系统不适用等问题,提出了一种基于信道特征参数的无线通信密钥生成方法。基于宽带信号对多径的辨识力,利用各径间相对时延生成初始密钥,结合码本进行密钥长度扩展,从而生成最终密钥。通过数值分析证明,相对于传统物理层密钥生成方式,所提方法能显著提高密钥生成速率,同时,基于时延信道特征的互易性,该方法可适用于时分双工和频分双工无线通信系统的物理层加密。     

Delay-Tolerant Distributed Linear Convolutional Space-Time Code with Minimum Memory Length under Frequency-Selective Channels

In cooperative communication networks, the performance of distributed space-time code will be severely degraded if the timing synchronization among relay nodes is not perfect. In this letter, we propose a systematic construction of the so called distributed linear convolutional space-time code (DLCSTC) for multipath fading channels that does not require the synchronization assumption. We derive sufficient conditions on the code design such that the full cooperative and multipath diversities can be achieved under the minimum memory length constraint. Then we design DLCSTCs that both have the traceorthonormality property and achieve the full diversity. We show that the proposed codes can also achieve the full diversity for asynchronous cooperative communications with ZF, MMSE and MMSE-DFE receivers under frequency-selective channels. Finally, various numerical examples are provided to corroborate the analytical studies.     

基于STBC的MIMO OFDM系统中的I/Q不平衡及CFO的联合均衡策略

基于STBC方案,针对MIMO OFDM通信系统中同时存在发射机和接收机I/Q不平衡、前端滤波器失配、CFO和频率选择性信道失真的组合影响进行了深入研究,并提出了一种适用的联合均衡策略;具体实现是首先通过对MIMO OFDM系统中只存在发射机I/Q不平衡和多径信道干扰的分析,得到一种频域均衡器;然后再考虑同时存在接收机I/Q不平衡和CFO的情况,得到了2个时域均衡器;最后把2个时域均衡器变换到频域,并结合消除发射机I/Q不平衡和多径信道干扰的频域均衡技术,提出了一种全面的联合均衡技术即频域子载波均衡器。仿真结果表明,针对MIMO OFDM系统提出的频域子载波均衡技术不仅能扩展到其他高阶STBC系统,而且使均衡后的系统BER性能得到了明显的提高。     

Interference mitigation for asynchronous cooperative STBC-OFDM systems

This paper addresses the problem of interference mitigation in cooperative Space Time Block Coded Orthogonal Frequency Division Multiplexing (STBC-OFDM) systems in the presence of asynchronism. This scheme first preprocesses the received ST codewords to convert the equivalent fading matrix into a suboptimal ordering upper triangular form based on low complexity permutation QR decomposition, and then suppresses the InterCarrier Interference (ICI) and InterSymbol Interference (ISI) by exploiting Successive Interference Cancellation (SIC) technique. Simulation results show that the performance of the proposed algorithm slightly outmatches or asymptotically approaches to that of the existing Minimum Mean Square Error (MMSE) detector depending on the magnitude of the Carrier Frequency Offsets (CFOs) but with less complexity.     

On channel orthogonalization using space-time block coding with partial feedback

Orthogonal space-time block codes (OSTBCs) yield full diversity gain even while requiring only a linear receiver. Such full-rate (rate-one) orthogonal designs are available for complex symbol constellations only for N=2 transmit antennas. In this paper, we propose a new family of full-rate space-time block codes (STBCs) using a single parameter feedback for communication over Rayleigh fading channels for N=3,4 transmit antennas and M receive antennas. The proposed rate-one codes achieve full diversity, and the performance is similar to maximum receiver ratio combining. The decoding complexity of these codes are only linear even while performing maximum-likelihood decoding. The partial channel information is a real phase parameter that is a function of all the channel gains, and has a simple closed-form expression for N=3,4. This feedback information enables us to derive (channel) orthogonal designs starting from quasi-orthogonal STBCs. The feedback complexity is significantly lower than conventional closed-loop transmit beamforming. We compare the proposed codes with the open-loop OSTBCs and also with the closed-loop equal gain transmission (EGT) scheme which uses equal power loading on all antennas. Simulated error-rate performances indicate that the proposed channel orthogonalized STBCs significantly outperform the open-loop orthogonal designs, for the same spectral efficiency. Moreover, even with significantly lower feedback and computational complexity, the proposed scheme outperforms the EGT technique for M>N.     

Performance Analysis of the Downlink CP-WCDMA System with Turbo Code in Frequency Domain

Modern wireless communications require an efficient spectrum usage and high channel capacity and high throughput. Turbo code, linear equalizers, multi-user detection and wideband code-division multiple access (WCDMA) are possible solutions to achieve spectral efficiency, high channel capacity, eliminate MAI, eliminate ISI and robustness against frequency selective fading. In this paper, we combine all these techniques and investigate BER performance. We propose a low complexity receiver structure for Single-input Single-output downlink cyclic prefix CP-WCDMA systems. It employs frequency domain interference cancellation schemes to mitigate the interference caused by the multipath fading channel. Also, the proposed scheme is developed for the downlink Turbo code CP-WCDMA system to maximize the throughput of the proposed system.     

A transmit MIMO scheme with frequency domain pre-equalization for wireless frequency selective channels

In this paper, we introduce a transmit multiple-input multiple-output (MIMO) scheme with frequency domain pre-equalization for a multipath or frequency selective channel. In this scheme, MIMO processing in the frequency domain is performed at the transmitter or base station so that the receiver or mobile station only requires limited processing. This scheme provides high data rates and also inherits from the frequency domain equalization the property of relatively low complexity in severe multipath environments. The MIMO transmit processing is derived by minimizing the minimum mean square errors (MMSE), and expressions for the signal-to-interference-plus-noise ratio and error probability based on the Gaussian approximation of the interference term are provided. Some important associated issues, such as channel errors and computational complexity, are also investigated. Numerical simulations are also provided and these demonstrate the improved performance of our proposed scheme compared to other transmit MIMO schemes. In particular, they show that the proposed system can attain multipath or frequency diversity of the channel.     

Cooperative Transmission Using Quasi-Orthogonal Space-Time Block Codes with Adaptive Decode-and-Forward Relaying Protocol

In this paper, we propose a cooperative transmission scheme using quasi-orthogonal space-time block codes (QOSTBCs) for multiple-input multiple-output (MIMO) relay networks. Comparing with the conventional cooperative transmission scheme using orthogonal space-time block codes (OSTBCs), the proposed scheme can achieve higher bandwidth efficiency with the same decoding complexity. Moreover, an adaptive decode-and-forward (ADF) relaying protocol is proposed based on one-bit channel state information (CSI) feedback. According to the CSI feedback, a better transmission mode can be selected between the direct transmission and decode-and-forward (DF) cooperative transmission. In addition, the outage performance of the proposed scheme is investigated and a closed-form upper bound on the outage probability is derived. The performance analysis shows that the proposed scheme can achieve a full diversity order, which is higher than that of the direct and DF cooperative transmissions.     

Grouped signed power-of-two algorithms for low-complexity adaptive equalization

With increasing demand for higher data rate, modern communication systems have grown more complex. Equalization has become more and more important as it is effective in mitigating the multipath fading often occurred in high-data-rate communication systems. However, the implementation complexity of adaptive equalizers is usually too high for mobile communication applications. In this paper, a novel adaptive equalization algorithm and its low-complexity architecture are proposed. This algorithm employs a new grouped signed power-of-two (GSPT) number representation. The GSPT algorithm and several enhanced versions are simulated as adaptive equalizers in a phase-shift keying communication receiver for several practical channels and the GSPT-based equalizers perform as well as the least mean square (LMS) equalizer. Moreover, for comparison, two GSPT-based equalizers and two other equalizers are implemented in field-programmable gate arrays. The GSPT-based equalizers require only about 25%-30% of the hardware resources needed in the LMS equalizer. Also the GSPT-based equalizers are more than twice as fast as the LMS equalizer.     

Partially-coherent distributed space-time codes with differential encoder and decoder

Distributed space-time coding is a mean of achieving diversity through cooperative communication in a wireless relay network. In this paper, we consider a transmission protocol that follows a two-stage model: transmission from source to relays in the first stage, followed by a simple relaying technique from relays to destination. The relays transmit a vector which is a transformation of the received vector by a relay-specific unitary transformation. We assume that the relays do not have any channel information, while the destination has only a partial-channel knowledge, by which we mean that destination knows only the relay-to-destination channel. For such a setup, we derive a Chernoff bound on the pairwise error probability and propose code design criteria. A second contribution is the differential encoding and decoding scheme for this setup, which is different from the existing ones. Furthermore, differential codes from cyclic division algebra are proposed that achieve full diversity. For our setup with two relays, a Generalized PSK code is shown to achieve full diversity, for which the decoding complexity is independent of code size     

An Improved Frequency Synchronizer for Mobile OFDMSystems

1IntroductionOrthogonal Frequency Division Multiplexing(OFDM) hasgained strong position in the next generation widebandwireless systems for its advantages over frequency-selec-tive fading channels . The principal weakness of OFDMis its sensitivity to Carrier Frequency Offset ( CFO)caused by Doppler drifts and/or oscillator instabili-ties[1 ~3]. Many frequency synchronization algorithmsfor OFDM have been proposed, which can be dividedinto three main categories .First groupis based on s…