This paper proposes an efficient scheme for concurrent error detection for hardware implementations of the block cipher AES. In the proposed scheme, the circuit component for the round function is divided into two stages, which are used alternately for encryption (or decryption) and error checking in a pipeline. The proposed scheme has a limited overhead with respect to size and speed for the following reasons. Firstly, the need for a double number of clock cycles is eliminated by virtue of the reduced critical path. Secondly, the scheme only requires minimal additional circuitry for error detection since the detection is performed by the remaining encryption (or decryption) components within the pipeline. AES hardware with the proposed scheme was designed and synthesized by using 90-nm CMOS standard cell library with various constraints. As a result, the proposed circuit achieved 1.66 Gbps @ 12.9 Kgates for the compact version and 4.22 Gbps @ 30.7 Kgates for the high-speed version. These performance characteristics are comparable to those of a basic AES circuit without error detection, where the overhead of the proposed scheme is estimated to be 14.5% at maximum. The proposed circuit was fabricated in the form of a chip, and its error detection performance was evaluated through experiments. The chip was tested with respect to fault injection by using clock glitch, and the proposed scheme successfully detected and reacted to all introduced errors.

In this paper, we propose a method capable of shortening the distance from a noise detection microphone to a loudspeaker, which is one of important issues in the field of active noise control (ANC). In the ANC system, the secondary noise provided by the loudspeaker is required arriving at an error microphone simultaneously with the primary noise to be cancelled. However, the reverberation involved in the secondary path from the loudspeaker to the error microphone increases the secondary noise components arriving later than the primary noise. The late components are not only invalid for canceling the primary noise but also impede the cancellation. To reduce the late components, the distance between the noise detection microphone and the loud speaker is generally extended. The proposed method differently reduces the late components by forming the noise control filter, which produces the secondary noise, with the cascade connection of a non-recursive and a recursive filters. The distance can be thus shortened. On the other hand, the recursive filter is required to work stably. The proposed method guarantees the stable work by forming the recursive filter with the lattice filter whose coefficients are restricted to less than unity.

This letter has retrained an MQDF classifier on the retraining set, which is constructed by samples locating near classification boundary. The method is evaluated on HCL2000 and HCD Chinese handwriting sets. The results show that the retrained MQDF outperforms MQDF and cascade MQDF on all test sets.

We propose multiscale bagging as a modification of the bagging procedure. In ordinary bagging, the bootstrap resampling is used for generating bootstrap samples. We replace it with the multiscale bootstrap algorithm. In multiscale bagging, the sample size m of bootstrap samples may be altered from the sample size n of learning dataset. For assessing the output of a classifier, we compute bootstrap probability of class label; the frequency of observing a specified class label in the outputs of classifiers learned from bootstrap samples. A scaling-law of bootstrap probability with respect to σ2=n/m has been developed in connection with the geometrical theory. We consider two different ways for using multiscale bagging of classifiers. The first usage is to construct a confidence set of class labels, instead of a single label. The second usage is to find inputs close to decision boundaries in the context of query by bagging for active learning. It turned out, interestingly, that an appropriate choice of m is m =-n, i.e., σ2=-1, for the first usage, and m =∞, i.e., σ2=0, for the second usage.

This letter presents a novel user scheduling algorithm that provides a maximum sum-rate based on zero-forcing beamforming (ZFBF) in multiple-input multiple-output (MIMO) systems. The proposed technique determines primary user pairs in which the sum-rate exceeds a predetermined threshold. To determine the threshold, we define the maximum-sum-rate criterion (MSRC) derived from the extreme value theory (EVT). Applying the MSRC in ZFBF-based user scheduling, we find that the performance of the proposed method is comparable to that of the exhaustive searching scheme which has a greater computational load. Through computer simulations, we show that the proposed method outperforms the very well-known correlation-based method, semi-orthogonal user selection (SUS), yielding a sum rate that is about 0.57 bps/Hz higher when the transmit SNR is 10 dB with perfect CSI at BS and the numbers of users and transmit antennas in a cell are 100 and 4, respectively.

In this note, we go further on the “basis exchange” idea presented in [2] by using Mobious inversion. We show that the matrix S1(f)S0(f)-1 has a nice form when f is chosen to be the majority function, where S1(f) is the matrix with row vectors υk(α) for all α ∈ 1f and S0(f)=S1(f ⊕ 1). And an exact counting for Boolean functions with maximum algebraic immunity by exchanging one point in on-set with one point in off-set of the majority function is given. Furthermore, we present a necessary condition according to weight distribution for Boolean functions to achieve algebraic immunity not less than a given number.

