CONDITIONAL FACTORIZATION BASED ON LATTICE THEORY FOR -INTEGERS

In this paper,the integer N = pkq is called a -integer,if p and q are odd primes with almost the same size and k is a positive integer. Such integers were previously proposed for various cryptographic applications. The conditional factorization based on lattice theory for n-bit -integersis considered,and there is an algorithm in time polynomial in n to factor these integers if the least significant 「((2k-1)n)/((3k-1)(k+1))」bits of p are given.     

ERROR-DETECTING CODES AND UNDETECTED ERROR PROBABILITIES

The definition of good codes for error-detection is given. It is proved that a (n, k) linear block code in GF(q) are the good code for error-detection, if and only if its dual code is also. A series of new results about the good codes for error-detection are derived. New lower bounds for undetected error probabilities are obtained, which are relative to n and k only, and not the weight structure of the codes.     

Fault detection for multiple-valued logic circuits with fanout-free

The single fault and multiple fault detections for multiple-valued logic circuits are studied in this paper. Firstly, it is shown that the cardinality of optimal single fault test set for fanout-free m-valued circuits with n primary inputs is not more than n + 1, for linear tree circuits is two, and for multiplication modulo circuits is two if n is an odd number or if n is an even number and m > 3, where the optimal test set of a circuit has minimal number of test vectors. Secondly, it is indicated that the cardinality of optimal multiple fault test set for linear tree circuits with n primary inputs is 1 + [n/(m - 1)], for multiplication modulo circuits is n + 1, for fanout-free circuits that consist of 2-input linear tree circuits and 2-input multiplication modulo circuits is not greater than n+ 1, where [x] denotes the smallest integer greater than or equal to x. Finally, the single fault location approaches of linear tree circuits and multiplication modulo circuits are presented, and all faults in th     

AUTOCORRELATIONS OF l-SEQUENCES WITH CERTAIN SHIFTS

In this paper, the autocorrelations of maximal period Feedback with Carry Shift Register sequences （l-sequences） are discussed. For an l-sequence a with connection integer q = p^e（e ≥ 2） and period T = p^t-1（p- 1）, and for any integer i, 1 ≤ i ≤ e/2, by calculating the number of certain sets, it is shown that the autocorrelation of a with shift τ= kT/2p^i is Ca（τ） =（-1）^k-1 T/p^2i-1, where 1 ≤ k ≤ 2p^i - 1, and gcd（k,2p^i） = 1. This result shows there do exist some shifts such that the autocorrelations of l-sequences are high although most autocorrelations are low. Such result also holds for the decimations of l-sequences.     

Improved Algorithm for Solving Discrete Logarithm Problem by Expanding Factor

The discrete logarithm problem(DLP)is to find a solution n such that g^n=h in a finite cyclic group G=,where h∈G.The DLP is the security foundation of many cryptosystems,such as RSA.We propose a method to improve Pollard’s kangaroo algorithm,which is the classic algorithm for solving the DLP.In the proposed algorithm,the large integer multiplications are reduced by controlling whether to perform large integer multiplication.To control the process,the tools of expanding factor and jumping distance are introduced.The expanding factor is an indicator used to measure the probability of collision.Large integer multiplication is performed if the value of the expanding factor is greater than the given bound.The improved algorithm requires an average of(1.633+o(1))q(1/2)times of the large integer multiplications.In experiments,the average large integer multiplication times is approximately(1.5+o(1))q(1/2).     

FAULT DETECTION TEST SET FOR TESTABLE REALIZATIONS OF LOGIC FUNCTIONS WITH ESOP EXPRESSIONS

The circuit testable realization and its fault detection for logic functions with ESOP （EXOR-Sum-Of-Products） expressions are studied. First of all, for the testable realization by using XOR gate cascade, a test set with 2n ＋ m ＋ 1 vectors for the detections of AND bridging faults and a test set with 2n ＋ m vectors for the detections of OR bridging faults are presented. Secondly, for the testable realization by using ）（OR gate tree, a test set with 2n ＋ m vectors for the detections of AND bridging faults and a test set with 3n ＋ m ＋ 1 vectors for the detections of OR bridging faults are presented. Finally, a single fault test set with n ＋ 5 vectors for the XOR gate tree realization is presented. Where n is the number of input variables and m is the number of product terms in a logic function.     

Analytical modeling and ATLAS simulation for a homojunction LED in the mid-infrared spectral region

A generic analytical model and the ATLAS simulation of a homojunction light emitting diode（LED） based on p＋-InAs0.91Sb0.09/n0-InAs0.91Sb0.09/n＋-InAs0.91Sb0.09 materials grown on lattice matched p＋-GaSb substrate are presented.This LED is suitable for use as source in the optical absorption gas spectroscopy in the mid-infrared spectral region at 300 K.The various electro-optical properties of the homojunction LED are evaluated using analytical techniques and ATLAS device simulation software.The current-voltage characteristics of the structure are computed analytically and simulated,and the results are found to be in good agreement.The output power of the homojunction LED is estimated as a function of bias current under high carrier injection and compared with the reported experimental results.     

