The RFID (Radio Frequency IDentification) tag technology is expected as a tool of localization. By the localization of RFID tags, a mobile robot which installs in RFID readers can recognize surrounding environments. In addition, RFID tags can be applied to a navigation system for walkers. In this paper, we propose an adaptive likelihood distribution scheme for the localization of RFID tags. This method adjusts the likelihood distribution depending on the signal intensity from RFID tags. We carry out the performance evaluation of estimated position error by both computer simulations and implemental experiments. We show that the proposed system is more effective than the conventional system.

The present paper introduces the construction of a class of sequence sets with zero-correlation zones called zero-correlation zone sequence sets. The proposed zero-correlation zone sequence set can be generated from an arbitrary perfect sequence and an arbitrary Golay complementary sequence pair. The proposed construction is a generalization of the zero-correlation zone sequence construction previously reported by the present author. The proposed sequence set can successfully provide CDMA communication without co-channel interference.

This paper proposes a closed form solution to L2-sensitivity minimization of second-order state-space digital filters subject to L2-scaling constraints. The proposed approach reduces the constrained optimization problem to an unconstrained optimization problem by appropriate variable transformation. Furthermore, restricting ourselves to the case of second-order state-space digital filters, we can express the L2-sensitivity by a simple linear combination of exponential functions and formulate the L2-sensitivity minimization problem by a simple polynomial equation. As a result, L2-sensitivity is expressed in closed form, and its minimization subject to L2-scaling constraints is achieved without iterative calculations.

Orthogonal frequency-division multiplexing (OFDM) is an attractive transmission technique for high-bit-rate communication systems. One major drawback of OFDM is the high peak-to-average power ratio (PAPR) of the transmitted signal. This study introduces a low-complexity selected mapping (SLM) OFDM scheme based on discrete Fourier transform (DFT) constellation-shaping. The DFT-based constellation-shaping algorithm applied with conventional SLM scheme usually requires a bank of DFT-shaping matrices to generate low-correlation constellation sequences and a bank of inverse fast Fourier transforms (IFFTs) to generate a set of candidate transmission signals, and this process usually results in high computational complexity. Therefore, a sparse matrix algorithm with low-complexity is proposed to replace the IFFT blocks and the DFT-shaping blocks in the proposed DFT constellation-shaping SLM scheme. By using the proposed sparse matrix, the candidate transmission signal with the lowest PAPR can be achieved with lower complexity than that of the conventional SLM scheme. The complexity analysis of the proposed algorithm shows great an improvement in the reduction of the number of multiplications. Moreover, this new low-complexity technique offers a PAPR that is significantly lower than that of the conventional SLM without any loss in terms of energy and spectral efficiency.

This paper studies packet scheduling schemes with QoE (user-level QoS) guarantee for audio-video transmission in a wireless LAN with HCF controlled channel access (HCCA) of the IEEE 802.11e MAC protocol. We first propose the static scheduling (SS) scheme, which grants adjustable transmission opportunity (TXOP) duration for constant bit rate (CBR) traffic. The SS scheme can determine the minimum TXOP duration capable of guaranteeing high QoE; it can maximize the number of admitted flows. As the burstiness of variable bit rate (VBR) traffic cannot be absorbed by the SS scheme, we also propose the multimedia priority dynamic scheduling (MPDS) scheme, which can absorb the burstiness through allocating additional TXOP duration. We then compare the SS scheme, the MPDS scheme, and the reference scheduler (TGe scheme) in terms of application-level QoS and user-level QoS (QoE). Numerical results show that in the SS scheme, the QoE can be kept relatively higher even when the TXOP duration is reduced in the case of video with the I picture pattern; this implies that more flows can be admitted. In the case of video with the IPPPPP picture pattern, which has the VBR characteristic more remarkably, reducing the TXOP duration according to the SS scheme will deteriorate the QoS level. In this case, the MPDS scheme performs better when the number of multimedia stations is small. However, the performance of the MPDS scheme deteriorates with the increase of the number of multimedia stations, though the results are comparable to or even better than those of the SS and TGe schemes.

In this letter, we address a carrier frequency offset (CFO) estimator with a large estimation range for ultra-wideband multi-band orthogonal frequency division multiplexing (UWB MB-OFDM) systems. We find by simulations that the proposed CFO estimator yields an improved estimation range, maintaining the same estimation performance and complexity in comparison with the conventional estimator.

