Regularization plays a fundamental role in adaptive filtering. There are, very likely, many different ways to regularize an adaptive filter. In this letter, we propose one possible way to do it based on a condition that makes intuitively sense. From this condition, we show how to regularize the recursive least-squares (RLS) algorithm.

In this letter, we propose two low complexity algorithms for least square (LS) and minimum mean square error (MMSE) based multi-cell joint channel estimation (MJCE). The algorithm for LS-MJCE achieves the same complexity and mean square error (MSE) performance as the previously proposed most efficient algorithm, while the algorithm for MMSE-MJCE is superior to the conventional ones, in terms of either complexity or MSE performance.

Fourier transform is a significant tool in image processing and pattern recognition. By introducing a hypercomplex number, hypercomplex Fourier transform treats a signal as a vector field and generalizes the conventional Fourier transform. Inspired from that, hypercomplex polar Fourier analysis that extends conventional polar Fourier analysis is proposed in this paper. The proposed method can handle signals represented by hypercomplex numbers as color images. The hypercomplex polar Fourier analysis is reversible that means it can be used to reconstruct image. The hypercomplex polar Fourier descriptor has rotation invariance property that can be used for feature extraction. Due to the noncommutative property of quaternion multiplication, both left-side and right-side hypercomplex polar Fourier analysis are discussed and their relationships are also established in this paper. The experimental results on image reconstruction, rotation invariance, color plate test and image retrieval are given to illustrate the usefulness of the proposed method as an image analysis tool.

In this article, we first review key derivation functions specified in NIST SP 800-108 and one proposed by Krawczyk. Then, we propose parallelizable key derivation functions obtained by modifying or using the existing schemes. We also define two measures of efficiency of key derivation functions, and evaluate their performance in terms of the two measures.

In this paper, we present an approach of detecting speech presence for which the decision rule is based on a combination of multiple features using a sigmoid function. A minimum classification error (MCE) training is used to update the weights adjustment for the combination. The features, consisting of three parameters: the ratio of ZCR, the spectral energy, and spectral entropy, are combined linearly with weights derived from the sub-band domain. First, the Bark-scale wavelet decomposition (BSWD) is used to split the input speech into 24 critical sub-bands. Next, the feature parameters are derived from the selected frequency sub-band to form robust voice feature parameters. In order to discard the seriously corrupted frequency sub-band, a strategy of adaptive frequency sub-band extraction (AFSE) dependant on the sub-band SNR is then applied to only the frequency sub-band used. Finally, these three feature parameters, which only consider the useful sub-band, are combined through a sigmoid type function incorporating optimal weights based on MSE training to detect either a speech present frame or a speech absent frame. Experimental results show that the performance of the proposed algorithm is superior to the standard methods such as G.729B and AMR2.

This paper presents the development of a sound–specific vibration interface and its evaluation results by playing three commercial games with the interface. The proposed interface complements the pitfalls of existing frequency–based vibration interfaces such as vibrating headsets, mouses, and joysticks. Those interfaces may bring negative user experiences by generating incessant vibrations because they vibrate in response to certain sound frequencies. But the proposed interface which responds to only target sounds can improve user experiences effectively. The hardware and software parts of the interface are described; the structure and the implementation of a wrist pad that delivers vibration are discussed. Furthermore, we explain a sound-matching algorithm that extracts sound characteristics and a GUI-based pattern editor that helps users to design vibration patterns. The results from evaluating the performance show that the success ratio of the sound matching is over 90% at the volume of 20 dB and the delay time is around 400 msec. In the survey about user experiences, the users evaluates that the interface is more than four times effective in improving the reality of game playing than without using the vibration interfaces, and two times than the frequency–based ones.

Different encoding modes for variable block size are available in the H.264/AVC standard in order to offer better coding quality. However, this also introduces huge computation time due to the exhaustive check for all modes. In this paper, a fast spatial DIRECT mode decision method for profiles supporting B frame encoding (main profile, high profile, etc.) in H.264/AVC is proposed. Statistical analysis on multiple video sequences is carried out, and the strong relationship of mode selection and rate-distortion (RD) cost between the current DIRECT macroblock (MB) and the co-located MBs is observed. With the check of mode condition, predicted RD cost threshold and dynamic parameter update model, the complex mode decision process can be terminated at an early stage even for small QP cases. Simulation results demonstrate the proposed method can achieve much better performance than the original exhaustive rate-distortion optimization (RDO) based mode decision algorithm by reducing up to 56.8% of encoding time for IBPBP picture group and up to 67.8% of encoding time for IBBPBBP picture group while incurring only negligible bit increment and quality degradation.