Distributed systems desire to construct a random overlay graph for robustness, efficient information dissemination and load balancing. A random walk-based overlay construction is a promising alternative to generate an ideal random scale free overlay in distributed systems. However, a simple random walk-based overlay construction can be affected by node churn. Especially, the number of edges increases and the degree distribution is skewed. This inappropriate distortion can be exploited by malicious nodes. In this paper, we propose a modified random walk-based overlay construction supported by a logistic/trial based decision function to compensate the impact of node churn. Through event-driven simulations, we show that the decision function helps an overlay maintain the proper degree distribution, low diameter and low clustering coefficient with shorter random walks.

For a prime p with p≡3 (mod 4) and an odd number m, the Bentness of the p-ary binomial function fa,b(x)=Tr1n(axpm-1)+Tr12 is characterized, where n=2m, a ∈ F*pn, and b ∈ F*p2. The necessary and sufficient conditions of fa,b(x) being Bent are established respectively by an exponential sum and two sequences related to a and b. For the special case of p=3, we further characterize the Bentness of the ternary function fa,b(x) by the Hamming weight of a sequence.

Proving the security of cancelable biometrics and other template protection techniques is a key prerequisite for the widespread deployment of biometric technologies. BioEncoding is a cancelable biometrics scheme that has been proposed recently to protect biometric templates represented as binary strings like iris codes. Unlike other template protection schemes, BioEncoding does not require user-specific keys or tokens. Moreover, it satisfies the requirements of untraceable biometrics without sacrificing the matching accuracy. However, the security of BioEncoding against smart attacks, such as correlation and optimization-based attacks, has to be proved before recommending it for practical deployment. In this paper, the security of BioEncopding, in terms of both non-invertibility and privacy protection, is analyzed. First, resistance of protected templates generated using BioEncoding against brute-force search attacks is revisited rigorously. Then, vulnerabilities of BioEncoding with respect to correlation attacks and optimization based attacks are identified and explained. Furthermore, an important modification to the BioEncoding algorithm is proposed to enhance its security against correlation attacks. The effect of integrating this modification into BioEncoding is validated and its impact on the matching accuracy is investigated empirically using CASIA-IrisV3-Interval dataset. Experimental results confirm the efficacy of the proposed modification and show that it has no negative impact on the matching accuracy.

This study aims how to contain the environment reflection in a dynamic on-body ultra wideband (UWB) channel model. Based on a measurement approach, it is demonstrated that a complete body area channel model can be regarded as a combination of the on-body propagation characteristic and additional components from the environment. Based on such a channel model, the effect of environment reflection on the average bit error rate performance was investigated for a typical impulse radio UWB system.

The dynamic encoding algorithm for searches (DEAS) is a recently developed algorithm that comprises a series of global optimization methods based on variable-length binary strings that represent real variables. It has been successfully applied to various optimization problems, exhibiting outstanding search efficiency and accuracy. Because DEAS manages binary strings or matrices, the decoding rules applied to the binary strings and the algorithm's structure determine the aspects of local search. The decoding rules used thus far in DEAS have some drawbacks in terms of efficiency and mathematical analysis. This paper proposes a new decoding rule and applies it to univariate DEAS (uDEAS), validating its performance against several benchmark functions. The overall optimization results of the modified uDEAS indicate that it outperforms other metaheuristic methods and obviously improves upon older versions of DEAS series.

In order to study the influences of contact opening speeds on arc extinction gap length characteristics, Ag contacts were operated to break DC inductive load currents from 0.1 A to 2.0 A at 14 V with contact opening speeds of 0.5 mm/s, 1 mm/s, 2 mm/s, 5 mm/s and 10 mm/s in a switching mechanism employing a stepping motor, and arc voltage waveforms were observed at each opening of the contacts. From the results, the average arc durations were determined at each current level under the respective contact opening speeds, and the average arc extinction gap lengths were calculated by multiplying the average arc duration value and the contact opening speed value. It was found that average arc durations showed no significant differences with increasing contact opening speeds. Thus, arc extinction gaps became larger at faster opening speeds in the inductive load conditions of this study.

In this paper, to clarify the thermal effect of the bridge for long lifetime contacts, the effects of heat conductivity on bridge break at different material contact pairs were discussed experimentally. To examine the relationship between the bridge and material, the electrode materials of the anode and the cathode were chosen as the same and the different material pairs in this experiment. Ag, AgPd60 and Pd were chosen as the electrode materials, because Ag, AgPd60 and Pd had the different thermal diffusivity. Firstly, the voltage waveforms in the bridge with different material pair were compared to the voltage waveform with the same material pair case. Secondary, the effects of heat conductivity on the break of bridge were discussed. In the results, the bridge voltage waveform depends on the electrode material at anode side. The length of the bridge at bridge break depends on the heat conductivity of the electrode material at anode side. This study provides the basic considerations on the thermal condition of the bridge break.

