This paper presents a partially resonant active filter based on a digital PWM control circuit with a DSP that can improve the power factor and input current harmonic distortion factor of distributed power supply systems in communications buildings. The steady-state and dynamic characteristics of this active filter are analyzed experimentally and the relationship between the control variables of digital control circuit with the DSP and performance characteristics such as regulation of the output voltage, input power factor, input current harmonic distortion factor, boundaries of stabilities and transient response are defined. Using the partially resonant circuit, the efficiency is over 91%, which is 0.9 point higher than that of non-resonant circuit and the high frequency switching noise is suppressed. Furthermore, the digital control strategy with the DSP proposed in this paper can realize the superior transient response of input current and output voltage for the step change of load, the power factor over 0.99 and total harmonic distortion factor less than 1.1%.

This study examines treatment of a boundary between media to simulate an acoustic field using the CIP method. The handling of spatial derivatives of fields is extremely important for CIP acoustic field analysis. We demonstrate a method of handling this boundary and report results of CIP acoustic field analysis using the present treatment.

In multiple-input multiple-output (MIMO) wireless relay networks, simultaneously using multiple relay nodes can improve the capacity of source-to-destination communications. Recent information theories have shown that passing the same message across multiple relay nodes can improve the capacity of source-to-destination communications. We have previously proposed three relay schemes that use jointly QR decomposition and the phase control matrix; computer simulations have confirmed the superiority of these schemes over conventional ones such as amplify-and-forward and zero-forcing schemes. In this paper, we analyze the capacity and achievable gains (distributed array gain, intra-node array gain and spatial multiplexing gain) of the previously proposed relay schemes (QR-P-QR, QR-P-ZF, and ZF-P-QR) and thus provide an insight into what contributes to their superiority over conventional schemes. The analyses show that the location of the relay nodes used has a significant impact on capacity. On the basis of this observation, we further propose a method that enables each relay node to individually select its relay scheme according to its channel conditions so as to maximize the capacity. A computer simulation confirms the capacity improvement achieved by the proposed selection method.

Future optical code division multiple access (CDMA) networks should be designed for multirate and fully integrated multimedia services. In the conventional schemes, multilength optical orthogonal codes (OOCs) are designed to support multirate systems, while variable-weight OOCs are designed to support differentiated quality of service (QoS) for multimedia applications. In this paper, a novel class of optical signature codes; multiple-length variable-weight optical orthogonal codes (MLVW-OOC) is proposed for supporting multirate and integrated multimedia services in optical CDMA networks. The proposed MLVW-OOC has features that are easy to construct variable-weight codes and expanded to multiple-length codes. A construction method for designing MLVW-OOCs up to three levels of codes is discussed. The designed MLVW-OOCs can support differentiated requirements on data rates and QoS for several types of services in the networks. A code analysis for obtaining the value of cross-correlation constraints or multiple access interference (MAI) computation for several levels of codes is also suggested. The cross-correlation constraints of the proposed codes are better than the conventional codes such as multilength OOCs. Finally, the bit error probability performance of the two-level MLVW-OOC is evaluated analytically. The results show that the proposed MLVW-OOC can provide differentiated bit error probability performances for several combinations of data rates and QoS.

In previous literature on adaptive transmission in multiuser OFDMA systems, only uncoded case or capacity (coded with infinite length of codeword) has been considered. In this paper, an adaptive transmission algorithm for coded OFDMA systems with practical codeword lengths is investigated. Also, in order to keep the feedback overhead within a practical range, a two-step partial CQI scheme is adopted, which has both better performance and reduced feedback overhead compared to conventional partial CQI schemes. By allowing a long codeword block across all allocated sub-bands with appropriate power and modulation order allocation rather than using short codeword blocks to each sub-band, high coding gain can be obtained, which leads to performance improvement.

This paper proposes probabilistic pruning techniques for a Bayesian video face recognition system. The system selects the most probable face model using model posterior distributions, which can be calculated using a Sequential Monte Carlo (SMC) method. A combination of two new pruning schemes at the resampling stage significantly boosts computational efficiency by comparison with the original online learning algorithm. Experimental results demonstrate that this approach achieves better performance in terms of both processing time and ID error rate than a contrasting approach with a temporal decay scheme.

This paper describes a novel discrimination method of pulmonary nodules based on statistical analysis of thoracic computed tomography (CT) scans. Our previous Computer-Aided Diagnosis (CAD) system can detect pulmonary nodules from CT scans, but, at the same time, yields many false positives. In order to reduce the false positives, the method proposed in the present paper uses a relationship between pulmonary nodules, false positives and image features in CT scans. The trend of variation of the relationships is acquired through statistical analysis of a set of CT scans prepared for training. In testing, by use of the trend, the method predicts the appearances of pulmonary nodules and false positives in a CT scan, and improves the accuracy of the previous CAD system by modifying the system's output based on the prediction. The method is applied to 218 actual thoracic CT scans with 386 actual pulmonary nodules. The receiver operating characteristic (ROC) analysis is used to evaluate the results. The area under the ROC curve (Az) is statistically significantly improved from 0.918 to 0.931.

