A Novel Decoding Method for Non-Binary TCM Codes

A new non-binary decoding method, which is called Yaletharatalhussein decoding algorithm, is designed and implemented for decoding non-binary convolutional codes which is based on the trellis diagram representing the convolutional encoder. Yaletharatalhussein decoding algorithm outperforms the Viterbi algorithm and other algorithms in its simplicity, very small computational complexity, decoding reliability for high states TCM codes that suitable for Fourth-Generation (4G), decreasing errors with increasing word length, and easy to implement with real-time applications. The proposed Yaletharatalhussein decoding algorithm deals with non-binary error control coding of the convolutional and TCM codes. Convolutional codes differ from block codes in that a block code takes a fixed message length and encodes it, whereas a convolutional code can encode a continuous stream of data, and a hard-decision decoding can easily be realized using the Yaletharatalhussein algorithm. The idea of non-binary codes has been extended for symbols defined over rings of integers, which outperform binary codes with only a small increase in decoding complexity. The simulation results show that the performance of the nonbinary TCM-based Yaletharatalhussein algorithm outperforms the binary and non-binary decoding methods.

Novel non-coherent integration method using binary phase-coded radar signal

The m series with 511 bits is taken as an example being applied in non-coherent integra- tion algorithm. A method to choose the bi-phase code is presented, which is 15 kinds of codes are picked out of 511 kinds of m series to do non-coherent integration. It is indicated that the power in- creasing times of larger target sidelobe is less than the power increasing times of smaller target main- lobe because of the larger target＇ s pseudo-randomness. Smaller target is integrated from larger tar- get sidelobe, which strengthens the detection capability of radar for smaller targets. According to the sidelobes distributing characteristic, a method is presented in this paper to remove the estimated sidelobes mean value for signal detection after non-coherent integration. Simulation results present that the SNR of small target can be improved approximately 6. 5 dB by the proposed method.

Implementation of a kind of FPGA-based binary phase coded radar signal processor architecture

A flexible field programmable gate array based radar signal processor is presented. The radar signal processor mainly consists of five functional modules： radar system timer, binary phase coded pulse compression（PC）, moving target detection （MTD）, constant false alarm rate （CFAR） and target dots processing. Preliminary target dots information is obtained in PC, MTD, and CFAR modules and Nios I! CPU is used for target dots combination and false sidelobe target removing. Sys- tem on programmable chip （SOPC） technique is adopted in the system in which SDRAM is used to cache data. Finally, a FPGA-based binary phase coded radar signal processor is realized and simula- tion result is given.

SIMULATED-ANNEALING-BASED SELECTION OF BINARY CODES

Binary code signals have been widely used in various radars due to their simpleimplementation,but the selection of the binary codes with high comporession ratio and lowsidelobes is not solved well,because of the difficult processing in mathmatics and expensivecalculation cost.In this paper,neural computing is introduced into the field of the selection ofbinary codes and a new method based’on simulated annealing(SA)is proposed.The experimentsshow that the proposed method is able to select the optimal binary codes with much less timecost than the known methods,furhtermore the optimization selection of the binary codes versusthe calculation cost tradeoff is easier.

DECODING ALGORITHM BASED QN REVISED SYNDROME FOR THE BINARY (23,12,7) GOLAY CODE

A decoding algorithm based on revised syndromes to decode the binary (23,12,7) Golay code is presented. The algorithm strongly depends on the algebraic properties of the code. For the algorithm, the worst complexity is about 683 mod2 additions, which is less than that of the algorithms available for the code, the average complexity is approximately 319 mod2 additions, which is slightly more than that of Blaum’s algorithm for the code.

基于Jump-SBERT的二进制代码相似性检测技术研究

