We propose the multi-domain adaptive learning that enables us to find a point meeting possibly time-varying specifications simultaneously in multiple domains, e.g. space, time, frequency, etc. The novel concept is based on the idea of feasibility splitting -- dealing with feasibility in each individual domain. We show that the adaptive projected subgradient method (Yamada, 2003) realizes the multi-domain adaptive learning by employing (i) a projected gradient operator with respect to a ‘fixed’ proximity function reflecting the time-invariant specifications and (ii) a subgradient projection with respect to ‘time-varying’ objective functions reflecting the time-varying specifications. The resulting algorithm is suitable for real-time implementation, because it requires no more than metric projections onto closed convex sets each of which accommodates the specification in each domain. A convergence analysis and numerical examples are presented.

We propose a new Internet group management protocol (IGMP) which can be used in passive optical network (PON) especially for IPTV services which dramatically reduces the channel change response time caused by traditional IGMP. In this paper, the newly proposed IGMP is introduced in detail and performance analysis is also included. Simulation results demonstrated the performance of the newly proposed IGMP, whereby, viewers can watch the shared IPTV channels without the channel change response time when channel request reaches a threshold.

A wireless power link utilizing inductive coupling is developed between stacked chips. In this paper, we discuss inductor layout optimization and rectifier circuit design. The inductive-coupling power link is analyzed using simple equivalent circuit models. On the basis of the analytic models, the inductor size is minimized for the given required power on the receiver chip. Two kinds of full-wave rectifiers are discussed and compared. Various low-power circuit design techniques for rectifiers are employed to decrease the substrate leakage current, reduce the possibility of latch-up, and improve the power transmission efficiency and the high-frequency performance of the rectifier block. Test chips are fabricated in a 0.18 µm CMOS process. With a pair of 700700 µm2 on-chip inductors, the test chips achieve 10% peak efficiency and 36 mW power transmission. Compared with the previous work the received power is 13 times larger for the same inductor size .

In this paper, a design methodology for the minimization of various performance metrics of MOS Current-Mode Logic (MCML) circuits is described. In particular, it allows to minimize the delay under a given power consumption, the power consumption under a given delay and the power-delay product. Design solutions can be evaluated graphically or by simple and effective automatic procedures implemented within the MATLAB environment. The methodology exploits the novel concepts of crossing-point current and crossing-point capacitance. A useful feature of it is that it provides the designer with useful insights into the dependence of the performance metrics on design variables and fan-out capacitance. The methodology was validated by designing several MCML circuits in an IBM 130 nm CMOS process.

This paper proposes a new realization technique of image rejection function by noise-coupling architecture, which is used for a complex bandpass ΔΣAD modulator. The complex bandpass ΔΣAD modulator processes just input I and Q signals, not image signals, and the AD conversion can be realized with low power dissipation. It realizes an asymmetric noise-shaped spectra, which is desirable for such low-IF receiver applications. However, the performance of the complex bandpass ΔΣAD modulator suffers from the mismatch between internal analog I and Q paths. I/Q path mismatch causes an image signal, and the quantization noise of the mirror image band aliases into the desired signal band, which degrades the SQNDR (Signal to Quantization Noise and Distortion Ratio) of the modulator. In our proposed modulator architecture, an extra notch for image rejection is realized by noise-coupled topology. We just add some passive capacitors and switches to the modulator; the additional integrator circuit composed of an operational amplifier in the conventional image rejection realization is not necessary. Therefore, the performance of the complex modulator can be effectively raised without additional power dissipation. We have performed simulation with MATLAB to confirm the validity of the proposed architecture. The simulation results show that the proposed architecture can achieve the realization of image-rejection effectively, and improve the SQNDR of the complex bandpass ΔΣAD modulator.

For fast egomotion of a camera, computing feature correspondence and motion parameters by global search becomes highly time-consuming. Therefore, the complexity of the estimation needs to be reduced for real-time applications. In this paper, we propose a compound omnidirectional vision sensor and an algorithm for estimating its fast egomotion. The proposed sensor has both multi-baselines and a large field of view (FOV). Our method uses the multi-baseline stereo vision capability to classify feature points as near or far features. After the classification, we can estimate the camera rotation and translation separately by using random sample consensus (RANSAC) to reduce the computational complexity. The large FOV also improves the robustness since the translation and rotation are clearly distinguished. To date, there has been no work on combining multi-baseline stereo with large FOV characteristics for estimation, even though these characteristics are individually are important in improving egomotion estimation. Experiments showed that the proposed method is robust and produces reasonable accuracy in real time for fast motion of the sensor.

