In a wireless home network, shadowing is frequently caused by human bodies or furniture. Therefore, relay transmission function is considered for the hub station in Wireless Homelink when the direct communication of terminals is obstructed. However, in relaying high rate isochronous data such as video streams, the bandwidth resource of Wireless Homelink may be crammed with those data. In this paper, we propose an efficient relay scheme--"Pipeline Repeater" for Wireless Homelink. The proposed scheme spatially multiplexes the relay transfer of the isochronous data using antenna directivity. The Pipeline Repeater can relay the isochronous packets as an efficient use of the limited frequency band, and it can be achieved to repeat the high rate data with delay of only one frame. To verify the proposed scheme, we conduct measurements in some actual home environments, and perform the numerical analyses and computer simulations based on the measurements. Our results confirm the efficiency of the Pipeline Repeater scheme.

In this paper, we analyze the performance of a bulk handoff scheme for mixed traffic in integrated voice/data wireless mobile networks in which new and handoff voice/data calls are accepted based on prioritization of handoff requests. If fewer channels than handoff calls are available in the target cell, some handoff calls are terminated without queuing. A higher priority is given to voice handoff calls than to data handoff calls. A multidimensional birth-death process model is presented to analyze the bulk handoff performance of mixed traffic. A numerical analysis of system performance is presented to evaluate the blocking probabilities of new voice and data calls, handoff failure probabilities, and the forced termination probabilities of voice/data handoff calls.

For checkpointing to be practical, it has to introduce low overhead for the targeted application. As a means of reducing the overhead of checkpointing, this paper proposes a probabilistic checkpointing method, which uses block encoding to detect the modified memory area between two consecutive checkpoints. Since the proposed technique uses block encoding to detect the modified area, the possibility of aliasing exists in encoded words. However, this paper shows that the aliasing probability is near zero when an 8-byte encoded word is used. The performance of the proposed technique is analyzed and measured by using experiments. An analytic model which predicts the checkpointing overhead is first constructed. By using this model, the block size that produces the best performance for a given target program is estimated. In most cases, medium block sizes, i.e., 128 or 256 bytes, show the best performance. The proposed technique has also been implemented on Unix based systems, and its performance has been measured in real environments. According to the experimental results, the proposed technique reduces the overhead by 11.7% in the best case and increases the overhead by 0.5% in the worst case in comparison with page-based incremental checkpointing.

A new blocking artifact reduction algorithm is proposed that uses block classification and feedforward neural network filters in the spatial domain. At first, the existence of blocking artifact is determined using statistical characteristics of neighborhood block, which is then used to classify the block boundaries into one of four classes. Thereafter, adaptive inter-block filtering is only performed in two classes of block boundaries that include blocking artifact. That is, in smooth regions with blocking artifact, a two-layer feedforward neural network filters trained by an error back-propagation algorithm is used, while in complex regions with blocking artifact, a linear interpolation method is used to preserve the image details. Experimental results show that the proposed algorithm produces better results than the conventional algorithms.

In this paper, we propose a new fair queueing algorithm to improve cell delay variation (CDV) for real-time service categories and to make efficient use of system resources for multimedia traffic in high speed ATM networks. The proposed algorithm is called the delay variation-based fair queueing (DVFQ) algorithm, which is based on per-VC queueing to improve CDV and fairness for each VC of real-time services such as CBR and rt-VBR. In DVFQ algorithm, we define two fairness indexes, which indicate the degree of the fairness of CDV at the rate of each VC, and the degree of impartially sharing the bandwidth between the scheduled cells for each VC. The simulation results for both heavily and lightly loaded conditions show that DVFQ algorithm provides better performances in terms of the CDV, the CDV fairness, and the service fairness than those of FCFS for real-time service.

A Multiwavelength Brillouin/Erbium fibre laser which operates in long-wavelength band (L-band) is demonstrated with an approximate comb spacing of 10 GHz. The laser configuration consists of a long EDF to enable the L-band amplification and two 3-dB couplers to take a portion of the generated BEFL signal and re-inject it into the SMF to seed a cascaded BEFL line in the same direction as the first BEFL line. 20 lines including the anti-Stokes are obtained with the maximum Brillouin pump and 980 nm-pump power of 8.9 mW and 92 mW, respectively.