In mobile communication systems, high speed packet data services are demanded. In the high speed data transmission, throughput degrades severely due to severe inter-path interference (IPI). Recently, we proposed a random transmit power control (TPC) to increase the uplink throughput of DS-CDMA packet mobile communications. In this paper, we apply IPI cancellation in addition to the random TPC. We derive the numerical expression of the received signal-to-interference plus noise power ratio (SINR) and introduce IPI cancellation factor. We also derive the numerical expression of system throughput when IPI is cancelled ideally to compare with the Monte Carlo numerically evaluated system throughput. Then we evaluate, by Monte-Carlo numerical computation method, the combined effect of random TPC and IPI cancellation on the uplink throughput of DS-CDMA packet mobile communications.

This paper presents a technology for short-range communications using sound wave, in which the modulated data signal can be transmitted in parallel with regular audio without significantly degrading the quality of the sound. The technology, which we call Acoustic OFDM, replaces the high frequency band of the audio signal with OFDM carriers, each of which is power-controlled according to the spectrum envelope of the original audio signal. It can provide data transmission of several hundreds bps. The implemented Acoustic OFDM system enables the transmission of short text messages from loud speakers to mobile devices at a distance of around 3 m.

A key issue in QoS-provisioning real-time wireless communications is to provide the QoS requirement with low energy consumption. In this paper, we propose an energy-efficient error correction scheme for real-time communications with QoS requirements in wireless networks. The QoS requirement of a message stream is modeled with (m, k) constraint, implying that at least m messages should be sent to a receiver during any window of k periods. The proposed scheme adaptively selects an error correcting code in an energy-efficient manner so that it maximizes the number of QoS provisionings per unit energy consumption.

This paper studies the rotation map with a controlling segment. As a parameter varies, the map exhibits superstable periodic orbits, chaos and rich bifurcation phenomena. The map is applicable to an A/D converter having efficient resolution characteristics. The converter can be realized as a circuit model based on a spiking neuron and the rate-coding. Presenting a test circuit, basic operation is confirmed experimentally.

On the basis of the RF characteristics of p-type diamond field-effect transistors (FETs) with hydrogen surface termination, we establish an equivalent circuit (EQC) model. From comparisons of three cases we reveal that to represent the device performance in the EQC, the source, gate, and drain resistance should be considered but that the gate-source and gate-drain resistance can be ignored. The features of diamond FETs are (1) a plateau of the gate capacitance in a certain gate voltage range. (2) maximum fT and fMAX cut-off frequencies near the threshold gate voltage, and (3) a high fMAX/fT ratio 3.8. We discuss these features in terms of the energy barrier between the gate metal and the two-dimensional hole channel and drift region below the gate.

A reversible watermark algorithm with large capacity has been developed by applying the difference expansion of a generalized integer transform. In this algorithm, a watermark signal is inserted in the LSB of the difference values among pixels. In this paper, we apply the prediction errors calculated by a predictor in JPEG-LS for embedding watermark, which contributes to increase the amount of embedded information with less degradation. As one of the drawbacks discovered in the above conventional method is the large size of the embedded location map introduced to make it reversible, we decrease the large size of the location map by vectorization, and then modify the composition of the map using the local characteristics. We also exclude the positions such that the modification in the embedding operation cannot increase the capacity but merely degrade the image quality, which can be applicable to the conventional methods.

This paper presents a VLSI architecture of MMSE detection in a 44 MIMO-OFDM receiver. Packet-based MIMO-OFDM imposes a considerable throughput requirement on the matrix inversion because of strict timing in frame structure and subcarrier-by-subcarrier basis processing. Pipeline processing oriented algorithms are preferable to tackle this issue. We propose a pipelined MMSE detector using Strassen's algorithms of matrix inversion and multiplication. This circuit achieves real-time operation which does not depend on numbers of subcarriers. The designed circuit has been implemented to a 90-nm CMOS process and shows a potential for providing a 2.6-Gbps transmission speed in a 160-MHz signal bandwidth.

Using Bloom filters is one of the most popular and efficient lookup methods in P2P networks. A Bloom filter is a representation of data item indices, which achieves small memory requirement by allowing one-sided errors (false positive). In the lookup scheme besed on the Bloom filter, each peer disseminates a Bloom filter representing indices of the data items it owns in advance. Using the information of disseminated Bloom filters as a clue, each query can find a short path to its destination. In this paper, we propose an efficient extension of the Bloom filter, called a Deterministic Decay Bloom Filter (DDBF) and an index dissemination method based on it. While the index dissemination based on a standard Bloom filter suffers performance degradation by containing information of too many data items when its dissemination radius is large, the DDBF can circumvent such degradation by limiting information according to the distance between the filter holder and the items holders, i.e., a DDBF contains less information for faraway items and more information for nearby items. Interestingly, the construction of DDBFs requires no extra cost above that of standard filters. We also show by simulation that our method can achieve better lookup performance than existing ones.

