Flexible resource utilization in terms of adaptive use of optical bandwidth with agile reconfigurability is key for future metro networks. To address this issue, we focus on optical subwavelength switched network architectures that leverage high-speed optical switching technologies and can accommodate dynamic traffic cost-effectively. Although optical subwavelength switched networks have been attracting attention, most conventional studies apply static (pre-planned) protection scenarios in the networks of limited sizes. In this paper, we discuss optical switch requirements, the use of transceivers, and protection schemes to cost-effectively create large-scale reliable metro networks. We also propose a cost-effective adaptive protection scheme appropriate for optical subwavelength switched networks using our fast time-slot allocation algorithm. The proposed scheme periodically re-optimizes the bandwidth of both working and protection paths to prevent bandwidth resources from being wasted. The numerical examples verify the feasibility of our proposed scheme and the impact on network resources.

A job is called just-in-time if it is completed exactly on its due date. Under multi-slot conditions, each job has one due date per time slot and has to be completed just-in-time on one of its due dates. Moreover, each job has a certain weight per time slot. We would like to find a just-in-time schedule that maximizes the total weight under multi-slot conditions. In this paper, we prove that this problem is NP-hard.

Unlimited requirements for system-on-chip (SoC) facilitate three-dimensional (3D) technology as a promising alternative for extending Moore's Law. In spite of many advantages 3D technology provides, 3D technology faces testing issues because of the complexity of 3D design. Therefore, resolving the problem of test optimization and reducing test cost are crucial challenges. In this paper, we propose a novel optimization mechanism of 3D SoCs to minimize test time for mid-bond testing. To make our proposed mechanism more practical, we discuss test cost in mid-bond testing with consideration of manufacturing influence factors. Experimental results on ITC'02 SoC benchmark circuits show that our proposed mechanism reduces mid-bond test time by around 73% on average compared with one baseline solution, furthermore, the mechanism also proves its capacity in test cost reduction.

Many actual systems, e.g. computer programs, can be modeled as a subclass of Petri nets, called bridge-less workflow nets. For bridge-less workflow nets, we revealed the following properties: (i) any acyclic bridge-less workflow net is free choice; (ii) an acyclic bridge-less workflow net is sound iff it is well-structured; and (iii) any sound bridge-less workflow net is well-structured. We also proposed a necessary and sufficient condition to decide whether a given workflow net is bridge-less, and then constructed a polynomial-time procedure for it.

Verification of temporal logic properties plays a crucial role in proving the desired behaviors of continuous systems. In this paper, we propose an interval method that verifies the properties described by a bounded signal temporal logic. We relax the problem so that if the verification process cannot succeed at the prescribed precision, it outputs an inconclusive result. The problem is solved by an efficient and rigorous monitoring algorithm. This algorithm performs a forward simulation of a continuous-time dynamical system, detects a set of time intervals in which the atomic propositions hold, and validates the property by propagating the time intervals. In each step, the continuous state at a certain time is enclosed by an interval vector that is proven to contain a unique solution. We experimentally demonstrate the utility of the proposed method in formal analysis of nonlinear and complex continuous systems.

The traffic of the future aggregation network will dynamically change not only in volume but also destination to support the application of virtualization technology to network edge equipment to achieve cost-effectiveness. Therefore, future aggregation network will have to accommodate this traffic cost-effectively, despite dynamic changes in both volume and destination. To correspond to this trend, in this paper, we propose an optical layer 2 switch network based on bufferless optical time division multiplexing (TDM) and dynamic bandwidth allocation to achieve a future aggregation network cost-effectively. We show here that our proposed network architecture effectively reduced the number of wavelengths and optical interfaces by application of bufferless optical TDM technology and dynamic bandwidth allocation to the aggregation network.

