This paper proposes an LDMOSFET (Lateral Double-diffused MOSFET) that has the robustness against the hardest ESD (Electrostatic Discharge) requirement for automobile ECUs (Electronic Control Units) of discharging 25 kV 150 pF through 150 ohm 1 µH without external protecting circuits. The basic idea to achieve this is to add a novel discharge circuit to an LDMOSFET, which turns on when Human Body Model (HBM) type ESD is applied, and to consume the discharge energy in SOA (Safe Operating Area) in the LDMOSFET, avoiding localized current crowding of a parasitic bipolar transistor which causes the conventional ESD device failure. First, dynamics of current crowding when a grounded gate LDMOSFET is exposed to ESD stress is described by means of a circuit level SPICE simulation on a parallel distributed device model. Then a novel ESD turn-on LDMOSFET with a discharge MOSFET is proposed, which has ESD robustness of 25 kV. Finally the ESD measurements of the new device are shown to be in good accordance with estimation and to satisfy the target.

This paper proposes a synchronous acquisition method using correlation mapping by multiple-dwell detection considering false alarm penalty in M-ary/SS systems. In the method, first, the correlation value between a received signal and each assigned sequence in an M-ary/SS system in some short duration is calculated for each phase and stored in the mapping. Second, the maximum correlation value of each phase in the mapping is selected and arranged, then, the first probable synchronous phase is decided by the maximum one in these values. Simultaneously, data demodulation starts. Next, to recognize the synchronous phase, i.e., as considering false alarm penalty, the correlation values are calculated in longer duration, and the second probable phase with high reliability can be obtained by suppression of noise to signal level. Finally, if the second synchronous phase is different from the first one, the second one is reset. By this method, a short acquisition time and high reliability of acquisition can be achieved. The improvement of acquisition time and the optimal combination values of dwelling time, which is duration to calculate the correlation, are shown for several conditions in asynchronous M-ary/SSMA.

This paper suggests the way to perform the handover by predicting the movement route of the mobile terminal by considering the movement pattern of the user. By considering the fact that the most users has the constant movement pattern, the channels needed for the handover can be reserved, and the required quality of service (QoS) is maintained during handover. The suggested algorithm makes the channel allocation schemes more efficient.

A low loss magnetic plate positioned near an antenna is proposed to increase radiation efficiency of cellular phones. This magnetic plate is used to control the nearby magnetic field around the cellular phone's antenna, and this field controlling is shown to be effective for the improvement of radiation efficiency and far-field pattern. As for the material design of the plate, a magnetic plate having high µr and low µr" (complex relative permeability: µr = µr - j µr") is found to be effective for achieving high performance. In our sample fabrication, a low loss magnetic sample with µr = 5.7 - j 0.7 at 900 MHz is realized. It is demonstrated that this low loss sample contributes to increased efficiency and improved far-field characteristics.

Filtering and smoothing using a non-Gaussian state space model are proposed for motion trajectory of feature point in image sequence. A heavy-tailed non-Gaussian distribution is used for measurement noise to reduce the effect of outliers in motion trajectory. Experimental results are presented to show the usefulness of the proposed method.

The model to calculate high frequency C-V characteristics of ferroelectric capacitors that have not been modeled yet is presented. At first, P-V hysteresis model necessary to calculate C-V characteristics is improved by introducing two modification factors and by comparing with experimental results. Then, other parameters to express high frequency C-V characteristic of the metal/ferroelectric/metal structure are derived, in which the response for AC signal input is considered. Finally, it has been shown that these models predict well the C-V hysteresis shapes of the MFIS and the MFMIS structures.

This paper describes a realtime 3D sound localization algorithm to be implemented with the use of a low power embedded DSP. A distinctive feature of this implementation approach is that the audible frequency band is divided into three, in accordance with the analysis of the sound reflection and diffraction effects through different media from a certain sound source to human ears. In the low, intermediate, and high frequency subbands, different schemes of the 3D sound localization are devised by means of an IIR filter, parametric equalizers, and a comb filter, respectively, so as to be run realtime on a low power embedded DSP. This algorithm aims at providing a listener with the 3D sound effects through headphones at low cost and low power consumption.

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.

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 stage 3/2 decoding scheme, originally suggested by U. Timor, is modified for a Rayleigh fading channel to improve the performance of a fast frequency-hopped multiple access/multilevel frequency shift keying system. When signal-to-noise ratio per bit is 30 dB, the simulation results show that the modified stage 3/2 decoding scheme increases the spectral efficiency by 11% compared to the modified stage 1 decoding scheme at bit error rate of 10-3. Further, the performance comparisons are made between the modified multistage decoding scheme and the diversity combining methods, where the modified stage 3/2 decoding scheme shows better performance.

The inter-cell interference between uplinks and downlinks in CDMA packet communication systems, employing a shared-TDD scheme, is evaluated under cellular environments. It is found that interference between base stations rarely degrades uplink throughput, but interference between mobile stations substantially degrades downlink throughput. A transmission power control scheme is proposed to improve the downlink throughput. The proposed scheme increases the transmission power of downlink packets when they are re-transmitted, and thus, improves the signal-to-interference ratio of the downlink re-transmission packets. Computer simulation shows that this scheme increases downlink throughput without sacrificing the uplink throughput until the uplink throughput reaches a maximum value.

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.

In server load balancing where replicated servers are dispersed geographically and accesses from clients are distributed to replicated servers, a way of distributing the accesses from clients to an adequate server plays an important role from the viewpoint of load balancing. In the paper, we propose a new network paradigm for server load balancing using active anycast. In active anycast, an end user only sends its request to group of servers using an anycast address. When this request arrives at an active router, it selects an adequate server from the viewpoint of load balancing and changes the anycast address of a packet to the unicast address of the selected server. The decision which server is the best one from the viewpoint of server load balancing is made by an active router rather than an end user, so active anycast is a network-initiated method. Simulation results show that active anycast can accomplish efficient server load balancing, even when a small part of routers are equipped with active network technology.

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.

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.

In this paper, we survey the fairness issues in the congestion control mechanisms of TCP, which is one of most important service aspects in the current and future Internet. We first summarize the problems from a perspective of the fair service among connections. Several solution methods are next surveyed. Those are modifications of TCP congestion control mechanism and router support for achieving the fair service among TCP connections. We finally investigate the fair share of resources at endhosts.

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%.

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.

One drawback of Integrated service architecture is the scaling problem. Therefore, flow aggregation is an important solution for supporting quality of service in large-scale network. In advance reservation, priori information of advance-reserved requests can be used for flow aggregation before their initiation time. However, an impolitic aggregation can lead to violate admission control. In this paper, we propose an effective algorithm to aggregate advance-reserved requests with guaranteed delay. The proposed algorithm not only can reduce the amount of state in core network but also minimize the bandwidth consumption. The simulation result indicates that the state in the core network can be reduced as low as 17.3% even in the worst case.

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.