一种改进的准正交空时分组码编码设计

本文提出了一种改进的准正交空时分组码设计。它利用准正交准则,在不增加译码复杂度的前提下,设计出了一个更好的编码。仿真结果表明,这种方法的误比特率无论在低信躁比还是在高信躁比条件下都要优于Jafarkhani码。     

基于变长Turbo码的低复杂度联合信源信道译码

基于变长Turbo码的联合信源信道译码通过构造联合译码平面网格图,具有比比特级译码更好的性能.但平面网格图复杂,使变长Turbo码译码复杂度高.基于此,构造了一个空间网格图,提出基于变长Turbo码的低复杂度联合信源信道译码方法.仿真结果表明,该算法比平面网格图计算复杂度减少约3.8%,在SER(symbol error ratio)为10-4时,获得Eb/N0增益约为0.2dB.     

New linear codes from constacyclic codes

One of the main challenges of coding theory is to construct linear codes with the best possible parameters. Various algebraic and combinatorial methods along with computer searches are used to construct codes with better parameters. Given the computational complexity of determining the minimum distance of a code, exhaustive searches are not feasible for all but small parameter sets. Therefore, codes with certain algebraic structures are preferred for both theoretical and practical reasons. In this work we focus on the class of constacyclic codes to first generate all constacyclic codes exhaustively over small finite fields of order up to 9 to create a database of best constacyclic codes. We will then use this database as a building block for a search algorithm for new quasi-twisted codes. Our search on constacyclic codes has revealed 16 new codes, i.e. codes with better parameters than currently best-known linear codes. Given that constacyclic codes are well known, this is a surprising result. Moreover, using the standard constructions of puncturing, shortening or extending a given code, we also derived 55 additional new codes from these constacyclic codes. Hence, we achieved improvements on 71 entries in the database of best-known codes. We use a search strategy that is comprehensive, i.e. it computes every constacyclic code for a given length and shift constant, and it avoids redundantly examining constacyclic codes that are equivalent to either cyclic codes or other constacyclic codes.     

On improving Tunstall codes

Though many compression methods are based on the use of variable length codes, there has recently been a trend to search for alternatives in which the lengths of the codewords are more restricted, which can have useful applications, such as easier processing and fast decoding. This paper explores the construction of variable-to-fixed length codes, which have been suggested long ago by Tunstall. Using new heuristics based on suffix trees, the performance of Tunstall codes can in some cases be improved by more than 40%.     

基于空间网格图的低复杂度联合信源信道编译码方法

在分析和研究空间网格图和优化方法的基础上,采用约束条件方程组和权重值递推方法,优化空间网格图的权重参数,提出基于空间网格图的低复杂度联合信源信道编译码方法.仿真实验结果表明,与现存方法相比,该方法有效降低了计算复杂度,并改善了译码性能,可应用于资源受限的空间通信中的流媒体的联合编译码.     

Detection of optimal spreading codes for DS-CDMA wireless systems with despreading sequences weighted by adjustable chip waveforms

This paper considers the problem of detecting the optimal spreading codes (OSC) in a given code set for a direct sequence-code division multiple access system that employs despreading sequences weighted by adjustable chip waveforms. Due to computational complexity required to detect the OSC in a code set, a simple and efficient strategy is introduced. Analysis and numerical results show that the proposed strategy can successfully distinguish the spreading codes being most suitable references for a given code set in which the candidate spreading codes have equal crosscorrelation properties.     

A fast BER evaluation method for LDGM codes

Low-density generator matrix (LDGM) codes have recently drawn researchers’ attention thanks to their satisfying performance while requiring only moderate encoding/decoding complexities as well as to their applicability to network codes. In this paper, we aim to propose a fast simulation method useful to investigate the performance of LDGM code. Supported by the confidence interval analysis, the presented method is, for example, 10⁸ times quicker than the Monte-Carlo computer simulation for bit-error-rate (BER) in 10⁻¹⁰ region.     

一种CMMB系统信道估计改进算法的研究

针对CMMB系统中接收信号因受传输环境的大、小尺度衰落、多普勒衰落影响,通过最小二乘信道估计和低密度奇偶校验码LDPC（Low Density Parity Check Code）译码结合的算法在接收端对信号进行接收处理,实验仿真表明,该算法可以达到与经典算法的性能相接近效果的同时大量减少了系统的复杂度。     