We describe a practical and precise calibration method for generating a top view image that is transformed so that a planar object such as the road can be observed from a direction perpendicular to its surface. The geometric relation between the input and output images is described by a 3 3 homography matrix. Conventional methods use large planar calibration patterns to achieve precise transformations. The proposed method uses much smaller element patterns that are placed in arbitrary positions within the view of the camera. One of the patterns is used to obtain an initial homography. Then, the information from all of the patterns is used by a non-linear optimization scheme to reach a global optimum homography. The experiment done to evaluate the method showed that the precision of the proposed method is comparable to that of the conventional method where a large calibration pattern is used, making it more practical for automotive applications.

A novel RSSI (Received Signal Strength Indication) refinement algorithm is proposed to enhance the resolution for indoor and outdoor real-time location tracking system. The proposed refinement algorithm is implemented in two separate phases. During the first phase, called the pre-processing step, RSSI values at different static locations are collected and processed to build a calibrated model for each reference node. Different measurement campaigns pertinent to each parameter in the model are implemented to analyze the sensitivity of RSSI. The propagation models constructed for each reference nodes are needed by the second phase. During the next phase, called the runtime process, real-time tracking is performed. Smoothing algorithm is proposed to minimize the dynamic fluctuation of radio signal received from each reference node when the mobile target is moving. Filtered RSSI values are converted to distances using formula calibrated in the first phase. Finally, an iterative trilateration algorithm is used for position estimation. Experiments relevant to the optimization algorithm are carried out in both indoor and outdoor environments and the results validated the feasibility of proposed algorithm in reducing the dynamic fluctuation for more accurate position estimation.

The concept of personal networks is very user-centric and representative for the next generation networks. However, the present security mechanism does not consider at all what happens whenever a mobile node (device) is compromised, lost or stolen. Of course, a compromised, lost or stolen mobile node (device) is a main factor to leak stored secrets. This kind of leakage of stored secrets remains a great danger in the field of communication security since it can lead to the complete breakdown of the intended security level. In order to solve this problem, we propose a 3-way Leakage-Resilient and Forward-Secure Authenticated Key Exchange (3LRFS-AKE) protocol and its security architecture suitable for personal networks. The 3LRFS-AKE protocol guarantees not only forward secrecy of the shared key between device and its server as well as providing a new additional layer of security against the leakage of stored secrets. The proposed security architecture includes two different types of communications: PN wide communication and communication between P-PANs of two different users. In addition, we give a performance evaluation and numerical results of the delay generated by the proposed security architecture.

A fast algorithm to speed up the search process of vector quantization encoding is presented. Using the sum and the partial norms of a vector, some eliminating inequalities are constructeded. First the inequality based on the sum is used for determining the bounds of searching candidate codeword. Then, using an inequality based on subvector norm and another inequality combining the partial distance with subvector norm, more unnecessary codewords are eliminated without the full distance calculation. The proposed algorithm can reject a lot of codewords, while introducing no extra distortion compared to the conventional full search algorithm. Experimental results show that the proposed algorithm outperforms the existing state-of-the-art search algorithms in reducing the computational complexity and the number of distortion calculation.

Route optimization for network mobility is a key technique for providing a node in a mobile network (Mobile Network Node or MNN) with high quality broadband communications. Many schemes adding route optimization function to Network Mobility (NEMO) Basic Support protocol, the standardized network mobility management protocol from the IETF nemo working group, have already been proposed in recent years. One such scheme, a scheme using Hierarchical Mobile IPv6 (HMIPv6) aims to overcome micromobility management issues as well by applying a mechanism based on HMIPv6. The traditional scheme, however, suffers from a significant number of signaling messages as the number of MNNs and/or the number of their Correspondent Nodes (CNs) increase, because many messages notifying the MNNs' Home Agents (HAMNNs) and the CNs of the mobile network's movement are generated simultaneously each time the mobile network moves to the domain of another micromobility management router (Mobility Anchor Point or MAP). This paper proposes a scheme to overcome this problem. Our scheme reduces the number of signaling messages generated at the same time by managing the mobility of MNNs using multiple MAPs distributed within a network for load sharing. The results of simulation experiments show that our scheme works efficiently compared to the traditional scheme when a mobile network has many MNNs and/or these MNNs communicate with many CNs.

A new adaptive model based on fuzzy integrals has been presented and used for combining three well-known methods, Eigenface, Fisherface and SOMface, for face classification. After training the competence estimation functions, the adaptive mechanism enables our system the filtering of unsure judgments of classifiers for a specific input. Comparison with classical and non-adaptive approaches proves the superiority of this model. Also we examined how these features contribute to the combined result and whether they can together establish a more robust feature.