A semi-coherent technique for low-complexity frequency offset estimation is presented. The proposed estimation is based on discrete-time Fourier transform (DTFT). Since residual frequency offset can be compensated by channel estimation, frequency offset can be estimated only coarsely. We take advantage of the relationship between frequency resolution and accumulation period in DTFT in deriving the coarse estimator. Based on that, a novel method to balance the coherent and the non-coherent accumulation for frequency offset estimation is proposed. The proposed algorithm has low latency and complexity so that it is particularly suitable for packet traffic. The semi-coherent structure of the proposed algorithm is also scalable so that it can be used for both bursty and continuous traffic.

In this paper, a fiber with two inhomogeneous sector holes around the core is proposed, and propagation characteristics of polarization maintaining region and single-polarization region are numerically analyzed by circular Fourier expansion method. In each case of the single-polarization region and the polarization maintaining region, a fiber is designed so as to satisfy the zero total dispersion at wavelength of 1.55 µm. Then, the single-polarization bandwidth for the single-polarization region and the modal birefringence for the polarization maintaining region are examined as the specific characteristics in each region. In addition, the power concentrating into the core region and distributions of Poynting vector is also discussed.

In this letter, a novel blind CFO estimation algorithm for the uplink of an OFDMA system is proposed. The proposed method exploits the inherent redundant information in OFDMA symbols and does not require additional pilot or preamble overhead. Since it is a post-FFT estimator, it does not use filter banks to separate the desired user's signal from the others in the time domain. Hence, the subcarriers of a certain user are not restricted to be clustered in the frequency domain. Therefore, the proposed estimator can be applied to OFDMA systems with an arbitrary subcarrier assignment over the entire bandwidth, including IEEE 802.16e, to obtain sufficient frequency diversity in a frequency selective fading channel. The proposed method can be efficiently used for continuous tracking of all active users' CFOs only with two FFT windows within a single OFDM symbol. From simulation results, the performance of the proposed scheme is shown better than that uses preamble symbols.

This paper presents an RK-means clustering algorithm which is developed for reliable data grouping by introducing a new reliability evaluation to the K-means clustering algorithm. The conventional K-means clustering algorithm has two shortfalls: 1) the clustering result will become unreliable if the assumed number of the clusters is incorrect; 2) during the update of a cluster center, all the data points belong to that cluster are used equally without considering how distant they are to the cluster center. In this paper, we introduce a new reliability evaluation to K-means clustering algorithm by considering the triangular relationship among each data point and its two nearest cluster centers. We applied the proposed algorithm to track objects in video sequence and confirmed its effectiveness and advantages.

In this paper, we propose a soft decision based cooperative sensing method for cognitive radio (CR) networks for opportunistic frequency usage. To identify unused frequency, CR should exploit sensing technique to detect presence or absence of primary user and use this information to opportunistically provide communication among secondary users while performance of primary user should not be deteriorated by the secondary users. Because of multipath fading or shadowing, the detection of primary users may be significantly difficult. For this problem, cooperative sensing (CS), where gathered observations obtained by multiple secondary users is utilized to achieve higher performance of detection, has been investigated. We design a soft decision based CS analytically and analyze the detector in several situations, i.e., signal model where single-carrier case and multi-carrier case are assumed and two scenarios; in the first scenario, SNR values of secondary users are totally equal and in the second scenario, a certain SNR difference between secondary users is assumed. We present numerical results as follows. The first scenario shows that there is little difference between the signal models in terms of detection performance. The second scenario shows that CS is superior to non-cooperative sensing. In addition, we presents that detection performance of soft decision based CS outperform detection performance of hard decision based CS.

A technique for suppressing the clipping noise of an analogue-to-digital converter (ADC) is proposed to realize a cognitive radio transceiver that offers high sensitivity carrier-sensing. When a large bandwidth cognitive radio transceiver performs carrier-sensing, it must receive a radio wave that includes many primary user transmissions. The radio wave may have high peak-to-average power ratio (PAPR) and clipping noise may be generated. Clipping noise becomes an obstacle to the achievement of high-sensitivity carrier-sensing. In the proposed technique, the original values of the samples clipped by an ADC are estimated by interpolation. Polynomial spline interpolation to the clipped signal is performed in the first step, and then SINC function interpolation is applied to the spline interpolated signal. The performance was evaluated using the signals with various PAPR. It has been found that suppression performance has a dependency on the number of samples clipped at once rather than on PAPR. Although there is an upper limit for the number of samples clipped at once that can be compensated with high accuracy, about 20 dB suppression of clipping noise was achieved with the medium degree of clipping.

