链路自适应技术在流星余迹通信中的应用

流星余迹通信具有其他通信系统无法比拟的优点,如:大跨距、抗干扰、低截获概率特性和抗毁性等特点,使得这种通信方式的应用范围越来越广泛,尤其是支援短波通信及用作卫星通信的替补手段。但是流星余迹信道又是一种典型的突发信道,通信容量小和实时性差。为了最大限度地利用短暂的流星余迹信道,人们设计了链路自适应技术。此技术能够根据信道状况自动调整发射机和接收机的参数,使得流星余迹信道资源得到最大限度的利用。     

基于TPC-RS的自适应编码流星余迹通信系统

 针对流星余迹通信系统原理及信道特点,研究了基于自适应编码机制的流星余迹通信系统．根据流星余迹信道能量随时间呈指数变化的规律,在系统误比特率的约束条件下,通过实时估计出的流星信号接收信噪比,动态地改变系统TPC-RS编码的码率冗余,实现信息速率的自适应变化,有效提高了流星余迹信道的利用率．仿真结果和分析表明,在相同信道条件下,采用自适应编码较固定编码传输效率在误比特率为2×10^-4时可获得3.68dB系统增益,数据通过量提高了一倍,验证了该方案的有效性和可行性．     

基于流星余迹通信的调制解调器设计与实现

随着对适用于流星余迹信道的各种调制体制的日渐深入研究,基于流星余迹通信的调制方案也变得越来越复杂。为了达到流余系统通信性能进一步提高的目的,主要介绍一种基于流星余迹通信的调制解调器。介绍了流星余迹通信系统调制解调体制设计,探讨了调制解调器的具体设计及实现。给出了试验数据及测试分析,试验数据结果表明,该调制解调器完全满足系统指标,适应流星余迹信道的信道特性。     

基于速率自适应流星余迹通信设计

针对随机突发并且接收信号多数以指数衰减的流星余迹信道来说,研究链路自适应技术以达到充分利用流星余迹信道资源就显得尤为重要。深入研究了流星余迹突发通信的传播机理和信道的随机特性,从理论上经过分析计算证明了采用自适应变速率技术可以显著改善和提高流星突发通信性能,在此研究基础上提出了基于流星余迹动态信道估计的流星余迹自适应变速率通信技术解决方案。     

流星余迹通信最佳传输帧长设计

在分析流星余迹通信原理及其传输信道物理特性基础上,根据流星余迹电子线密度的分布特性,构建出流星余迹信号初始接收功率的概率密度函数.针对以信号帧为单位的自适应变速率传输机制,推导出欠密类余迹平均信息通过量与传输帧长的关系,提出最佳帧长设计原则,得到自适应传输帧长的理论最佳值.仿真结果表明,在满足通信可靠性及实时性的要求下,所得最佳帧长能使系统平均信息通过量达到最大,有效提高流星余迹信道利用率.     

流星余迹通信信道建模与性能仿真

在已有经验数据和理论的基础上,结合实际的通信情况,利用通信、数理、几何、概率的知识建立了流星余迹通信信道的数学模型,并且应用C++程序模拟了该信道模型。利用该模型对流星余迹通信信道的特性进行了仿真,并对流星余迹通信的几项重要指标(如流星余迹平均通信时间、余迹的到达间隔、多径干扰的概率等)做了统计,统计结果表明所建立的信道模型与实际的信道特性基本一致。该信道模型被应用于流星余迹通信系统的软件开发过程中,以模拟实际的流星余迹通信链路。     

流星余迹通信变速率编码研究

流星余迹通信是一种利用流星电离余迹反射电波实现数据传输的通信方式。衡量流星余迹通信系统性能的指标之一是所采用编码的数据包正确传输概率。通常采用的编码方式为固定速率编码,这种编码数据包传输正确概率较低,系统性能较差。变速率编码根据流星余迹通信信道特点,通过改变数据包中各个码字的码率,提高数据包正确传输概率,改善系统性能。理论分析和仿真结果表明,采用变速率编码系统性能提高。     

流星余迹信道建模与仿真分析

为检验流星余迹通信设备及软件在实战化环境中的应用效能,针对流星余迹通信信道规律复杂、实测代价高等问题,建立流星余迹信道仿真模型。通过对典型数学模型的深入研究,以欠密类流星余迹和过密类流星余迹信道模型为基础,融入了欠密类流星簇和多径信道两种特殊类型,按照概率论原理,建立了流星余迹信道混合模型,并结合流星余迹到达间隔模型,利用C++实现了流星余迹信道混合模型的仿真。该模型可生成包含单颗欠密类、单颗过密类、欠密类流星簇和多径信道等多种类型的复杂信道。仿真结果表明,所产生的流星余迹信道特征与实际信道基本相符,验证了该模型的可用性和合理性。     