Some statistical characteristics, including the means and the cross-correlations, of frequency-selective Rician fading channels seen by orthogonal frequency division multiplexing (OFDM) subcarriers are derived in this paper. Based on a pairwise error probability analysis, the mean vector and the cross-correlation matrix are used to obtain an upper bound of the overall bit-error rate (BER) in a closed-form for coded OFDM signals with and without inter-carrier interference. In this paper, the overall BER is defined as the average BER of OFDM signals of all subcarriers obtained by considering their cross-correlations. Numerical examples are presented to compare the proposed upper bound of the overall BERs and the overall BERs obtained by simulations.

A non-audible murmur (NAM), a very weak whisper sound produced without vocal fold vibration, has been researched in the development of a silent-speech communication tool for functional speech disorders as well as human-to-human/machine interfaces with inaudible voice input. The NAM can be detected using a specially designed microphone, called a NAM microphone, attached to the neck. However, the detected NAM signal has a low signal-to-noise ratio and severely suppressed high-frequency component. To improve NAM clarity, the mechanism of a NAM production must be clarified. In this work, an air flow through a glottis in the vocal tract was numerically simulated using computational fluid dynamics and vocal tract shape models that are obtained by a magnetic resonance imaging (MRI) scan for whispered voice production with various strengths, i.e. strong, weak, and very weak. For a very weak whispering during the MRI scan, subjects were trained, just before the scanning, to produce the very weak whispered voice, or the NAM. The numerical results show that a weak vorticity flow occurs in the supraglottal region even during a very weak whisper production; such vorticity flow provide aeroacoustic sources for a very weak whispering, i.e. NAM, as in an ordinary whispering.

The marking construction problem (MCP) of Petri nets is defined as follows: “Given a Petri net N, an initial marking Mi and a target marking Mt, construct a marking that is closest to Mt among those which can be reached from Mi by firing transitions.” MCP includes the well-known marking reachability problem of Petri nets. MCP is known to be NP-hard, and we propose two schemas of heuristic algorithms: (i) not using any algorithm for the maximum legal firing sequence problem (MAX LFS) or (ii) using an algorithm for MAX LFS. Moreover, this paper proposes four pseudo-polynomial time algorithms: MCG and MCA for (i), and MCHFk and MC_feideq_a for (ii), where MCA (MC_feideq_a, respectively) is an improved version of MCG (MCHFk). Their performance is evaluated through results of computing experiment.

In this paper, we propose a simple, yet effective, multiuser detection scheme for a two-hop cooperative CDMAs. In phase 1, the minimum mean square error (MMSE) detector at the destination is used to identify reliable decisions of direct transmissions from the sources and return them to the relays. Then, in phase 2, based on the reliable decisions, the relays and the destination successively utilize the maximum likelihood (ML) detectors to estimate the residual symbols. Due to the destination estimating the symbols separately from direct transmissions and the relaying signals, as a result the destination does not need the information about the relays' decision performance for the construction of the ML detector. Hence, the proposed scheme is more feasible than existing approaches for practical implementation. In addition, due to the ML detectors in phase 2 only estimating the residual symbols, the number of computations performed by the ML detectors can be reduced significantly. The results of simulations and complexity analysis demonstrate the efficiency and effectiveness of the proposed scheme.

A novel algorithm is presented for near-field source localization with a symmetric uniform linear array (ULA) consisting of an even number of sensors. Based on element reordering of a symmetric ULA, the steering vector is factorised with respect to the range-independent bearing parameters and range-relevant 2-D location parameters, which allows the range-independent bearing estimation with rank-reduction idea. With the estimated bearing, the range estimation for each source is then obtained by defining the 1-D MUSIC spectrum. Simulation results are presented to validate the performance of the proposed algorithm.

An efficient pruning method is proposed for the infinity-norm sphere decoding based on Schnorr-Euchner enumeration in multiple-input multiple-output spatial multiplexing systems. The proposed method is based on the characteristics of the infinity norm, and utilizes the information of the layer at which the infinity-norm value is selected in order to decide unnecessary sub-trees that can be pruned without affecting error-rate performance. Compared to conventional pruning, the proposed pruning decreases the average number of tree-visits by up to 37.16% in 44 16-QAM systems and 33.75% in 66 64-QAM systems.

In this paper, a new method for 2-D frequency estimation of multiple damped sinusoids in additive white Gaussian noise is proposed. The key idea is to combine the subspace-based technique and projection separation approach. The frequency parameters in the first dimension are estimated by the MUSIC-based method, and then a set of projection separation matrices are constructed by the estimated frequency parameters. In doing so, the frequency parameters in the second dimension can be separated by the constructed projection separation matrix. Finally, each frequency parameter in the second dimension is estimated by multiple 1-D MUSIC-based methods. The estimated frequency parameters in two dimensions are automatically paired. Computer simulations are included to compare the proposed algorithm with several existing methods.