CDMA系统中对应于线性插值信道估计的最佳扩频因子

线性插值信道估计是一种适用于CDMA系统的简单而有效的信道估计方法。这种方法的性能受到信道的时变特性和接收机端噪声的影响。本文通过研究发现，在插值密度相同的情况下，导频符号信道估计克服噪声的能力和扩频增益(SE，spreading factor)成正比，而线性插值的跟踪时变信道的能力和扩频增益成反比。这样，在信道的变化剧烈程度一定的情况下，必然有使估计性能达到最优的最佳扩频因子。本文考查了在采用线性插值信道估计的CDMA系统中，当插值密度和车速一定时，不同扩频因子带来的系统的性能差别。仿真结果表明，对于给定车速，系统存在着最佳扩频因子，并且随着车速的变化而不同。     

基于码片延迟的多径信道扩频序列盲估计

针对多径信道下低信噪比直扩信号扩频序列的盲估计问题,提出一种通过码片延迟与相关矩阵分析相结合的方法实现扩频波形估计。该方法首先将接收信号延迟一段时间与原信号相乘,然后代入自相关矩阵中,通过特征值分解求得最大特征值及其对应的特征向量,通过该特征向量中的零点确定同步位置并恢复扩频序列。理论分析和仿真结果表明,本算法在低信噪比条件下能完成对PN码序列的精确估计。     

基于盲源分离的CDMA多用户检测与伪码估计

 在分析DS-CDMA系统模型的基础上,提出一种基于盲源分离技术的用户扩频码盲估计算法.仿真结果表明,该算法在单径或多径环境中都能正确地估计不同用户的扩频码信息.同时还提出一种基于盲源分离技术的盲多用户检测算法,该算法利用不同用户信息之间的独立性,不仅不需要知道用户的扩频码和信道信息,而且其性能相对传统的匹配滤波和解相关算法有很大改善,当信噪比为6dB时,本文算法的误码率降低了两个数量级.     

基于OBE算法的超宽带信道估计方法

针对采用码片率采样的直接序列扩频BPSK超宽带系统离散信道,利用集合论的知识.对UWB信道估计问题进行建模.提出一种基于OBE算法的超宽带信道估计算法.并分析了采用不同的扩频码对估计出的信道均方误差的影响.仿真表明,即使在信道的长度未知的情况下.在给定的维数空间中,仍然能很好的估计出信道抽头值.     

基于弱纹理块的扩频隐写分析

提出了一种基于弱纹理块的扩频隐写分析方法,可以对图像扩频隐写强度进行有效估计。该方法根据扩频隐写过程中的图像灰度截断效应对图像中各图像块进行预筛选,避免灰度截断干扰。然后基于图像块的梯度统计特性从扩频隐写图像中选取弱纹理块,并利用所选弱纹理块根据主分量分析方法估计图像中秘密信息的嵌入强度。仿真实验表明,该方法能很好的估计扩频隐写图像中秘密信息的嵌入强度。     

基于序贯蒙特卡罗的非同步长码DS-CDMA信号扩频码及信息序列联合估计

针对多径信道环境下非同步长码DS-CDMA信号扩频码及信息序列等参数的联合估计问题,该文提出了基于序贯蒙特卡罗(SMC)的盲估计算法。该算法采用混合重要密度函数对联合后验分布模型进行抽样,并迭代计算重要性权值,以完成所需状态参量的估计。同时为了减少算法的计算量,在算法的实现过程中,先估计出各用户的扩频码,再对观测数据进行处理,从而修正原有的迭代步骤,提出一种修正的SMC算法。仿真结果验证了算法对多种情况的适应性,且在时变的多径信道环境下也能获得较好的估计性能。     

一种新型调频广播授时信号体制研究

利用调频广播附加信道作为载波进行时间信息的传递为调频广播授时奠定了基础，该文基于对调频广播附加信道的研究，提出新的授时扩频码设计方法并详细设计了扩频码内容，既符合信道条件要求，又有利于接收端的精确捕获跟踪，从而进行时间信息的传递并实现授时功能，实测结果验证了该方法的可行性和准确性。     

基于优化信息算子的UWB信道贝叶斯估计

针对压缩感知应用于UWB通信信道估计时信息算子的相干性严重影响UWB信道估计精度的问题,提出将优化的信息算子和贝叶斯算法相结合的方法。该方法以互累积相干参数为准则,首先将加权信息算子通过最优化与正则化得到优化的信息算子,最后通过贝叶斯算法重构UWB信道。理论分析和仿真结果表明优化信息算子的相干性大大减弱,有效提高了UWB信道估计精度,同时该方法能在较低的压缩比和信噪比条件下实现UWB通信信道的准确重建。     

一种新的扩频信号信噪比估计算法

对经典扩频信号信噪比(SNR)估计算法进行分析,提出了一种新的适用于扩频通信系统中频扩频信号信噪比估计算法。该算法在时域估计信号总功率,频域估计噪声功率,时频结合估计出中频扩频信号SNR。在加性高斯白噪声(AWGN)信道下,Matlab仿真结果表明该算法估计精度高,估计范围广及估计下限低。     

