Lightwave switching is discussed with a cascaded connection of optical couplers with light intensity control elements. By employing wavelength-selective amplifiers such as a waveguide-type Raman amplifier, all-optical wavelength-selective switching can be realized. We discuss analytically using coupled-mode theory that the lightwave switching is feasible by controlling the intensity of propagating lightwave. The switching operation is verified numerically using finite-difference beam-propagation method. As a result, the expected operation is realized and some characteristics involved with dependencies of wavelength and phase are also investigated. A preliminary experiment using attenuators, beam splitters and mirrors is also described to verify the switching operation with only light-intensity control in interferometers.

This paper deals with the singular behavior of the diffraction of transverse magnetic (TM) waves by a perfectly conductive triangular periodic surface at a low grazing limit of incidence. The wave field above the highest excursion of the surface is represented as a sum of Floquet modes with modified diffraction amplitudes, whereas the wave field inside a triangular groove is written as a sum of guided modes with unknown mode amplitudes. Then, two sets of equations are derived for such amplitudes. From the equation sets, all the amplitudes are analytically shown to vanish at a low grazing limit of incidence. From this fact, it is concluded analytically that no diffraction takes place and only reflection occurs at a low grazing limit of incidence for any period length and any triangle height. This theoretical result is verified by a numerical example.

We consider a problem for constructing a minimum cost r-edge-connected multigraph in which degree d(v) of each vertex v ∈ V is specified. In this paper, we propose a 3-approximation algorithm for this problem under the assumption that edge cost is metric, r(u,v) ∈ {1,2} for each u,v ∈ V, and d(v) ≥ 2 for each v ∈ V. This problem is a generalization of metric TSP. We also propose an approximation algorithm for the digraph version of the problem.

For execution of computation-intensive applications, one of the most important paradigms is to divide the application into a large number of small independent tasks and execute them on heterogeneous parallel computing environments (abbreviated by HPCEs). In this paper, we aim to execute independent tasks efficiently on HPCEs. We consider the problem to find a schedule that maximizes the throughput of task execution for a huge number of independent tasks. First, for HPCEs where the network forms a directed acyclic graph, we show that we can find, in polynomial time, a schedule that attains the optimal throughput. Secondly, for arbitrary HPCEs, we propose an (+ε)-approximation algorithm for any constant ε(ε>0). In addition, we also show that the framework of our approximation algorithm can be applied to other collective communications such as the gather operation.

Ad hoc DMAC protocols have been proposed to improve spatial reuse, but directional transmissions have the problem of deafness. In the ToneDMAC protocol [9], an omnidirectional out-of-band tone after transmitting DATA or ACK mitigates deafness, but cannot prevent the interference packets caused by retransmissions to node in deafness. In this paper, we propose a dual-tone DMAC protocol with the out-of-band start-tone and stop-tone. In the proposed MAC protocol, a start-tone prevents retransmissions to node in deafness and decreases the packet collision probability. Throughput performance of the proposed MAC protocol is confirmed by simulations using Qualnet ver. 3.8 simulator.

In this letter, we propose two different joint transmit and receive antenna subset selection schemes for multiple-input multiple-output (MIMO) systems on the basis of capacity maximization criterion. We assume that perfect channel state information (CSI) is known at the receiver but unknown to the transmitter. As the selection signaling is perfectly fed back to the transmitter, we propose a flexible two-step selection algorithm (TSSA) in practical MIMO channel scenarios. Computer simulations show that TSSA can maximize the capacity at low computation cost in most scenarios. It performs well in terms of capacity, computational complexity and flexibility. Furthermore, we propose a simplified algorithm based on the correlation matrix when the channel correlation information (CCI) is known to the transmitter. Simulation results show that the proposed correlation matrix based selection algorithm is only slightly inferior to an optimal selection algorithm.

In this paper, we address the problem of the rotation-invariant texture analysis. For this purpose, we first present a modified version of the discrete Radon transform whose performance, including accuracy and processing time, is significantly better than the conventional transform in direction estimation and categorization of textural images. We then utilize this transform with a rotated version of Gabor filters to propose a new scheme for texture classification. Experimental results on a set of images from the Brodatz album indicate that the proposed scheme outperforms previous works.

