This paper proposes a λ-ring system that is a wavelength-based self-healing-ring application unlike ordinary fiber-based ones. To design survivable networks of interconnected such self-healing ring systems, a virtual mesh network scheme is used, in which wavelength assignment in virtual links can be considered according to the λ-ring-system or fiber-ring-system applications of the bidirectional wavelength-path switched architecture. Integer-programming-based design problems are then formulated that minimize the total fiber length in these self-healing-ring applications. Numerical examples show that the λ-ring-system application is always superior to 4-fiber and 2-fiber-ring-system applications and 1+1 end-to-end path protection.

Sequence estimation (SE) of narrow-band digital FM signals, such as CPFSK and GMSK, with non-coherent limiter/discriminator (L/D) and integrate and dump (I&D) detection is investigated in detail using both analysis and simulation. The BER is studied from approximate upper and lower bounds obtained through Chernoff bounding techniques and minimum error event path probability along with a Gaussian noise assumption for high SNR. Various IF filters and the dependence of the error probability upon modulation index are considered. The results show an optimum modulation index around h 0.55, and clearly demonstrate the effectiveness and limitations of sequence estimation.

We describe a simplified receiver structure having several receiving antennas (i.e., an adaptive array antenna system) and using time-division-multiplexing (TDM) signal processing. Three simplified receiver structures were investigated for use in the antenna system. To confirm the feasibility of using a TDM receiver, both a TDM receiver and a conventional adaptive array receiver were constructed for testing. In our proposed system, several repetitions of the constant modulus algorithm (CMA) are used to reduce co-channel interference (CCI). The frame format used for both receivers was the same as that of the personal handy phone system in Japan. The laboratory testing was done using a fading simulator to enable measurement of the bit error rate. The results are very promising and show the feasibility of the TDM receiver.

The differentiated services (diffserv) architecture has been proposed for implementing scalable service differentiation in the Internet. Expedited forwarding and assured forwarding have been standardized as Per-Hop Behaviors (PHB) in diffserv. Assured forwarding can be utilized to realize the service, which provides each user with a minimum guaranteed rate and a fair share of the residual bandwidth. We call it guaranteed rate (GR) service. With GR service, each packet for flow i is marked in or out based on comparison between the sending rate and the minimum guaranteed rate. When congestion occurs in networks, out packets are dropped more aggressively than in packets. Recently, several fair queuing schemes have been proposed for core stateless networks. They can achieve fairer bandwidth allocation than random early detection (RED). However, there have not been any studies that consider in/out bit usage to support GR service. This paper proposes how to extend the schemes that have been proposed for core stateless networks to allow the support of in/out bit usage. We present the performance of one of the extended schemes and compare the scheme to RED with in/out bit (RIO) in terms of fair bandwidth allocation.

This paper focuses on the comparison of OFDM system channel estimation using time domain techniques and using frequency domain techniques. The channel model is based on the Taiwan DTV field-testing results, with static and dynamic multipath distortion. The simulation results prove that the channel estimation performance of the OFDM system in the time domain is better than in the frequency domain.

The chemical stability of the constituent elements in polycrystalline Sr-Bi-Ta-O thin film with various Bi content prepared by metalorganic chemical vapor deposition (MOCVD) was investigated by X-ray photoelectron spectroscopy (XPS). Moreover, that of the epitaxial films was also investigated to estimate the effect of the grain boundary in polycrystalline films. Therefore, only the Bi element drastically changed from Bi3+ state to Bi0 one by the Ar sputtering. This change increased with increasing the Ta/Bi mole ratio in the film from 0.64 to 1.67. This result was observed not only for the polycrystalline films but also for the epitaxial films, suggesting that this is the grain character not grain boundary one. The stability and the leakage character of the film strongly depend on the constituent of the film.

A 2-step deposition technique was introduced in the heteroepitaxial growth of barium titanate (BaTiO3) thin films. Heteroepitaxial BaTiO3 films were prepared on a SrRuO3/SrTiO3 substrate by radio frequency (RF) magnetron sputtering with three kinds of deposition method: low RF-power deposition, 2-step deposition, and high power deposition. The crystallographic and ferroelectric properties were evaluated for the heteroepitaxial films. When the epitaxial capacitor was prepared by the 2-step deposition technique, the ferroelectric remanent polarization, 2Pr, was maximized. The optimized deposition condition to improve the crystal quality is discussed in terms of damage and diffusion, which could be introduced into the oxide films during the epitaxial growth, and controlled by the RF-power and deposition time, respectively.