流星余迹通信中的智能天线技术研究

针对流星余迹通信原理及信道特点,建立了适用于流星余迹通信系统的智能天线系统模型。在热区跟踪上,使用波束切换技术;而对于可用流星余迹使用自适应数字波束形成技术。针对流星余迹持续时间短的特点,为了获得最佳接收性能,缩短等待时间,对自适应算法提出了收敛速度快、计算复杂度小的要求,这里采用变步长LMS算法与判决导向算法相结合的半盲自适应算法,并对半算法进行了仿真分析。     

流星余迹通信信道季节变化模型与仿真

流星余迹通信不同于传统的通信,它是低速率通信,具有突发、不连续、不定时的特性。因此,流星余迹通信的复杂性要求有必要对其通信信道进行建模。根据流星轨道分布的特点,推导出轨道-辐射的转换,得到流星分布和通信链路的关系,建立了流星余迹通信信道季节变化预测模型,并将预测模型应用于流星余迹通信链路。预测的结果和中纬度雷达观测结果比较一致,为建立流星余迹通信系统提供了技术支持。     

Performance of a hybrid decision feedback equalizer structure forCAP-based DSL systems

We study the performance of a class of derision feedback equalizer (DFE) structures for high-speed digital transmission systems. We first present mathematical formulation of minimum mean-square error (MMSE) and the optimum tap coefficients for various finite-length phase-splitting equalizers over the loop in the presence of colored noise, such as near-end crosstalk (NEXT) and far-end crosstalk (FEXT). The performance of the equalizers is also analyzed in the presence of narrowband interference and the channel reflections introduced by bridged taps. The hybrid-type DFE (H-DFE) is presented as a practical equalizer structure for these applications. The results of analysis show that the H-DFE has advantages in the performance and/or in the implementation complexity as compared with the existing DFE structures. An additional advantage of the H-DFE is in the transmission systems that employ the precoding technique. The precoding for the H-DFE allows the system to track small changes in the channel     

RLS Algorithm with Variable Fogetting Factor for Decision Feedback Equalizer over Time-Variant Fading Channels

In a high-rate indoor wireless personal communication system, the delay spread due to multipath propagation results in intersymbol interference (ISI) which can significantly increase the transmission bit error rate (BER). Decision feedback equalizer (DFE) is an efficient approach to combating the ISI. Recursive least squares (RLS) algorithm with a constant forgetting factor is often used to update the tap-coefficient vector of the DFE for ISI-free transmission. However, using a constant forgetting factor may not yield the optimal performance in a nonstationary environment. In this paper, an adaptive algorithm is developed to obtain a time-varying forgetting factor. The forgetting factor is used with the RLS algorithm in a DFE for calculating the tap-coefficient vector in order to minimize the squared equalization error due to input noise and due to channel dynamics. The algorithm is derived based on the argument that, for optimal filtering, the equalization errors should be uncorrelated. The adaptive forgetting factor can be obtained based on on-line equalization error measurements. Computer simulation results demonstrate that better transmission performance can be achieved by using the RLS algorithm with the adaptive forgetting factor than that with a constant forgetting factor previously proposed for optimal steady-state performance or a variable forgetting factor for a near deterministic system.     

Fast adaptive equalization/diversity combining for time-varyingdispersive channels

We examine adaptive equalization and diversity combining methods for fast Rayleigh-fading frequency selective channels. We assume a block adaptive receiver in which the receiver coefficients are obtained from feedforward channel estimation. For the feedforward channel estimation, we propose a novel reduced dimension channel estimation procedure, where the number of unknown parameters are reduced using a priori information of the transmit shaping filter's impulse response. Fewer unknown parameters require a shorter training sequence. We obtain least-squares, maximum-likelihood, and maximum a posteriori (MAP) estimators for the reduced dimension channel estimation problem. For symbol detection, we propose the use of a matched filtered diversity combining decision feedback equalizer (DFE) instead of a straightforward diversity combining DFE. The matched filter form has lower computational complexity and provides a well-conditioned matrix inversion. To cope with fast time-varying channels, we introduce a new DFE coefficient computation algorithm which is obtained by incorporating the channel variation during the decision delay into the minimum mean square error (MMSE) criterion. We refer to this as the non-Toeplitz DFE (NT-DFE). We also show the feasibility of a suboptimal receiver which has a lower complexity than a recursive least squares adaptation, with performance close to the optimal NT-DFE     

Channel equalization via channel identification: algorithms andsimulation results for rapidly fading HF channels

