OFDM channel estimation with dispersive fading channels

In this paper, we studied the channel estimation problem for the orthogonal frequency division multiplexing (OFDM) system when the statistics of the multi-path fading channel is not known or partial known. A channel estimation approach based on polynomial approximation of the channel response is proposed. The pilot symbols are periodically inserted the channel responses for entire OFDM data sequence for exploiting channel correlation in both time and frequency domain, which is obtained from a time-variant frequency-selective Rayleigh fading channel model. Simulation shows that the method is robust to different channel statistics. Moreover, a window dimension adaptation algorithm is proposed to adapt the channel estimator to the channel statistics which further improves the robustness of the system.     

Two-Stage Channel Estimation Algorithm for TD-SCDMA System Employing Multi-Cell Joint Detection

The conventional Steiner channel estimator is inefficient for TD-SCDMA systems employing multi-cell joint detection because of its low estimation accuracy. A novel two-stage channel estimation algorithm was presented by re-defining the channel estimation matrix to mitigate the noise in the channel estimation. It is based on matched filter and minimum mean square error channel estimation results and it refines the initial channel estimation using inter-symbol interference and multiple access interference elimination. Simulation results prove the validity of the proposed algorithm for estimation accuracy upgrade, contributing to 10.2 dB and 6.8 dB BER performance improvement for the outdoor-to-indoor A channel and Vehicular A channel respectively.     

超宽带室内信道仿真分析

对超宽带通信室内修正S-V信道模型的进行仿真,在分析S-V信道模型的参数特点的基础上,探讨修正S-V信道模型的数学模型的建立方法,在CM4的非视距(NLOS)信道环境下,用Matlab进行仿真实验,结果表明修正S-V信道模型更接近实际,比S-V信道模型具有更好的信道冲激响应特性,能够更好地应用于超宽带通信系统性能的信道传输特性研究。     

Source and Channel Coding for Correlated Sources Over Multiuser Channels

Source and channel coding over multiuser channels in which receivers have access to correlated source side information are considered. For several multiuser channel models necessary and sufficient conditions for optimal separation of the source and channel codes are obtained. In particular, the multiple-access channel, the compound multiple-access channel, the interference channel, and the two-way channel with correlated sources and correlated receiver side information are considered, and the optimality of separation is shown to hold for certain source and side information structures. Interestingly, the optimal separate source and channel codes identified for these models are not necessarily the optimal codes for the underlying source coding or the channel coding problems. In other words, while separation of the source and channel codes is optimal, the nature of these optimal codes is impacted by the joint design criterion.      

Tradeoff between source and channel coding on a Gaussian channel

Consider a system that quantizes and encodes analog data for transmission across an additive noise Gaussian channel. To minimize distortion, the channel code rate must be chosen to optimally allocate the available transmission rate between lossy source coding and block channel coding. We establish tight upper and lower bounds on the channel code rate that minimizes the average distortion of a vector quantizer cascaded with a channel coder and a Gaussian channel, thus extending some recently obtained results for the binary-symmetric channel. The upper hounds are obtained by averaging, whereas the lower bounds are uniform, over all possible index assignments. Analytic expressions are derived for large and small signal-to-noise ratios, and also for large source vector dimension. As in the binary-symmetric channel, the optimal channel code rate is often substantially smaller than the channel capacity and the distortion decays exponentially with the number of channel uses. Exact exponents are derived     

Efficient Non-Pilot-Aided Channel Length Estimation for Digital Broadcasting Receivers