Neural decoders with permutation invariant structure

Neural decoders were introduced as a generalization of the classic Belief Propagation (BP) decoding algorithms. In this work, we propose several neural decoders with different permutation invariant structures for BCH codes and punctured RM codes. Firstly, we propose the cyclically equivariant neural decoder which makes use of the cyclically invariant structure of these two codes. Next, we propose an affine equivariant neural decoder utilizing the affine invariant structure of those two codes. Both these two decoders outperform previous neural decoders when decoding cyclic codes. The affine decoder achieves a smaller decoding error probability than the cyclic decoder, but it usually requires a longer running time. Similar to using the property of the affine invariant property of extended BCH codes and RM codes, we propose the list decoding version of the cyclic decoder that can significantly reduce the frame error rate(FER) for these two codes. For certain high-rate codes, the gap between the list decoder and the Maximum Likelihood decoder is less than 0.1 dB when measured by FER.     

面向空间通信不平等差错保护的联合信源信道编解码方法

提出了一种面向空间通信不平等差错保护的联合信源信道编解码方法. 该方法采用一种可逆编解码方法对直流系数进行重点保护,即对直流系数编码输出码流进行二进制游程编码,并采用可逆变长码对游程长度进行编码. 对重要性较低的交流(AC)系数采用可变长编解码. 仿真实验结果和分析表明,该方法有效地解决了错误扩散,提高了直流系数的抗差错性能,改善了图像传输质量.     

Unique-order interpolative coding for fast querying and space-efficient indexing in information retrieval systems

This paper presents a size reduction method for the inverted file, the most suitable indexing structure for an information retrieval system (IRS). We notice that in an inverted file the document identifiers for a given word are usually clustered. While this clustering property can be used in reducing the size of the inverted file, good compression as well as fast decompression must both be available. In this paper, we present a method that can facilitate coding and decoding processes for interpolative coding using recursion elimination and loop unwinding. We call this method the unique-order interpolative coding. It can calculate the lower and upper bounds of every document identifier for a binary code without using a recursive process, hence the decompression time can be greatly reduced. Moreover, it also can exploit document identifier clustering to compress the inverted file efficiently. Compared with the other well-known compression methods, our method provides fast decoding speed and excellent compression. This method can also be used to support a self-indexing strategy. Therefore our research work in this paper provides a feasible way to build a fast and space-economical IRS.     

Interpolative coding of integer sequences supporting log-time random access

Sequences of integers are common data types, occurring either as primary data or ancillary structures. The sizes of sequences can be large, making compression an interesting option. Effective compression presupposes variable-length coding, which destroys the regular alignment of values. Yet it would often be desirable to access only a small subset of the entries, either by position (ordinal number) or by content (element value), without having to decode most of the sequence from the start. Here such a random access technique for compressed integers is described, with the special feature that no auxiliary index is needed. The solution applies a method called interpolative coding, which is one of the most efficient non-statistical codes for integers. Indexing is avoided by address calculation guaranteeing sufficient space for codes even in the worst case. The additional redundancy, compared to regular interpolative coding, is only about 1 bit per source integer for uniform distribution. The time complexity of random access is logarithmic with respect to the source size for both position-based and content-based retrieval. According to experiments, random access is faster than full decoding when the number of accessed integers is not more than approximately 0.75 · n/log₂n for sequence length n. The tests also confirm that the method is quite competitive with other approaches to random access coding, suggested in the literature.     

一种基于自修改代码技术的软件保护方法

提出一种基于自修改代码(SMC)技术的软件保护方法,该方法通过将关键代码转换为数据存储在原程序中,以隐藏关键代码;受保护的可执行文件执行过程中,通过修改进程中存储有隐藏代码的虚拟内存页面属性为可执行,实现数据到可执行代码的转换. 实验证明,此软件保护方法简单,易实现,可以有效提高SMC的抗逆向分析能力.     

RS码在弹载数据链中的应用