This paper describes a smart thermal sensing chip with an integrated vertical bipolar transistor sensor, a Sigma Delta Modulator (SDM), a Micro-Control Unit (MCU), and a bandgap reference voltage generator for biomedical application by using 0.18 µm CMOS process. The npn bipolar transistors with the Deep N-Well (DNW) instead of the pnp bipolar transistor is first adopted as the sensor for good isolation from substrate coupling noise. In addition to data compression, Micro-Control Unit (MCU) plays an important role for executing auto-calibration by digitally trimming the bipolar sensor in parallel to save power consumption and to reduce feedback complexity. It is different from the present analog feedback calibration technologies. Using one sensor, instead of two sensors, to create two differential signals in 180phase difference input to SDM is also a novel design of this work. As a result, in the range of 0 to 80 or body temperature (375), the inaccuracy is less than 0.1 or 0.05 respectively with one-point calibration after packaging. The average power consumption is 268.4 µW with 1.8 V supply voltage.

A novel Uniform Discrete Multitone (DMT) transceiver is proposed, utilizing a wavelet packet based filter bank transmultiplexer in conjunction with a DMT transceiver. The proposed transceiver decomposes the channel spectrum into subbands of equal bandwidth. The objective is to minimize the bit error rate (BER), which is increased by channel-noise amplification. This noise amplification is due to the Zero-Forcing equalization (ZFE) technique. Quantization of the channel-noise amplification is presented, based on post-equalization signal-to-noise ratio (SNR) and probability of error in all subbands of the Uniform DMT system. A modified power loading algorithm is applied to allocate variable power according to subband gains. A BER performance comparison of the Uniform DMT with variable and uniform power-loading and with a conventional DMT system in a Digital Subscriber Line (DSL) channel is presented.

We propose a query language based on extended regular expressions. This language extends texts with text-generating macros. These macros make it possible to define languages in a compressed, elegant way. This paper also extends queries with linear implications and additive (classical) conjunctions. To be precise, it allows goals of the form D —ο G and G1&G2 where D is a text or a macro and G is a query. The first goal is solved by adding D to the current text and then solving G. This goal is flexible in controlling the current text dynamically. The second goal is solved by solving both G1 and G2 from the current text. This goal is particularly useful for internet search.

In this paper we analyze the characteristics of vehicle mobility and propose a novel Mobility Prediction Progressive Routing (MP2R) protocol for Inter-Vehicle Communication (IVC) that is based on cross-layer design. MP2R utilizes the additional gain provided by the directional antennas to improve link quality and connectivity; interference is reduced by the directional transmission. Each node learns its own position and speed and that of other nodes, and performs position prediction. (i) With the predicted progress and link quality, the forwarding decision of a packet is locally made, just before the packet is actually transmitted. In addition the load at the forwarder is considered in order to avoid congestion. (ii) The predicted geographic direction is used to control the beam of the directional antenna. The proposed MP2R protocol is especially suitable for forwarding burst traffic in highly mobile environments. Simulation results show that MP2R effectively reduces Packet Error Ratio (PER) compared with both topology-based routing (AODV [1], FSR [2]) and normal progressive routing (NADV [18]) in the IVC scenarios.

A concurrent model of computation and a language based on the model for bit-level operation are useful for developing asynchronous and concurrent programs compositionally, which frequently use bit-level operations. Some examples are programs for video games, hardware emulation (including virtual machines), and signal processing. However, few models and languages are optimized and oriented to bit-level concurrent computation. We previously developed a visual programming language called A-BITS for bit-level concurrent programming. The language is based on a dataflow-like model that computes using processes that provide serial bit-level operations and FIFO buffers connected to them. It can express bit-level computation naturally and develop compositionally. We then devised a concurrent computation model called APEC (Asynchronous Program Elements Connection) for bit-level concurrent computation. This model enables precise and formal expression of the process of computation, and a notion of primitive program elements for controlling and operating can be expressed synthetically. Specifically, the model is based on a notion of uniform primitive processes, called primitives, that have three terminals and four ordered rules at most, as well as on bidirectional communication using vehicles called carriers. A new notion is that a carrier moving between two terminals can briefly express some kinds of computation such as synchronization and bidirectional communication. The model's properties make it most applicable to bit-level computation compositionally, since the uniform computation elements are enough to develop components that have practical functionality. Through future application of the model, our research may enable further research on a base model of fine-grain parallel computer architecture, since the model is suitable for expressing massive concurrency by a network of primitives.

In this paper we propose an algorithm of factoring any integer N which has k different prime factors with the same bit-length, when about ()log2 N high-order bits of each prime factor are given. For a fixed ε, the running time of our algorithm is heuristic polynomial in (log2 N). Our factoring algorithm is based on a lattice-based algorithm of solving any k-variate polynomial equation over Z, which might be an independent interest.

