Mamoru SAWAHASHI Yoshinori MIKI Hidehiro ANDOH Kenichi HIGUCHI
A pilot symbol-assisted coherent multistage interference canceller (PSA-COMSIC) using recursive channel estimation is proposed for DS-CDMA mobile radio cellular systems. In the proposed scheme, since the channel variation due to fading is recursively estimated at each interference canceling stage, the accuracy of channel estimation is successively improved. The bit error rate (BER) performances against average Eb/N0 (signal energy per bit-to-noise power spectral density ratio) and capacity in the isolated cell are investigated by computer simulations. The simulations demonstrate that the capacity using the PSA-COMSIC with recursive channel estimation is about 1.6 times higher than that of the conventional matched filter receiver with channel coding and bit-interleaving in the interference-limited environments.
Keisuke TANAKA Tetsuro NISHINO
We show a relationship between the number of negations in circuits and the size of circuits. More precisely, we construct a Boolean function Hn, and show that there exists an integer t, which can range over only two different values, such that the removal of one NEGATION gate causes an exponential growth of the optimal circuit size for Hn.
Tsz Shing CHEUNG Kunihiro ASADA
Regenerative Pass-transistor Logic (RPL), a modular dual-rail circuit technique for high speed logic design that gives reasonably low power consumption, was developed. The technique can be applied to basic logic gates, full adders, multiplier units, and more complicated arithmetic logics like Conditional Carry Select (CCS) circuit. The magnitude of propagation delay time of RPL is smaller than the conventional CPL(Complementary Pass-transistor Logic), or DPL (Double Pass-transistor Logic). Low power consumption can also be achieved by reduced number of transistors and metal interconnections. Simulation and layout data also proved that RPL is advantageous over existing dual-rail logics while considering speed, power consumption and layout area.
The purpose of this letter is to investigate the stability of the active two port networks having some restrictions on load and source terminations, and the stability conditions having two inequalities have been obtained. As the terminations making the active two port networks stable can be obtained from these inequalities, these stability conditions are very useful for designing high frequency amplifiers, especially, tuned amplifiers.
John LAUDERDALE Danny H. K. TSANG
This paper presents the system issues involved with the transmission of pre-encoded VBR MPEG video using CBR service. Conventional wisdom suggests that lossless delivery of VBR video using CBR service requires bandwidth to be reserved at the peak rate resulting in low bandwidth utilization. We calculate the minimum rate at which bandwidth must be reserved on a network in order to provide continuous playback of an MPEG encoded video bitstream. Simulation results using the frame size traces from several pre-encoded MPEG bitstreams and several buffer sizes demonstrate that this minimum reservation rateis much lower than the peak rate when a relatively small playback buffer size is used, resulting in much higher bandwidth utilization. Procedures for performing connection setup and lossless realtime video playback between the video server and the client are outlined. Methods for incorporating VCR-like features such as pauseandfast forward/reversefor Video-on-Demand (VoD) applications are presented.
Yen-Wei CHEN Zensho NAKAO Shinichi TAMURA
An attenuation correction method was proposed for laser-produced plasma emission computed tomography (ECT), which is based on a relation of the attenuation coefficient and the emission coefficient in plasma. Simulation results show that the reconstructed images are dramatically improved in comparison to the reconstructions without attenuation correction.
Tomoo INOUE Hironori MAEDA Hideo FUJIWARA
The order of faults which are targeted for test-pattern generation affects both of the processing time for test generation and the number of generated test-patterns. This order is referred to as a test generation schedule. In this paper, we consider the effect of scheduling in test generation. We formulate the test generation scheduling problem which minimizes the cost of testing. We propose schedulings based on test-pattern generation time, dominating probability and dominated probability, and analyze the effect of these schedulings. In the analysis, we show that the total test-pattern generation time and the total number of test-patterns can be reduced by the scheduling according to the descending order of dominating probability prior to the ascending order of test-pattern generation. This is confirmed by the experiments using ISCAS'85 benchmark circuits. Further, in the experiments, we consider eight schedulings, and show that the scheduling according to the ascending order of dominated probability is the most effective of them.
Many activities are being promoted for the coming multimedia age. In this paper, background information for multimedia communications is followed by an outline of joint tests in multimedia communications with some examples of the projects and applications. These trials are also explained from the aspects of project specifications, which include application classifications and details of multimedia-on-demand offerings, as well as technical issues in experimental environments which mainly include those related to ATM technology.
Mitsuru MARUYAMA Kazutoshi NISHIMURA Hirotaka NAKANO
Three techniques are proposed for reducing the time required for protocol processing: protocol data unit management using page management, assembly and disassembly of data packet header and contents in hardware, and rescheduling of protocol processing. These techniques were shown to be feasible by applying them to the TCP/IP over a fiber-distributed data interface network. The maximum communication throughput was 91.6 Mbps; the total throughput for 64 sessions was 89.6 Mbps, only 2% less than the maximum. These techniques will enable the development of more effcient video-on -demand systems.
Haruhiko OKUMURA Goh ITOH Kouhei SUZUKI Kouji SUZUKI
We have proposed a concept of low power drive system for a multi-media TFT-LCD using MFD in which a displayed image is divided into some interlaced subfield images and the number of interlaced subfields can be changed depending on the moving quantities of displayed images. This method has been applied to a 9.5" TFT-LCD and successful operation has been confirmed without moving image degradation.
This paper introduces a new method to recover 3-D road plane from its 2-D monocular perspective image. The research is aimed at the reconstruction of depth information from the 2-D visual input in road following and navigation. Planar road model is considered and the road-centered coordinate system which forms slope and turn angles with camera-centered coordinate system is used to describe boundary points on road plane. We develop approaches to find matching points of boundaries of road and to obtain angular parameters thereafter. A way of finding depth of matching points from the perspective images and angular parameters together is proposed. Therefore the 3-D road reconstruction can be replicated without introducing any parameters of inverse perspective.
The mesh-connected computers with hyperbus broadcasting are an extension of the mesh-connected computers with multiple broadcasting. Instead of using local buses, we use global buses to connect processors. Such a strategy efficiently reduces the time complexity of the semigroup problem from O(N) to O(log N). Also, the matrix multiplication and the transitive closure problems are solved in O(log N) and O(log2 N) time, respectively. Then, based on these operations, several interesting problems such as the connected recognition problem, the articulation problem, the dominator problem, the bridge problem, the sorting problem, the minimum spanning tree problem and the bipartite graph recognition problem can be solved in the order of polylogarithmic time.
Atsushi MURATA Taisuke BOKU Hideharu AMANO
The recent advance of semiconductor technologies enable to produce a medium size of crossbar with reasonable cost. By making the best use of the high bandwidth of such crossbars, indirect networks including the base-m n-cube and HyperCross have been proposed and researched. In these networks, a node is connected other nodes through crossbars in multiple dimensions. Although these networks are practically used in commercial machines, almost no discussion on a class of networks including them has been done. In this paper, a network class called Multi-Dimensional X'bar (MDX) which includes the above two networks is defined. Several new networks in this class are proposed, and relationship between these networks and direct networks/multistage interconnection networks is discussed. Finally, routing methods for these new networks are proposed and the average distance is evaluated. Through the discussion and evaluation, the MDX supports higher bandwidth than the corresponding multistage interconnection network with smaller hardware than the corresponding direct network.
Fumie TAGA Hiroshi SHIMOTAHIRA
It is an important problem in fields of radar, sonar, and so on to estimate parameters of closely spaced multiple signals. The MUSIC algorithm with the forward-backward (FB) spatial smoothing is considered as the most effective technique at present for the problem with coherent signals in a variety of fields. We have applied this in Laser Microvision. Recently, Shimotahira has proposed the Kernel MUSIC algorithm, which is applicable to cases when signal vectors and noise vectors are orthogonal. It also utilizes Gaussian elimination of the covariance matrix instead of eigenvalue analysis to estimate noise vectors. Although the amount of computation by the Kernel MUSIC algorithm became lighter than that of the conventional MUSIC algorithm, the covariance matrix was formed to estimate noise vectors and also all noise vectors were used to analyze the MUSIC eigenspectrum. The heaviest amount of computation in the Kernel MUSIC algorithm exists in the transformation of the covariance matrix and the analysis of the MUSIC eigenspectrum. We propose a more straightforward algorithm to estimate noise vectors without forming a covariance matrix, easier algorithm to analyze the MUSIC eigenspectrum. The superior characteristics will be demonstrated by results of numerical simulation.
Hiroshi FUJI Tomiyuki NUMATA Mitsuo ISHII Takeshi YAMAGUCHI Hideaki SATO Shigeo TERASHIMA
A laser power optimizing method for multi-pulse recording is described. Multi-pulse recording uses the recording pulse formed by bias part and comb part. To obtain best readout signal characteristics and reduce the time for optimizing, new mark pattern is recorded and then two parts of the recording pulse are individually adjusted by evaluating the detected signals during pre-write testing. At the optimized laser power by this method, a good qualitative eyepattern was obtained. As a result, this new method proves to be suitable for the multi-pulse recording and adapted to various disks with different recording properties.
Physical optics(PO) and the aperture field integration method (AFIM) give accurate and similar field patterns near the first few sidelobes of reflector antennas. It is widely accepted that the use of AFIM is restricted to norrower angles than PO. In this paper, uniform equivalent edge currents of PO and AFIM are compared analytically and their equivalence in high frequency in discussed. It is asymptotically verified that the patterns by AFIM are almost identical to PO fields in the full 360angular region, provided that AFIM uses the equivalent surface currents consisting of two components, that is, the geometrical optics(GO) reflected fields from the reflector and the incident fields from the feed source, the latter of which are often neglected. Slightly weaker equivalence is predicted for cross polarization patterns. Numerical comparison of PO and AFIM confirms all these results, the equivalence holds not only for large but also for a very small refiector of the order of one wavelength diameter.
Akira FUNAHASHI Toshihiro HANAWA Hideharu AMANO
Multistage Interconnection Networks (MIN) with multiple outlets are networks which can support higher bandwidth than those of nonblocking networks by passing multiple packets to the same destination. Fault recovery mechanisms are proposed for two of such networks (TBSF/PBSF) with the best use of their inherent fault tolerant capability. With these mechanisms, on-the-fly fault recovery is possible for multiple faults on switching elements. For the link fault, the networks are reconfigured after fault diagnosis, and the network is available with some performance degradation. The bandwidth degradation under multiple faults on link/element is analyzed with both theoretical models and simulation. Through the analysis, F-PBSF shows high fault tolerance under high traffic load and low reliability by using 3 or more banyan networks.
Hiroshi HASEBE Haruyoshi TAKATSU Kiyofumi TAKEUCHI Yasufumi IIMURA Shunsuke KOBAYASHI
Super twisted nematic (STN) liquid crystal displays(LCDs) using spiral polymer aligned nematic (SPAN) liquid crystals have been achieved by photo-polymerization of some kinds of chiral monoacrylates in liquid crystalline hosts.The spiral polymer made of a chiral monoacrylate in STN LCD has effect to reduce the driving voltage without any disadvantages for the STN LCD. The relation of chemical structure of a chiral monoacrylate and nature of spiral polymer is discussed.
2D (two-dimensional) convolution is a basic operation in image processing and requires intensive computation. Although the SIMD model is considered suitable for 2D convolution, previous 2D convolution algorithms on the SIMD model assume unbounded number of PEs (Processing Elements) available, which we call unbounded case. Unbounded case could not be satisfied on real computers. In this paper, time-optimal data-parallel 2D convolution is studied on mesh-connected SIMD computers with bounded number of PEs. Because the optimal computation complexity is not difficult to achieve, the main concern of this paper is how to achieve optimal communication complexity. Firstly the lower bound computation complexity is analyzed. Then the lower bound communication complexities are analyzed under two typical data-distribution strategies: block-mapping and cyclic-mapping. Based on the analysis result, an optimal algorithm is presented under the block-mapping. The algorithm achieves the lower bound complexity both in computation and in communication.
Iwao OHISHI Masatoshi MAEDA Nobuyuki TAKAHASHI Arihisa SHIRATANI Takeshi KUWATA
For the multi-gray shades image in the passive matrix type STN-LCDs, the method which combined space modulated patterns and frame rate control(FRC)with switched some frames has been used. Although bi-level display elements are used this method makes it possible to display a multi-gray shades image without resolution-loss for still-image, while the method has a fault to perceive interference of flicker at low frame rate, as is wellknown. However the measured quantitative data for flicker and frame frequency have hardly be published. With regard to frame rate control method which some typical space modulated patterns are combined, we measure critical flicker frame frequency(CFFF) with subjective experiments. This paper also discribes that the data are arranged to be shown in form of relationship with the screen luminance and the lowest frequency components included among ripples on times and also the ripples ratio. Our experimental study provides useful data for designing such kinds of display.