Transmit power planning in the W-CDMA downlink, especially planning of the total transmit power of base stations and their apportionment to common control channels, is discussed taking cell coverage planning into account. A transmit power planning procedure is proposed for common control channels based on both link-level and system-level simulations. An analysis on optimum power allocation for common pilot channels is also presented. Link budgets that are applicable to downlink common control channels are developed and presented.

While higher chip rate can provide better performance for Direct Sequence/Code Division Multiple Access (DS/CDMA) systems due to larger process gain, it may also induce spectrum emission to adjacent channels, i. e. , adjacent channel interference. Especially, if different operators use adjacent channels in the same area with uncoordinated power levels, such interference becomes large, and excessively higher chip rate will decrease the efficiency of a system. In this context, this paper evaluates the relation between chip rate and capacity in DS/CDMA cellular communication systems considering adjacent channel interference from other systems. First, the classification of adjacent channel interference between two independent DS/CDMA systems is described, and the concrete interference levels are calculated for several chip rates. Then, by using computer simulation, the system CDMA capacity is evaluated under adjacent channel interference. From these results, we can find that the excessively higher chip rate can not always provide the larger system CDMA capacity in spite of the larger process gain, and there exists the appropriate chip rate for a certain given bandwidth.

This paper describes a 600 mV single-chip MPEG2 video decoder, implemented in a 0.5 µm triple metal CMOS technology, which operates with a 3.3-volt power supply. To achieve low power consumption, a low power dual-port RAM has been developed utilizing a selective bit line precharge scheme to reduce bit line current which is suitable for use in the bit-slice array commonly found in parametric ASIC RAM macro modules. This architecture and a non-DC current sense amp make the RAM's read power consumption one-third of that of a conventional dual-port RAM. Various techniques such as multiple-clock architecture and a system clock independent from a display clock make a system clock frequency as low as possible. The video decoder has a syntax parser, so that it can handle the higher syntactic elements of MPEG2 bit streams without any host processor and decode the Main profile at Main level of MPEG2 bit streams.

Clustering is one of the most important topics in the field of knowledge discovery from databases. Especially, hierarchical clustering is useful since it gives a hierarchical view of a whole database and can be used to guide users in browsing a huge database. In many cases, clustering can be modeled as a graph partitioning problem. When an appropriate distance function between database objects is given, a database can be viewed as an edge-weighted complete graph, where vertices are database objects and weights of edges are distances between them. Then a process of MST (Minimal Spanning Tree) construction can be viewed as a process of a single-linkage agglomerative clustering process for database objects. In this paper, we propose an efficient MST construction method for a large complete metric graph, which is derived from a database with a metric distance function defined on it. Our method utilizes a metric index to reduce the number of distance calculations. The basic idea is to exclude those edges less probable to be a part of an MST by using the metric postulate. For this purpose, we introduce a new metric index named MetricMatrix. Experimental results show that our method can drastically reduce the number of distance calculations needed for MST construction in comparison with the classical method.

A 1 Mbit/s optical data bus employing micro-optic directional couplers, which can compatibly replace an electrical bus cable in an in-line work station computer system connecting a central processor and four work stations up to 1.5 km apart, has been developed, and the feasibility has been confirmed.

Sea clutter was measured using an X-band radar at very high grazing angles between 8.2 and 17.5. The sea state was 7 with the wave height of 6 to 9m. The wind velocity was 25m/s. It is shown that sea clutter amplitudes obey the log-normal and K distributions using the Akaike Information Criterion (AIC) , which is more rigorous fit to the distribution to the data than the least squares method.

Muscle based face image synthesis is one of the most realistic approaches to the realization of a life-like agent in computers. A facial muscle model is composed of facial tissue elements and simulated muscles. In this model, forces are calculated effecting a facial tissue element by contraction of each muscle string, so the combination of each muscle contracting force decides a specific facial expression. This muscle parameter is determined on a trial and error basis by comparing the sample photograph and a generated image using our Muscle-Editor to generate a specific face image. In this paper, we propose the strategy of automatic estimation of facial muscle parameters from 2D markers'movements located on a face using a neural network. This corresponds to the non-realtime 3D facial motion capturing from 2D camera image under the physics based condition.