Channel estimation and equalization techniques are crucial for the ubiquitous broadcasting systems. Conventional receivers for most broadcasting or wireless standards preset the channel length to the maximal expected duration of the channel impulse response for the adopted channel estimation and equalization algorithms. The excessive channel length often significantly increases the implementational complexity of the wireless receivers and leads to the redundant information which would induce the additional estimation errors. Moreover, such a scheme does not allow the dynamic memory allocation for variable channel lengths. This could further increase the power consumption and reduce the battery life of a mobile device. The knowledge of the actual channel length would, in principle, help the system designers decrease the complexity of the channel estimators using maximum likelihood (ML) and minimum-mean-square-error (MMSE) algorithms. In this paper, we address this important channel length estimation problem and propose a novel autocorrelation-based algorithm to estimate the channel length without the need of pilots or training sequence. The associated threshold for the channel length estimation depends on the sample size, the signal-to-noise ratio and the leading/last channel coefficients. In addition, we provide the mean-square analysis on the effectiveness of the proposed non-pilot-aided channel length estimator through Monte Carlo simulations.      

基于虚拟时间反转镜的水声OFDM信道均衡

针对水声信道对正交频分复用(OFDM)系统带来的符号间干扰(ISI)问题,提出了虚拟时间反转镜(VTRM)信道均衡算法,该算法具有时间压缩特性和频域相位共轭特性,可以有效缩短信道长度,减小多途信道带来的相位畸变,采用匹配追踪(MP)算法估计信道冲激响应,可以精确的估计出水声信道的幅度、时延和相位信息,为虚拟时反信道均衡提供准确的信道信息,改进了传统匹配相关信道估计方法估计精度低、无法估计信道相位信息的缺点。仿真、水池和湖上实验结果表明,OFDM水声通信系统中,VTRM信道均衡技术性能优于被动时反镜(PTRM)信道均衡和最小平方(LS)信道均衡。     

Cluster-based blind nonlinear-channel estimation

A cluster-based maximum-likelihood sequence estimator (MLSE) for nonlinear channels was described, which consists of a clustering network and an MLSE implemented by the Viterbi algorithm. The cluster-based MLSE can be used for digital communication through nonlinear finite-length channels because channel mapping estimation is used instead of channel estimation in the conventional MLSE. The clustering network of the cluster-based MLSE, which estimates the channel mapping between the signal input vectors and the noiseless channel outputs, is a supervised network and requires a training sequence. We propose a blind channel mapping estimator to estimate the channel mapping without using the training sequence. The blind channel mapping estimator has a clustering block and a mapping block. The clustering block estimates the channel outputs, which represent the channel mapping, subject to an unknown permutation operation because no training sequence is utilized. That permutation operation is resolved by the mapping block, and therefore, the channel mapping is obtained. Introducing the blind channel mapping estimator into the cluster-based MLSE, a blind cluster-based MLSE for nonlinear channels can be done. Computer simulations of the blind channel mapping estimator and the blind MLSE for nonlinear channels are presented     

Diversity combining with imperfect channel estimation

The optimal diversity-combining technique is investigated for a multipath Rayleigh fading channel with imperfect channel state information at the receiver. Applying minimum mean-square error channel estimation, the channel state can be decomposed into the channel estimator spanned by channel observation, and the estimation error orthogonal to channel observation. The optimal combining weight is obtained from the first principle of maximum a posteriori detection, taking into consideration the imperfect channel estimation. The bit-error performance using the optimal diversity combining is derived and compared with that of the suboptimal application of maximal ratio combining. Numerical results are presented for specific channel models and estimation methods to illustrate the combined effect of channel estimation and detection on bit-error rate performance.     

Channel characteristics of ultra‐wideband systems with single co‐channel interference

In this paper, the channel characteristics of ultra‐wideband systems with single co‐channel interference are investigated. A ray‐tracing technique is developed to calculate channel frequency responses in an indoor environment, of which the frequency dependence for the dielectric constant and the conductivity are carefully considered. By using the frequency responses, the channel capacities with single co‐channel interference are calculated. The outage probability of the channel capacities are also calculated for analyzing the channel statistical property. Furthermore, some useful channel statistical parameters are also investigated for different material partitions. Copyright © 2011 John Wiley & Sons, Ltd.     