Supporting quality-of-service (QoS) of multimedia communications over IEEE 802.11 based ad hoc networks is a challenging task. This paper develops a simple 3-D Markov chain model for queuing analysis of IEEE 802.11 MAC layer. The model is applied for performance analysis of voice communications over IEEE 802.11 single-hop ad hoc networks. By using the model, we finish the performance optimization of IEEE MAC layer and obtain the maximum number of voice calls in IEEE 802.11 ad hoc networks as well as the statistical performance bounds. Furthermore, we design a fully distributed call admission control (CAC) algorithm which can provide strict statistical QoS guarantee for voice communications over IEEE 802.11 ad hoc networks. Extensive simulations indicate the accuracy of the analytical model and the CAC scheme.

Existence of backward TE volume modes which are to be identified as Magnetostatic Wave (MSW) in anisotropic single-negative slab with partly negative permeability tensor component have already been revealed by present authors. In this paper, detailed modal analysis has been carried out for this kind of TE volume modes to find out their novel and peculiar properties. From these numerical results, it has been clarified that dispersion curve of the lowest order mode for thicker slab has a frequency of turning point below which both forward and backward waves can be simultaneously observed and also there is a critical slab thickness for each order of TE volume modes to exist.

A differential inter-symbol interference (ISI) cancellation method for time domain synchronous orthogonal frequency division multiplexing (TDS-OFDM) systems is proposed. The differential output of an OFDM system can greatly reduce the impact of ISI in the frequency domain and it constructs a convolutional structure, thus the Viterbi decoding algorithm can be used to recover the transmitted information from the output signal. Simulation results show the effectiveness of the proposed method.

Gaussian rough surfaces can be characterized by two roughness parameters, the root-mean-square height and correlation length. For accurate estimation of these parameters from measured surface height-profile, data samples with sufficiently long record length are necessary. In this letter, an expression of correlation length in terms of a surface slope function is introduced in order to estimate correlation length and analytical expression of the data record length required for accurate estimation is derived. The result shows that the method using the slope function can reduce the data record length approximately 60% as compared to the commonly employed method using the correlation function. In order to check the result, a Monte Carlo simulation is also carried out and the validity of the result is confirmed.

The "geometric AIC" and the "geometric MDL" have been proposed as model selection criteria for geometric fitting problems. These correspond to Akaike's "AIC" and Rissanen's "BIC" well known in the statistical estimation framework. Another well known criterion is Schwarz' "BIC", but its counterpart for geometric fitting has not been known. This paper introduces the corresponding criterion, which we call the "geometric BIC", and shows that it is of the same form as the geometric MDL. Our result gives a justification to the geometric MDL from the Bayesian principle.

A secure method for steganography is proposed. Pixel-value differencing (PVD) steganography and bit-plane complexity segmentation (BPCS) steganography have the weakness of generating blocky effects and noise in smooth areas and being detectable with steganalysis. To overcome these weaknesses, a secure bit-plane based steganography method on the spatial domain is presented, which uses a robust measure to select noisy blocks for embedding messages. A matrix embedding technique is also applied to reduce the change of cover images. Given that the statistical property of cover images is well preserved in stego-images, the proposed method is undetectable by steganalysis that uses RS analysis or histogram-based analysis. The proposed method is compared with the PVD and BPCS steganography methods. Experimental results confirm that the proposed method is secure against potential attacks.

The present study proposes a quasi-static finite-difference time-domain (FDTD) method for dosimetry in humans due to contact current at low frequencies (10 kHz). Our attention focused on wave sources which can reduce computational time. The computational time was found to be reduced using a voltage source of a step function with smooth start. The computational time required for the proposed method was smaller than a quasi-static FDTD method proposed in a previous study. Comparison between our computational results and those in a previous study suggested the effectiveness of our proposal. The difference in in-situ electric field due to different human models was a factor of 2 or so.