This letter presents a new time-digital single-slope ADC (TDSS) architecture for CMOS image sensors. In the proposed ADC, a conventional single-slope ADC is used in coarse phase and a time to digital convertor is employed in fine phase. Through second comparison of the two different slope voltages (discharge input voltage and ramp voltage), the proposed ADC achieves low bit precision compensation. Compared with multiple-ramp single-slope (MRSS) ADC, the proposed ADC not only has a simple digital judgment circuit, but also increases conversion speed without complicated structure of ramp generator. A 10-bit TDSS ADC consisting of 7-bit conventional single-slope ADC and 3-bit time to digital converter was realized in a 0.13µm CIS process. Simulations demonstrate that the conversion speed of a TDSS ADC is almost 3.5 times faster than that of a single-slope ADC.

Nonlinear precoding improves the downlink bit error rate (BER) performance of multi-user multiple-input multiple-output (MU-MIMO). Broadband single-carrier (SC) block transmission can improve the capability that nonlinear precoding reduces BER, as it provides frequency diversity gain. This paper considers Tomlinson-Harashima precoding (THP) as a nonlinear precoding scheme for SC-MU-MIMO downlink. In the SC-MU-MIMO downlink with frequency-domain THP proposed by Degen and Rrühl (called SC-FDTHP), the inter-symbol interference (ISI) is suppressed by transmit frequency-domain equalization (FDE) after suppressing the inter-user interference (IUI) by frequency-domain THP. Transmit FDE increases the signal variance, hence transmission performance improvement is limited. In this paper, we propose a new SC-MU-MIMO downlink with time-domain THP which can pre-remove both ISI and IUI (called SC-TDTHP) if perfect channel state information (CSI) is available. Modulo operation in THP suppresses the signal variance increase caused by ISI and IUI pre-removal, and hence the transmission quality improves. For further performance improvement, vector perturbation is introduced to SC-TDTHP (called SC-TDTHP w/VP). Computer simulation shows that SC-TDTHP achieves better BER performance than SC-FDTHP and that SC-TDTHP w/VP offers further improvement in BER performance over SC-MU-MIMO with VP (called SC-VP). Computational complexity is also compared and it is showed that SC-TDTHP and SC-TDTHP w/VP incur higher computational complexity than SC-FDTHP but lower than SC-VP.

The key factors in overcoming for weak global navigation satellite systems (GNSS) signal acquisition are sensitivity and dwell time. In the conventional MAX/TC criteria, a preset threshold value is used to determine whether the signal exists. Thus the threshold is calculated carefully to balance the sensitivity and the dwell time. Affected by various environment noise and interference, the acquisition circuit will enter verifying mode frequently to eliminate false alarms, which will extend the mean acquisition time (MAT). Based on the periodicity of spread spectrum code in GNSS, this paper presents an improved double-dwell scheme that uses no threshold in detecting weak GNSS signals. By adopting this method, the acquisition performance of weak signal is significantly improved. Theoretical analysis and numerical simulation are presented detailed. Compared with the conventional MAX/TC criteria, the proposed method achieves improved performance in terms of detection probability and false alarm rate. Furthermore, the MAT decreases 15s when C/N0 is above 20dB-Hz. This can enhance the receiver sensitivity and shorten the time to first fix (TTFF).

This paper proposes a practical throughput upper bound that considers physical layer techniques using adaptive modulation and coding (AMC) for orthogonal frequency division multiplexing (OFDM) multiple-input multiple-output (MIMO) multiplexing. The proposed upper bound is computed from the modulation and coding scheme (MCS) that provides the maximum throughput considering the required block error rate (BLER) at the respective received signal-to-noise power ratios as a constraint. Then, based on the practical throughput upper bound, we present the causes of impairment for selecting the best MCS based on the computed mutual information for OFDM MIMO multiplexing. More specifically, through the evaluations, we investigate the effect of MCS selection error on an increasing maximum Doppler frequency due to the round trip delay time and the effect of channel estimation error of maximum likelihood detection associated with reference signal based channel estimation.