For the effectively therapeutic conditions of laser acupuncture, as a first step, this letter examines the thermal stress inside the skin tissue produced by laser acupuncture. A method is presented of calculating the 3-dimensional thermal stress. The numerical results are also shown.

In communication systems such as mobile telecommunication systems and the Internet, resource sharing among coexisting real-time and non-real-time services is extremely important to provide multimedia services. This paper analytically investigates the performance of the packet data control algorithm proposed in. This algorithm efficiently uses radio resources by utilizing the remaining capacity that is not used by real-time services. The state probability vectors and transition probability matrices of both the real-time and non-real-time services are first derived and then the delay characteristics, the outage probability of voice users, and the outage probability of data users are evaluated. A performance analysis with high bit-rate non-real-time services is also presented.

This paper describes a 16-b fixed point digital signal processor(DSP), especially its multiply-accumulate(MAC) unit, memories, and instruction set.By adopting a redundant binary multiplier and a variable pipeline structure, this DSP's MAC unit, compared to a conventional MAC unit, consumes about 15% less power and operates 24% faster. Furthermore, its doublespeed MAC mechanism can realize twice the performance of a single MAC operation while consuming only 69% more power. By being able to more finely control which portions of memory are activated, the data ROM and data RAM's precharge current was reduced to about 1/8 of the conventional ROM and RAM's. We redesigned the instruction set and reduced its width from 32 b to 24 b based on the analysis of data generated by simulating an application program on our previous DSP. The reduction in instruction width made our on-chip instruction memory size 33% smaller than the previous one. This chip is fabricated with a 0.5- µm double-metal-layer CMOS process and achieves 80-MOPS-peak double speed multiply-accumulate performance.

It is important to analyze a tracking or synchronizing process in Spread Spectrum (SS) receiving system. The most common SS tracking system considered here consists of pseudorandom (PN) generator, Lowpass Filter (LPE) and Voltage Controlled Oscillator (VCO). The SS receiver is to track or synchronize its local PN generator to the received PN waveform by VCO. The fundamental equation of the system is known by a second order nonlinear differential equation in terms of phase difference between local PN generator and received PN waveform. The differential equation is nonautonoumous due to PN function of time t with period T. Picking up the gain of VCO as the main parameter in the system we show that the system has bifurcation from the normal oscillation through subharmonic oscillation to finally chaos. In the final case, chaos is confirmed by investigating maximum Liapunov number and both stable and unstable manifolds.

The next generation mobile communications systems must support multimedia communications services as well as conventional voice service. DS-CDMA is regarded as the most promising candidate, because it is indispensable to cope with multimedia. The system capacity of DS-CDMA system is limited by the total interference level. As a result, in DS-CDMA systems many users suffer very poor communication quality if the total interference level exceeds this limit. Therefore, this paper considers smoothing interference fluctuation using the difference between voice and data in a type of QoS (quality of service). In other words, voice communication is suitable for a loss system because the quality of voice communication is delay-sensitive. On the other hand, data communication is suitable for a waiting system because the quality of data communication is non-delay-sensitive. This paper focuses on a system that applies a circuit switching method for voice traffic and a reservation type packet switching method for data traffic and proposes a data traffic control method. In this proposed data traffic control method, a base station controls data transmission from a mobile station to utilize unused voice traffic resources. As a result, the proposed method achieves highly efficient use of the radio spectra by smoothing interference fluctuation in DS-CDMA systems. This paper evaluates the performance level of the proposed method from a system capacity standpoint. It is shown that the proposed method achieves higher system capacity in voice/data integrated transmission.

We propose in this paper a SOM-like algorithm that accepts online, as inputs, starts and ends of viewing of a multimedia content by many users; a one-dimensional map is then self-organized, providing an approximation of density distribution showing how many users see a part of a multimedia content. In this way "viewing behavior of crowds" information is accumulated as experience accumulates, summarized into one SOM-like network as knowledge is extracted, and is presented to new users as the knowledge is transmitted. Accumulation of multimedia contents on the Internet increases the need for time-efficient viewing of the contents and the possibility of compiling information on many users' viewing experiences. In the circumstances, a system has been proposed that presents, in the Internet environment, a kind of summary of viewing records of many viewers of a multimedia content. The summary is expected to show that some part is seen by many users but some part is rarely seen. The function is similar to websites utilizing "wisdom of crowds" and is facilitated by our proposed algorithm.

