This paper proposes a scalable active optical access network using high-speed Plumbum Lanthanum Zirconate Titanate (PLZT) optical switch/splitter. The Active Optical Network, called ActiON, using PLZT switching technology has been presented to increase the number of subscribers and the maximum transmission distance, compared to the Passive Optical Network (PON). ActiON supports the multicast slot allocation realized by running the PLZT switch elements in the splitter mode, which forces the switch to behave as an optical splitter. However, the previous ActiON creates a tradeoff between the network scalability and the power loss experienced by the optical signal to each user. It does not use the optical power efficiently because the optical power is simply divided into 0.5 to 0.5 without considering transmission distance from OLT to each ONU. The proposed network adopts PLZT switch elements in the variable splitter mode, which controls the split ratio of the optical power considering the transmission distance from OLT to each ONU, in addition to PLZT switch elements in existing two modes, the switching mode and the splitter mode. The proposed network introduces the flexible multicast slot allocation according to the transmission distance from OLT to each user and the number of required users using three modes, while keeping the advantages of ActiON, which are to support scalable and secure access services. Numerical results show that the proposed network dramatically reduces the required number of slots and supports high bandwidth efficiency services and extends the coverage of access network, compared to the previous ActiON, and the required computation time for selecting multicast users is less than 30 msec, which is acceptable for on-demand broadcast services.

The k-edge-connectivity augmentation problem with bipartition constraints (kECABP, for short) is defined by “Given an undirected graph G=(V, E) and a bipartition π = {VB, VW} of V with VB ∩ VW = ∅, find an edge set Ef of minimum cardinality, consisting of edges that connect VB and VW, such that G'=(V, E ∪ Ef) is k-edge-connected.” The problem has applications for security of statistical data stored in a cross tabulated table, and so on. In this paper we propose a fast algorithm for finding an optimal solution to (σ + 1)ECABP in O(|V||E| + |V2|log |V|) time when G is σ-edge-connected (σ > 0), and show that the problem can be solved in linear time if σ ∈ {1, 2}.

We give characterizations of stable scaling functions with compact band regions, which have the oversampling property.

This paper proposes an efficient list extension algorithm for soft-output multiple-input-multiple-output (soft-MIMO) detection. This algorithm extends the list of candidate vectors based on the vector selected by initial detection, in order to solve the empty-set problem, while reducing the number of additional vectors. The additional vectors are obtained from multiple detection orders, from which high-quality soft-output can be generated. Furthermore, a method to reduce the complexity of the determination of the multiple detection orders is described. From simulation results for a 44 system with 16- and 64-quadrature amplitude modulations (QAM) and rate 1/2 and 5/6 duo-binary convolutional turbo code (CTC), the soft-MIMO detection to which the proposed list extension was applied showed a performance degradation of less than 0.5 dB at bit error rate (BER) of 10-5, compared to that of the soft-output maximum-likelihood detection (soft-MLD) for all code rate and modulation pairs, while the complexity of the proposed list extension was approximately 38% and 17% of that of an existing algorithm with similar performance in a 44 system using 16- and 64-QAM, respectively.

In the conventional iterative superimposed pilot-assisted channel estimation (SI-PACE), simple averaging of the instantaneous channel estimates obtained by using the pilot over several single-carrier (SC) blocks (called the frame in this paper) is taken in order to reduce the interference from data symbols. Therefore, the conventional SI-PACE has low tracking ability against fading time variations. To solve the tracking problem, Wiener filtering (WF)-based averaging can be used instead of simple averaging. However, WF incurs high computational complexity. Furthermore, the estimation error of the fading autocorrelation function significantly degrades the channel estimation accuracy. In order to improve the channel estimation accuracy while keeping the computational complexity low, a new iterative SI-PACE using sliding WF (called iterative SWFSI-PACE) is proposed. The channel estimation is done by sliding a WF having a shorter filter size than the measurement interval. The bit error rate (BER) and throughput performances of SC-FDE using iterative SWFSI-PACE are investigated by computer simulation to show that the proposed scheme achieves good BER and throughput performances while keeping the computational complexity low irrespective of the fading rate (or maximum Doppler frequency).