二进制代码相似性检测技术在不同的安全领域中有着重要的作用。针对现有的二进制代码相似性检测方法面临计算开销大且精度低、二进制函数语义信息识别不全面和评估数据集单一等问题,提出了一种基于Jump-SBERT的二进制代码相似性检测技术。Jump-SBERT有两个主要创新点,一是利用孪生网络构建SBERT网络结构,该网络结构能够在降低模型的计算开销的同时保持计算精度不变;二是引入了跳转识别机制,使Jump-SBERT可以学习到二进制函数的图结构信息,从而更加全面地捕获二进制函数的语义信息。实验结果表明,Jump-SBERT在小函数池(32个函数)中的识别准确率可达96.3%,在大函数池(10000个函数)中的识别准确率可达85.1%,比最先进(State-of-the-Art,SOTA)的方法高出36.13%,且Jump-SBERT在大规模二进制代码相似性检测中的表现更加稳定。消融实验表明,两个主要创新点对Jump-SBERT均有积极作用,其中,跳转识别机制的贡献最高可达9.11%。

A High Spectral Efficient Non-Binary TCM Scheme-Based Novel Decoding Algorithm for 4G Systems

This paper deals with the MIMO-OFDM technique that is applied to the fourth generation (4G) of the wireless communication systems, this technique can provide high data rate transmission without increasing transmit power and expanding bandwidth, it can also efficiently use space resources and has a bright future. It presents the channel coding assisted STBC-OFDM systems, and employs the Coded Modulation techniques (CM), since the signal bandwidth available for wireless communications is limited. The proposed system deals with Non-binary error control coding of the TCM-aided STBC-OFDM scheme for transmissions over the Rayleigh channel. A new non-binary decoding method, Yaletharatalhussein decoding algorithm, is designed and implemented for decoding non-binary convolutional codes, which is based on the trellis diagram representing the convolutional encoder. Yaletharatalhussein decoding algorithm outperforms the Viterbi algorithm and other algorithms in its simplicity, very small computational complexity, decoding reliability for high states TCM codes that are suitable for Fourth-Generation (4G), decreasing errors with increasing word length, and easy to implement with real-time applications. The simulation results show that the performance of the non-binary TCM-based Yaletharatalhussein decoding algorithm-assisted STBC-OFDM scheme outperforms the binary and non-binary decoding methods.

Bandwidth optimization of a Planar Inverted-F Antenna using binary and real coded genetic algorithms

With the exponential development of mobile communications and the miniaturization of radio frequency transceivers, the need for small and low profile antennas at mobile frequencies is constantly growing. Therefore, new antennas should be developed to provide larger bandwidth and at the same time small dimensions. Although the gain in bandwidth performances of an antenna are directly related to its dimensions in relation to the wavelength, the aim is to keep the overall size of the antenna constant and from there, find the geometry and structure that give the best performance. The design and bandwidth optimization of a Planar Inverted-F Antenna (PIFA) were introduced in order to achieve a larger bandwidth in the 2 GHz band, using two optimization techniques based upon genetic algorithms (GA), namely the Binary Coded GA (BCGA) and Real-Coded GA (RCGA). During the optimization process, the different PIFA models were evaluated using the finite-difference time domain (FDTD) method-a technique belonging to the general class of differential time domain numerical modeling methods.

P-code位矩阵方法与扩展研究

以磁盘冗余阵列(Redundant Array of Inexpensive Disks,RAID)技术中新出现的P-code编码为主要对象,进行了其构造方法、编码及译码算法的详细分析,并首次运用位矩阵(Binary Distribution Matrix,BDM)的方法分析和研究了P-code码。在此基础上,对当前主要RAID-6编码的扩展即更多磁盘数量的容错问题进行了总结与探讨,提出了P-code等垂直最大距离可分码(Maximum Distance Separable,MDS)的扩展将是该领域未来研究的新方向和难点。

Statistical Recognition Method of Binary BCH Code

In this paper, a statistical recognition method of the binary BCH code is proposed. The method is applied to both primitive and non-primitive binary BCH code. The block length is first recognized based on the cyclic feature under the condition of the frame length known. And then candidate polynomials are achieved which meet the restrictions. Among the candidate polynomials, the most optimal polynomial is selected based on the minimum rule of the weights sum of the syndromes. Finally, the best polynomial was factorized to get the generator polynomial recognized. Simulation results show that the method has strong capability of anti-random bit error. Besides, the algorithm proposed is very simple, so it is very practical for hardware im-plementation.

