A multiband monopole antenna with modified fractal loop parasitic is presented. Especially, bow-tie stubs and a modified fractal loop are attached to the sides and bottom of a strip line monopole antenna, respectively, in order to generate the multi-resonant frequencies for the applications of wireless communication systems. The characteristics of the presented antenna have been examined by using the simulation software. The comparison between the simulated and measured results confirms the good agreement. The results show good multiband operation with 10 dB impedance bandwidths of 15.55%, 8.75%, and 31.94% at the resonant frequencies of 1.8 GHz, 2.4 GHz, and 3.6 GHz, respectively, which cover the operating band applications of DCS 1800, WLAN (IEEE802.11 b/g), WiMAX, and IMT advanced system (4G mobile communication system).

This paper proposes a differential fault analysis on the stream cipher MUGI, which uses two kinds of update functions of an intermediate state. MUGI was proposed by Hitachi, Ltd. in 2002 and is specified as ISO/IEC 18033-4 for keystream generation. Differential fault analysis (DFA) is a type of fault analysis, which is considered to be a serious threat against secure devices such as smart cards. DFA on MUGI was first proposed at ICISC 2010 [25]; however, the attack condition for the successful attack such as the position into which the fault is injected was restricted. In this paper, we extend the attack methods which are more practical, based on a one-byte and a multi-byte fault models using the relationship between two kinds of update functions that are mutually dependent. In the proposed attack, the attacker can know the position affected by the fault injection even if he has no control of the timing of the fault injection. As a result, a 128-bit secret key can be recovered using 13 pairs of correct and faulty outputs on average.

This paper presents a folded surface detection and tracking method for augmented maps. First, we model a folded surface as two connected planes. Therefore, in order to detect a folded surface, the plane detection method is iteratively applied to the 2D correspondences between an input image and a reference plane. In order to compute the exact folding line from the detected planes for visualization purpose, the intersection line of the planes is computed from their positional relationship. After the detection is done, each plane is individually tracked by the frame-by-frame descriptor update method. We overlay virtual geographic data on each detected plane. As scenario of use, some interactions on the folded surface are introduced. Experimental results show the accuracy and performance of folded surface detection for evaluating the effectiveness of our approach.

The continuous advances in sensing and positioning technologies have resulted in a dramatic increase in popularity of Location-Based Services (LBS). Nevertheless, the LBS can lead to user privacy breach due to sharing location information with potentially malicious services. A high degree of location privacy preservation for LBS is extremely required. In this paper, a clustering K-anonymity scheme for location privacy preservation (namely CK) is proposed. The CK scheme does not rely on a trusted third party to anonymize the location information of users. In CK scheme, the whole area that all the users reside is divided into clusters recursively in order to get cloaked area. The exact location information of the user is replaced by the cloaked spatial temporal boundary (STB) including K users. The user can adjust the resolution of location information with spatial or temporal constraints to meet his personalized privacy requirement. The experimental results show that CK can provide stringent privacy guarantees, strong robustness and high QoS (Quality of Service).

This paper proposes an adaptive algorithm for adaptive arrays that minimizes the bit error rate (BER) of the array output signals in radio communication systems with the use of multilevel modulation signals. In particular, amplitude phase shift keying (APSK) is used as one type of multilevel modulations in this paper. Simultaneous non-linear equations that are satisfied by the optimum weight vector of the proposed algorithm are derived and used for theoretical analyze of the performance of the adaptive array based on the proposed algorithm. As a result of the theoretical analysis, it can be shown that the proposed adaptive array improves the carrier to interference ratio of the array output signal without taking advantage of the nulls. Furthermore, it is confirmed that the result of the theoretical analysis agrees with that of computer simulation. When the number of the received antenna is less than that of the received signals, the adaptive array based on the proposed algorithm is verified to achieve much better performance then that based on the least mean square (LMS) algorithm.

A 20 kHz audio-band ADC with a single pair of power and ground pads is implemented for a digital electret microphone. Under the limited power/ground pad condition, the switching noise effect on the signal quality is estimated via post simulations with parasitic models. Performance degradation is minimized by time-domain noise isolation with sufficient time-spacing between the sampling edge and the output transition. The prototype ADC was implemented in a 0.18 µm CMOS process. It operates under a minimum supply voltage of 1.6 V with total current of 420 µA. Operating at 2.56 MHz clock frequency, it achieves 84 dB dynamic range and a 64 dB peak signal-to-(noise+distortion) ratio. The measured power supply rejection at a 100 mVpp 217 Hz square wave is -72 dB.

We introduce a novel method to optimize field decomposition for a mode matching technique. Using our method, expanded mode numbers can be minimized to achieve the desired digits of computational accuracy.

