复制理论与二进码

基于复制理论的思想，分析了有关的二进码，指出了二进码本身具有的某种复制特性，并且根据组合思想提出了新的二进码──Ｋ码，根据平移复制和对称复制的等效性，证明了Ｋ码和自然二进制码的关系，揭示了Ｋ码的物理意义，提出了有趣的有关函数．

二进码的复制特性

本文基于复制理论的思想,分析了有关的二进码,指出了二进码本身具有的某种复制特性,并且根据组合思想提出了新的二进码—K码,根据平移复制和对称复制的等效性,证明了K码和自然码的关系,揭示了K码的物理意义.

桥函数及广义桥函数的研究进展

桥函数和广义桥函数均为三值函数系 ,都是将初始序列经复制方式和移位方式变换后而形成的 .它们包括了一些常见的非正弦正交函数 ,如沃尔什函数和方波函数等 .简要介绍了近 1 0年来北京航空航天大学通信与电子系统博士点在非正弦正交函数方面研究的一些新进展 ,重点介绍了复制理论和广义复制方法 ,桥函数、广义桥函数的复制生成方法。

万年历芯片DS1302功能测试方法研究

为完成集成电路芯片DS1302的功能测试工作,利用计算机辅助测试技术,搭建测试系统。系统硬件采用计算机、单片机、被控芯片三级相连结构,软件采用C#编写的上位机程序和C语言编写的下位机程序,两者之间按照约定的通讯协议进行交互,并计算机作为上位机,单片机作为下位机。待测试的被控芯片接收主控芯片的命令,返回信息给主控芯片。经过长期实测检验,证实该套测试系统能够缩短集成电路芯片DS1302的测试时间,提高测试准确度,达到了预期目的,且具有一定的可移植性。

数字伺服系统中角的表示方法

介绍了数字伺服系统中用十六位二进制数表示角的方法和误差角的计算。使数字伺服系统设计者从根本上树立角与数关系的正确看法,从而有助于正确、简练地设计控制算法程序。

Densities and surface tensions of ionic liquids/sulfuric acid binary mixtures

The densities and surface tensions of [Bmim][TFO]/H2SO4, [Hmim][TFO]/H2SO4 and [Omim][TFO]/H2SO4 binary mixtures were measured by pycnometer and Wilhelmy plate method respectively. The results show that densities and surface tensions of the mixtures decreased monotonously with increasing temperatures and increasing ionic liquid （IL） molar fraction. IL with longer alkyl side-chain length brings a lower density and a smaller surface tension to the ILs/H2SO4 binary mixtures. The densities and surface tensions of the mixtures are fitted well by Jouyban-Acree （JAM） model and LWW model respectively. Redlich-Kister （R-K）equation and modified Redlich-Kister （R-K） equation describe the excess molar volumes and excess surface tensions of the mixtures well respectively. Adding a small amount of ILs （XIL 〈 0.1 ） into sulfuric acid brings an obvious decrease to the density and the surface tension. The results imply that the densities and surface tensions of IL5/H2SO4 binary mixtures can be modulated by changing the IL dosage or tailoring the IL structure.

Buffer Overflow Detection on Binary Code

Most solutions for detecting buffer overflow are based on source code. But the requirement tor source code is not always practical especially for business software. A new approach was presented to detect statically the potential buffer overflow vulnerabilities in the binary code of software. The binary code was translated into assembly code without the lose of the information of string operation functions. The feature code abstract graph was constructed to generate more accurate constraint statements, and analyze the assembly code using the method of integer range constraint. After getting the elementary report on suspicious code where buffer overflows possibly happen, the control flow sensitive analysis using program dependence graph was done to decrease the rate of false positive. A prototype was implemented which demonstrates the feasibility and efficiency of the new approach.

Network coding resources optimization with transmission delay constraint in multicast networks

Minimizing network coding resources of multicast networks,such as the number of coding nodes or links,has been proved to be NP-hard,and taking propagation delay into account makes the problem more complicated. To resolve this optimal problem,an integer encoding routing-based genetic algorithm( REGA) is presented to map the optimization problem into a genetic algorithm( GA)framework. Moreover,to speed up the search process of the algorithm,an efficient local search procedure which can reduce the searching space size is designed for searching the feasible solution.Compared with the binary link state encoding representation genetic algorithm( BLSGA),the chromosome length of REGA is shorter and just depends on the number of sinks. Simulation results show the advantages of the algorithm in terms of getting the optimal solution and algorithmic convergence speed.