Time synchronization is of paramount importance in wireless sensor networks (WSNs) due to the inherent distributed characteristics of WSNs. Border surveillance WSNs, especially, require a highly secure and accurate time synchronization scheme to detect and track intruders. In this paper, we propose a Secure and Efficient Time synchronization scheme for Border surveillance WSNs (SETB) which meets the requirements of border surveillance WSNs while minimizing the resource usage. To accomplish this goal, we first define the performance and security requirements for time synchronization in border surveillance WSNs in detail. Then, we build our time synchronization scheme optimized for these requirements. By utilizing both heterogeneous WSNs and one-way key chains, SETB satisfies the requirements with much less overhead than existing schemes. Additionally, we introduce on-demand time synchronization, which implies that time synchronization is conducted only when an intruder enters the WSN, in order to reduce energy consumption. Finally, we propose a method of deploying time-source nodes to keep the synchronization error within the requirement. Our analysis shows that SETB not only satisfies the performance and security requirements, but also is highly efficient in terms of communication and computation overhead, thus minimizing energy consumption.

Nonnegative matrix factorization (NMF) is one of the most popular tools for speech enhancement. In this letter, we present an improved semi-supervised NMF (ISNMF)-based speech enhancement algorithm combining techniques of noise estimation and Incremental NMF (INMF). In this approach, fixed speech bases are obtained from training samples offline in advance while noise bases are trained on-the-fly whenever new noisy frame arrives. The INMF algorithm is adopted for noise bases learning because it can overcome the difficulties that conventional NMF confronts in online processing. The proposed algorithm is real-time capable in the sense that it processes the time frames of the noisy speech one by one and the computational complexity is feasible. Four different objective evaluation measures at various signal-to-noise ratio (SNR) levels demonstrate the superiority of the proposed method over traditional semi-supervised NMF (SNMF) and well-known robust principal component analysis (RPCA) algorithm.

The sense of presence is often used to evaluate the performances of audio-visual (AV) content and systems. However, a presence meter has yet to be realized. We consider that the sense of presence can be divided into two aspects: system presence and content presence. In this study we focused on content presence. To estimate the overall presence of a content item, we have developed estimation models for the sense of presence in audio-only and audio-visual content. In this study, the audio-visual model is expanded to estimate the instantaneous presence in an AV content item. Initially, we conducted an evaluation experiment of the presence with 40 content items to investigate the relationship between the features of the AV content and the instantaneous presence. Based on the experimental data, a neural-network-based model was developed by expanding the previous model. To express the variation in instantaneous presence, 6 audio-related features and 14 visual-related features, which are extracted from the content items in 500-ms intervals, are used as inputs for the model. The audio-related features are loudness, sharpness, roughness, dynamic range and standard deviation in sound pressure levels, and movement of sound images. The visual-related features involve hue, lightness, saturation, and movement of visual images. After constructing the model, a generalization test confirmed that the model is sufficiently accurate to estimate the instantaneous presence. Hence, the model should contribute to the development of a presence meter.

A novel directional coupler loaded with feedback capacitances on the coupled lines is presented. Its effect of enhancing the coupling is qualitatively shown by deriving an equation for the coupling. Besides, a method to compensate for the phase difference between the even and odd modes of the coupler is presented. To demonstrate, a novel tandem 3-dB coupler consisting of the proposed coupled lines is designed and described. In addition, a waveguide (rectangular coaxial line) 8×8 HYB matrix using planar double-layer structure that is composed of the proposed tandem 3-dB couplers and branch-line couplers, which is operated in S-band, is designed and fabricated showing excellent performance.

This paper deals with the security of chaos-based “true” random number generators (RNG)s. An attack method is proposed to analyze the security weaknesses of chaos-based RNGs and its convergence is proved using a master slave synchronization scheme. Attack on a RNG based on a double-scroll attractor is also presented as an example. All secret parameters of the RNG are revealed where the only information available is the structure of the RNG and a scalar time series observed from the double-scroll attractor. Simulation and numerical results of the proposed attack method are given such that the RNG doesn't fulfill NIST-800-22 statistical test suite, not only the next bit but also the same output bit stream of the RNG can be reproduced.