Epitaxial SrTiO3(STO) film on epitaxial (Ti,Al)N/Si(100) was successfully obtained using a Ti-buffer layer. The SrTiO3 film was (100) oriented and grew in parallel epitaxial relationship (cube-on-cube), i.e., (100)SrTiO3//(100)(Ti,Al)N//(100)Si, <110> SrTiO3//<110> (Ti,Al)N//<110> Si. The Ti-buffer layer was grown on (Ti,Al)N by magnetron sputtering, and the thickness of the buffer layer was 2-10 nm. After the STO film was sputtered, the Ti-buffer layer was changed to polycrystalline anatase-TiO2.

We have developed a new scheme to provide Diffserv-based QoS over ATM access networks. Well-known Diffserv over ATM scheme requires some extension for conventional routers with ATM interfaces. The routers must map their Diffserv classes of services into ATM QoS classes and forward IP packets into prioritized VCs based on DSCP (DiffServ Code Point). The purpose of this work is to provide Diffserv-based QoS over ATM network using conventional IP over ATM interfaces on routers. We propose DSCP snooping at ATM edge nodes, which differentiates services over a single VC between two IP domains. A prototype circuit was used to evaluate this scheme.

We demonstrate all-optical clock recovery at 160 Gbit/s by injection locking of a 10 GHz mode-locked laser diode. Effective locking in a range of 10 MHz is observed for average input powers around -10 dBm. The timing jitter is analyzed for data rates between 10 Gbit/s and 160 Gbit/s. Beyond 40 Gbit/s, the high frequency timing jitter of the slave laser becomes of prime importance and has to be taken into account since it degrades the performance of a subsequent receiver. Increasing power penalties are found, especially beyond 80 Gbit/s.

In this paper, we propose a high-speed multiplier-free realization using ROM's to store the results of coefficient scalings in combination with higher signal rate and pipelined operations, without the need of hardware multipliers. By varying some parameters, the proposed structure provides various combinations of hardware and clock speed (or throughput). Examples are given comparing the proposed realization with the distributed arithmetic (DA) realization and direct-form realization with power-of-two coefficients. Results show that with proper choices of the parameters the proposed structure achieves a faster processing speed with less hardware, as compared to the DA realization, while it is much faster than the direct-form with slightly more hardware.

An important goal in communication theory is to construct good minimum squared Euclidean distance (MSED) codes for transmission over additive white Gaussian noise (AWGN) channels. In this paper, a new construction method for the M-ary phase-shift-keyed (M-PSK) codes over the ring structure ZM, the ring of integers modulo M, with a good minimum Euclidean distance, is proposed. The proposed codes are linear when multiple coset leaders are considered. The characteristics and performance levels of the newly constructed codes are analyzed for code length up to n 8. It is found that the proposed codes compare favorably with Piret's codes and Graeffe's method codes on Gaussian channels in terms of decoding complexity, coding gain, and error performance.

A parallel program with a fixed degree of parallelism cannot be executed efficiently, or at all, by a parallel computer with a different degree of parallelism. This will cause a problem in the distribution of software applications in the near future when parallel computers with various degrees of parallelism will be widely used. In this paper we propose a way to make the machine code of the programs parallelism-independent, i.e. executable in minimum time on parallel computers with any degree of parallelism. We propose and evaluate three parallelism-independent scheduling algorithms for direct acyclic graphs (DAGs) of tasks with non-uniform execution times. To prove their efficiency, we performed simulations both with random DAGs and DAGs extracted from real applications. We evaluate them in terms of schedule length, computation time and size of the scheduled program. Their results are compared to those of the traditional CP/MISF algorithm which is used separately for each number of processors.