Constructing Non-binary Asymmetric Quantum Codes via Graphs

The theory of quantum error correcting codes is a primary tool for fighting decoherence and other quantum noise in quantum communication and quantum computation. Recently, the theory of quantum error correcting codes has developed rapidly and been extended to protect quantum information over asymmetric quantum channels, in which phase-shift and qubit-flip errors occur with different probabilities. In this paper, we generalize the construction of symmetric quantum codes via graphs (or matrices) to the asymmetric case, converting the construction of asymmetric quantum codes to finding matrices with some special properties. We also propose some asymmetric quantum Maximal Distance Separable (MDS) codes as examples constructed in this way.

An adaptive pipelining scheme for H.264/AVC CABAC decoder

An adaptive pipelining scheme for H.264/AVC context-based adaptive binary arithmetic coding(CABAC) decoder for high definition(HD) applications is proposed to solve data hazard problems coming from the data dependencies in CABAC decoding process.An efficiency model of CABAC decoding pipeline is derived according to the analysis of a common pipeline.Based on that,several adaptive strategies are provided.The pipelining scheme with these strategies can be adaptive to different types of syntax elements(SEs) and the pipeline will not stall during decoding process when these strategies are adopted.In addition,the decoder proposed can fully support H.264/AVC high4:2:2 profile and the experimental results show that the efficiency of decoder is much higher than other architectures with one engine.Taking both performance and cost into consideration,our design makes a good tradeoff compared with other work and it is sufficient for HD real-time decoding.

Beam shaping with limited amplitude weight values for satellite active phased array antenna

To gain the tradeoff between lower sidelobe and higher power amplifiers efficiency,a transmitting beam shaping scheme with limited amplitude weight values for satellite active phased array antenna is presented. The scheme is implemented by a dual coding genetic algorithm(GA). Phase and amplitude of array weight vectors for beam shaping are encoded by real coding and finite length binary coding,respectively,which,maintaining accuracy of results,reduces the amplitude dynamic range and improves the efficiency of power amplifiers. The presented algorithm,compared with complex-coded GA,increases the convergence rate due to the search space's decrease. In order to overcome the prematurity and obtain better global optimization or quasi-global optimization,a new dual coding GA based on "species diversity retention" strategy and adaptive crossover and mutation probability are presented.

Steganography Algorithm to Hide Secret Message inside an Image

In this paper, the authors propose a new algorithm to hide data inside image using steganography technique. The proposed algorithm uses binary codes and pixels inside an image. The zipped file is used before it is converted to binary codes to maximize the storage of data inside the image. By applying the proposed algorithm, a system called Steganography Imaging System （gig） is developed. The system is then tested to see the viability of the proposed algorithm. Various sizes of data are stored inside the images and the Peak signal-to-noise ratio （PSNR） is also captured for each of the images tested. Based on the PSNR value of each images, the stego image has a higher PSNR value. Hence this new steganography algorithm is very efficient to hide the data inside the image.

[[2n ,n]] ADDITIVE QUANTUM ERROR CORRECTING CODES

The self-orthogonal condition is analyzed with respect to symplectic inner product for the binary code that generated by [B1 I B2 B3],where Bi are the binary n ×n matrices,I is an identity matrix.By the use of the binary codes that generated by [B1 I B2 B2B1^T],asymptotic good[[2n ,n ]]additive quantum codes are obtained.

Decomposition behavior of CaSO_4 during potassium extraction from a potash feldspar-CaSO_4 binary system by calcination