Nonlinear feedback shift registers (NFSRs), which can generate maximal-period sequences called de Bruijn sequences, are regarded as one-dimensional maps with finite bits by observing states of the registers at each time. Such one-dimensional maps are similar to the Bernoulli map which is a famous chaotic map. This implies that an NFSR is one of finite-word-length approximations to the Bernoulli map. Inversely, constructing such one-dimensional maps with finite bits based on other chaotic maps, we can design new types of NFSRs, called extended NFSRs, which can generate new maximal-period sequences. We design such extended NFSRs based on some well-known chaotic maps, which gives a new concept in sequence design. Some properties of maximal-period sequences generated by such NFSRs are investigated and discussed.

Associative memories composed of sparsely interconnected neural networks (SINNs) are suitable for analog hardware implementation. However, the sparsely interconnected structure also gives rise to a decrease in the capability of SINNs for associative memories. Although this problem can be solved by increasing the number of interconnections, the hardware cost goes up rapidly. Therefore, we propose associative memories consisting of multilayer perceptrons (MLPs) with 3-valued weights and SINNs. It is expected that such MLPs can be realized at a lower cost than increasing interconnections in SINNs and can give each neuron in SINNs the global information of an input pattern to improve the storage capacity. Finally, it is confirmed by simulations that our proposed associative memories have good performance.

It have been one open and significant topic for real-time applications to enhance the processing-speed of Boltzmann machines for long time. One effective way of solution of this problem is the augmentation of probability of neurons' state move. In this paper, a novel method, called a rejectionless method, was proposed and introduced into the Boltzmann machines for this augmentation. This method has a feature of independence on the ratio of neurons' state move. The efficiency of this method for speed-up was confirmed with the experiments of TSP and graph problem.

In this letter, we consider one-to-all broadcast on distributed memory parallel computers based on message-passing, such as cluster of WSs or PCs. We present an efficient broadcast algorithm, called overlapped-two-phase broadcast (O2PB), that is an enhanced version of two-phase broadcast (2PB). The O2PB algorithm is compared with other algorithms, such as linear broadcast, tree broadcast and 2PB algorithms. According to our theoretical and experimental results, when the size of message to be broadcasted is large, the O2PB algorithm is fastest among all the algorithms. The O2PB algorithm is approximately 20% faster than the 2PB algorithm.

It has been known that the cell loss ratio (CLR) characteristics of the multiplexed traffic depend on the arrangement of I-picture starting times of individual variable bit rate (VBR) MPEG video sources. In this paper, we propose a simple yet accurate traffic model for the multiplexed VBR MPEG video to calculate the CLR at an ATM multiplexer when the arrangement of the I-picture starting times of individual sources is given. In the proposed model, in order to represent the arrangement of the I-picture starting times, each picture type (I-, P-, or B-picture) of individual source is modeled by the arrival rate histogram, and the multiplexed video traffic is modeled by the convolution of the arrival rate histograms of the pictures that comprise the multiplexed traffic. Using the proposed traffic model, we propose an analytical method to calculate the CLR of the multiplexed VBR MPEG video at an ATM multiplexer. Simulation results show that the proposed method can calculate the CLR more precisely and efficiently than other existing methods.

The radix-64 encoding scheme was used to reduce the number of partial products in the 5454 CMOS parallel multiplier. The transistor counts, the chip area and the power-delay product were reduced by 28%, 22%, and 17%, respectively, compared to any of the published 5454 CMOS parallel multipliers. A redundant binary (RB) number system was used to represent any of the 65 multiplying coefficients as a RB number which consists of two of 9 fundamental multiplying coefficients and their complements. The resultant RB partial products were added by using optimized RB adders. The total transistor count of the proposed multiplier was 43,579. The chip area in 0.25 µm CMOS process with 5 metal layers was 0.99 mm2. The power consumption and the multiplication time were 111 mW and 6.9 ns, respectively.

The surface potential built across vacuum deposited phthalocyanine (Pc) films on aluminum electrode was investigated by means of electro-modulation spectroscopy. The sandwich-type cells with thin air gap, which becomes a good insulator were used in order to avoid the influence of charge injection. The existence of the surface potential at the metal/organic-material interface induced 1f referenced electro-reflectance (ER) signals. As a result, the surface potential built across vacuum deposited Pc films on aluminum electrode was estimated to be 1.25 V.

