A 33-cm-Diagonal High-Resolution(1280 1024RGB, which stands for red, green, and blue) TFT-LCD with low, uniform parasitic capacitance between gate electrodes and source/drain electrodes has been developed using Fully Self-Aligned a-Si TFTs. The fabricated TFT-LCD shows no visible seams between block shot exposure regions, even in the display of gray images. In this paper, we describe(1) our full self-alignment technology for the TFTs, including the fabrication process and the technology for reducing OFF current in the TFTs under illumination, (2) SPICE simulation for estimating pixel voltage shift in the fabricated TFT-LCD, and (3) performance results for the fabricated TFT-LCD.

This paper presents a binary neural network approach for link activation problems in multihop radio networks. The goal of the NP-complete problems is to find a conflict-free link activation schedule with the minimum number of time slots for specified communication requirements. The neural network is composed of NM binary neurons for scheduling N links in M time slots. The energy functions and the motion equations are newly defined with heuristic methods. The simulation results through 14 instances with up to 419 links show that the neural network not only surpasses the best existing neural network in terms of the convergence rate and the computation time, but also can solve large scale instances within a constant number of iteration steps.

This letter points out that while a class of conditions presented in Matsuoka K. [1] are truly sufficient for absolute stability of neural networks, the proof of the sufficiency given in [1] is not sound. As a remark, a mathematically rigorous proof of the sufficiency of the class of conditions for absolute stability of neural networks is provided.

A method based on clustering is presented for restoring and segmenting gray scale images. An optimum clustering obtained by a gradient method gives an image with gray scale values which vary smoothly in each segmented region. The method is also applied to restoration from sparsely sampled data.

We present a volume rendering algorithm which renders images at approximately two to seven times the speed of a conventional ray caster with almost no visible loss of image quality. This algorithm traverses the volume data in object order and renders the image by performing ray casting for the pixels within the footprint of the voxel (i.e., rectangular prism) being processed. The proposed algorithm supports the rendering of both single and multiple isosurfaces with arbitrary opacity values. While the projection approach to volume rendering is not new, we present an algorithm specifically designed for the perspective projection, evaluate its rendering speed for both single and multiple isosurfaces with arbitrary opacity values, and examine how efficiently it uses cache memory.

This paper describes communication traffic characteristics in cellular systems employing the concept of reuse partitioning and Dynamic Channel Assignment. Such systems hava a problem of the spatial unbalance of blocking probability. The objective of this paper is overcoming this problem. To accomplish this objective, we use a method for analyzing communication traffic characteristics. We also show results on traffic characteristics in the systems.

We proposed a new marker design for passive alignment of a laser to a fiber on a silicon waferboard. Our fiducial marker is simple form and easy to fabricate. With a unique marker design, high accurate positioning of the laser chip is easily achieved using a conventional flip-chip bonder. We have successfully fabricated laser modules with uniform coupling, within 1 dB for a flat end single-mode fiber and within 2 dB for a hemispherical end fiber. This assembly method offers the potential for low-cost optical module packaging.

Precise direct mounting of laser diode (LD) and photodiode (PD) chips on silica planar lightwave circuits (PLCs) has been investigated for application to transceiver modules. To achieve submicron optical alignment, self-aligned index marks on the PLCs and LDs were directly detected by transmission infrared light. The repeatability of the positioning was measured to be within 0.125 µm. The output power of the resultant module was 0.2 mW at 80 mA. A waveguide-type PD was also mounted in the same way, and module sensitivity of 0.25 A/W was demonstrated.

The uncertainty involved in the gradient constraint for optical flow detection is often modeled as constant Gaussian noise added to the time-derivative of the image intensity. In this paper, we examine this modeling closely and investigate the error behavior by experiments. Our result indicates that the error depends on both the spatial derivatives and the image motion. We propose alternative uncertainty models based on our experiments. It is shown that the optical flow computation algorithms based on them can detect more accurate optical flow than the conventional least-squares method.

In packet radio networks with TDMA, the throughput performance of network should be degraded due to the unequal traffic of each user. To overcome this problem, Mini-Slotted Alternating Priorities (MSAP) and TDMA with Parallel Transmission (TDMA/PT) were proposed. Especially, TDMA/PT can attain the thorughput performance more than one, even under unequal traffic. However, TDMA/PT cannot be used for mobile networks, because each terminal should know the location of every other terminal. In this paper, we propose an entirely new protocol named Slot Reservation TDMA with Parallel Transmissino: SR-TDMA/PT," which is suitable for mobile networks because a central station is able to locate every terminal easily. The central station also reserves time slots for each terminal so as to transmit packets in parallel as much as possible. Therefore, the throughput performance of SR-TDMA/PT is higher than TDMA/PT. We describe SR-TDMA/PT in detail and evaluate the performance of this protocol by simulation under various conditions.

A deterministic pushdown automaton (dpda) having just one stack symbol is called a deterministic restricted one-counter automaton (droca). A deterministic one-counter automaton (doca) is a dpda having only one stack symbol, with the exception of a bottom-of-stack market. The class of languages accepted by droca's is a proper subclass of the class of languages accepted by doca's. Valiant has shown that the regularity problem for doca's is decidable in a single exponential worst-case time complexity. In this paper, we prove that the class of languages accepted by droca's which accept by final state is incomparable with the class of languages accepted by droca's which accept by empty stack (strict droca's), and that the intersection of them is equal to the class of strict regular languages. In addition, we present a new direct branching algorithm for checking the regularity for not only a strict droca but also a real-time droca which accepts by final state. Then we show that the worst-case time complexity of our algorithm is polynomial in the size of each droca.