OFDMA框架下一种低代价直接信道信息反馈方法

该文提出一种低代价下行信道信息实时反馈方法.在接收端将模拟量信道信息扩频后叠加在上行信息序列中进行上传,不必为下行信道信息分配单独的时频资源.在基站侧利用干扰消除原理,迭代进行信息序列检测与信道信息估计.由于对下行信道信息进行了扩频处理,即使分配较低的能量也能在基站侧可靠恢复.仿真实验证明这种方法的有效性.     

PN sequence blind estimation in multiuser DS‐CDMA systems with multipath channels based on successive subspace scheme

In this paper, we proposed a new method based on expanding subspace algorithm and finite alphabet characteristics, for blind estimation of the users' spreading sequences in the multiuser direct sequence code division multiple access system in the presence of the multipath channels. In the proposed scheme, we show that the estimation of the users' overall channels in the direct sequence code division multiple access system is equivalent to the impulse response estimation of the multi‐input multi‐output finite impulse response channels. Our proposed approach is based on the successive estimation of the columns of the equivalent multi‐input multi‐output finite impulse response channels from the lowest degree columns to the highest degree ones. Accordingly, each user's overall channel that is the convolution of the original multipath channel and the spreading sequence is estimated. Then we extract PN sequences from the overall channel using finite alphabet characteristics of the spreading sequence chips for each user. According to simulation results, our proposed scheme outperforms the conventional methods in that it does not require symbol synchronization and does not have channel constraints (for example, AWGN and single user system) in the multipath channels.     

MUI-free receiver for a synchronous DS-CDMA system based on blockspreading in the presence of frequency-selective fading

We discuss a synchronous direct-sequence code division multiple-access (DS-CDMA) system based on block spreading in the presence of frequency-selective fading. Note that block spreading, which is also known as chip interleaving, refers to a spreading of a data block sequence, which is obtained by dividing a data symbol sequence into consecutive blocks. For such a system, we develop a simple new receiver that completely removes the multiuser interference (MUI) without using any channel information. The MUI-free operation is obtained by the use of a shift-orthogonal set of code sequences on which this receiver is based. Within the framework of the MUI-free receiver, we further present a subspace deterministic blind single-user channel estimation algorithm. As a benchmark for the MUI-free receiver and the corresponding subspace deterministic blind single-user channel estimation algorithm, we consider the linear multiuser equalizer and the corresponding subspace deterministic blind multiuser channel estimation algorithm developed by Liu and Xu (1996) for a standard synchronous DS-CDMA system in the presence of frequency-selective fading. We show that the complexity of the MUI-free receiver using the corresponding subspace deterministic blind single-user channel estimation algorithm is much smaller than the complexity of the linear multiuser equalizer using the corresponding subspace deterministic blind multiuser channel estimation algorithm. We further show that the performance of the MUI-free receiver is comparable with the performance of the linear multiuser equalizer. This is for the case in which the channels are known as well as for the case in which the channels are estimated with the corresponding subspace deterministic blind channel estimation algorithm     

On CDMA with space-time codes over multipath fading channels

We explore code-division multiple-access systems with multiple transmitter and receiver antennas combined with algebraic constellations over a quasi-static multipath fading channel. We first propose a technique to obtain transmit diversity for a single user over quasi-static fading channels by combining algebraic constellations with full spatial diversity and spreading sequences with good cross-correlation properties. The proposed scheme is then generalized to a multiuser system using the same algebraic constellation and different spreading sequences. We also propose a linear multiuser detector based on the combination of linear decorrelation with respect to all users, and the application of the sphere decoder to decode each user separately. Finally, we consider the generalization to multipath fading channels where the additional diversity advantage due to multipath is exploited by the sphere decoder, and a method of blind channel estimation based on subspace decomposition is examined.     

Group-blind intersymbol multiuser detection for downlink CDMA with multipath

Group-blind multiuser detectors for uplink code-division multiple-access (CDMA) were recently developed by Wang and Host-Madsen. These detectors make use of the spreading sequences of known users to construct a group constraint to suppress the intracell interference. However, such techniques demand the estimation of the multipath channels and the delays of the known users. In this paper, several improved blind linear detectors are developed for CDMA in fading multipath channels. The proposed detectors utilize the correlation information between consecutively received signals to generate the corresponding group constraint. It is shown that by incorporating this group constraint, the proposed detectors can provide different performance gains in both uplink and downlink environments. Compared with the previously reported group-blind detectors, our new methods only need to estimate the multipath channel of the desired user and do not require the channel estimation of other users. Simulation results demonstrate that the proposed detectors outperform the conventional blind linear multiuser detectors.     

Group-blind multiuser detection for uplink CDMA