Optimization of Mapping Rule of Bit-Interleaved Turbo Coded Modulation with 16QAM

Optimization of mapping rule of bit-interleaved Turbo coded modulation with 16 quadrature amplitude modulation (QAM) is investigated based on different impacts of various encoded bits sequence on Turbo decoding performance. Furthermore, bit-interleaved in-phase and quadrature phase (I-Q) Turbo coded modulation scheme are designed similarly with I-Q trellis coded modulation (TCM). Through performance evaluation and analysis, it can be seen that the novel mapping rule outperforms traditional one and the I-Q Turbo coded modulation can not achieve good performance as expected. Therefore, there is not obvious advantage in using I-Q method in bit-interleaved Turbo coded modulation.

A Physical Layer Network Coding Based Tag Anti-Collision Algorithm for RFID System

In RFID(Radio Frequency IDentification)system,when multiple tags are in the operating range of one reader and send their information to the reader simultaneously,the signals of these tags are superimposed in the air,which results in a collision and leads to the degrading of tags identifying efficiency.To improve the multiple tags’identifying efficiency due to collision,a physical layer network coding based binary search tree algorithm(PNBA)is proposed in this paper.PNBA pushes the conflicting signal information of multiple tags into a stack,which is discarded by the traditional anti-collision algorithm.In addition,physical layer network coding is exploited by PNBA to obtain unread tag information through the decoding operation of physical layer network coding using the conflicting information in the stack.Therefore,PNBA reduces the number of interactions between reader and tags,and improves the tags identification efficiency.Theoretical analysis and simulation results using MATLAB demonstrate that PNBA reduces the number of readings,and improve RFID identification efficiency.Especially,when the number of tags to be identified is 100,the average needed reading number of PNBA is 83%lower than the basic binary search tree algorithm,43%lower than reverse binary search tree algorithm,and its reading efficiency reaches 0.93.

First photometric study of ultrashort-period contact binary 1SWASP J140533.33＋114639.1

In this paper,CCD photometric light curves for the short-period eclipsing binary 1 SWASP J140533.33＋114639.1（hereafter J1405） in the BV R bands are presented and analyzed using the 2013 version of the Wilson-Devinney（W-D） code. It is discovered that J1405 is a W-subtype shallow contact binary with a contact degree of f = 7.9±0.5% and a mass ratio of q = 1.55±0.02. In order to explain the asymmetric light curves of the system,a cool starspot on the more massive component is employed. This shallow contact eclipsing binary may have been formed from a short-period detached system through orbital shrinkage due to angular momentum loss. Based on the（O-C） method,the variation of orbital period is studied using all the available times of minimum light. The（O-C） diagram reveals that the period is increasing continuously at a rate of d P/dt = ＋2.09×10^-7 d yr^-1,which can be explained by mass transfer from the less massive component to the more massive one.

Research of Methods for Lost Data Reconstruction in Erasure Codes over Binary Fields

In the process of encoding and decoding,erasure codes over binary fields,which just need AND operations and XOR operations and therefore have a high computational efficiency,are widely used in various fields of information technology.A matrix decoding method is proposed in this paper.The method is a universal data reconstruction scheme for erasure codes over binary fields.Besides a pre-judgment that whether errors can be recovered,the method can rebuild sectors of loss data on a fault-tolerant storage system constructed by erasure codes for disk errors.Data reconstruction process of the new method has simple and clear steps,so it is beneficial for implementation of computer codes.And more,it can be applied to other non-binary fields easily,so it is expected that the method has an extensive application in the future.

Structural, mechanical, and electronic properties of 25 kinds of Ⅲ–Ⅴbinary monolayers: A computational study with first-principles calculation