Coding theorems for the nonsynchronized channel

Capacity and error bounds are derived for a memoryless binary symmetric channel with the receiver having no a priori information as to the starting time of the code words. The channel capacity is the same as the capacity of the synchronized channel. For all rates below capacity, the minimum probability of error for the nonsynchronized channel decreases exponentially with the code-block length. For rates near channel capacity, the exponent in the upper bound on the probability of error for the nonsynchronized channel is the same as the corresponding exponent for the synchronized channel. For low rates, the largest exponent obtained for the nonsynchronized channel with conventional block coding is inferior to the exponent obtained for the synchronized channel. Stronger results are obtained for a new form of coding that allows for a Markov dependency between successive code words. Bounds on the minimum probability of error are obtained for unconstrained binary codes and for several classes of parity-check codes and are used to obtain asymptotic distance properties for various classes of binary codes. At certain rates there exist codes whose minimum distance, in the comma-free sense, is not only greater than one, but is proportional to the block length.     

基于DMF捕获系统频率选择性信道下捕获性能的分析

对基于数字匹配滤波器(DMF)捕获系统在频率选择性信道下的捕获性能进行了深入讨论，利用状态转移图推导出单次驻留判决方式时平均捕获时间的表达式，对平均捕获时间与多径分量的关系进行了数字分析。得出的主要结论是：对于多径分量为非衰落信号时，多径分量之间的能量差别越大，系统捕获性能越好，多径分量的能量相等时，系统捕获性能最差，且随着可以分离的多径路数的增加下降；对于多径分量为慢衰落信号时，多径信道的捕获性能好于单径信道(非频率选择性衰落信道)，且多径分量之间的能量差别越大，系统捕获性能越差，当多径分量的能量相等时，捕获性能最好，这与非衰落信道的情形相反。因此在频率选择性衰落信道中，采用分集接收可以改善系统的捕获性能。     

Binary lattice vector quantization with linear block codes andaffine index assignments

We determine analytic expressions for the performance of some low-complexity combined source-channel coding systems. The main tool used is the Hadamard transform. In particular, we obtain formulas for the average distortion of binary lattice vector quantization with affine index assignments, linear block channel coding, and a binary-symmetric channel. The distortion formulas are specialized to nonredundant channel codes for a binary-symmetric channel, and then extended to affine index assignments on a binary-asymmetric channel. Various structured index assignments are compared. Our analytic formulas provide a computationally efficient method for determining the performance of various coding schemes. One interesting result shown is that for a uniform source and uniform quantizer, the natural binary code is never optimal for a nonsymmetric channel, even though it is known to be optimal for a symmetric channel     

Characterization of channel width dependence of gate delay in0.18-μm CMOS technology

The channel width dependence of gate delay in 0.18-μm CMOSFET has been characterized. Substantial increase of gate delay observed in the narrow channel width region is found due to channel width independent capacitance components, which is inherent to transistors. An expression for gate delay considering the channel width independent capacitance components and gate sheet resistance is derived and compared with experimental data. The minimum gate delay is shown to result from the compromise between delay components proportional to channel width and proportional to inverse of channel width. Although the channel width independent capacitance is negligible in the wide channel width region, the gate delay of the 1-μm channel width ring oscillator increased more than 20% compared with the 5-μm channel width ring oscillator     

LDPC码的稳定中断分析

对于一个给定的信道和一个特定的ldpc码族,针对由密度进化的不稳定性而造成的稳定中断事件,本文通过研究了BEC和AWGN信道中的稳定中断概率并确切表达了在块衰弱信道中的稳定中断概率,其仿真过程给出了在删除信道中容量逼近系统是怎样跳开了在块衰弱信道中的中断限制。     

Turbo Equalization with Prediction and Iterative Estimation of Time-Varying Frequency-Selective Channels