In W-CDMA systems, distributions of the interference power and the total transmit power both measured at base stations are respectively used for capacity analysis in the uplink and downlink. For accurate capacity analysis, these quantities must be in proportion to the traffic amount. However, these quantities are no longer in proportion to the traffic amount since the transmit power control maintains the signal to interference power ratio at a constant level. Although the relationship between these measurements and the traffic amount has been investigated, there are still challenges to calculate the statistics such as the blocking probability or the outage probability accurately. This paper proposes a method to calculate the blocking probability by transforming the distributions of these measurements into distributions that are referred to as "traffic equivalent distributions," where the distributions are automatically adjusted according to the traffic amount. The calculated results show good agreement with the results obtained by dynamic computer simulations in the uplink, and show good agreement in the downlink as well when the traffic load is light. Accurate calculation of the blocking probability using a feedback loop and the observation of the traffic equivalents is also reported.

We propose receiver authentication and group key delivery protocol (AKDP) to realize secure multicast communication. AKDP provides three principal functions: 1) group key delivery for data confidentiality, 2) receiver access control to cope with denial of service and 3) receiver authentication for user accounting. AKDP has a negotiation function to choose and offer only those functions required by the situation. We evaluate the feasibility of AKDP by developing a prototype system and show that total communication time is acceptable (i.e. 406 ms). We also show that the negotiation function of AKDP reduces total communication time because unnecessary functions can be skipped. We demonstrate that the negotiation function reduces the total communication time by 52% if user accounting is not executed. We also find that the scalability of group control and key server is not insignificant if multiple receivers access it simultaneously; however, we also propose a secure multicast architecture that can accommodate multiple servers and so guarantee scalability.

This is commonly thought that CASE tools reduce programming efforts and increase development productivity. However, no paper has provide quantitative data supporting the matter. This paper discusses productivity improvement through the use of an integrated CASE tool system named EAGLE (Effective Approach to Achieving High Level Software Productivity), as shown by various data collected in Hitachi from the 1980s to the 2000s. We have evaluated productivity by using three metrics, l) program generation rate using reusable program skeletons and components, 2) fault density at two test phase, and 3) learning curve for the education of inexperienced programmers. We will show that productivity has been improved by the various facilities of EAGLE.

This paper describes a new, low power 16-bit Digital Signal Processor (DSP). The DSP has a double-speed MAC mechanism, an accelerator for Viterbi decoding, and a block floating section which contribute to lower power consumption. The double-speed MAC can perform two multiply and accumulate operations in one instruction cycle. Since MAC operations are so common in digital signal processing, this mechanism can reduce the average clock frequency of the DSP resulting in lower power consumption. The Viterbi accelerator and block floating circuitry also reduce the clock frequency by minimizing the number of required cycles needed to be executed. The DSP was fabricated using a 0.8 µm CMOS 2-aluminum layer process technology to integrate 644 K transistors on a 9.30 mm9.09 mm die. It can realize an 11.2 kbps VSELP speech CODEC while consuming only 70 mW at 3.5 V Vdd.

Region of interest (ROI) coding is a useful function for many applications. JPEG2000 supports ROI coding and can decode ROIs preferentially regardless of the shape and number of the regions. However, if the number of regions is quite large, the ROI coding performance of JPEG2000 declines because the code-stream includes many useless non-ROI codes. This paper proposes a wavelet-based ROI coding method suited for multiple ROIs. The proposed wavelet transform does not access any non-ROIs when transforming the ROIs. Additionally, the proposed method eliminates the need for unnecessary coding of the bits in the higher bit planes of non-ROI regions by adding an ROI map to the code-stream. The experimental results show that the proposed method achieves a higher peak signal-to-noise ratio than the ROI coding of JPEG2000. The proposed method can be applied to both max-shift and scaling-based ROI coding.