Total Coloring of G×Pn and G×Cn

It is proved that if G is a (△+1)-colorable graph, so are the graphs G×Pn and C×Cn, where Pn and Cn are respectively the path and cycle with n vertices, and △ the maximum edge degree of the graph. The exact chromatic numbers of the product graphs Pr1×Pr1×...×Prn× and C3k×C2m1×C2m2×...×C2mn are also presented. Thus the total coloring conjecture is proved to be true for many other graphs.     

Nested Visual Cryptography Scheme

A new nested visual cryptography scheme is proposed for n cooperated user groups. It can encode the secret image consists of black and white pixels into share images which should be distributed to each user in each group. To decode the secret, users in at least k out of n groups should be present, and at least p out of q users should provide their shares for each attendant group （where p and q can be distinct for each group）. For the proposed scheme, the known scheme can be regarded as a simple instance which has only one user in each group. Compared to S-extended visual cryptography scheme, there is no need to enumerate all the user sets which can decode the secret.     

Utilizing the dropped packets for data delivery in VANETs

Timely and cost-efficient multi-hop data delivery among vehicles is essential for vehicular ad-hoc networks （VANETs）, and various routing protocols are envisioned for infrastructure-less vehicle-to-vehicle （V2V） communications. Generally, when a packet （or a duplicate） is delivered out of the routing path, it will be dropped. However, we observe that these packets （or duplicates） may also be delivered much faster than the packets delivered along the original routing path. In this paper, we propose a novel tree based routing scheme （TBRS） for ultilizing the dropped packets in VANETs. In TBRS, the packet is delivered along a routing tree with the destination as its root. And when the packet is delivered out its routing tree, it won＇t be dropt immediately and will be delivered for a while if it can arrive at another branch of the tree. We conduct the extensive simulations to evaluate the performance of TBRS based on the road map of a real city collected from Google Earth. The simulation results show that TBRS can outperform the existing protocols, especially when the network resources are limited.     

Joint resource allocation with QoS provisioning in K-tier heterogeneous cellular networks

In this paper, the joint resource allocation （RA） problem with quality of service （QoS） provisioning in downlink heterogeneous cellular networks （HCN） is studied. To fully exploit the network capacity, the HCN is modeled as a K-tier cellular network where each tier＇s base stations （BSs） have different properties. However, deploying numbers of low power nodes （LPNs） which share the same frequency band with macrocell generates severe inter-cell interference. Enhancement of system capacity is restricted for inter-cell interference. Therefore, a feasible RA scheme has to be developed to fully exploit the resource efficiency. Under the constraint of inter-cell interference, we formulate the RA problem as a mixed integer programming problem. To solve the optimization problem we develop a two-stage solution. An integer subchannel assignment algorithm and Lagrangian-based power allocation algorithm are designed. In addition, the biasing factor is also considered and the caused influence on system capacity is evaluated. Simulation results show that the proposed algorithms achieve a good tradeoff between network capacity and interference. Moreover, the average network efficiency is highly improved and the outage probability is also decreased.     

Optimal p-ary Codes from One-weight Linear Codes over Zpm

We investigate the structures and proper- ties of one-Homogeneous （Lee） weight linear codes over the ring of integers modulo M （M is a power of a prime inte- ger p） with one unique nonzero weight. We fully describe one-Homogeneous （Lee） weight codes over rings of integers modulo 4, 8 and 9. By the generalized Gray map, we ob- tain a class of optimal binary linear codes which reaches the Griesmer bound as well as the plotkin bound and a class of optimal p-ary （p is odd and prime） nonlinear codes which attains the Plotkin bound.     

A NOVEL INTEGER FREQUENCY OFFSET ESTIMATOR FOR OFDM

One of the principal disadvantages of Orthogonal Frequency Division Multiplexing （OFDM） is very sensitive to carrier frequency offset. The integer frequency offset has no effect on the orthogonality among the subcarriers, but it causes a circular shift and phase rotation of the received data symbols sequence, resulting in a Bit Error Rate（BER） of 0.5. In this paper, a novel integer frequency offset estimator for OFDM is derived based on maximum likelihood estimation technique and exploration of the differential relation between two consecutive OFDM data symbol sequences in frequency domain. Its performance is compared with the conventional method by computer simulations for the additive white Gaussian noise channel and a multipath fading channel. Simulation results show that the performance of the proposed estimator is better than the conventional estimator.     

Broadcasting with Controlled Redundancy and Improved Localization in Wireless Sensor Networks