Recently, a novel approach to color image compression based on colorization has been presented. The conventional method for colorization-based image coding tends to lose the local oscillation of chrominance components that the original images had. A large number of color assignments is required to restore these oscillations. On the other hand, previous studies suggest that an oscillation of a chrominance component correlates with the oscillation of a corresponding luminance component. In this paper, we propose a new colorization-based image coding method that utilizes the local correlation between texture components of luminance and chrominance. These texture components are obtained by a total variation regularized energy minimization method. The local correlation relationships are approximated by linear functions, and their coefficients are extracted by an optimization method. This key idea enables us to represent the oscillations of chrominance components by using only a few pieces of information. Experimental results showed that our method can restore the local oscillation and code images more efficiently than the conventional method, JPEG, or JPEG2000 at a high compression rate.

In this paper, a simple type of printed dipole is proposed for Multi-Input Multi-Output (MIMO) applications in cognitive radio. The antenna is composed of a transmission line and a dipole. Some examinations of key factors and optimized parameters of the antenna are presented. The measured results illustrate that the proposed antenna offers a bandwidth of over 50% for Voltage Standing Wave Ratio (VSWR) less than 2, extending from 2.4 GHz to 4.0 GHz. The antenna peak gain in E-plane and radiation patterns at different frequencies are also explored. In addition, based on the proposed antenna, we introduce two simple broadband arrays for MIMO applications in cognitive radio. One has two ports and the other has four ports. Measurement results indicate that the arrays also work in a broad bandwidth. Mutual couplings between ports in each array are kept under -10 dB at the low frequencies and under -20 dB at the high frequencies of bandwidth of the arrays. Furthermore, we utilized the antenna arrays for some MIMO experiments to estimate the channel capacity in a wide frequency range.

Recently, social network services are rapidly growing and this trend is expected to continue in the future. Social network data can be published for various purposes such as statistical analysis and population studies. When social network data are published, however, the privacy of some people may be disclosed. The most straightforward manner to preserve privacy in social network data is to remove the identifiers of persons from the social network data. However, an adversary can infer the identity of a person in the social network by using his/her background knowledge, which consists of content information such as the age, sex, or address of the person and structural information such as the number of persons having a relationship with the person. In this paper, we propose a privacy protection method for social network data. The proposed method anonymizes social network data to prevent privacy attacks that use both content and structural information, while minimizing the information loss or distortion of the anonymized social network data. Through extensive experiments, we verify the effectiveness and applicability of the proposed method.

Equivalent Transmission Path (ETP) model-based BER map method was proved to be used in fast estimating Bit Error Rate (BER) of Single-Input Single-Output Orthogonal Frequency Division Multiplexing (SISO-OFDM) system, where the delay spreading exceeds the guard interval. In this paper, we propose a method for evaluating transmission characteristics of Single-Input Multiple-Output Orthogonal Frequency Division Multiplexing (SIMO-OFDM) system with application to maximum ratio combining diversity at the reception. The simulation results show that the proposed approximation method is able to be used in estimating trasmission characteristics with high accuracy not only for SISO-OFDM system but also for SIMO-OFDM system.

We study joint rate control and resource allocation with a packet collision constraint that maximizes the total utility of secondary users in cognitive radio networks. We formulate and decouple the original optimization problem into separable subproblems and then develop an algorithm that converges to optimal rate control and resource allocation. The proposed algorithm can operate on different time-scales to reduce the amortized time complexity.

A new frequency estimator for a single real-valued sinusoid signal in white noise is proposed. The new estimator uses the Pisarenko Harmonic Decomposer (PHD) estimator to get a coarse frequency estimate and then makes use of multiple correlation lags to obtain an adjustment term. For the limited-length single sinusoid, its correlation has the same frequency as itself but with a non-zero phase. We propose to use Taylor series to expand the correlation at the PHD coarse estimated frequency with amplitude and phase of the correlation into consideration. Simulation results show that this new method improves the estimation performance of the PHD estimator. Moreover, when compared with other existing estimator, the mean square frequency error of the proposed method is closer to the Cramer-Rao Lower Bound (CRLB) for certain SNR range.

An adaptive and iterative intertrack-interference (ITI) cancelling scheme is described for multi-track signal detection in inter-track asynchronous shingled write magnetic recording. There is write-clock frequency drift in asynchronous recording systems. Read-back signals obtained with a wide read head scanning narrow tracks thus suffer from not only intersymbol interference (ISI) but also time-variant ITI. To efficiently cope with static ISI and time-variant ITI, multi-track soft interference cancellers and two-dimensional partial-response filters are incorporated based on per-survivor processing into each trellis state defined in a one-dimensional/two-dimensional trellis-switching max-log-MAP detector. In addition, the computational complexity can be reduced based on channel interpolation and intermittent TDPR-filter control by allowing small degradation in signal detection. Computer simulation results in media-noise-dominant environments demonstrate that the proposed adaptive and iterative ITI canceller achieves bit error rates close to those obtained in a non-ITI case when the read-head off-track ratio is up to 50% in write-clock frequency difference of 0.02%.