Turbo equalization that cooperates with channel prediction and iterative channel estimation is investigated for mobile wireless communications. Frames of information bits are encoded, interleaved, and mapped to symbols for transmission over time-varying frequency-selective fading channels. At the receiver, the Turbo equalizer consists of a maximum a posteriori probability equalizer/demapper and a soft-input soft-output maximum a posteriori probability decoder. With initial channel estimates and sparse pilot insertion across a number of frames, the receiver predicts the channel of the current frame. The effect of error propagation of channel prediction is mitigated by the de-interleaver that is embedded in the Turbo equalizer. The predicted and interpolated channel is refined through a channel estimator that uses the soft estimates of data symbols at each Turbo iteration. Due to the bandlimiting feature of channel variation, the channel estimation error can be smoothed by low-pass filters that follow the channel estimator. Simulation results show that incorporating Turbo equalization with channel prediction and iterative channel estimation can combat time- and frequency-selective fading and improve reception performance.     

基于改进广义Steiner估计的MC-CDMA系统空时多用户检测

研究了频率选择性瑞利衰落信道中的同步MC-CDMA系统上行链路空时信道估计及多用户检测算法。考虑对应于子载波的衰落系数是信道冲激响应的离散傅里叶变换,通过在两个数据块之间插入训练序列(midamble)进行所有用户的联合信道估计。首先采用广义Steiner估计器(GSE)来进行阵列天线信道冲激响应的初始估计,然后提出一种简单有效的适用于均匀线阵的互相关波达方向(CCDOA)估计算法,用以改进阵列天线信道冲激响应的估计,从空间的角度降低了信道响应中的噪声。在估计出所有用户空时信道参数的基础上,构造最大比合并(MRC)、解相关检测和最小均方误差检测(MMSE)来进行信号检测。仿真结果表明基于互相关DOA估计的改进信道估计算法与广义Steiner估计器相比在系统性能上有显著的改善。     

Channel estimation for OFDM transmission in multipath fadingchannels based on parametric channel modeling

We present an improved channel estimation algorithm for orthogonal frequency-division multiplexing mobile communication systems using pilot subcarriers. This algorithm is based on a parametric channel model where the channel frequency response is estimated using an L-path channel model. In the algorithm, we employ the ESPRIT (estimation of signal parameters by rotational invariance techniques) method to do the initial multipath time delays acquisition and propose an interpath interference cancellation delay locked loop to track the channel multipath time delays. With the multipath time delays information, a minimum mean square error estimator is derived to estimate the channel frequency response. It is demonstrated that the use of the parametric channel model can effectively reduce the signal subspace dimension of the channel correlation matrix for the sparse multipath fading channels and, consequently, improve the channel estimation performance     

认知无线网络中信道选择算法研究

研究认知无线网络中认知用户（secondary user,SU）的信道选择策略。在每个信道上,由于主用户（primary user,PU）返回的概率不相同,因此SU需要接入一个成功传输概率最大的信道,以尽量避免与PU发生冲突。提出了一个基于EWA学习的信道选择算法,仿真结果表明,SU通过学习历史信道选择的经验,能自适应地选择可用性最好的信道,从而最小化与PU发生冲突的概率,有效地降低了SU进行信道切换的可能性。     

Performance of quantizers on noisy channels using structuredfamilies of codes

Achievable distortion bounds are derived for the cascade of structured families of binary linear channel codes and binary lattice vector quantizers. It is known that for the cascade of asymptotically good channel codes and asymptotically good vector quantizers the end-to-end distortion decays to zero exponentially fast as a function of the overall transmission rate, and is achieved by choosing a channel code rate that is independent of the overall transmission rate. We show that for certain families of practical channel codes and binary lattice vector quantizers, the overall distortion can be made to decay to zero exponentially fast as a function of the square root of transmission rate. This is achieved by carefully choosing a channel code rate that decays to zero as the transmission rate grows. Explicit channel code rate schedules are obtained for several well-known families of channel codes