Wireless sensor networks （WSNs） consist of sensor nodes that broadcast a message within a network. Efficient broadcasting is a key requirement in sensor networks and has been a focal point of research over the last few years. There are many challenging tasks in the network, including redundancy control and sensor node localization that mainly depend on broadcasting. In this paper, we propose a broadcasting algorithm to control redundancy and improve localization （BACRIL） in WSNs. The proposed algorithm incorporates the benefits of the gossip protocol for optimizing message broadcasting within the network. Simulation results show a controlled level of redundancy, which is up to 57.6% if the number of sensor nodes deployed in a 500 m×500 m area are increased from 50 to 500.     

Region Incrementing Visual Cryptography Scheme with Same Contrast

In binary Region increm enting visual cryptography schemes (RIVCSs), the secrets of multi-ple secrecy regions can be gradually revealed by hu-man visual system. A characteristic of the existing binary RIVCSs different from traditional binary Visual cryptog-raphy schemes (VCSs) is that, the contrasts for different revealed regions are different while traditional binary VCSs have same contrast. To keep the quality (contrast) of re-covered image compatible with the traditional VCS, we use integer linear programming to design a binary (k,n)-RIVCS with same contrast for all secrecy regions in this paper. Experimental results demonstrate that our method is feasible and effective. The trade-off is that our schem e involves a larger pixel expansion.     

A lossless compression algorithm of remote sensing image for space applications

A simple and adaptive lossless compression algorithm is proposed for remote sensing image compression, which includes integer wavelet transform and the Rice entropy coder. By analyzing the probability distribution of integer wavelet transform coefficients and the characteristics of Rice entropy coder, the divide and rule method is used for high-frequency sub-bands and low-frequency one. High-frequency sub-bands are coded by the Rice entropy coder, and low-frequency coefficients are predicted before coding. The role of predictor is to map the low-frequency coefficients into symbols suitable for the entropy coding. Experimental results show that the average Comprcssion Ratio （CR） of our approach is about two, which is close to that of JPEG 2000. The algorithm is simple and easy to be implemented in hardware. Moreover, it has the merits of adaptability, and independent data packet. So the algorithm can adapt to space lossless compression applications.     

Optimal p-ary Codes from Constacyclic Codes over a Non-chain Ring R

This paper is devoted to the study of con- stacyclic codes over a non-chain ring R. The generator polynomials of all constacyclic codes over R are characterized and their dual codes are also determined. We also introduce a Gray map. It is proved that the image of a vconstacyclic code of length n over R under the Gray map is a cyclic code of length 2n over a field with p elements, where p is odd prime. Moreover, we obtain a substantial number of optimal p-ary linear （cyclic） codes, in terms of their parameters, via the Gray map.     

一款应用于生物传感器的1.2V-600nW 12bit 2kS/s的增量型模数转换器

This paper presents an ultra-low power incremental ADC for biosensor interface circuits.The ADC consists of a resettable second-order delta–sigma(°/ modulator core and a resettable decimation filter.Several techniques are adopted to minimize its power consumption.A feedforward path is introduced to the modulator core to relax the signal swing and linearity requirement of the integrators.A correlated-double-sampling(CDS)technique is applied to reject the offset and 1/f noise,thereby removing the integrator leakage and relaxing the gain requirement of the OTA.A simple double-tailed inverter-based fully differential OTA using a thick-oxide CMOS is proposed to operate in the subthreshold region to fulfill both an ultra-low power and a large output swing at 1.2 V supply.The signal addition before the comparator in the feedforward architecture is performed in the current domain instead of the voltage domain to minimize the capacitive load to the integrators.The capacitors used in this design are of customized metal–oxide–metal(MOM) type to reach the minimum capacitance set by the k T =C noise limit.Fabricated with a 1P6 M 0.18 m CMOS technology,the presented incremental ADC consumes600 n W at 2 k S/s from a 1.2 V supply,and achieves 68.3 d B signal to noise and distortion ratio(SNDR) at the Nyquist frequency and an FOM of 0.14 p J/conversion step.The core area is 100120 m2.     

Detecting Circles Using a Two-Stage Approach

We propose a two-stage method for detecting circular objects in this paper. In the first stage, curves are divided as linear segments or nonlinear segments. A least square estimator is used to find the estimated centers and radii of the nonlinear segments in the second stage. The found centers and radii are then evaluated to see if there exist circles in the nonlinear segments. Both of the broken and occluded circular objects are evaluated for the proposed method. From the experimental results, it is seen that the proposed method is efficient.     

A new hypersphere support vector machine algorithm

The hypersphere support vector machine is a new algorithm in pattern recognition. By studying three kinds ofhypersphere support vector machines, it is found that their solutions are identical and the margin between two classes of samples is zero or is not unique. In this letter, a new kind ofhypersphere support vector machine is proposed. By introducing a parameter n（n〉1）, a unique solution of the margin can be obtained.Theoretical analysis and experimental results show that the proposed algorithm can achieve better generalization performance.