On Construction of Optimal A^2-Codes

Two authentication codes with arbitration (A 2 codes) are constructed from finite affine spaces to illustrate for the first time that the information theoretic lower bounds for A 2 codes can be strictly tighter than the combinatorial ones. The codes also illustrate that the conditional combinatorial lower bounds on numbers of encodingdecoding rules are not genuine ones. As an analogue of 3 dimensional case, an A 2 code from 4 dimensional finite projective spaces is constructed, which meets both the information theoretic and combinatorial lower bounds.

NOVEL BIPHASE CODE-INTEGRATED SIDELOBE SUPPRESSION CODE

A kind of novel binary phase code named sidelobe suppression code is proposed in this paper. It is defined to be the code whose corresponding optimal sidelobe suppression filter outputs the minimum sidelobes. It is shown that there do exist sidelobe suppression codes better than the conventional optimal codes-Barker codes. For example, the sidelobe suppression code of length 11 with filter of length 39 has better sidelobe level up to 17dB than that of Barker code with the same code length and filter length.

Optimal Asymmetric Quantum Codes from the Euclidean Sums of Linear Codes

In this paper,we first give the definition of the Euclidean sums of linear codes,and prove that the Euclidean sums of linear codes are Euclidean dual-containing.Then we construct two new classes of optimal asymmetric quantum error-correcting codes based on Euclidean sums of the Reed-Solomon codes,and two new classes of optimal asymmetric quantum error-correcting codes based on Euclidean sums of linear codes generated by Vandermonde matrices over finite fields.Moreover,these optimal asymmetric quantum errorcorrecting codes constructed in this paper are different from the ones in the literature.

Application of Discrete Lumped Kinetic Modeling on Vacuum Gas Oil Hydrocracking

The kinetic model of vacuum gas oil （VGO） hydrocracking based on discrete lumped approach was investigated, and some improvement was put forward at the same time in this article. A parallel reaction scheme to describe the conver- sion of VGO into products （gases, gasoline, and diesel） proposed by Orochko was used. The different experimental data were analyzed statistically and then the product distribution and kinetic parameters were simulated by available data. Fur- thermore, the kinetic parameters were correlated based on the feed property, reaction temperature, and catalyst activity. An optimization code in Matlab 2011b was written to fine-me these parameters. The model had a favorable ability to predict the product distribution and there was a good agreement between the model predictions and experiment data. Hence, the ki- netic parameters indeed had something to do with feed properties, reaction temperature and catalyst activity.

A HIGH-PERFORMANCE VLSI ARCHITECTURE OF EBCOT BLOCK CODING IN JPEG2000

The paper presents a new architecture composed of bit plane-parallel coder for Embedded Block Coding with Optimized Truncation (EBCOT) entropy encoder used in JPEG2000. In the architecture, the coding information of each bit plane can be obtained simultaneously and processed parallel. Compared with other architectures, it has advantages of high parallelism, and no waste clock cycles for a single point. The experimental results show that it reduces the processing time about 86% than that of bit plane sequential scheme. A Field Programmable Gate Array (FPGA) prototype chip is designed and simulation results show that it can process 512×512 gray-scaled images with more than 30 frames per second at 52MHz.

Trade-off Optimization for Scalable Video Coding Streaming in Relay-Based OFDMA Networks

To achieve an optimal trade-off between video quality and energy efficiency in the uplink streaming of multi-user Scalable Video Coding (SVC) videos in relay-based Orthogonal Frequency Division Multiple Access (OFDMA) cellular networks, a cross-layer design framework that jointly selects the Transmission Policy (TP) for SVC video frames, assigns OFDMA subcarriers, and allocates power for each subcarrier is proposed. We apply the dual decomposition method to the problem, and obtain a TP selection subproblem for each SVC video adaptation and a resource allocation subproblem of Joint Subcarrier, Relay and Power Allocation (JSRPA). A second level of dual decomposition is used to divide the JSRPA problem into independent subcarrier subproblems. The proposed Crosslayer Trade-off Optimization (CTO) algorithm is sub-distributed with significantly low complexity. A performance evaluation with typical SVC video traces demonstrates that the proposed algorithm is able to converge and efficiently achieve the optimal trade-off between the video quality and energy consumption at the MSs for uplink SVC streaming.

EXIT analysis of M-algorithm based MIMO detectors and LDPC code design optimization

This paper investigates joint design and optimization of both low density parity check （LDPC） codes and M-algorithm based detectors including iterative tree search （ITS） and soft-output M-algorithm （SOMA） in multiple-input multiple-output （MIMO） systems via the tool of extrinsic information transfer （EXIT） charts. First, we present EXIT analysis for ITS and SOMA. We indicate that the extrinsic information transfer curves of ITS obtained by Monte Carlo simulations based on output log-likelihood rations are not true EXIT curves, and the explanation for such a phenomenon is given, while for SOMA, the true EXIT curves can be computed, enabling the code design. Then, we propose a new design rule and method for LDPC code degree profile optimization in MIMO systems. The algorithm can make the EXIT curves of the inner decoder and outer decoder match each other properly, and can easily attain the desired code with the target rate. Also, it can transform the optimization problem into a linear one, which is computationally simple. The significance of the proposed optimization approach is validated by the simulation results that the optimized codes perform much better than standard non-optimized ones when used together with SOMA detector.

Codes cross-correlation analysis and data/pilot code pairs optimization for Galileo E1 OS and GPS L1C

The Galileo E1 open service （OS） and the global positioning system （GPS） L1C are intending to use the multiplexed binary offset carrier （MBOC） modulation in E1/L1 band, including both pilot and data components. The impact of data and pilot codes cross-correlation on the distortion of the discriminator function （i.e., the S-curve） is investigated, when only the pilot （or data） components of MBOC signals are tracked. It is shown that the modulation schemes and the receiver configuration （e.g., the correlator spacing） strongly affect the S-curve bias. In this paper, two methods are proposed to optimize the data/pilot code pairs of Galileo E1 OS and GPS L1C. The optimization goal is to obtain the minimum average S-curve bias when tracking only the pilot components a the specific correlator spacing. Figures of merit, such as S-curve bias, correlation loss and code tracking variance have been adopted for analyzing and comparing the un-optimized and optimized code pairs. Simulation results show that the optimized data/pilot code pairs could significantly mitigate the intra-channel codes cross-correlation, and then improve the code tracking performance of MBOC signals.

Two Constructions of Optimal Cartesian Authentication Codes from Unitary Geometry over Finite Fields

Two constructions of cartesian authentication codes from unitary geometry are given in this paper. Their size parameters and their probabilities of successful impersonation attack and successful substitution attack are computed. They are optimal under some cases.

The Existence of (v,4,1) Disjoint Difference Families with a Prime Power

A （v, k, λ） difference family （（v, k, λ）-DF in short） over an abelian group G of order v, is a collection F=（Bi｜i ∈ I} of k-subsets of G, called base blocks, such that any nonzero element of G can be represented in precisely A ways as a difference of two elements lying in some base blocks in F. A （v, k, λ）-DDF is a difference family with disjoint blocks. In this paper, by using Weil＇s theorem on character sum estimates, it is proved that there exists a （p^n, 4, 1）-DDF, where p = 1 （rood 12） is a prime number and n ≥1.