An iterative reconstruction algorithm of accelerating the estimation of the complex relative permittivity of a cylindrical dielectric object based on the multigrid optimization method (MGOM) is presented. A cost functional is defined by the norm of a difference between the scattered electric fields measured and calculated for an estimated contrast function, which is expressed as a function of the complex relative permittivity of the object. Then the electromagnetic inverse scattering problem can be treated as an optimization problem where the contrast function is determined by minimizing the cost functional. We apply the conjugate gradient method (CGM) and the frequency-hopping technique (FHT) to the minimization of the cost functional, and also employ the multigrid method (MGM) with a V-cycle to accelerate the rate of convergence for getting the reconstructed profile. The reconstruction scheme is called the multigrid optimization method. Computer simulations are performed for lossy and inhomogeneous dielectric circular cylinders by using single-frequency or multifrequency scattering data. The numerical results demonstrate that the rate of convergence of the proposed metod is much faster than that of the conventional CGM for both noise-free and noisy cases.

Context-based adaptive binary arithmetic coding (CABAC) is the major entropy-coding algorithm employed in H.264/AVC. Although the performance gain of H.264/AVC is mainly due to CABAC, it is difficult to achieve a fast decoder because the decoding algorithm is basically sequential and computationally intensive. In this letter, a prediction scheme is proposed that enhances overall decoding performance by decoding two binary symbols at a time. A CABAC decoder based on the proposed prediction scheme improves the decoding performance by 24% compared to conventional decoders.

An effective way to boost power gain without noise figure degradation in a cascode low noise amplifier (LNA) is demonstrated at 4 GHz using 0.35 µm SiGe HBT technology. This approach maintains the same current consumption because a low-pass π-type LC matching network is inserted in the inter-stage of a conventional cascode LNA. 5 dB gain enhancement with no noise figure degradation at 4 GHz is observed in the SiGe HBT LNA with inter-stage matching.

Element value spread of an equal-ripple RC polyphase filter depends heavily on the order of zero assignment. To find the optimum design, we must conduct exhaustive design for all the possible zero assignments. This paper describes two circuit transformations on equal-ripple RC polyphase filters, which preserve their transfer functions, for reducing circuit design efforts. Proposed Method I exchanges (R,C) values to (1/C,1/R) for each stage. This gives a new circuit with different zero assignment for each stage of its original circuit. Method II flips over the original circuit and exchanges the resulting (Ri,Ci) values for (Cn-i+1,Rn-i+1) for each i-th stage. Those circuit transformations can reduce a number of circuit designs down to 1/4 of the straight-forward method. This considerably reduces a burden for exhaustive design for searching the minimum element value spread condition. Some design examples are given to illustrate the proposed methods.

We present a novel algorithm that can suppress impulsive noise in video colour sequences. It uses order statistics, and directional and adaptive processing techniques.

Two versions of Krylov subspace order reduction techniques for VLSI interconnect reductions, including structure preserving reductions approach and adjoint networks approach, will be comparatively investigated. Also, we will propose a modified structure preserving reduction algorithm to speed up the projection construction in a linear order. The numerical experiment shows the high accuracy and low computational consumption of the modified method. In addition, it will be shown that the projection subspace generated from the structure-preserving approach and those from the adjoint networks approach are equivalent. Therefore, transfer functions of both reduced networks are identical.

An improved methodology, based on the genetic algorithm, is developed to design thermal-via structures and circuit parameters of advanced InGaP and InGaAs collector-up heterojunction bipolar transistors (C-up HBTs), which are promising miniature high-power amplifiers (HPAs) in cellular communication systems. Excellent simulated and measured results demonstrate the usefulness of this technique.