This paper proposes a diversity scheme for Multi-Input Multi-Output Orthogonal Frequency Division Multiplexing (MIMO-OFDM) based on Radio Frequency (RF) signal processing. Although a 22 MIMO-OFDM system can double the capacity without expanding the occupied frequency bandwidth, we cannot get additional diversity gain using the linear MIMO decomposition method. The proposed method improves the bit error rate (BER) performance by making efficient use of RF signal processing. Computer simulation results show that the proposed scheme gives additional diversity gain.

We propose a motion detection model, which is suitable for higher speed operation than the video rate, inspired by the neuronal propagation in the hippocampus in the brain. The model detects motion of edges, which are extracted from monocular image sequences, on specified 2D maps without image matching. We introduce gating units into a CA3-CA1 model, where CA3 and CA1 are the names of hippocampal regions. We use the function of gating units to reduce mismatching for applying our model in complicated situations. We also propose a map-division method to achieve accurate detection. We have evaluated the performance of the proposed model by using artificial and real image sequences. The results show that the proposed model can run up to 1.0 ms/frame if using a resolution of 6460 units division of 320240 pixels image. The detection rate of moving edges is achieved about 99% under a complicated situation. We have also verified that the proposed model can achieve accurate detection of approaching objects at high frame rate (>100 fps), which is better than conventional models, provided we can obtain accurate positions of image features and filter out the origins of false positive results in the post-processing.

We propose a novel 13 planar optical switch using aspheric lenses and carrier-induced tunable prisms on InP. An input light beam is collimated by the aspheric lenses in a slab waveguide. The tunable prism, whose refractive indices are tuned by the carrier plasma effect, deflect the collimated light beam and guide it to the output ports. The switching operations of the 13 optical switch that consists of five lenses and eight prisms with a footprint of 5003500 µm are performed by three-dimensional beam propagation methods. A static switching operation with a 5-dB insertion loss and a 13-dB extinction ratio is obtained with 70-mA current injection for each prism. This device has a simple structure and low power consumption and may be useful for optical packet switching systems.

Phase structure of nonlinear dynamical system is governed by the vector field and decides the trajectories. Accordingly, the power spectra of trajectories include the structural field effect on the phase space. In this paper, we develop a method for analyzing phase structure using power spectra of trajectories and reconstitute a potential function in the system.

The explosive growth of Internet usage has caused problems for the current Internet in terms of traffic congestion within networks and performance degradation of end-to-end flows. Therefore, a reconsideration of the current Internet has begun and is being actively discussed worldwide with the goals of enabling efficient share of limited network resources (i.e., the link bandwidth) and improved performance. To directly address the inefficiency of TCP's congestion mitigation solely on the end-to-end basis, in this paper we propose an adaptive split connection scheme on advanced relay nodes; this scheme dynamically splits end-to-end TCP connections on the basis of congestion status in output links. Through simulation evaluations, we examine the effectiveness and potential of the proposed scheme.

This article introduces some improvements to the already proposed custom instruction candidates selection for the automatic ISA customisation problem targeting reconfigurable processors. It introduces new opportunities to prune the search space, and a technique based on dynamic programming to check the independence between groups. The proposed new algorithm yields one order less measured number of convexity checks than the related work for the same inputs and outputs.

In this letter, we propose a distributed switch-and-stay combining network with partial relay selection and show that the system spectral efficiency can be improved via adaptive modulation. Analytical expressions for the achievable spectral efficiency and average bit error rate of the proposed system over Rayleigh fading channels are derived for an arbitrary switching threshold. Numerical results are gathered to substantiate the analytical derivation showing that in terms of spectral efficiency, the system with single relay outperforms that with more than one relay at high signal-to-noise ratios (SNRs) and the optimal switching threshold can significantly improve the system performance at medium SNRs.

Packet classification is essential for supporting advanced network services such as firewalls, quality-of-service (QoS), virtual private networks (VPN), and policy-based routing. The rules that routers use to classify packets are called packet filters. If two or more filters overlap, a conflict occurs and leads to ambiguity in packet classification. This study proposes an algorithm that can efficiently detect and resolve filter conflicts using tuple based search. The time complexity of the proposed algorithm is O(nW +s), and the space complexity is O(nW), where n is the number of filters, W is the number of bits in a header field, and s is the number of conflicts. This study uses the synthetic filter databases generated by Class-Bench to evaluate the proposed algorithm. Simulation results show that the proposed algorithm can achieve better performance than existing conflict detection algorithms both in time and space, particularly for databases with large numbers of conflicts.

