Xueqin JIANG Moon Ho LEE Tae Chol SHIN
This letter presents an approach to the construction of multiple-rate quasi-cyclic (QC) low-density parity-check (LDPC) codes based on hyperplanes (µ-flats) of two different dimensions in Euclidean geometries. The codes constructed with this method have the same code length, multiple-rate and large stopping sets while maintaining the same basic hardware architecture. The code performance is investigated in terms of the bit error rate (BER) and compared with those of the LDPC codes which are proposed in IEEE 802.16e standard. Simulation results show that our codes perform very well and have low error floors over the AWGN channel.
Tetsuro YABU Masahiro GESHIRO Masaharu OHASHI
The design of multi-branch optical waveguides having 3 or more output ports is not so easy as that of 2-output branches because some innovative geometry is required to realize equal power splitting. All previous studies take the same approach in which they first introduce innovative geometries and then adjust the structural parameters for equal splitting. On the other hand, we propose quite a different method where distribution of refractive index is calculated from an ideal field distribution which is synthesized artificially. The method is extended to design 3-D 4-branch waveguides. It is exemplified that 4-branch waveguides with low-loss and equal splitting can be realized by the proposed method.
Jun KURIHARA Shinsaku KIYOMOTO Kazuhide FUKUSHIMA Toshiaki TANAKA
In Shamir's (k,n)-threshold secret sharing scheme (threshold scheme)[1], a heavy computational cost is required to make n shares and recover the secret from k shares. As a solution to this problem, several fast threshold schemes have been proposed. However, there is no fast ideal (k,n)-threshold scheme, where k and n are arbitrary. This paper proposes a new fast (k,n)-threshold scheme which uses just EXCLUSIVE-OR(XOR) operations to make n shares and recover the secret from k shares. We prove that every combination of k or more participants can recover the secret, but every group of less than k participants cannot obtain any information about the secret in the proposed scheme. Moreover, the proposed scheme is an ideal secret sharing scheme similar to Shamir's scheme, in which every bit-size of shares equals that of the secret. We also evaluate the efficiency of the scheme, and show that our scheme realizes operations that are much faster than Shamir's.
Donghoon CHANG Mridul NANDI Jesang LEE Jaechul SUNG Seokhie HONG Jongin LIM Haeryong PARK Kilsoo CHUN
In this paper, we introduce new compression function design principles supporting variable output lengths (multiples of size n). They are based on a function or block cipher with an n-bit output size. In the case of the compression function with a(t+1)n-bit output size, in the random oracle and ideal cipher models, their maximum advantages from the perspective of collision resistance are . In the case of t=1, the advantage is near-optimal. In the case of t>1, the advantage is optimal.
This paper presents a novel high-speed low-complexity pipelined degree-computationless modified Euclidean (pDCME) algorithm architecture for high-speed RS decoders. The pDCME algorithm allows elimination of the degree-computation so as to reduce hardware complexity and obtain high-speed processing. A high-speed RS decoder based on the pDCME algorithm has been designed and implemented with 0.13-µm CMOS standard cell technology in a supply voltage of 1.1 V. The proposed RS decoder operates at a clock frequency of 660 MHz and has a throughput of 5.3 Gb/s. The proposed architecture requires approximately 15% fewer gate counts and a simpler control logic than architectures based on the popular modified Euclidean algorithm.
The N-dimensional (N-D) Hilbert curve is a one-to-one mapping between N-D space and one-dimensional (1-D) space. It is studied actively in the area of digital image processing as a scan technique (Hilbert scan) because of its property of preserving the spatial relationship of the N-D patterns. Currently there exist several Hilbert scan algorithms. However, these algorithms have two strict restrictions in implementation. First, recursive functions are used to generate a Hilbert curve, which makes the algorithms complex and computationally expensive. Second, all the sides of the scanned region must have the same size and the length must be a power of two, which limits the application of the Hilbert scan greatly. Thus in order to remove these constraints and improve the Hilbert scan for general application, a nonrecursive N-D Pseudo-Hilbert scan algorithm based on two look-up tables is proposed in this paper. The merit of the proposed algorithm is that implementation is much easier than the original one while preserving the original characteristics. The experimental results indicate that the Pseudo-Hilbert scan can preserve point neighborhoods as much as possible and take advantage of the high correlation between neighboring lattice points, and it also shows the competitive performance of the Pseudo-Hilbert scan in comparison with other common scan techniques. We believe that this novel scan technique undoubtedly leads to many new applications in those areas can benefit from reducing the dimensionality of the problem.
Xiaoni DU Yu ZHOU Rong SUN Guozhen XIAO
In this letter, we examine the linear complexity of some 3-ary sequences, proposed by No, of period 3n-1(n=3ek, e, k integer) with the ideal autocorrelation property. The exact value of linear complexity k(6e)w is determined when the parameter r =. Furthermore, the upper bound of the linear complexity is given when the other forms of the value r is taken. Finally, a Maple program is designed to illustrate the validity of the results.
Xiangyong ZENG John Q. LIU Lei HU Desmond P. TAYLOR
A new subfamily of sequences with optimal correlation properties is constructed for the generalized Kasami set. A lower bound on the linear span is established. It is proved that with suitable choices of parameters, this subfamily has exponentially larger linear spans than either No sequences or TN sequences. A class of sequences with ideal autocorrelation is also proved to have large linear span.
In this article, we discuss the security of double-block-length (DBL) hash functions against the free-start collision attack. We focus on the DBL hash functions composed of compression functions of the form F(x) = (f(x), f(p(x))), where f is a smaller compression function and p is a permutation. We first show, in the random oracle model, that a significantly good upper bound can be obtained on the success probability of the free-start collision attack with sufficient conditions on p and the set of initial values. We also show that a similar upper bound can be obtained in the ideal cipher model if f is composed of a block cipher.
Jun KURIHARA Shinsaku KIYOMOTO Kazuhide FUKUSHIMA Toshiaki TANAKA
In Shamir's (k,n)-threshold secret sharing scheme [1], a heavy computational cost is required to make n shares and recover the secret from k shares. As a solution to this problem, several fast threshold schemes have been proposed. However, there is no fast ideal (k,n)-threshold scheme, where k ≥ 3 and n is arbitrary. This paper proposes a new fast (3,n)-threshold scheme by using just EXCLUSIVE-OR(XOR) operations to make shares and recover the secret, which is an ideal secret sharing scheme similar to Shamir's scheme. Furthermore, we evaluate the efficiency of the scheme, and show that it is more efficient than Shamir's in terms of computational cost. Moreover, we suggest a fast (k,n)-threshold scheme can be constructed in a similar way by increasing the sets of random numbers constructing pieces of shares.
Soon LEE Seung-Mook BAEK Jung-Wook PARK Young-Hyun MOON
This paper presents a study to estimate the composition of an electric load, i.e. to determine the amount of each load class by the direct measurements of the total electric current waveform from instrument reading. Kalman filter algorithm is applied to estimate the electric load composition on a consumer side of a distributed power system. The electric load supplied from the different voltage level by using a non-ideal delta-wye transformer is also studied with consideration of the practical environment for a distributed power system.
Ujjwal NEUPANE Motoki MIURA Tessai HAYAMA Susumu KUNIFUJI
The problem with traditional Brain Writing (BW) is that the users are restricted from viewing all sets of ideas at one time; and they are also restricted from writing down more than three ideas at a time. In this research we describe distributed experimental environment for BW which was designed to obtain better results and can thus eliminate the problems of traditional BW technique. The actual experimental system is an integration of three BW modes with mutually different features and characters. We conducted three different tests implementing this environment, and confirmed quality and quantity of ideas generated by three different groups. It was confirmed that unrestricted inputs are effective in generating a large quantity of ideas, whereas limiting the number of sharable/viewable ideas shows better tendency in some aspects. However, qualitative evaluation results were not confirmed as different functions show variant results. The evaluation of the functions that support viewing and sharing of ideas show that synergy is not always an advantage in generating ideas. The results of number of ideas in correlation with time show that 20 minutes time was appropriate to conduct BW in distributed environment.
This paper considers reduction of the peak-to-average power ratio (PAPR) of M-quadrature amplitude modulation (QAM) signals in orthogonal frequency division multiplexing (OFDM) systems. It is known that a 16-QAM or 64-QAM constellation can be written as the vector sum of two or three QPSK constellations respectively. We can then use the Golay complementary sequences over Z4 to construct 16-QAM or 64-QAM OFDM sequences with low PAPR. In this paper, we further examine the squared Euclidean distance of these M-QAM sequences and their variations. Our goal here is to combine the block coded modulation (BCM) and Golay complementary sequences to trade off the PAPR, the code rate, and the squared Euclidean distance of M-QAM OFDM signals. In particular, some 16-QAM and 64-QAM OFDM sequences with low PAPR and large squared Euclidean distance are presented.
A method for searching minimum Euclidean distances of respective substreams for different modulation orders of M-ary quadrature amplitude modulation signals in multiple-input and multiple-output systems is described. A channel matrix is cyclically-sorted sequentially and QR-decomposed. Using upper triangular matrices obtained by QR decomposition, minimum Euclidean distances are searched over trellis diagrams consisting of symbol-difference lattice points by computationally efficient multiple trellis-search algorithms. The simulation results demonstrate that per-substream minimum Euclidean distances can be detected with a high correct-estimation probability by path-re-searching controls over different modulation orders.
Jian ZHANG Sei-ichiro KAMATA Yoshifumi UESHIGE
The 2-dimensional (2-D) Hilbert curve is a one-to-one mapping between 2-D space and one-dimensional (1-D) space. It is studied actively in the area of digital image processing as a scan technique (Hilbert scan) because of its property of preserving the spacial relationship of the 2-D patterns. Currently there exist several Hilbert scan algorithms. However, these algorithms have two strict restrictions in implementation. First, recursive functions are used to generate a Hilbert curve, which makes the algorithms complex and computationally expensive. Second, both sides of the scanned rectangle must have same size and each size must be a power of two, which limits the application of the Hilbert scan greatly. In this paper, a Pseudo-Hilbert scan algorithm based on two look-up tables is proposed. The proposed method improves the Hilbert scan to be suitable for real-time processing and general application. The simulation indicates that the Pseudo-Hilbert scan can preserve point neighborhoods as much as possible and take advantage of the high correlation between neighboring lattice points. It also shows competitive performance of the Pseudo-Hilbert scan in comparison with other scan techniques.
Heng-Chou CHEN Oscal T.-C. CHEN
The probability associated with population fitness in a Genetic Algorithm (GA) is studied using the concept of average Euclidean distance. Based on the probability derived from population fitness, the GA can effectively terminate its evolution operations to mitigate the total computational load. Simulation results verify the feasibility of the derived probability used for the GA's termination strategy.
This paper presents an automated design of analog circuits starting with idealized elements. Our system first synthesizes circuits using idealized elements by a genetic algorithm (GA). GA evolves circuit topologies and transconductances of idealized elements to achieve the given specifications. The use of idealized elements effectively reduces search space and make the synthesis efficient. Second, idealized elements in a generated circuit are replaced by MOSFETs. Through the two processes, a circuit satisfying the given specifications can be obtained. The capability of this method was demonstrated through experiments of synthesis of a trans-impedance amplifier and a cubing circuit and benchmark tests. The results of the benchmark tests show the proposed CAD is more than 10 times faster than the CAD which does not use idealized elements.
Synchronous sampling allows alternating current (AC) quantities, such as the root mean square (RMS) values of voltage and power, to be determined with very low uncertainties (on the order of a few parts of 10-6 [1]). In this paper, a mathematical expression for estimating measurement uncertainties in nonideal synchronization with fundamental frequency AC signals is presented. The obtained results were compared with those obtained by measurements with a high-precision instrument used for measuring basic AC values.
Xiangyong ZENG Lei HU Wenfeng JIANG
In this paper, a new family S(r) of 2n binary sequences of period 2n-1 is proposed, where n ≡ 2 mod 4 and gcd(r, 2n/2-1)=1. The presented family takes 4-valued out-of-phase auto- and cross-correlation values -1, 2n/2-1, and 2n/2+1-1, and its correlation distribution is determined. For r=2(n-2)/4-1, each sequence in S(r), except the unique ideal autocorrelation sequence in the family, is proved to have a large linear span n2n/2-2, whilst the linear span of the latter is n2(n-2)/4-1.
A hardware algorithm for computing the reciprocal of the Euclidean norm of a 3-dimensional (3-D) vector which appears frequently in 3-D computer graphics is proposed. It is based on a digit-recurrence algorithm for computing the Euclidean norm and an on-line division (on-line reciprocal computation) algorithm. These algorithms are modified, so that the reciprocal of the Euclidean norm is computed by performing on-line division where the divisor is the partial result of Euclidean norm computation. Division, square-rooting, and reciprocal square-root computation, which are important operations in 3-D graphics, can also be performed using a circuit based on the proposed algorithm.