讨论了里德-所罗门码（REED-SOLOMON,简称RS码）的编译码算法和主要模块,通过matlab和modelsim对符合CCSDS标准的RS（255,223）码进行了仿真验证,在弹载数据链系统中的测试验证。实验表明RS码能够明显改善弹载数据链的误码率性能。     

SSTS: A syntactic tool for pattern search on time series

Nowadays, data scientists are capable of manipulating and extracting complex information from time series data, given the current diversity of tools at their disposal. However, the plethora of tools that target data exploration and pattern search may require an extensive amount of time to develop methods that correspond to the data scientist's reasoning, in order to solve their queries. The development of new methods, tightly related with the reasoning and visual analysis of time series data, is of great relevance to improving complexity and productivity of pattern and query search tasks. In this work, we propose a novel tool, capable of exploring time series data for pattern and query search tasks in a set of 3 symbolic steps: Pre-Processing, Symbolic Connotation and Search. The framework is called SSTS (Symbolic Search in Time Series) and uses regular expression queries to search the desired patterns in a symbolic representation of the signal. By adopting a set of symbolic methods, this approach has the purpose of increasing the expressiveness in solving standard pattern and query tasks, enabling the creation of queries more closely related to the reasoning and visual analysis of the signal. We demonstrate the tool's effectiveness by presenting 9 examples with several types of queries on time series. The SSTS queries were compared with standard code developed in Python, in terms of cognitive effort, vocabulary required, code length, volume, interpretation and difficulty metrics based on the Halstead complexity measures. The results demonstrate that this methodology is a valid approach and delivers a new abstraction layer on data analysis of time series.     

基于Matlab/Simulink的GPS中频信号仿真

随着GPS应用领域的日益广泛,用户对GPS接收机的性能提出了更高的要求,研制出各种高性能的GPS接收机势在必行。而对GPS接收机的所有研究都是基于GPS中频信号的。在此背景下,本文在分析GPS中频信号生成原理的基础上,利用MATLAB/simulink搭建了GPS中频信号仿真平台;特别对C/A码的生成过程和C/A码的性能进行了详细研究;最后利用直接序列扩频生成了GPS L1 C/A信号。     

Codes over Galois rings with respect to the Rosenbloom-Tsfasman metric

We investigate the structure of codes over Galois rings with respect to the Rosenbloom-Tsfasman (shortly RT) metric. We define a standard form generator matrix and show how we can determine the minimum distance of a code by taking advantage of its standard form. We compute the RT-weights of a linear code given with a generator matrix in standard form. We define maximum distance rank (shortly MDR) codes with respect to this metric and give the weights of the codewords of an MDR code. Finally, we give a decoding technique for codes over Galois rings with respect to the RT metric.     

基于VHDL的可编程逻辑器件虚拟实验平台

主要研究基于VHDL的可编程逻辑器件虚拟实验平台的设计和实现方案。平台的主体是VHDL程序翻译模块和模拟调度模块。翻译模块的核心是VHDL编译器,它将用户编写的VHDL源程序翻译转换为等价的C++语言描述,最终生成若干C++程序文件;模拟调度模块通过改进传统的事件驱动模拟算法,对翻译模块得到的C++文件进行编译、连接和动态调度,实现对所描述的静态电路的动态行为的模拟。通过典型实验样例对平台进行了验证,结果表明该系统中进行实验的过程和结果与真实实验一致,达到预定设计要求。     

The MacWilliams identity for m-spotty Rosenbloom–Tsfasman weight enumerator

The communication systems and disk or tape memory can sometimes cause clusters of errors, namely burst errors. There have been many designs in order to detect and even correct such errors. Recently, a new class of codes called m-spotty byte error correcting codes has found applications in high speed memory systems that employ random access memory chips wide Input/Output data, especially at 8, 16, or 32 bits. The MacWilliams identity provides the relationship between the weight distribution of a code and that of its dual code. Also, an interesting new metric called Rosenbloom–Tsfasman metric has been studied as an alternative metric for linear codes recently. In this paper, we combine these two interesting topics and introduce the m-spotty Rosenbloom–Tsfasman weights and the m-spotty Rosenbloom–Tsfasman weight enumerator of a binary code. Moreover, we prove a MacWilliams identity for the m-spotty Rosenbloom–Tsfasman weight enumerators.