非理想同步下BCH码盲识别的改进算法

为实现信道差错概率未知和非理想同步条件下BCH码的盲识别,本文提出了一种改进的盲识别算法。首先,结合调制方式和信噪比估计算法估计出信道差错概率;然后,根据该信道差错概率推导出一个最佳判决界,以判断测试域指数下某个最小多项式是否为生成多项式的因式,完成码长的识别;最后,比较各测试同步偏差下全部行多项式中被最小多项式整除的个数识别出实际同步偏差,并找到满足判决界的全部最小多项式完成生成多项式的识别。仿真结果表明,在信道差错概率未知和非理想同步条件下,本文算法能够有效的完成对BCH码的识别,且识别性能优于已有算法。      

Distributed sample acquisition-based fast cell search in inter-cellasynchronous DS/CDMA systems

We introduce a fast fell-search scheme based on the distributed sample acquisition (DSA) technique for inter-cell asynchronous DS/CDMA systems. The proposed DSA scheme enables the long-code acquisition extremely fast even without employing any passive matched filter which used to dominate synchronization circuit complexity in asynchronous DS/CDMA systems. In the DSA-based asynchronous DS/CDMA system, each base station spreads its DQPSK-modulated long-code generator information with an assigned short-period igniter sequence, and broadcasts it as a common pilot signal. A mobile station first identifies and acquires the igniter sequence of the cell group currently located, then detects the conveyed long-code generator information by despreading the acquired igniter sequence, thereby identifying and synchronizing the long-code of the current cell. The mean acquisition time of this proposed DSA-based inter-cell asynchronous DS/CDMA system, evaluated under the assumption that each of 512 cell-specific long-codes is a 10-ms segment (38400-chips for the chip rates of 3.84 Mchips/s) of complex Gold codes of period 2¹⁸-1 and the igniter sequence (or, group code) set is composed of 7 complex orthogonal Gold codes of period 256, turned out even shorter than that of the inter-cell synchronous DS/CDMA systems employing the conventional serial search method. Furthermore, simulation results showed that the DSA scheme employing a passive matched filter is much superior in terms of acquisition time and robustness, to the 3GPP W-CDMA synchronization scheme having comparable complexity     

基于特殊导频码的OFDM系统高效同步算法

设计了一类适用于OFDM系统具有良好理想相关性的前导码结构。基于此前导码,提出了一种适用于OFDM系统的基于匹配滤波结构的高效帧定时同步捕获方法,该算法具有非常高的效率并且能够准确估计出定时同步位置。计算机仿真结果表明该捕获方法在低信噪比下具有较高捕获同步概率,而且同步精度很高。     

基于异步通信链路的星间基线精密测量技术研究

卫星成员之间信息共享、星间基线测量是分布式航天器(Distributed Spacecraft,DS)实现多星协同完成天基虚拟探测任务的关键技术。该文提出一种分布式航天器星间通信/基线测量的综合链路体制,重点研究了基于星间异步通信链路的双向异步传输帧非相干扩频测距的方法,详细给出算法的计算公式推导和模型误差分析。技术验证系统的实验结果表明该文提出的方法性能指标先进、信道利用率高、功能集成度高,为型号任务提供了一种先进的设计理念。     

Theoretical analysis of a MAP based blind frame synchronizer

We have recently proposed in [1] a blind frame synchronization method based on a Maximum A Posteriori (MAP) approach. In this letter, we study the properties of this method and show that this synchronization technique is well suitable for codes having a sparse parity check matrix, such as Low-Density Parity-Check (LDPC) codes. We also find the probability distributions involved in our synchronization criterion and expand the analytical expression of the probability of false synchronization. Through computer simulations we validate our theoretical results and show that this synchronization technique has excellent performance when applied to LDPC codes. We also show that this method outperforms another approach of blind frame synchronization that computes hard values of the syndrome instead of its Log-Likelihood Ratios (LLR).     

基于能量检测的UWB数据包联合捕获方法

针对非相干UWB系统的数据包捕获问题,提出了一种联合信号捕获、误码率性能优化与包同步字检测的捕获方案.在信号捕获后发送导频序列实时估计信噪比,并搜索积分窗口长度,以获得最低误码率.给出了数据包捕获模型的合适性能指标,分别采用串行搜索与跳K步搜索策略,结合7位与13位巴克码为包同步字进行数据包捕获,仿真结果表明,三者联合的方案能够在保持一定包捕获性能的同时获得较好的误码率性能.     

动态环境下数字化DS/BPSK接收机捕获电路