The applicability in harsh optical environments, such as dark smog, or strong backlight of ultra-wide band (UWB) pulse radar has a definite advantage over optical ranging techniques. We have already proposed the extended Synthetic Aperture Radar (SAR) algorithm employing double scattered waves, which aimed at enhancing the reconstructible region of the target boundary including shadow region. However, it still suffers from the shadow area for the target that has a sharp inclination or deep concave boundary, because it assumes a mono-static model, whose real aperture size is, in general, small. To resolve this issue, this study proposes an extension algorithm of the double scattered SAR based on a multi-static configuration. While this extension is quite simple, the effectiveness of the proposed method is nontrivial with regard to the expansion of the imaging range. The results from numerical simulations verify that our method significantly enhances the visible range of the target surfaces without a priori knowledge of the target shapes or any preliminary observation of its surroundings.

A semi-analytical approach for analyzing the electromagnetic radiation of a line source in cylindrical electromagnetic bandgap (EBG) structure is presented. The cylindrical structure is composed of circular rods periodically distributed along concentrically layered circular rings. The method uses the T-matrix of a circular rod in isolation, the reflection and transmission matrices of a cylindrical array expressed in terms of the cylindrical waves as the basis, and the generalized reflection and transmission matrices for a layered cylindrical structure. Using the proposed method, the radiated field from a line source placed inside a three-layered cylindrical EBG structure with defects is investigated. The defects are created by removing the particular circular rods from each circular ring. The structure is prominent from the viewpoint of flexible design of the directive antennas. Numerical examples demonstrate that the cylindrical EBG structures are very effective at forming and controlling the directed beam in the radiated fields.

This paper presents a content-addressable memory (CAM) using a phase-change device. A hierarchical match-line structure and a one-hot-spot block code are indispensable to suppress the resistance ratio of the phase-change device and the area overhead of match detectors. As a result, an 8-nsec 72-bit-parallel-search CAM is implemented using a phase-change-device/MOS-hybrid circuitry, where high and low resistances are higher than 2.3 MΩ and lower than 97 kΩ, respectively, while maintaining one-day retention.

Recently, Yu, Gong and Tang found new constructions of binary sequences of period 4N with optimal autocorrelation magnitude by different interleaved structure of sequences and sequences which had special correlation property, respectively. In this paper, we derive more results on binary sequences of period 4N which also have optimal autocorrelation.

Kennedy has proposed the bare bones particle swarm (BBPS) by the elimination of the velocity formula and its replacement by the Gaussian sampling strategy without parameter tuning. However, a delicate balance between exploitation and exploration is the key to the success of an optimizer. This paper firstly analyzes the sampling distribution in BBPS, based on which we propose an adaptive BBPS inspired by the cloud model (ACM-BBPS). The cloud model adaptively produces a different standard deviation of the Gaussian sampling for each particle according to the evolutionary state in the swarm, which provides an adaptive balance between exploitation and exploration on different objective functions. Meanwhile, the diversity of the swarms is further enhanced by the randomness of the cloud model itself. Experimental results show that the proposed ACM-BBPS achieves faster convergence speed and more accurate solutions than five other contenders on twenty-five unimodal, basic multimodal, extended multimodal and hybrid composition benchmark functions. The diversity enhancement by the randomness in the cloud model itself is also illustrated.

In this letter, a study on the end-to-end outage performance of dual-hop non-regenerative relaying in the presence of co-channel interference is presented. We assume that both the desired and the interfering signals are subjected to Nakagami-m fading. Exact analytical expressions, as well as tight lower bounds of the end-to-end outage probability, are derived. An asymptotic expression for the outage probability at high values of Signal-to-Interference Ratio is also presented. Furthermore, we also propose the optimal power allocation for high values of Signal-to-Interference Ratio. Extensive numerically evaluation and computer simulation results are presented to verify the validity and the accuracy of the proposed analysis.

We propose a novel method of supervised feature projection called class-distance-based discriminant analysis (CDDA), which is suitable for automatic age estimation (AAE) from facial images. Most methods of supervised feature projection, e.g., Fisher discriminant analysis (FDA) and local Fisher discriminant analysis (LFDA), focus on determining whether two samples belong to the same class (i.e., the same age in AAE) or not. Even if an estimated age is not consistent with the correct age in AAE systems, i.e., the AAE system induces error, smaller errors are better. To treat such characteristics in AAE, CDDA determines between-class separability according to the class distance (i.e., difference in ages); two samples with similar ages are imposed to be close and those with spaced ages are imposed to be far apart. Furthermore, we propose an extension of CDDA called local CDDA (LCDDA), which aims at handling multimodality in samples. Experimental results revealed that CDDA and LCDDA could extract more discriminative features than FDA and LFDA.