Previously developed blind techniques for multiuser detection in code division multiple access (CDMA) systems lead to several near-far resistant adaptive receivers for demodulating a given user's data with the prior knowledge of only the spreading sequence of that user. In the CDMA uplink, however, typically the base station receiver has the knowledge of the spreading sequences of all the users within the cell, but not that of the users from other cells. In this paper, group-blind techniques are developed for multiuser detection in such scenarios. These new techniques make use of the spreading sequences and the estimated multipath channels of all known users to suppress the intracell interference, while blindly suppressing the intercell interference. Several forms of group-blind linear detectors are developed based on different criteria. Moreover, group-blind multiuser detection in the presence of correlated noise is also considered. In this case, two receiving antennas are needed for channel estimation and signal separation. Simulation results demonstrate that the proposed group-blind linear multiuser detection techniques offer substantial performance gains over the blind linear multiuser detection methods in a CDMA uplink environment     

双向MIMO中继网络中采用信道独立预编码的自干扰消除技术

双向中继网络在提高频谱效率的同时会引入额外的自干扰,本文针对放大转发（AF）模式下双向多输入多输出（MIMO）中继网络中的自干扰抵消问题,从消除信道估计误差引入的剩余自干扰着手,提出一种采用信道独立预编码的盲干扰抵消（BIC）方案。新方案在源节点对信息进行行空间预编码,从而构建不依赖于MIMO信道矩阵的期望信号子空间和自干扰子空间,实现未知信道状态下自干扰抵消和期望信号分离,从而消除非理想信道估计带来的剩余自干扰信号。在此基础上,以最大化有效信噪比为目标设计最佳预编码,通过推导可达和速率的闭合表达式,分析不同方案下信道估计误差对可达和速率的影响。仿真结果表明,新方案在不同的信道估计误差下,能够实现完美自干扰消除,其检测性能和容量均优于基于信道估计的自干扰消除方案。      

非周期扩频CDMA系统中时空信道的盲估计

时空信道可以用矢量信道冲激响应(VCIR)来描述,正确估计VCIR是智能天线系统实现的关键技术.本文从多用户解相关的思想出发,利用子空间技术实现了非周期扩频的CDMA系统时空信道的盲估计,所给出的时空信道估计方法具有抗远近效应的能力.计算机仿真实验表明,时空信道的估计精度完全可以满足DOA与相对时延信息提取的要求.     

Complexity reduction in subspace-based blind channel identificationfor DS/CDMA systems

Direct-sequence code-division multiple access is emerging as a potential multiple-access communication scheme for future digital wireless communications systems. Such wide-band systems usually operate in a frequency-selective fading channel that introduces intersymbol interference and thus potential performance degradation. Previously proposed subspace-based blind channel identification algorithms, which provide estimates of channel parameters for effective equalization, suffer from high numerical complexity for systems with large spreading gains. In this paper, it is shown that, through the use of matched filter outputs, reduction in numerical complexity can be obtained. The complexity reduction is considerable when the channel length is small and the system is moderately loaded. The results show that the new algorithm suffers a slight performance loss. Although the employed matched filter outputs do not form a set of sufficient statistics for the unknown channels, the difference between the matched filter outputs and the sufficient statistics becomes negligible for large observation lengths and the asymptotic normalized Fisher information does not change. Performance is evaluated through simulations, the derivation of a tight approximation of the mean-squared channel estimation error, and through comparisons to the Cramer-Rao bound for the estimation error variance. It is shown that the approximation of the mean-squared error can be obtained in terms of the correlation of the spreading codes and the channels. This representation of the error supplies a tool for investigating the relationship between performance and spreading sequence correlations     

Blind adaptive multiuser detection for DS/SSMA communications withgeneralized random spreading

A new spreading scheme and an accompanying blind adaptive receiver structure are proposed for direct-sequence spread-spectrum multiple-access communications in a slowly-varying, frequency-selective fading channel. Each user's spreading sequence is given by the Kronecker product of a long-period pseudonoise (PN) sequence, which is accurately modeled by a random sequence, and a short-length deterministic signature code. This spreading scheme bridges the gap between pure PN spreading and pure short-code spreading schemes. It is shown that with this spreading scheme, the channel response to the desired signal component is easily estimated without relying on the spectral decomposition of the signal correlation matrix. With the estimate of the channel response, the receiver suppresses interference based on the maximum signal-to-interference ratio criterion. The blind adaptive receiver requires only coarse timing information and a priori knowledge of the desired user's PN sequence for adaptation. Numerical results show that the adaptive receiver significantly suppresses interference by successfully estimating the channel response and the interference statistics with a low computational complexity. An extension to spatio-temporal processing using an array antenna is also discussed     

Totally blind APP channel estimation for mobile OFDM systems

A new two-dimensional blind channel estimation scheme for coherent detection of orthogonal frequency-division multiplexing (OFDM) signals in a mobile environment is presented. The channel estimation is based on the a posteriori probability (APP) calculation algorithm. The time-variant channel transfer function is completely recovered without phase ambiguity with no need for any pilot or reference symbols, thus maximizing the spectral efficiency of the underlying OFDM system. The phase ambiguity problem is solved by using a 4-QAM (quadrature amplitude modulation) scheme with asymmetrical arrangement. The results clearly indicate that totally blind channel estimation is possible for virtually any realistic time-variant mobile channel.