Cache memories are small fast memories used to temporarily hold the contents of main memory that are likely to be referenced by processors so as to reduce instruction and data access time. In study of cache performance, most of previous works have employed simulation-based methods. However, that kind of researches cannot precisely explain the obtained results. Moreover, when a new processor is designed, huge simulations must be performed again with several different parameters. This research classifies cache structures for superscalar processors into four types, and then represents analytical model of instruction fetch process for each cache type considering various kinds of architectural parameters such as the frequency of branch instructions in program, cache miss rate, cache miss penalty, branch misprediction frequency, and branch misprediction penalty, and etc. To prove the correctness of the proposed models, we performed extensive simulations and compared the results with the analytical models. Simulation results showed that the proposed model can estimate the expected instruction fetch rate accurately within 10% error in most cases. This paper shows that the increase of cache misses reduces the instruction fetch rate more severely than that of branch misprediction does. The model is also able to provide exact relationship between cache miss and branch misprediction for the instruction fetch analysis. The proposed model can explain the causes of performance degradation that cannot be uncovered by the simulation method only.

Efficient query processing in multi-dimensional indexing structures is an important issue for multimedia data applications. In this paper, we propose incremental k-nearest neighbor query (k-NNQ) and range query algorithms for R-tree based structures. The novel aspect of these algorithms is that they make use of the notion of VP filtering, a concept borrowed from the MVP-tree. The filtering notion allows for delaying of computational overhead until absolutely necessary. By so doing, we attain considerable performance benefits while paying insignificant overhead during the construction of the index structure. We implemented our algorithms and carried out experiments to demonstrate the capability and usefulness of our method. Results show that improvements range from 8% to 23% in response time for the experimental environment that we considered.

In QoS networks, routing algorithms for QoS traffic have to provide the transmission path satisfying its QoS requirement while achieving high utilization of network resources. Therefore, server-based QoS routing algorithms would be more effective than distributed routing ones which are very common on the Internet. Furthermore, we believe that rerouting function enhances the advantage of their algorithms in which an already accepted flow with established path is replaced on some other path in order to accept newly arriving transmission request if it can not be accepted without doing so. Thus in this paper, we will propose a rerouting algorithm with the server-based QoS routing and evaluate its performance in terms of the blocking probability by computer simulation. In addition, we will investigate the impact of the amount of traffic with high-priority on the performance in some network topologies. Through some simulation results, we also discuss some issues arising in improving the effectiveness of rerouting.

This paper proposes an automatic system which can perform the entire diagnostic process from the extraction of the liver to the recognition of a tumor. In particular, the proposed technique uses shape information to identify and recognize a lesion adjacent to the border of the liver, which can otherwise be missed. Because such an area is concave like a bay, morphological operations can be used to find the bay. In addition, since the intensity of a lesion can vary greatly according to the patient and the slice taken, a decision on the threshold for extraction is not easy. Accordingly, the proposed method extracts the lesion by means of a Fuzzy c-Means clustering technique, which can determine the threshold regardless of a changing intensity. Furthermore, in order to decrease any erroneous diagnoses, the proposed system performs a 3-D consistency check based on three-dimensional information that a lesion mass cannot appear in a single slice independently. Based on experimental results, these processes produced a high recognition rate above 91%.

A completely symmetric dual-level spiral inductor structure is proposed. The symmetry, area efficiency, the size dependence of the coupling factor, and the quality factors of the dual-level inductors are evaluated and compared with that of the single-level. This work demonstrates that, with most RF applications, the dual-level inductors are the better choice than the single-level.

In this paper, multiuser detector (MUD) based on radial basis function (RBF) is proposed and simulated for a multicode DS/CDMA system in an AWGN and a multipath fading channels. The performance of RBF-based MUD is compared with that of many suboptimal multiuser detectors in terms of bit error probability. To obtain simulation results, importance sampling technique is employed. From the simulation results, it is confirmed that the RBF-based MUD outperforms decorrelating detector, and achieves near-optimum performance under various environments. The results in this paper can be applied to design of MUD for a multicode DS/CDMA system.

In this paper, we first propose a new speech enhancement preprocessing algorithm by combining power subtraction method and maximal ratio combining technique, then apply it to both energy-based and statistical model-based VAD algorithm to improve the performance even in low SNR conditions. We also perform extensive computer simulations to demonstrate the performance improvement of the proposed VAD algorithm employing the proposed speech enhancement preprocessing algorithm under various background noise environments.