A new multi-functional card with a display, sounder and input keys, and related communication equipment, including a microwave base station and a contactless surface reader/writer, have been developed to perform the functions of positioning, paging, returning a message and identity certification. We confirmed that a prototype subsystem was capable of providing a simple and automatic call forwarding service. The multi-functional card as an ID card and a personal data terminal, and its subsystem can provide new personal services for a multimedia office.

A simple algorithm is proposed for representing nonseparable functions by equivalent separable functions. In this algorithm, functions are first represented by computational graphs, which are directed graphs representing the computational process of the functions. Then, the vertices of the computational graphs are searched in preorder or postorder, and the transformation to separable forms is performed at the places where it is necessary. By this repetition of the transformation, nonseparable functions are represented by separable functions automatically. The proposed algorithm will be useful in various fields of science and engineering because funcutions of one variable are easy to deal with.

The paper deals with the evaluation of performance of current cellular systems which are required to accommodate in an already operating system a wide range of new services, with different quality requirements (on delays, retransmission rates, etc.), and often characterised by a high burstiness (i. e. with relatively short traffic bursts, interleaved by comparatively long silence periods). To this end, an extension of packet communications is appealing for its inherent flexibility; standardisation of packet protocols for data transmission over idle GSM channels is in progress, and a similar service exploiting AMPS radio and network resources is already specified as Cellular Digital Packet Data. In both cases voice traffic retains a higher priority. The paper focuses on the evaluation of the effect of this additional traffic on existing voice traffic in a GSM Phase 2+ system. Although voice calls experience the same channel availability, their performance are worsened by the higher co-channel interference due to the higher average channel occupancy. This impairment cannot be tackled, as a matter of course, by increasing the re-use distance as this would affect the overall system capacity. The paper suggests the use of smart planning strategies capable to ease control of interference levels with a negligible impact on system complexity and signalling load.

This paper proposes Channel Reservation for Ahead Cells (CRAC)" scheme for street micro-cellular systems. The scheme enables mobiles to reserve the same channel over several cells at once. This paper analyzes both CRAC and FCA (Fixed Channel Assignment) in a ring-shaped service area where high speed mobiles and low speed mobiles move. In the analysis, the priority control which prioritizes hand-off calls and reservation calls over new calls over new calls is also taken into account. Obtained results include the blocking rate, the forced call termination rate, the average number of channel changings and the system utilization. From numerical results, CRAC is found to perform better than FCA with regard to the average number of channel changings and the forced call termination rate.

In this paper, a feasible optical code-division multiple-access (CDMA) technique is proposed for high-speed computer networks using prime codes and optical signal processing to guarantee real-time data communications. All-optical architectures for fastly tunable CDMA encoders and decoders are presented, which can be feasibly implemented in the optical domain by using electrooptic switches and optical delay lines. This can support an ultrahigh throughput and a very fast reconfiguration time. Furthermore, we present a self-synchronized sample technique to ensure the correct phase synchronization between optical clock stream and asynchronous electronic data at each electrooptic modulator of an optical CDMA transmitter.

Video services such as video-on-demand are expected to be a motivation for deploying multimedia services in residential areas. These services should increase customer demand for video channels as customer demands become more sophisticated and diverse in the future. Therefore, it is important to determine how network configurations (i.e. network transition scenarios) should evolve in response to changes in access network demand. This paper proposes economical deployment of access networks based on transition scenarios. We conclude that transition scenarios offer more economical deployment than single-network configurations. Two transition scenarios, from passive double-star to fiber single-star, and from hybrid fiber-coax to fiber single-star, are evaluated as examples. These transition scenarios are economical even when customer demand changes. The transition starting time affects the present worth of annual charges (PWAC) of access networks more than the transition period does.

This paper describes the concept of the regional community network system. The system provides PC connectionless communication services to residential customers and a platform on which customers can construct closed user groups. The proposed system is superior to conventional dial-up PC communications from the viewpoint of quick response and communication charge. A new mechanism of group management using the MAC addresses of the interface cards embedded in the ONU and PC terminals is proposed. Conventional telecommunication services, multi-channel video distribution services, and connectionless computer communication services can be provided simultaneously by utilizing the fiber-optic access system. The regional community network system is promising for the construction of a regional information platform and would be one of the forces driving FTTH.

A CATV network which has a switched double star configuration, fiber to the home (FTTH) and full digital transmission has been tested to see the feasibility with one Head-End (HE), one Central Office (CO), one Distribution Center (DC), and 25 subscribers. Also POTS and NISDN services have been provided to 5 subscribers. Single mode optical fibers are fully deployed from a HE to subscribers. A PON with TDM/polling scheme has been implemented considering the economic issue. Also in the outside plant, we tried to use the existing facility including the in-house duct. This paper deals with the results of the trial and some issues on the operational view.

For the successful realization of the multimedia information environment, it is strongly required to develop very cost effective optical access networks. Accordingly, ways of reducing system cost are described. At the same time, the development of attractive new services is indispensable to drive network modernization. The connectionless networking service for community user groups is proposed together with the new concept of group communication.