提出了一种全数字化扩频序列捕获电路,建立了接收机动态环境下捕获电路的数学模型,分析了多普勒频移、伪码相位差和信号载噪比对电路捕获性能的影响.提出了一种提高电路捕获性能的改进方案.分析表明改进后的捕获电路具有检测概率高和虚警概率低的特点,可有效地缩短电路的平均捕获时间.     

复杂环境下突发短帧扩频通信系统处理算法设计与综合性能仿真

以海上舰船和无人机控制信道为应用背景,结合某扩频通信系统的设计提出一种适合突发短帧模式的扩频通信系统设计方案.给出关键模块的实现算法分析,针对突发模式特点设计了一种频域并行伪码捕获算法,该算法采用变频率覆盖、变频率步进、变积分时间的搜索策略,使系统既能在大频偏条件下工作,又能在低载噪比条件下工作.论文还设计了一种在突发短帧模式下,能同时实现位同步和帧同步的联合同步算法.最后对设计方案进行综合性能数值仿真与分析.     

Reed-Solomon codes for correcting phased error bursts

A code structure is introduced that represents a Reed-Solomon (RS) code in two-dimensional format. Based on this structure, a novel approach to multiple error burst correction using RS codes is proposed. For a model of phased error bursts, where each burst can affect one of the columns in a two-dimensional transmitted word, it is shown that the bursts can be corrected using a known multisequence shift-register synthesis algorithm. It is further shown that the resulting codes posses nearly optimal burst correction capability, under certain probability of decoding failure. Finally, low-complexity systematic encoding and syndrome computation algorithms for these codes are discussed. The proposed scheme may also find use in decoding of different coding schemes based on RS codes, such as product or concatenated codes.     

On error detection and error synchronization of reversible variable-length codes

Reversible variable-length codes (RVLCs) are not only prefix-free but also suffix-free codes. Due to the additional suffix-free condition, RVLCs are usually nonexhaustive codes. When a bit error occurs in a sentence from a nonexhaustive RVLC, it is possible that the corrupted sentence is not decodable. The error is said to be detected in this case. We present a model for analyzing the error detection and error synchronization characteristics of nonexhaustive VLCs. Six indices, the error detection probability, the mean and the variance of forward error detection delay length, the error synchronization probability, the mean and the variance of forward error synchronization delay length are formulated based on this model. When applying the proposed model to the case of nonexhaustive RVLCs, these formulations can be further simplified. Since RVLCs can be decoded in backward direction, the mean and the variance of backward error detection delay length, the mean and the variance of backward error synchronization delay length are also introduced as measures to examine the error detection and error synchronization characteristics of RVLCs. In addition, we found that error synchronization probabilities of RVLCs with minimum block distance greater than 1 are 0.     

Blind frame synchronization for error correcting codes having a sparse parity check matrix

We present in this letter a blind frame synchronization method based on a Maximum A Posteriori probability (MAP) approach. Applied to coded communication systems, this method is based on the calculation of the Log-likelihood Ratios (LLR) of the syndrome obtained according to the parity check matrix of the code. After presenting the proposed method, we compare it to an existing blind synchronization method previously introduced. Simulation results show that the proposed method outperforms the existing one and presents good performance when applied to codes having a sparse parity check matrix such as Low Density Parity Check (LDPC) codes and convolutional codes.     

A Generalized Analysis for a Dual Threshold Sequential Detection PN Acquisition Receiver

Spread spectrum techniques have become very useful in modern communications. A common spread spectrum technique is to directly modulate a pseudorandom noise (PN) code onto the carrier. Systems employing this technique are called direct sequence (DS) systems. A primary concern with direct sequence systems involves PN code synchronization (acquisition) of the incoming and local signals to within at least one PN symbol followed by a fine alignment (tracking) which must be maintained throughout transmission. This paper is concerned with the PN acquisition aspect of code synchronization. Specifically, a dual threshold sequential detection receiver is analyzed and a general expression is derived which addresses the probability that the sequential detection procedure ceases after an arbitrary number of samples. This expression is needed in order to support a characteristic function approach in deriving acquisition Probability as a function of time which will be the topic of a subsequent paper.     

DS/FH通信系统的跳频同步技术研究

同步是DS/FH混合通信系统的关键技术之一。根据跳频系统中对同步的要求,介绍了一种适用于DS/FH混合扩频通信系统的跳频同步方法,采用同步字头和精准时间相结合的方法实现跳频同步。对同步性能进行了分析,结果表明该跳频同步方法同步时间短,捕获概率高。     