Femto cell systems have been the one of the key technologies for ubiquitous networks, and some of them are already serviced by manufacturers. Femto base stations are deployed randomly and without pre-planning, so the femto system has a wider variation in topology than cellular networks. Therefore, a specialized resource assignment algorithm is essential for efficient performance of the femto cell. In this paper, we propose a realtime channel assignment algorithm for adapting to the varying environments, including new cell deployment or power switch off. Our algorithm is a form of a sequential graph coloring problem which outperforms other fixed allocation algorithms. Simulation results show realtime assignment has better performance than the fixed allocation when the wireless environment changes faster than the tracking operation time.

A rigorous semi-analytical approach for the scalar field in a microstructured optical fiber, which is formed of layered cylindrical arrays of circular rods symmetrically distributed on each concentric cylindrical layer, is presented. The method uses the T-matrix of a circular rod in isolation and the generalized reflection and transmission matrices of cylindrical arrays. Numerical examples of the mode index for three-layered hexagonal structure of circular air holes are demonstrated and compared with those obtained by a variational method.

This paper investigates the gain of inter-Node B macro diversity for a scheduled-based shared channel using single-carrier FDMA radio access in the Evolved UTRA (UMTS Terrestrial Radio Access) uplink based on system-level simulations. More specifically, we clarify the gain of inter-Node B soft handover (SHO) with selection combining at the radio frame length level (=10 msec) compared to that for hard handover (HHO) for a scheduled-based shared data channel, considering the gains of key packet-specific techniques including channel-dependent scheduling, adaptive modulation and coding (AMC), hybrid automatic repeat request (ARQ) with packet combining, and slow transmission power control (TPC). Simulation results show that the inter-Node B SHO increases the user throughput at the cell edge by approximately 10% for a short cell radius such as 100-300 m due to the diversity gain from a sudden change in other-cell interference, which is a feature specific to full scheduled-based packet access. However, it is also shown that the gain of inter-Node B SHO compared to that for HHO is small in a macrocell environment when the cell radius is longer than approximately 500 m due to the gains from hybrid ARQ with packet combining, slow TPC, and proportional fairness based channel-dependent scheduling.

In this Letter, a residual acoustic echo suppression method is proposed to enhance the speech quality of hands-free communication in an automobile environment. The echo signal is normally a human voice with harmonic characteristics in a hands-free communication environment. The proposed algorithm estimates the residual echo signal by emphasizing its harmonic components. The estimated residual echo is used to obtain the signal-to-interference ratio (SIR) information at the acoustic echo canceller output. Then, the SIR based Wiener post-filter is constructed to reduce both the residual echo and noise. The experimental results confirm that the proposed algorithm is superior to the conventional residual echo suppression algorithm in terms of the echo return loss enhancement (ERLE) and the segmental signal-to-noise ratio (SEGSNR).

Ultrasonic imaging is useful in seabed or lakebed observations. We can roughly estimate the sea depth by hearing the echo generated by the boundary of water and rocks or sand. However, the estimation quality is usually not sufficient to draw seabed landscape since the echo signal includes serious distortion caused by autointerference. This paper proposes a novel method to visualize the shape of distant boundaries, such as the seawater-rock/sand boundary, based on the complex-valued Markov random field (CMRF) model. Our method realizes adaptive compensation of distortion without changing the global features in the measurement data, and obtains higher-quality landscape with less computational cost than conventional methods.

This letter deals with the time-domain estimation of time-varying channels in orthogonal frequency-division multiplexing (OFDM) systems. The general complex exponential basis expansion model (GCE-BEM) is used to capture the time variation of the channel within an OFDM block. The design criterion of optimal training for OFDM systems in time-varying channels is derived. This optimal training enables the complete elimination of the interference from data symbols and minimizes the noise effect on channel estimation. The design criterion can be used for both pilot symbol aided modulation (PASM) and superimposed training OFDM systems over time-varying channels.

We introduce the "split padding" into a current Merkle-Damgård hash function H. The patched hash function satisfies the following properties: (i) is second-preimage-resistant (SPR) if the underlying compression function h satisfies an "SPR-like" property, and (ii) is one-way (OW) if h satisfies an "OW-like" property. The assumptions we make about h are provided with simple definitions and clear relations to other security notions. In particular, they belong to the class whose existence is ensured by that of OW functions, revealing an evident separation from the strong collision-resistance (CR) requirement. Furthermore, we get the full benefit from the patch at almost no expense: The new scheme requires no change in the internals of a hash function, runs as efficiently as the original, and as usual inherits CR from h.