The IEEE 802.15.4 protocol is considered a promising technology for low-cost low-power wireless personal area networks. Researchers have discussed the feasibility of voice communications over IEEE 802.15.4 networks. To this end, the personal area network (PAN) coordinator allocates guaranteed time slots (GTSs) for voice communications in the beacon-enabled mode of IEEE 802.15.4. Although IEEE 802.15.4 is capable of supporting voice communications by GTS allocation, it is impossible to accommodate voice transmission beyond two hops due to the excessive transmission delay. In this paper, we propose a GTS allocation scheme for bidirectional voice traffic in IEEE 802.15.4 multihop networks. The goal of our proposed scheme is to achieve low end-to-end delay and packet drop ratio without a complex allocation algorithm. Thus, the proposed scheme allocates GTSs to devices for successful completion of voice transmission in a superframe duration. The proposed scheme also considers transceiver switching delay. This is relatively large compared to a time slot due to the low-cost and low-gain antenna designs. We analyze and validate the proposed scheme in terms of average end-to-end delay and packet drop ratio. Our scheme has lower end-to-end delay and packet drop ratio than the basic IEEE 802.15.4 GTS allocation scheme.

A key technical challenge in heterogeneous wireless networks (HWNs) is the support of vertical handoff. It allows mobile users to switch connections among networks. In this paper, we propose and evaluate the application of VIKOR for vertical handoff. VIKOR is a Multiple Attribute Decision Making (MADM) method which makes decisions based on an aggregating function representing closeness to the ideal solution. We conducted simulation experiments to compare the performance of VIKOR for vertical handoff with other decision schemes such as SAW, TOPSIS, and WMC. We considered voice, data, and cost-constrained connections. Our results show that VIKOR is able to obtain satisfactory to excellent performance in the four different types of connections being considered.

We investigated optical transmission characteristics of aluminum thin films with periodic hole arrays in sub-wavelength. We divided white light into several color spectra using a color filter based on the surface plasmon resonance (SPR) utilizing aluminum showing high plasma frequency. By optimizing a hole-array period, hole shape, polarization and index difference of two surface, transmittance of 30% and full-width at half-maximum of around 100 nm were achieved.

Obtaining a compact representation of a large-size feature map built by mapper robots is a critical issue in recent mobile robotics. This “map compression” problem is explored from a novel perspective of dictionary-based data compression techniques in the paper. The primary contribution of the paper is the proposal of the dictionary-based map compression approach. A map compression system is presented by employing RANSAC map matching and sparse coding as building blocks. The effectiveness levels of the proposed techniques is investigated in terms of map compression ratio, compression speed, the retrieval performance of compressed/decompressed maps, as well as applications to the Kolmogorov complexity.

We propose an adaptive coding algorithm for digital hologram transmission based on server-client interaction. A client can visualize various images of 3D objects from a digital hologram, which are reconstructed on different depth planes. The client's requests for reconstruction depths are sent to the server. The server adaptively encodes and transmits the same object image as the client's reconstructed image. When the client changes the reconstruction depth, only the prediction error of the new image is transmitted. Experimental results show that, in some cases, the proposed algorithm reduces more than half of the distortion at the same bitrate compared with the conventional coding technique.

We developed advanced techniques for the growth of self-assembled quantum dots (QDs) for fabricating a broadband light source that can be applied to optical coherence tomography (OCT). Four QD ensembles and strain reducing layers (SRLs) were grown in selective areas on a wafer by the use of a 90° rotational metal mask. The SRL thickness was varied to achieve appropriate shifts in the peak wavelength of the QD emission spectrum of up to 120 nm. The four-color QD ensembles were expected to have a broad bandwidth of more than 160 nm due to the combination of excited state emissions when introduced in a current-induced broadband light source such as a superluminescent diode (SLD). Furthermore, a desired shape of the SLD spectrum can be obtained by controlling the injection current applied to each QD ensemble. The broadband and spectrum shape controlled light source is promising for high-resolution and low-noise OCT systems.

In this paper, we propose a duplicate document detection model recognizing both partial duplicates and near duplicates. The proposed model can detect partial duplicates as well as exact duplicates by splitting a large document into many small sentence fingerprints. Furthermore, the proposed model can detect even near duplicates, the result of trivial revisions, by filtering the common words and reordering the word sequence.