The problem of channel equalization via channel identification (CEQCID) that has previously been considered by a handful of researchers is explored further. An efficient algorithm for mapping the channel parameters to the equalizers coefficients is proposed. The proposed scheme is compared with a lattice least squares (LS) based receivers. For the particular application of the high frequency (HF) radio channels, we find that the CEQCID has lower computational complexity. In terms of the tracking performance, also, the CEQCID has been found to be superior to the LS based receivers. We emphasize on the implementation of a fractionally tap-spaced decision feedback equalizer (DFE) and compare that with the T-spaced DFE. We show that the former is a better choice for the multipath HF channels     

An Efficient VLSI Architecture for Computing Decision Feedback Equalizer Coefficients from the Channel State Information

A novel algorithm and architecture for computing the optimal decision feedback equalizer (DFE) coefficients from a channel state information (CSI) estimate is present. The proposed algorithm maps well onto a linear chain of n highly pipelineable CORDIC based processing elements. It is thus well suited for VLSI implementation. Due to the very regular data flow, the number of processing elements may be reduced without sacrificing computational latency by recycling the data through a chain of less than n processing elements.The proposed architecture computes the optimal DFE coefficients of a twelve tap symbol spaced DFE suitable for HIPERLAN I in 2.7 s and requires only 0.7 mm² area on a 0.35 m CMOS process, assuming a clock frequency of 100 MHz.     

Combined equalization and differential detection using precoding

A new transceiver for data transmission over multipath fading channels employing precoding and differential detection is investigated. This precoding scheme effectively functions as a decision feedback equalizer (DFE) for differentially coherent demodulation. The main advantage of the proposed scheme over the conventional DFE is its ability to compensate for fast channel phase variations     

A blind decision feedback equalizer incorporating fixed lagsmoothing

A new type of blind decision feedback equalizer (DFE) incorporating fixed lag smoothing is developed in this paper. The structure is motivated by the fact that if we make full use of the dependence of the observed data on a given transmitted symbol, delayed decisions may produce better estimates of that symbol. To this end, we use a hidden Markov model (HMM) suboptimal formulation that offers a good tradeoff between computational complexity and bit error rate (BER) performance. The proposed equalizer also provides estimates of the channel coefficients and operates adaptively (so that it can adapt to a fading channel for instance) by means of an online version of the expectation-maximization (EM) algorithm. The resulting equalizer structure takes the form of a linear feedback system including a quantizer, and hence, it is easily implemented. In fact, because of its feedback structure, the proposed equalizer shows some similarities with the well-known DFE. A full theoretical analysis of the initial version of the algorithm is not available, but a characterization of a simplified version is provided. We demonstrate that compared to the zero-forcing DFE (ZF-DFE), the algorithm yields many improvements. A large range of simulations on finite impulse response (FIR) channels and on typical fading GSM channel models illustrate the potential of the proposed equalizer     

Adaptive Decision Feedback Equalizer with Hexagon EOM and Jitter Detection

This paper presents an adaptive decision feedback equalizer (DFE) utilizing a hexagon eye-opening monitor to detect both the violation of the minimum eye and the severity of the violation so as to allow different step sizes to be used in search for optimal DFE tap coefficients. In addition, a new slope detection method is used to detect the deviation of received data symbols from the desired one so as to guide the direction of search for the optimal DFE tap coefficients. The proposed adaptive DFE allows designers to freely set DFE constraints such as the minimum vertical eye opening, the minimum horizontal eye opening, and the maximum jitter of the sampling clock so as to address the needs of different applications. To validate its effectiveness, the proposed adaptive DFE is embedded in a 2 Gbps serial link designed in an IBM 130 nm 1.2 V CMOS technology. The link is analyzed using Spectre from Cadence Design Systems with BSIM4 device models. Simulation results demonstrate that the proposed adaptive DFE is capable of opening completely closed data eyes at the far end of a 2-m FR4 channel with 75 % vertical eye opening, 78 % horizontal eye opening, and 21 % data jitter while consuming 17.38 mW.     

Square root Kalman filtering for high-speed data received over fading dispersive HF channels

This paper shows how to apply square root Kalman filtering to high speed data transmission on fading dispersive high-frequency (HF) channels. High data-rate HF transmission can be achieved by use of a single carrier bandwidth efficiency modulation that is demodulated with decision-feedback equalization (DFE). The DFE coefficients are updated adaptively by square root Kalman algorithms. Theoretical formulation and mechanization procedures for the square root Kalman algorithms are given. Computer simulation indicates that good error-rate performance can be achieved with these algorithms for rapid fading HF radio channels.