Spread Spectrum PN Code Acquisition Using Hybrid Correlator Architectures

A hybrid correlator architecture is described which combines the serial structure of an active correlator with the parallel structure of a matched filter correlator. The mean PN code acquisition time performance of this hybrid serial-parallel correlator structure is analysed. Results are shown which compare the acquisition performance of the serial, parallel, and serial-parallel structures. The results are for a PN code length of 64 code chips and assumes a Gaussian channel with the receiver detection threshold set to obtain a constant false alarm rate. An enhancement to the serial-parallel acquisition algorithm is also described which can increase the acquisition time performance by about 15% for typical operating conditions. Overall the results demonstrate that the hybrid correlator can provide rapid code acquisition with a limited receiver complexity.     

Diagnostic Data Compression Techniques for Embedded Memories with Built-In Self-Test

A system-on-chip (SOC) usually consists of many memory cores with different sizes and functionality, and they typically represent a significant portion of the SOC and therefore dominate its yield. Diagnostics for yield enhancement of the memory cores thus is a very important issue. In this paper we present two data compression techniques that can be used to speed up the transmission of diagnostic data from the embedded RAM built-in self-test (BIST) circuit that has diagnostic support to the external tester. The proposed syndrome-accumulation approach compresses the faulty-cell address and March syndrome to about 28% of the original size on average under the March-17N diagnostic test algorithm. The key component of the compressor is a novel syndrome-accumulation circuit, which can be realized by a content-addressable memory. Experimental results show that the area overhead is about 0.9% for a 1Mb SRAM with 164 faults. A tree-based compression technique for word-oriented memories is also presented. By using a simplified Huffman coding scheme and partitioning each 256-bit Hamming syndrome into fixed-size symbols, the average compression ratio (size of original data to that of compressed data) is about 10, assuming 16-bit symbols. Also, the additional hardware to implement the tree-based compressor is very small. The proposed compression techniques effectively reduce the memory diagnosis time as well as the tester storage requirement.     

The Two-Point Codes with the Designed Distance on a Hermitian Curve in Even Characteristic

In Homma M and Kim SJ [2], the authors considered two-point codes on a Hermitian curve defined over fields of odd characteristic. In this paper, we study the geometry of a Hermitian curve over fields of even characteristic and classify the two-point codes whose minimum distances agree with the designed ones.     

在线误码监测方法及其性能

本文论述了在数字通信中进行在线误码监测的必要性，介绍了几种在线误码监测方法，并对其监测性能进行了理论分析。     

Two-point AG codes from the Beelen-Montanucci maximal curve

In this paper we investigate two-point algebraic-geometry codes (AG codes) coming from the Beelen-Montanucci (BM) maximal curve. We study properties of certain two-point Weierstrass semigroups of the curve and use them for determining a lower bound on the minimum distance of such codes. AG codes with better parameters with respect to comparable two-point codes from the Garcia-Güneri-Stichtenoth (GGS) curve are discovered.     

Two new bounds on the size of binary codes with a minimum distance of three

We prove two new upper bounds on the size of binary codes with a minimum distance of three, namelyA(10, 3)76 andA(11, 3)152.     

On the classification of geometric codes by polynomial functions

It is shown how to represent algebraically all functions that have a zero sum on all -dimensional subspaces ofPG(n,q) or ofAG(n,q). In this way one can calculate the dimensions of related codes, or one can represent interesting sets of points by functions.     

一种利用小波降噪的卫星导航信号并行捕获算法

针对全球定位系统（Global Positioning System,GPS）接收机传统捕获算法计算复杂度高、捕获灵敏度低等缺点,提出了一种可降噪的简化并行码相位捕获（Noise Reduction for Simplified Parallel Code Phase Acquisition,NR-SPCA）算法。该算法通过对信号降采样,利用小波变换对二次采样信号作降噪处理,提高了捕获灵敏度;利用GPS信号和C/A码互相关的稀疏性,并行计算降噪后的信号的相关值,提高了运算效率。仿真结果表明,在90%概率捕获成功的前提下,NR-SPCA算法比传统的PCA算法信噪比低1 dB,运算效率提升了100%。该算法还可应用于航天探测、自动驾驶等领域。     

一种高资源效率的Fast-RCSC极化码译码器

针对现有极化码软输出译码器存在的高资源消耗与低资源效率,设计了一种快速低复杂度软取消(Fast Reduced Complexity Soft-Cancelation,Fast-RCSC)译码算法及其译码器硬件架构。Fast-RCSC算法对内部特殊结点进行完整计算,在减少译码周期的同时仍有较好译码性能。基于不同特殊结点公式之间存在相似性,进而通过对引入的特殊结点模块进行计算结果复用以及计算模块分时复用,减少特殊结点模块资源消耗。通过共用存储单元以及对不足存储单元数据宽度的数据进行合并,降低存储资源消耗。在华润上华(Central Semiconductor Manufacturing Corporation,CSMC)180nm工艺下综合结果表明,设计的译码器在码长为1024的情况下,面积为2.92mm²,资源效率为245.2Mbps/mm²,相比现有软输出译码器有不同程度的提升。     

集中式MIMO雷达研究进展：正交波形设计与信号处理

集中式多输入多输出（Multiple Input Multiple Output,MIMO）雷达通常利用正交波形增加发射波形自由度,采用数字阵列拓展空间收发自由度,使得雷达接收机的天线孔径获得明显扩展,最终带来空间分辨率、测角精确度、杂波抑制能力等大幅度提升。但是,这些性能提升的前提是发射波形具有正交特性。事实上,在实际应用中,在不牺牲时域/频域资源情况下,受限于时宽带宽积,无法获得完全正交的波形集合,从而限制了MIMO雷达系统性能。本文对集中式MIMO雷达正交波形复用的技术原理进行了系统回顾,分别归纳了三种快时间发射波形设计方法：时分复用（Time Division Multiplexing, TDM）、码分复用（Code Division Multiplexing,CDM）和频分复用 （Frequency Division Multiplexing, FDM）,以及两种慢时间发射波形设计方法：多普勒分复用（Doppler Division Multiplexing,DDM）和随机相位编码波形,并对其优缺点进行对比。同时,对快时间MIMO和慢时间MIMO的信号处理流程进行归纳综合,给出基于匹配滤波的集中式MIMO雷达统一信号处理框架。为了展示不同波形对成像性能的影响,本文给出了基于三维匹配滤波的MIMO雷达成像结果。最后,结合实际应用问题,指出当前MIMO雷达面临的技术难点和发展趋势。