Both mutual authentication and generation of session keys can be accomplished by an authenticated key exchange (AKE) protocol. Let us consider the following situation: (1) a client, who communicates with many different servers, remembers only one password and has insecure devices (e.g., mobile phones or PDAs) with very-restricted computing power and built-in memory capacity; (2) the counterpart servers have enormous computing power, but they are not perfectly secure against various attacks (e.g., virus or hackers); (3) neither PKI (Public Key Infrastructures) nor TRM (Tamper-Resistant Modules) is available. The main goal of this paper is to provide security against the leakage of stored secrets as well as to attain high efficiency on client's side. For those, we propose an efficient and leakage-resilient RSA-based AKE (RSA-AKE) protocol suitable for the above situation whose authenticity is based on password and another secret. In the extended model where an adversary is given access to the stored secret of client, we prove that its security of the RSA-AKE protocol is reduced tightly to the RSA one-wayness in the random oracle model. We also show that the RSA-AKE protocol guarantees several security properties (e.g., security of password, multiple sever scenario with only one password, perfect forward secrecy and anonymity). To our best knowledge, the RSA-AKE protocol is the most efficient, in terms of both computation costs of client and communication costs, over the previous AKE protocols of their kind (using password and RSA).

A new method to approximate the receive minimum distance is presented. In the proposed approximation, the geometric mean of the singular values of the channel matrix is used instead of the conventional minimum singular value. Numerical experiments show that the proposed approximation has less mean squared error than the minimum singular value bound and outperforms the minimum singular value bound in terms of bit error rate when they are applied to the antenna subgroup selection system.

ACK thinning refers to the technique to discard or reduce TCP acknowledgements (ACKs) for the purpose of diverting scarce bandwidth to TCP data traffic. It has been shown that under some circumstances the technique is effective to boost the TCP throughput on wireless links, in particular the IEEE 802.11 wireless LAN (WLAN). In this letter, however, we show that ACK thinning backfires under congestion due to its cross-layer impact on the 802.11 MAC dynamics. With the ACK filtering example, we demonstrate the phenomenon and analyze the cause. Based on the analysis, we show how the IEEE 802.11 contention window size control solves the problem.

We present theoretical foundations about error estimations of the global Krylov subspace techniques for multiple-inputs multiple-outputs (MIMO) Interconnect reductions. Analytical relationships between Lyapunov functions of the original interconnect network and those of the reduced system generated by the global Arnoldi algorithm will be developed. Under this framework, a new moment matching reduced network is proposed. Also, we will show that the reduced system can be expressed as the original network with some additive perturbations.

We have previously developed a concatenative speech synthesizer based on the plural speech unit selection and fusion method that can synthesize stable and human-like speech. In this method, plural speech units for each speech segment are selected using a cost function and fused by averaging pitch-cycle waveforms. This method has a large computational cost, but some platforms require a speech synthesis system that can work within limited hardware resources. In this paper, we propose an offline unit fusion method that reduces the computational cost. In the proposed method, speech units are fused in advance to make a pre-fused speech unit database. At synthesis time, a speech unit for each segment is selected from the pre-fused speech unit database and the speech waveform is synthesized by applying prosodic modification and concatenation without the computationally expensive unit fusion process. We compared several algorithms for constructing the pre-fused speech unit database. From the subjective and objective evaluations, the effectiveness of the proposed method is confirmed by the results that the quality of synthetic speech of the offline unit fusion method with 100 MB database is close to that of the online unit fusion method with 93 MB JP database and is slightly lower to that of the 390 MB US database, while the computational time is reduced by 80%. We also show that the frequency-weighted VQ-based method is effective for construction of the pre-fused speech unit database.

The Multiple Access Interference (MAI) and the Multipath Fading (MPF) restrict the performance of Code-Division Multiple-Access (CDMA) systems. The Multiuser Detection (MUD) based on Particle Swarm Optimization algorithm (PSO) with Rake processing is proposed in this paper to overcome these obstacles, followed by full details of how to apply the Binary PSO MUD (BPSO-MUD) on a CDMA system. Simulations show that the BPSO-MUD has significantly better performance than the Conventional Detection (CD).