We investigated the electrical properties of hole transport materials such as TPD, α-NPD and m-MTDATA using in-situ field effect measurement. TPD, α-NPD and m-MTDATA films showed p-type semiconducting properties, and their electrical parameters such as conductivity, carrier mobility and carrier concentration were obtained. We also examined the effect of the substrate temperature during vacuum deposition and the thermal treatment after deposition, on the electrical parameters of the films. Experimental results showed that conductivity and carrier mobility decreased as the substrate temperature increased over the glass transition temperature. These decreases in conductivity and carrier mobility as a result of thermal treatment appear to be strongly related to the degradation mechanism of organic electroluminescent devices.

Metal nanostructure of organic/metal interface showing photocurrent multiplication phenomenon more than 105-fold was investigated. Au films deposited on organic films were revealed to be a gathering of nanoparticles and the multiplication rate can be tuned by the particle size. Spatial gaps formed between Au sphere and organic surface, which provide the hole accumulation sites (structural trap), was concluded to be indispensable for the photocurrent multiplication.

Organic nonlinear optical crystal 4-(p-dimethylaminostyryl)-1-methylpridinium tosylate (DAST) has a larger electro-optic (EO) coefficient than that of LiNbO3 crystal. Thus, DAST is a promising material for EO switching device. To use its large EO coefficient effectively, a waveguide structure is desirable. We have successfully fabricated two types of DAST crystal optical channel waveguide. One is a serially grafted waveguide combining a DAST and a transparent polymer by using the combination of standard photo-process and reactive ion-etching (RIE). Because DAST has large optical loss, parts of the waveguide should be composed of transparent polymer with a serially grafted structure with DAST. This structure reduced not only a propagation loss but also input/output losses. This serially graft waveguide fabrication technique for active organic crystal is available to many types of crystals with device function. The other is a channel waveguide made by a photo-bleaching technique. The cladding part of DAST waveguide was photo-bleached by irradiation of UV light. Under and over cladding layer were composed with UV-cured resin that did not dissolve the DAST crystal. This technique is very convenient for making DAST waveguide because of its simple procedure to make core-cladding structure of DAST compared to standard photo-process and RIE.

A new algorithm is presented for recovering the blocks lost with the cell loss in the ATM transmission of the images coded by Jacquin's fractal coding. The key technique of the proposed BLRA (block loss recovery algorithm) is a fractal extrapolation that estimates the pixels in a lost block by using the contractive mapping parameters of a range block homogeneous to the lost block. The proposed BLRA is applied to the lost blocks in the iteration of decoding.

Angle-multiplexed holography using four-wave mixing (4WM) was demonstrated with a monolithic photorefractive carbazole trimer. We measured the diffraction efficiency as a function of incident angle of the read beam. The cross-talk was almost negligible at the Bragg angle mismatch of 1. Two figure images were recorded with the different incident angle of the reference beam in the photorefractive carbazole trimer film, and were read out independently by illuminating with the read beam which counter-propagated to the corresponding reference beam.

We propose a new effective method of managing flash memory space for flash memory-specific file systems based on a log-structured file system. Flash memory has attractive features such as non-volatility and fast I/O speed, but it also suffers from inability to update in situ and from limited usage (erase) cycles. These drawbacks necessitate a number of changes to conventional storage (file) management techniques. Our focus is on lowering cleaning cost and evenly utilizing flash memory cells while maintaining a balance between these two often-conflicting goals. The proposed cleaning method performs well especially when storage utilization and the degree of locality are high. The cleaning efficiency is enhanced by dynamically separating cold data and non-cold data, which is called 'collection operation.' The second goal, that of cycle-leveling, is achieved to the degree that the maximum difference between erase cycles is below the error range of the hardware. Experimental results show that the proposed technique provides sufficient performance for reliable flash storage systems.

A new H.263+ rate control method that has very low encoder-decoder delay, small buffer and low computational complexity for hardware realization is proposed in this paper. This method focuses on producing low encoder-decoder delay in order to solve the lip synchronization problem. Low encoder-decoder delay is achieved by improving target bit rate achievement and reducing processing delay. The target bit rate achievement is improved by allocating an optimum frame encoding bits, and employing a new adaptive threshold of zero vector motion estimation. The processing delay is reduced by simplifying quantization parameter computation, applying a new non-zero coefficient distortion measure and utilizing previous frame information in current frame encoding. The simulation results indicate very large number skipped frames reduction in comparison with the test model TMN8. There were 80 skipped frames less than that of TMN8 within a 380 frame sequence during encoding of a very high movement video sequence. The 27 kbps target bit rate is achieved with insignificant difference for various types of video sequences. The simulation results also show that our method successfully allocates encoding bits, maintains small data at the encoder buffer and avoids buffer from overflow and underflow.