An explicit expression for the impulse response coefficients of the predictive FIR digital filters is derived. The formula specifies a four-parameter family of smoothing FIR digital filters containing the Savitsky-Goaly filters, the Heinonen-Neuvo polynomial predictors, and the smoothing differentiators of arbitrary integer orders. The Hahn polynomials, which are orthogonal with respect to a discrete variable, are the main tool employed in the derivation of the formula. A recursive formula for the computation of the transfer function of the filters, which is the z-transform of a terminated sequence of polynomial ordinates, is also introduced. The formula can be used to design structures with low computational complexity for filters of any order.

The ESIGN signature scheme was initially proposed in 1985. Since then, several variants have been proposed, but only a few have been formally supported using the methodology of provable security. In addition, these schemes are different from the ESIGN-PSS signature scheme submitted to ISO/IEC-14888-2 for standardization. It is believed that ESIGN-PSS is secure against the chosen-message attack, however, there has not yet been any report verifying this belief. This paper presents the security proofs of ESIGN-PSS and a variant of this scheme, denoted ESIGN-PSS-R, which is a signature scheme comprising the ESIGN signature mechanism and the PSS-R mechanism.

A design method for an ultra-wideband bandpass filter (BPF) with four coupled lines has been developed. For demonstration purposes, 50 Ω-matched self-complementary antennas integrated with the ultra-wideband, differential-mode BPF with four coupled lines, a notch filter, and a low-pass filter (LPF) were prepared and tested. An optimized structure for a single-stage, broadside-coupled and edge-coupled four-lines BPF was shown to exhibit up to 170% fractional bandwidth and an impedance transformation ratio of 1.2 with little bandwidth reduction, both analytically and experimentally. Using the optimized structure, 6-stage BPFs were designed to transform the self-complementary antenna's constant input impedance (60πεe- 1/2(Ω)) to 50 Ω without degrading bandwidth. In addition, two types of filter variations--a LPF-embedded BPF and a notch filter-embedded BPF--were designed and fabricated. The measured insertion loss of both filter systems was less than 2.6 dB over the ultra-wideband (UWB) band from 3.1 GHz to 10.6 GHz. The filter systems were embedded in the wideband self-complementary antennas to reject unnecessary radiation over the next pass band and 5-GHz wireless LAN band.

Recent theoretical and experimental studies indicate that spatial multiplexing (SM) systems have enormous potential for increasing the capacity of corresponding multiple input multiple output (MIMO) channels in rich scattering environments. In this paper, we propose a new recursion based algorithm for Bell Labs layered space time (BLAST) signal detection in SM systems. The new algorithm uses an inflated recursion in the initialization and a deflated recursion in the iteration stage: as a result, the complexity is greatly reduced and the irregularity issues are completely avoided. Compared with the conventional fastest recursive approach, the complexity of our proposal is lower by a factor of 2 and it is also very implementation friendly.

We propose a service differentiation scheme for optical burst switching (OBS) with the scheduling algorithm Horizon. In the proposed scheme, in addition to the latest horizon used in the conventional Horizon, we introduce the second latest horizon and use them for reservation preemption. Burst priority order is perfectly guaranteed according to the burst class information informed by its control packet if the arrival time of the burst is later than the second latest horizon and earlier than the latest horizon. Since the extra offset time is no longer needed for service differentiation, the burst blocking probability and the data latency will be reduced. We assume a multi-hop network with ring topology where bursts traverse five intermediate nodes, and evaluate the performance in terms of the end-to-end and hop-by-hop burst blocking probabilities. Simulation results show that the proposed scheme can achieve service differentiation with smaller blocking probability than the extra-offset-time-based scheme with Horizon. Furthermore, we show that the proposed scheme preserves service differentiation even in multi-hop environments.

We consider an initialization problem in single-hop radio networks. The initialization is the task of assigning distinct ID numbers to nodes in a network. We have greatly improved the previous results [10] for the initialization in an n-node network. We propose randomized initialization algorithms in two cases. The first case is that n is known to all the nodes and the second case is that n is unknown to all the nodes. The algorithm for the first case completes in en+ln n+O (1) expected time slots, and the algorithm for the second case completes in en+O() expected slots. The main idea of the algorithm for the case that n is unknown is presumption of the number of nodes. In the algorithm, each node presumes the number of nodes efficiently and is assigned ID by using the algorithm for the case that n is known with the presumption value.