Using first-principle calculations,we investigate the mechanical,structural,and electronic properties and formation energy of 25 kinds ofⅢ-Ⅴ binary monolayers in detail.A relative radius of the binary compound according to the atomic number in the periodic table is defined,and based on the definition,the 25 kinds ofⅢ-Ⅴ binary compounds are exactly located at a symmetric position in a symmetric matrix.The mechanical properties and band gaps are found to be very dependent on relative radius,while the effective mass of holes and electrons are found to be less dependent.A linear function between Young’s modulus and formation energy is fitted with a linear relation in this paper.The change regularity of physical properties of B-Ⅴ(Ⅴ=P,As,Sb,Bi)andⅢ-N(Ⅲ=Al,Ga,In,Tl)are found to be very different from those of otherⅢ-Ⅴ binary compounds.

New CCD photometric investigation of the early-type overcontact binary BH Cen in the young star-forming Galactic cluster IC 2944

BH Cen is a short-period early-type binary with a period of 0.792^d in the extremely young star-forming cluster IC 2944. New multi-color CCD photometric light curves in U, B, V, R and I bands are presented and are analyzed by using the Wilson-Devinney code. It is detected that BH Cen is a high-mass-ratio overcontact binary with a fill-out factor of 46.4% and a mass ratio of 0.89. The derived orbital inclination i is 88.9 degrees, indicating that it is a totally eclipsing binary and the photometric parameters can be determined reliably. By adding new eclipse times, the orbital period changes in the binary are analyzed. It is confirmed that the period of BH Cen shows a long-term increase while it undergoes a cyclic oscillation with an amplitude of A3 = 0.024 d and a period of P3 = 50.3 yr. The high mass ratio, overcontact configuration and long-term continuous increase in the orbital period all suggest that BH Cen is in the evolutionary state after the shortest-period stage of Case A mass transfer.The continuous increase in period can be explained by mass transfer from the secondary component to the primary one at a rate of˙M2 = 2.8×10^-6 M⊙per year. The cyclic change can be plausibly explained by the presence of a third body because both components in the BH Cen system are early-type stars. Its mass is determined to be no less than 2.2 M⊙ at an orbital separation of about 32.5 AU. Since no third light was found during the photometric solution, it is possible that the third body may be a candidate for a compact object.

The W UMa binaries USNO-A2.0 1350-17365531,V471 Cas,V479 Lac and V560 Lac:light curve solutions and global parameters based on Gaia distances

We present photometric observations in Sloan filters g′, i′of the eclipsing W UMa stars USNOA2.0 1350-17365531, V471 Cas, V479 Lac and V560 Lac. The sinusoidal-like O-C diagram of V471 Cas indicates the presence of a third body with mass 0.12 M_⊙(a red dwarf) at distance 897 R_⊙. The O-C diagram of V479 Lac reveals a period decrease of d P/dt =-1.69 × 10-6d yr-1. The results of the light curve solutions are:(i) the targets are overcontact binaries with small fill-out factors;(ii) their components are F–K stars, comparable in size, whose temperature differences are below 80 K;(iii) all targets undergo partial eclipses and to limit the possible mass ratios we carried out two-step q-search analysis. The target global parameters(luminosities, radii, masses) were obtained on the basis of their Gaia distances and the results of our light curve solutions. The obtained total mass of V560 Lac turns out to be smaller than the lower mass limit for presently known W UMa binaries of 1.0-1.2 M_⊙, i.e. this target is a peculiar overcontact system.

Buffer Overflow Detection on Binary Code

Most solutions for detecting buffer overflow are based on source code. But the requirement for 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.

面向高信道衰减的低功耗112 Gibit/s Duo-binary PAM4 SerDes发射机设计

为了解决串行收发机在强信道衰减下误码过高的问题,采用Duo-binary PAM4编码技术设计了一款低功耗的112 Gibit/s SerDes发射机。通过采用Duo-binary PAM4编码技术,解决了高速PAM4(Pulse Amplitude Modulation-4)信号衰减过大的问题;采用CMOS的1/4速架构的4∶1合路器,降低了发射机的系统功耗;采用阻抗校准电路,提高了Duo-binary PAM4发射机的线性度。该发射机采用CMOS 28 nm工艺设计,0.9 V电压供电。仿真结果表明:该发射机在20.9 dB强信道衰减下,可以工作在112 Gibit/s,功耗为1.9 pJ/bit,且线性度达到88.3%。