Human's ability to perceive elevation of a sound and distinguish whether a sound is coming from the front or rear strongly depends on the monaural spectral features of the pinnae. In order to realize an effective virtual auditory display by HRTF (head-related transfer function) customization, the pinna responses were isolated from the median HRIRs (head-related impulse responses) of 45 individual HRIRs in the CIPIC HRTF database and modeled as linear combinations of 4 or 5 basic temporal shapes (basis functions) per each elevation on the median plane by PCA (principal components analysis) in the time domain. By tuning the weight of each basis function computed for a specific height to replace the pinna response in the KEMAR HRIR at the same height with the resulting customized pinna response and listening to the filtered stimuli over headphones, 4 individuals with normal hearing sensitivity were able to create a set of HRIRs that outperformed the KEMAR HRIRs in producing vertical effects with reduced front/back ambiguity in the median plane. Since the monaural spectral features of the pinnae are almost independent of azimuthal variation of the source direction, similar vertical effects could also be generated at different azimuthal directions simply by varying the ITD (interaural time difference) according to the direction as well as the size of each individual's own head.

Various wireless systems are being developed to meet users' needs, and the rapid increase in frequency demand that accompanies the increasing popularity of wireless services means that more effective use of frequency resources is urgently needed. However, existing base stations are making no effort to use frequency resources effectively, and cooperation among wireless system base stations is needed to use frequency resources more effectively. Base stations can cooperate more efficiently if they are able to use multiple channels of many wireless systems simultaneously. We propose an autonomous adaptive base station (AABS) that can switch among various wireless systems the way software defined radio (SDR) base stations do. AABS can autonomously select and use the most suitable wireless system on the basis of user traffic and its hardware resources. Moreover, frequency resources are used effectively because AABS prevents unnecessary radio wave transmission when the number of users in the wireless systems decreases. AABS is also suitable for "multi-link communication" because it can use multiple channels of multiple wireless systems simultaneously. We developed AABS prototype and evaluated its performance. Our experimental and computer simulation results show the performance of AABS and its efficiency.

In this letter, we propose an efficient resource allocation scheme that improves the system performance by reducing the signaling overhead for voice over Internet protocol (VoIP) services in the IEEE 802.16e OFDMA system. We theoretically analyze the performance of the proposed allocation scheme and carry out a computer simulation to evaluate the FA scheme.

We focus on the relationship between the linearization method and linear complexity and show that the linearization method is another effective technique for calculating linear complexity. We analyze its effectiveness by comparing with the logic circuit method. We compare the relevant conditions and necessary computational cost with those of the Berlekamp-Massey algorithm and the Games-Chan algorithm. The significant property of a linearization method is that it needs no output sequence from a pseudo-random number generator (PRNG) because it calculates linear complexity using the algebraic expression of its algorithm. When a PRNG has n [bit] stages (registers or internal states), the necessary computational cost is smaller than O(2n). On the other hand, the Berlekamp-Massey algorithm needs O(N2) where N ( 2n) denotes period. Since existing methods calculate using the output sequence, an initial value of PRNG influences a resultant value of linear complexity. Therefore, a linear complexity is generally given as an estimate value. On the other hand, a linearization method calculates from an algorithm of PRNG, it can determine the lower bound of linear complexity.

Recently Tate pairing and its variations are attracted in cryptography. Their operations consist of a main iteration loop and a final exponentiation. The final exponentiation is necessary for generating a unique value of the bilinear pairing in the extension fields. The speed of the main loop has become fast by the recent improvements, e.g., the Duursma-Lee algorithm and ηT pairing. In this paper we discuss how to enhance the speed of the final exponentiation of the ηT pairing in the extension field F36n. Indeed, we propose some efficient algorithms using the torus T2(F33n) that can efficiently compute an inversion and a powering by 3n + 1. Consequently, the total processing cost of computing the ηT pairing can be reduced by 16% for n=97.

In this paper, we propose a leakage-resilient and proactive authenticated key exchange (called LRP-AKE) protocol for credential services which provides not only a higher level of security against leakage of stored secrets but also secrecy of private key with respect to the involving server. And we show that the LRP-AKE protocol is provably secure in the random oracle model with the reduction to the computational Diffie-Hellman problem. In addition, we discuss about some possible applications of the LRP-AKE protocol.

In this paper, an evolutionary approach is proposed to obtain a discrete-time state-space interval model for uncertain continuous-time systems having interval uncertainties. Based on a worst-case analysis, the problem to derive the discrete interval model is first formulated as multiple mono-objective optimization problems for matrix-value functions associated with the discrete system matrices, and subsequently optimized via a proposed genetic algorithm (GA) to obtain the lower and upper bounds of the entries in the system matrices. To show the effectiveness of the proposed approach, roots clustering of the characteristic equation of the obtained discrete interval model is illustrated for comparison with those obtained via existing methods.

This paper proposes a novel Orthogonal frequency-division multiplexing (OFDM) system based on polynomial cancellation coded OFDM (PCC-OFDM). This proposed system can reduce peak-to-average power ratio (PAPR) by our neural phase rotator and it does not need any side information to transmit phase rotation factors. Moreover, this system can compensate the common phase error (CPE) by a proposed technique which allows estimating frequency offset at receiver. From numerical experiments, it is shown that our system can reduce PAPR and ICI at the same time and improve BER performance effectively.