This brief paper proposes a method for calibration of GPR pulse waveforms that is effective for identification of buried objects in the ground and/or in concrete structures. This approach is based on the inverse filtering operation that eliminates the influence of GPR antenna characteristics, and a response from a flat metal plate is employed as a reference data for calibration. In order to evaluate the effectiveness of this approach, it is applied to actual experimental data measured by the UWB-GPR antennas. The results show the validity of the method and importance of the waveform calibration for target identification.

An inter-vehicle communication system for the 720 MHz band that is designed to prevent car crashes at intersections has recently been proposed in Japan. This paper presents an analysis of the propagation characteristics of an intersection surrounded by concrete block walls in a residential area. The propagation characteristics were analyzed for the first time using the finite-difference time-domain (FDTD) method. We investigated the influence of wall thickness and source locations on the propagation characteristics. The results of our investigation showed that the most commonly used wall thickness and source locations do not strongly affect propagation loss. Furthermore, we analyzed the power delay profile and delay spread by taking into consideration the structure of the concrete block walls.

This paper deals with the diffraction of a transverse magnetic (TM) plane wave by a perfectly conductive periodic surface by an integral method. However, it is known that a conventional integral method does not work for a critical angle of incidence, because of divergence of a periodic Green's function (integral kernel). To overcome such a divergence difficulty, we introduce an image Green's function which is physically defined as a field radiated from an infinite phased array of dipoles. By use of the image Green's function, it is newly shown that the diffracted field is represented as a sum of radiation from the periodic surface and its image surface. Then, this paper obtains a new image integral equation for the basic surface current, which is solved numerically. A numerical result is illustrated for a very rough sinusoidal surface. Then, it is concluded that the method of image Green's function works practically even at a critical angle of incidence.

An inductorless low noise amplifier (LNA) with active balun for digital TV (DTV) applications is presented. The LNA exploits a noise cancellation technique which allows for simultaneous wide-band impedance matching and low noise design. The matching and amplifier stages in the LNA topology perform single-ended to differential signal conversion with balanced output. The second and third-order nonlinearity of the individual amplifiers as well as the distortion caused by the interaction between the stages are suppressed to achieve high IIP2 and IIP3. A method for intrinsic cancellation of the second-order interaction is employed to reduce the dependence of the IIP3 on the frequency spacing between the interfering signals in the two-tone test of DTV tuners. Fabricated in a 0.18 µm CMOS technology, the LNA core size is 0.21 mm2. Measurements show that the LNA IIP3 and IIP2 are +12 dBm and +21 dBm, respectively. The IIP3 variation is less than 5 dB in the 10 MHz to 200 MHz frequency spacing range. A voltage gain of 14.5 dB and a noise figure below 4 dB are achieved in a frequency range from 100 MHz to 1 GHz. The LNA consumes 11 mA from a 1.8 V supply voltage.

Even though meet-in-the-middle preimage attack framework has been successfully applied to attack most of narrow-pipe hash functions, it seems difficult to apply this framework to attack double-branch hash functions. Only few results have been published on this research. This paper proposes a refined strategy of applying meet-in-the-middle attack framework to double-branch hash functions. The main novelty is a new local-collision approach named one-message-word local collision. We have applied our strategy to two double-branch hash functions RIPEMD and RIPEMD-128, and obtain the following results.·On RIPEMD. We find a pseudo-preimage attack on 47-step compression function, where the full version has 48 steps, with a complexity of 2119. It can be converted to a second preimage attack on 47-step hash function with a complexity of 2124.5. Moreover, we also improve previous preimage attacks on (intermediate) 35-step RIPEMD, and reduce the complexity from 2113 to 296. ·On RIPEMD-128. We find a pseudo-preimage on (intermediate) 36-step compression function, where the full version has 64 steps, with a complexity of 2123. It canl be converted to a preimage attack on (intermediate) 36-step hash function with a complexity of 2126.5. Both RIPEMD and RIPEMD-128 produce 128-bit digests. Therefore our attacks are faster than the brute-force attack, which means that our attacks break the theoretical security bound of the above step-reduced variants of those two hash functions in the sense of (second) preimage resistance. The maximum number of the attacked steps on both those two hash functions is 35 among previous works based to our best knowledge. Therefore we have successfully increased the number of the attacked steps. We stress that our attacks does not break the security of full-version RIPEMD and RIPEMD-128. But the security mergin of RIPEMD becomes very narrow. On the other hand, RIPEMD-128 still has enough security margin.

This article presents an algorithm that solves an on-line version of the longest common subsequence (LCS) problem for two strings over a constant alphabet in O(d+n) time and O(m+d) space, where m is the length of the shorter string, the whole of which is given to the algorithm in advance, n is the length of the longer string, which is given as a data stream, and d is the number of dominant matches between the two strings. A new upper bound, O(p(m-q)), of d is also presented, where p is the length of the LCS of the two strings, and q is the length of the LCS of the shorter string and the m-length prefix of the longer string.