Data caching is widely known as an effective power-saving technique, in which mobile devices use local caches instead of original data placed on a server, in order to reduce the power consumption necessary for network accesses. In such data caching, a cache invalidation mechanism is important in preventing these devices from unintentionally accessing invalid data. In this paper, we propose a broadcast-based protocol for cache invalidation in a location-aware system. The proposed protocol is designed to reduce the access time required for obtaining necessary invalidation reports through broadcast media and to avoid client-side sleep fragmentation while retrieving the reports. In the proposed protocol, a Bloom filter is used as the data structure of an invalidation report, in order to probabilistically check the invalidation of caches. Furthermore, we propose three broadcast scheduling methods that are intended to achieve flexible broadcasting structured by the Bloom filter: fragmentation avoidance scheduling method (FASM), metrics balancing scheduling method (MBSM), and minimizing access time scheduling method (MASM). The broadcast schedule is arranged for consecutive accesses to geographically neighboring invalidation reports. In addition, the effectiveness of the proposed methods is evaluated by simulation. The results indicate that the MBSM and MASM achieve a high rate of performance scheduling. Compared to the FASM, the MBSM reduces the access time by 34%, while the fragmentations on the resultant schedule increase by 40%, and the MASM reduces the access time by 40%, along with an 85% increase in the number of fragmentations.

This paper proposes a new resource allocation algorithm for uplink OFDMA-based cooperative relay networks, assuming multiple user nodes, multiple relay nodes and a single destination. The aim is to maximise the total sum of the users' data rates, while guaranteeing fairness among them with different QoS requirements. Assuming perfect channel state information (CSI) at the resource allocation controller, the optimisation problem is formulated such that each user is assigned a weight factor based on its QoS requirements. The ones with higher weights are given higher priorities to select their resources (relay stations and subcarriers) first. Once the required QoS is achieved for all users, the weight factor for all users is reduced to a small uniform value. The remaining resources are then allocated to the users with higher instantaneous rates in order of magnitude. The results show that the proposed algorithm outperforms the greedy and static algorithms in terms of outage probability and fairness, and at the same time outperforms Jeong's algorithm by 58% in terms of total sum rate, with an average 74% reduction in system complexity.

Distance to target is fundamental and very important information in numerous engineering fields. Many distance measurement methods using sound use the time delay of a reflected wave, which is measured in reference to the transmitted wave. This method, however, cannot measure short distances because the transmitted wave, which has not attenuated sufficiently by the time the reflected waves are received, suppresses the reflected waves for short distances. Therefore, we proposed an acoustic distance measurement method based on the interference between the transmitted wave and the reflected waves, which can measure distance in a short range. The proposed method requires a cancellation processing for background components due to the spectrum of the transmitted wave and the transfer function of the measurement system in real environments. We refer to this processing as background components cancellation processing (BGCCP). We proposed BGCCP based on subtraction or whitening. However, the proposed method had a limitation with respect to the transmitted wave or additive noise in real environments. In the present paper, we propose an acoustic distance measurement method based on the new BGCCP. In the new BGCCP, we use the calibration of a real measurement system and the whitening processing of the transmitted wave and introduce the concept of the cepstrum to the proposed method in order to achieve robustness. Although the conventional BGCCP requires the recording of the transmitted wave under the condition without targets, the new BGCCP does not have this requirement. Finally, we confirmed the effectiveness of the proposed method through experiments in real environments. As a result, the proposed method was confirmed to be valid and effective, even in noisy environments.

This paper presents the initial results of a study of an asymptotic method for calculating the received intensity of multi-path millimeter waves transmitted over an undulating surface. First, an integral expression of the received intensity is derived using a physical optics approximation. Then its zero-th order asymptotic expression is derived, using the Pearcey integral, for the case where the phase function appearing in the integrand can be approximated by a quartic polynomial. A numerical examination made at 59.5 GHz showed that the asymptotic method is in good agreement with the physical optics method, even in cases where the geometrical optics method deviates significantly from the physical optics method, and that the range of applicability of the asymptotic method has its upper bound somewhere around a transmission distance to surface undulation wavelength ratio of 2.

In this letter, the reliabilty of the generalized normal-Laplace (GNL) distribution used for modeling the multiple access interference (MAI) plus noise in time-hopping (TH) binary phase-shift keying (BPSK) ultra-wideband (UWB) systems is evaluated in terms of the probability density function and the BER. The multiple access performance of TH-BPSK UWB systems based on GNL model is analyzed. The average BER performance obtained by using GNL approximation well matches with the exact BER results of TH-BPSK UWB systems. The parameter estimates of GNL distribution based on the moments estimation method is also presented.

This paper proposes a novel hallucination technique for color face image reconstruction in the RGB, YCbCr, HSV and CIELAB color systems. Our hallucination method depends on multilinear principal component analysis (MPCA) with a linear regression model. In the hallucination framework, many color face images are expressed in color spaces. These images can be naturally described as tensors or multilinear arrays. This novel hallucination technique can perform feature extraction by determining a multilinear projection that captures most of the original tensorial input variation. In our experiments, we used facial images from the FERET database to test our hallucination approach which is demonstrated by extensive experiments with high-quality hallucinated color face images. The experimental results show that a correlation between the color channel and the proposed hallucination method can reduce the complexity in the color face hallucination process.