DS/SSMA communication system with trellis coding and CPM

A direct-sequence spread spectrum multiple access (DS/SSMA) communication system employing continuous phase modulation (CPM) and trellis coding is described and analyzed to obtain an estimate of the error probability. The trellis code provides significant coding gain while the CPM signal format gives desirable spectral properties. The analysis shows that significant improvement in error probability over the standard binary DS/SSMA system can be achieved with relatively simple codes     

Performance Bounds for Convolutional Codes with Digital Viterbi Decoders in Gaussian Noise

With digital implementations of the Viterbi decoding algorithm for convolutional codes, soft quantization is preferred over hard quantization because it generally yields superior performance. Since the decoder needs to know the signal energy and channel noise variance with soft quantization, inaccurate information can result in a mismatch between the channel and decoder. Bounds which are tight for high signal-to-noise ratios are obtained on the bit error probability using the generating function approach. Automatic gain control level inaccuracies, imperfect carrier phase, symbol timing synchronization error, and path metric digitization are discussed in the context of a mismatch between the channel and decoder.     

Channel estimation and multiuser detection in long-code DS/CDMAsystems

The problems of channel estimation and multiuser detection for direct sequence code division multiple access (DS/CDMA) systems employing long spreading codes are considered. With regard to channel estimation, several procedures are proposed based on the least-squares approach, relying on the transmission of known training symbols but not requiring any timing synchronization. In particular, algorithms suited for the forward and reverse links of a single-rate DS/CDMA cellular system are developed, and the case of a multirate/multicode system, wherein high-rate users are split into multiple virtual low-rate users, is also considered. All of the proposed procedures are recursively implementable with a computational complexity that is quadratic in the processing gain, with regard to the issue of multiuser detection, an adaptive serial interference cancellation (SIC) receiver is considered, where the adaptivity stems from the fact that it is built upon the channel estimates provided by the estimation algorithm. Simulation results show that coupling the proposed estimation algorithms with a SIC receiver may yield, with a much lower computational complexity, performance levels close to those of the ideal linear minimum mean square error (MMSE) receiver, which assumes perfect knowledge of the channels for all of the users and which (in a long-code scenario) has a computational complexity per symbol interval proportional to the third power of the processing gain     

一种基于之型分量码的系统GLDPC码

本文以规则低密度生成矩阵码为基础,构建了一种以之型码为分量码的系统广义低密度奇偶校验(Generalized Low-Density Parity-Check,GLDPC)码,称为ZS-GLDPC码.该码具有线性编码复杂度,可采用和积译码算法实现迭代译码,其译码复杂度低于以汉明码为分量码的GLDPC码.在均匀交织器的前...     

基于PSWF的非正弦时域正交调制信号的同步方法

该文针对基于PSWF的非正弦时域正交调制信号同步困难的问题,通过分析调制信号的脉冲序列特征,提出了一种基于辅助序列的同步方法。采用Barker码调制0阶基带时限PSWF脉冲设计具有单峰值特性的辅助序列。同步捕获时,先采用滑动相关捕获法将同步大致位置快速定位于一个小的搜索区间,再采用MAX/TC算法在这个小的搜索区间内进行准确捕获并验证正确性。理论推导了AWGN条件下的同步捕获性能,仿真结果表明,该同步方法可行,且在低信噪比条件下具有较好的捕获概率。     

FFH/BFSK系统的一种基于频率和PN序列双图案的早迟门同步捕获方法

针对FFH/BFSK系统的同步难题,该文提出了一种基于频率和PN序列双图案的早迟门同步捕获方法,理论分析和仿真结果显示,该方法门限的选择更为简单、准确;克服了全跳解调时由于收发窗口未同步引起的解调不可靠性。这种捕获方法能进一步提高捕获性能,在信道误比特率为0.1时,同步捕获概率大于95%。分析和仿真结果经过了试验台验证。     

Performance analysis of DSA-based DS/CDMA acquisition

We analyze the acquisition time performance of the distributed sample acquisition (DSA) scheme proposed for a fast DS/CDMA signal acquisition. To analyze the composite acquisition mechanism, we first define several acquisition-related probability parameters which can describe all the essential events in the DSA synchronization, along with the basic states that constitute the eventual DSA state transition diagram. Then, we construct the state transition diagram employing these basic states and the moment generating functions which are entirely based on the above defined probability parameters. Applying this state transition diagram and determining the acquisition-related parameters, we finally analyze the mean acquisition time performance of the DSA