Traffic markers differentiate among packets from senders based on their service profile in the differentiated service networks. Researchers have previously revealed that the existing marking mechanism causes the unfairness in aggregates. This study presents a new marking algorithm. Simulation results demonstrate that the fairness of the proposed scheme exceeds that of SRTCM, TRTCM, TSWTCM and ITSWTCM for medium to high network provision levels.

This paper presents an automated design of linear and non-linear differential analog circuits accelerated by reuse of genetic operations. The system first synthesizes circuits using pairs of simplified MOSFET model. During the evolutionary process, genetic operations that improve circuit characteristics are stored in a database and reused to effectively obtain a better circuit. Simplified elements in a generated circuit are replaced by MOSFETs and optimization of the transistor size is performed using an optimizer available in market if necessary. The capability of this method is demonstrated through experiments of synthesis of a differential voltage amplifier, a circuit having cube-law characteristic in differential mode and square-law characteristic in common-mode, and a dB-linear VGA (Variable Gain Amplifier). The results show the reuse of genetic operations accelerates the synthesis and success rate becomes 100%.

We address the problem of routing and wavelength assignment (RWA) considering differentiated reliability (DiR) in WDM mesh networks. The backup resource can be shared by the primary lightpaths. However, both the primary-backup sharing and the different levels of fault tolerance requirement have never been considered together in the literature. In the paper, we consider the dynamic character of the link availability, which is caused by primary-backup sharing. Moreover, the priority of traffic is considered in the paper. The paper focuses on routing under dynamic availability of wavelength resource while the requested reliability of traffic has to be met, using the modified shortest path algorithm. A layered availability model is established based on wavelength layered graph model. Using this model, we propose a new algorithm called dynamic layered availability (DLA) algorithm. We evaluate the performance of the proposed algorithm on the NSFNET.

The crosstalks between a single-ended line and a differential pair in parallel are analyzed using telegrapher's equations for multi-conductor lines. The crosstalk from the single-ended trace to the differential pair is estimated at shunt-arm resistors in T or Π termination networks. The analysis is conducted by incorporating the termination conditions with the solution of the telegrapher's equations. The time-domain characteristics of the crosstalk are obtained by using the fast inverse Laplace transform. The measurements are conducted easily by using a single-ended digital oscilloscope since the crosstalk is evaluated on the shunt-arm resistors. Both the calculated and measured results are presented, and the characteristics of the crosstalk are also investigated qualitatively.

A novel PND (PMOS-NMOS-Depletion MOS) technology for a single poly gate non-volatile memory cell design has been reported for the first time. This technology features memory cell design with a differential cell architecture which enables to provide the higher performance for the key specifications such as programming time, erasing time, and endurance characteristics. This memory cell consists of 3-Transistors, PMOS, NMOS, and Depletion MOS transistors (hereafter PND). The DMOS in this cell is used for the tunneling device in the erasing operation, while the NMOS and the PMOS are used for the tunneling device and the coupling capacitor in the programming operation, respectively. The proposed PND design can allow lower applied voltage of the erase-gate (EG) and control-gate (CG) in the erasing and the programming operations so that the endurance characteristics can be improved because the DMOS suppresses the potential of floating-gate (FG) and hence the effective potential difference between the EG and the FG can be increased in the erasing operation. Based on the measured data, it can be expected that the erasing speed of the PND cell can be 125-fold faster than that of our previously reported work (PN type). Therefore, high performance and high reliability CMOS non-volatile memory without any additional process can be realized using this proposed PND technology.

In this paper, the effect of Halo concentration on performance of 30 nm gate length Double-Gate MOSFET with 30 nm thin body-Si is investigated by using two dimensional device simulator. We quantitatively show the dependency of electrical characteristic (subthreshold-slope, threshold voltage: Vth, drivability and leak current: Ion and Ioff) on the Halo concentration. This dependency can be explained by the reasons why the Halo concentration has directly effect on the potential distribution of the body. It is made clear that from viewpoint of body potential control, the design of Halo concentration is key technology for suppressing short-channel effect and improving subthreshold-slope, Ion and Ioff adjusting the Vth.

We investigate the issues involved in designing a packet scheduler for the proportional delay differentiation (PDD) model in differentiated services (DiffServ) networks. The PDD model controls the average waiting time of each class such that the average waiting time is proportional to its corresponding delay differentiation parameter. This paper proposes a novel packet scheduler for PDD referred to as the longest waiting time first (LWTF). By adding certain conditions, we found that the LWTF scheduler can be reduced to a known packet scheduler-priority queue with linear priorities (PQ-LP). The properties and behaviors of LWTF can be predicted from the analysis of PQ-LP. The simulation results in comparison with other PDD algorithms have also revealed that LWTF provides no worse level of service quality in long timescales and affords more accurate and robust control over the delay ratio in short timescales.