In this letter, we propose a blind adaptive algorithm for joint compensation of inter-block interference (IBI) and frequency-dependent IQ imbalance using a single time-domain equalizer. We combine the MERRY algorithm for IBI suppression with the differential constant modulus algorithm to compensate for IQ imbalance. The effectiveness of the proposed algorithm is shown through computer simulations.

The amount of seasonings used during food preparation is quite important information for modern people to enable them to cook delicious dishes as well as to take care for their health. In this paper, we propose a near real-time automated system for measuring and recording the amount of seasonings used during food preparation. Our proposed system is equipped with two devices: electronic scales and a camera. Seasoning bottles are basically placed on the electronic scales in the proposed system, and the scales continually measure the total weight of the bottles placed on them. When a chef uses a certain seasoning, he/she first picks up the bottle containing it from the scales, then adds the seasoning to a dish, and then returns the bottle to the scales. In this process, the chef's picking and returning actions are monitored by the camera. The consumed amount of each seasoning is calculated as the difference in weight between before and after it is used. We evaluated the performance of the proposed system with experiments in 301 trials in actual food preparation performed by seven participants. The results revealed that our system successfully measured the consumption of seasonings in 60.1% of all the trials.

Multi-FPGA systems, which consist of multiple FPGAs and a printed circuit board connecting them, are useful and important tools for prototyping large scale circuits, including SoCs. In this paper, we propose a method for optimizing inter-FPGA signal transmission to accelerate the system frequency of multi-FPGA prototyping systems and shorten prototyping time. Compared with the number of I/O pins of an FPGA, the number of I/O signals between FPGAs usually becomes very large. Thus, time-multiplexed I/Os are used to resolve the problem. On the other hand, they introduce large delays to inter-FPGA I/O signals, and much lower the system frequency. To reduce the degradation of the system frequency, we have proposed a method for optimally selecting signals to be time-multiplexed and signals not to be time-multiplexed. However, this method assumes that there exist physical connections (i.e., wires on the printed circuit board) between every pair of FPGAs, and cannot handle I/O signals between a pair of FPGAs that have no physical connections between them. Thus, in this paper, we propose a method for obtaining indirect inter-FPGA routes for such I/O signals, and then combine the indirect routing method and the time-multiplexed signal selection method to realize effective time-multiplexing of inter-FPGA I/O signals on systems with various topologies.

Recently in the mobile graphic industry, ultra-realistic visual qualities with 60fps and limited power budget for GPU have been required. For graphics-heavy applications that run at 30 fps, we easily observed very noticeable flickering artifacts. Further, the workload imposed by high resolutions at high frame rates directly decreases the battery life. Unlike the recent frame rate up sampling algorithms which remedy the flickering but cause inevitable significant overheads to reconstruct intermediate frames, we propose a dynamic rendering quality scaling (DRQS) that includes dynamic rendering based on resolution changes and quality scaling to increase the frame rate with negligible overhead using a transform matrix. Further DRQS reduces the workload up to 32% without human visual-perceptual changes for graphics-light applications.

In this paper, we propose a localization algorithm that uses the time difference of arrival (TDOA) and the angle of arrival (AOA). The problem is formulated in a hybrid linear matrix equation. TDOA and AOA measurements are used for estimating the target's position. Although it is known that the accuracy of TDOA based localization is superior to that of AOA based localization, TDOA based localization has a poor vertical accuracy in deteriorated geometrical conditions. This paper, therefore, proposes a localization algorithm in which the vertical position is estimated by AOA measurements and the horizontal position is estimated by TDOA measurement in order to achieve high location accuracy in three dimensions. In addition, the Lagrange multipliers are obtained efficiently and robustly. The simulation analysis shows that the proposed constrained linear squares (CLS) algorithm is an unbiased estimator, and that it approaches the Cramer-Rao lower bound (CRLB) when the measurement noise and the sensor's location errors are sufficiently small.