The extraction of potassium from a tablet mixture of K-feldspar ore and CaSO4by roasting was studied with a focus on the effects of the decomposition behavior of CaSO4on the potassium extraction process.The roasted slags were characterized by X-ray diffraction（XRD）,scanning electron microscopy（SEM）,energy-dispersive X-ray spectroscopy,and thermogravimetric（TG）analysis.The XRD analysis revealed that hydrosoluble mischcrystal K2Ca2（SO4）3was obtained by ion exchange of Ca^2＋ in CaSO4 and K^＋ in KAlSi3O8.Meanwhile,the intermediate product,SiO2,separated from KAl Si3O8and reacted with CaSO4to decompose CaSO4.The SEM results showed that some blowholes emerged on the surface of the CaSO4particles when they reacted with SiO2at 1200℃,which indicates that SO2and O2gases were released from CaSO4.The TG curves displayed that pure CaSO4could not be decomposed below 1200℃,while the mixture of K-feldspar ore and CaSO4began to lose weight at 1000℃.The extraction rate of potassium and decomposition rate of CaSO4were 62%and 44%,respectively,at a mass ratio of CaSO4to K-feldspar ore of 3：1,temperature of 1200℃,tablet-forming pressure of6 MPa,and roasting time of 2 h.The decomposition of CaSO4reduced the potassium extraction rate;therefore,the required amount of CaSO4was more than the theoretical amount.However,excess CaSO4was also undesirable for the potassium extraction reaction because a massive amount of SO2and O2gas were derived from the decomposition of CaSO4,which provided poor contact between the reactants.The SO2released from CaSO4decomposition can be effectively recycled.

Binary Cyclic Codes and Minimal Codewords

Cyclic codes form an important class of codes. They have very interesting algebraic structure. Furthermore, they are equivalent to many important codes, such as binary Hamming codes, Golay codes and BCH codes. Minimal codewords in linear codes are widely used in constructing decoding algorithms and studying linear secret sharing scheme. In this paper, we show that in the binary cyclic code all of the codewords are minimal, except 0 and 1. Then, we obtain a result about the number of minimal codewords in the binary cyclic codes.

BER Modified Decode-and-Forward Protocol for OFDM-Based Linear Multihop Networks

In orthogonal frequency division multiplexing （OFDM） based multihop communications, the conventional decodeand-forward （DF） relay scheme severely suffers from the error propagation problem. This drawback is serious in multihop networks as errors made by any relay node may fail the decoder at the destination in great chance. In this paper, we propose a bit error rate （BER） modified DF protocol （BMDF） which can be applied to systems where error correction channel coding and M-ary modulation are used. By modeling all links except the last one as a binary symmetric channel （BSC）, we derive a log likelihood ratio （LLR） modification function relying only on the accumulated BER of all previous links to be applied to the output of the soft demapper. Furthermore, to reduce the computational complexity and signaling overhead, the modification function is simplified from its original exponential expression and less BERs are delivered between nodes by making successive subcarriers share the same BER. In addition, for situations where the channel state information （CSI） of forward link is available, the proposed BMDF can be further enhanced by combining with subcarrier pairing （SP） and power allocation （PA）, where a sorted-channel gain SP scheme and a greedy PA algorithm are proposed. The simulation results verify thesignificant performance improvement to the conventional DF.

SPARSE SEQUENCE CONSTRUCTION OF LDPC CODES

This letter proposes a novel and simple construction of regular Low-Density Parity-Check (LDPC) codes using sparse binary sequences. It utilizes the cyclic cross correlation function of sparse sequences to generate codes with girth8. The new codes perform well using the sumproduct decoding. Low encodingcomplexity can also be achieved due to the inherent quasi-cyclic structure of the codes.

Enhance Information Flow Tracking with Function Recognition

With the spread use of the computers, a new crime space and method are presented for criminals. Thus computer evidence plays a key part in criminal cases. Traditional computer evidence searches require that the computer specialists know what is stored in the given computer. Binary-based information flow tracking which concerns the changes of control flow is an effective way to analyze the behavior of a program. The existing systems ignore the modifications of the data flow, which may be also a malicious behavior. Thus the function recognition is introduced to improve the information flow tracking. Function recognition is a helpful technique recognizing the function body from the software binary to analyze the binary code. And that no false positive and no false negative in our experiments strongly proves that our approach is effective.

Complete Focal Plane Compression Based on CMOS Image Sensor Using Predictive Coding

In this paper, a CMOS image sensor(CIS) is proposed, which can accomplish both decorrelation and entropy coding of image compression directly on the focal plane. The design is based on predictive coding for image decorrelation. The predictions are performed in analog domain by 2×2 pixel units. Both the prediction residuals and original pixel values are quantized and encoded in parallel. Since the residuals have a peak distribution around zero,the output codewords can be replaced by the valid part of the residuals' binary mode. The compressed bit stream is accessible directly at the output of CIS without extra disposition. Simulation results show that the proposed approach achieves a compression rate of 2. 2 and PSNR of 51 on different test images.