Terrestrial radio links with sparsely distributed multipath delays can be represented by a tapped-delay line with a few significant tap coefficients. This letter presents criteria and performance of identification methods that determine channel taps with significant power. In particular, a tap identification method derived from the maximum-likelihood criterion and its closed form error probabilities are presented. Performance improvement over a previously reported scheme is quantified using the derived error probabilities.
Qing HAN Keizo INAGAKI Kyouichi IIGUSA Robert SCHLUB Takashi OHIRA
Reactive near field reflection characteristics of commercial RF absorbers are investigated to determine the minimum size of a reactive-field anechoic box necessary for measuring the reactive near field of an ESPAR antenna. The reflectivity of the absorber placed in close proximity to an antenna is inversely proportional to the distance between the antenna and the absorber. For carbon filled urethane foam tapered absorbers, we find that the backscattered reflection characteristics mainly depend on their tapered height rather than the thickness of absorber base. As a result, we show that carbon filled urethane foam pyramidal and wave surface shaped absorbers can be used to make reactive-field anechoic boxes. A prototype of a reactive-field anechoic box is presented and the distance from the absorber to the antenna is reduced to a wavelength. The prototype is verified by comparing its performance with that obtained from a large anechoic chamber.
Takeshi KAMIO Hisato FUJISAKA Mititada MORISUE
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.
Blagovest SHISHKOV Jun CHENG Takashi OHIRA
The electronically steerable passive array radiator (ESPAR) antenna is one kind of the parasitic elements based single-port output antennas with several variable reactances. It performs analog aerial beamforming and none of the signals on its passive elements can be observed. This fact and one that is more important--the nonlinear dependence of the output of the antenna from adjustable reactances--makes the problem substantially new and not resolvable by means of conventional adaptive array beamforming techniques. A novel approach based on stochastic approximation theory is proposed for the adaptive beamforming of the ESPAR antenna as a nonlinear spatial filter by variable parameters, thus forming both beam and nulls. Two learning rate schedule were examined about output SINR, stability, convergence, misadjustment, noise effect, bias term, etc., and the optimal one was proposed. Further development was traced. Our theoretic study, simulation results and performance analysis show that the ESPAR antenna can be controlled effectively, has strong potential for use in mobile terminals and seems to be very perspective.
Blagovest SHISHKOV Jun CHENG Takashi OHIRA
The electronically steerable passive array radiator (ESPAR) antenna performs analog aerial beamforming that has only a single-port output and none of the signals on its passive elements can be observed. This fact and one that is more important--the highly nonlinear dependence of the output of the antenna from adjustable reactances--makes the problem substantially new and not resolvable by means of conventional adaptive array beamforming techniques. A novel approach based on stochastic approximation theory is proposed for the adaptive beamforming of the ESPAR antenna as a nonlinear spatial filter by variable parameters, thus forming both beam and nulls. Our theoretic study, simulation results and performance analysis show that the ESPAR antenna can be controlled effectively, has strong potential for use in mobile terminals and seems to be very perspective.
Chiho LEE Gwangzeen KO Kiseon KIM
In this paper, we propose an activity-based estimation scheme to determine the received signal power disparity, that enhances the BER performance of the SIC scheme in a DS/CDMA system considering a practical voice activity factor, and compare BER performance with those of other schemes with or without estimation. Numerical analysis results show that the SIC scheme with the proposed activity-based estimation improves the BER performance compared with that without considering voice activity, and it approaches to that of the ideal estimation as the total number of concurrent users increases. In addition, the higher becomes the maximum attainable SNR, the better becomes the BER performance of the proposed activity-based estimation scheme.
Tran Ha NGUYEN Kiyohide NAKAUCHI Masato KAWADA Hiroyuki MORIKAWA Tomonori AOYAMA
Layered multicast approach enables IP multicast to adapt to heterogeneous networks. In layered multicast, each layer of a session is sent to separate multicast groups. These layers will be transmitted on the same route, or on different routes. However, traditional congestion control schemes of layered multicast do not consider the case when layers of a session are transmitted on different routes. In this paper, at first we show that in sparse-mode routing protocols like PIM-SM and CBT, layers of a session can be mapped to different Rendezvous Points or cores due to the bootstrap mechanism. It means that layers of a session can be transmitted on different routes. We then show that traditional congestion control schemes of layered multicast do not work properly in sparse-mode routing regions. At last we introduce Rendezvous Point based Layered Multicast (RPLM), a novel congestion control scheme suitable for sparse-mode routing regions, and show that RPLM works efficiently in regions using sparse mode routing protocols. RPLM uses per-RP packet loss rate instead of the overall one to detect congestion on each route, and can react to congestion quickly by dropping the highest layer on the congested route. In addition, RPLM simultaneously drops all the layers those are useless in quality's improvement to prevent bandwidth waste.
A novel in vivo exposure setup has been developed for testing the possible promoting effects of 1.5 GHz digital cellular phones on mouse skin carcinogenesis. The exposure setup has two main features: one is the employment of an electrically short monopole antenna with capacitive-loading, which supplies the ability to realize a highly localized peak SAR above 2 W/kg without any thermal stress for a mouse; the other is the use of a transparent absorber to allow real-time observation of both the exposure process as well as mouse activities during the exposure. Dosimetric analyses for the exposure setup have been carried out both numerically and experimentally. Good agreement was confirmed between the numerical and experimental results, thereby demonstrating the validity of the novel exposure setup.
Wavelength converters are usually used for improving the performance of WDM optical networks. From the viewpoint of network economics and current technologies, the wavelength converters with a limited conversion range are necessary to be used sparsely in real applications. However, there have been little efforts for developing wavelength assignment algorithm that achieves a guaranteed high performance with either limited or sparse wavelength conversion. In this paper, we propose a new wavelength assignment algorithm that can be applied to both sparse and limited wavelength conversion. Through the results of simulation program, we show that the proposed algorithm outperforms other ones presented until now.
We present a new basis for discrete representation of stereo correspondence. This center referenced basis permits a more natural, complete and concise representation of constraints in stereo matching. In this context a MAP formulation for disparity estimation is derived and reduced to unconstrained minimization of an energy function. Incorporating natural constraints, the problem is simplified to the shortest path problem in a sparsely connected trellis structure which is performed by an efficient dynamic programing algorithm. The computational complexity is the same as the best of other dynamic programming methods, but a very high degree of concurrency is possible in the algorithm making it suitable for implementation with parallel procesors. Experimental results confirm the performance of this method and matching errors are found to degrade gracefully in exponential form with respect to noise.
Bruno SCHULZE Edmundo R. M. MADEIRA
Migration transparency is considered in the context of multi-agent systems. A mobile agent architecture is proposed with an Availability service and a Transparency interface. We define mobility as explicit (or proactive) when the agent decides when and where to move and define mobility as implicit (i. e. , transparent or reactive) when it is a consequence of changes in the environment. Implicit mobility of agents is explored in addition to the usual explicit mobility. The search for a target agent (or agency) follows a transparent location and selection. The client agent preferably moves towards the target agent. If not possible, the target agent will move towards the client agent when calling back. If both agents can not move then the execution takes place remotely or is abandoned. Transparency is goal oriented.
Hagbae KIM Sangmoon LEE Taewha HONG
The reconfiguration latency defined as the time taken for reconfiguring a system upon failure detection or mode change. We evaluate it quantitatively for backup sparing, which is one of the most popular reconfiguration methods, by investigating the effects of key parameters.
Toshiaki SUGIHARA Tsutomu MIYASATO Ryohei NAKATSU
In this paper, we describe an experimental evaluation of visual fatigue in a binocular disparity type 3-D display system. To evaluate this fatigue, we use a subjective assessment method and focus on mismatching between convergence and accommodation, which is a major weakness of binocular disparity 3-D displays. For this subjective assessment, we use a newly-developed binocular disparity 3-D display system with a compensation function for accommodation. Because this equipment only allowed us to compare the terms of the mismatching itself, the evaluation is more accurate than similar previous works.
Human visual system can perceive 3-D structure of an object by binocular disparity, gradient of illumination (shading), occlusion, textures, perspective and so forth. Among them, binocular disparity seems to be the essentially important cues for the 3-D space perception and it is used widely for displaying 3-D visual circumstances such as in VR (virtual reality) system or 3-D TV. Visual illusions seem to be one of the phenomena which are purely reflecting the mechanism of human visual system. In the recent several years, the authors found several new types of 3-D visual illusions with binocular viewing. Entire 3-D illusory object including volume perception, transparency, dynamic illusions can be perceived only from the visual stimuli of disparity given by some inducing objects arranged with suitable relations. In this report, the authors introduced these newly found visual illusions and made some considerations on the human visual mechanism of 3-D perception and on their exploitation for new effective techniques in 3-D display. They introduced especially on the visual effect in two kinds of arrangement with occlusion and sustaining relationship between the illusory object and inducing objects. In the former case, the inducing objects which provide the stimuli were named as occlusion cues and classified into two types: contour occlusion cues and bulky occlusion cues. In the later case, those inducing objects were named as sustaining cues and a 3-D fully transparent illusory object was perceived. The perception was just like imagined from the scenes of the actions and positions of the pantomimists; then this phenomena was named as "Mime (Pantomime) Effect. " According to the positions of sustaining cues, they played different actions in this perception, and they are classified into three types: front sustaining cues, side sustaining cues and back sustaining cues. In addition, dynamic fusion and separation of volumetrical illusory objects were perceived when the visual stimuli were moving continuously between two structurally different conditions. Then the hysteresis was recognized in geometrical position between the fusion and separation. The authors believe that the occlusion cues and sustaining cues introduced in this paper could be effective clues for exploiting the new techniques for 3-D display.
Sang Hwa LEE Jong-Il PARK Seiki INOUE Choong Woong LEE
In this paper, a general formula of disparity estimation based on Bayesian Maximum A Posteriori (MAP) algorithm is derived and implemented with simplified probabilistic models. The formula is the generalized probabilistic diffusion equation based on Bayesian model, and can be implemented into some different forms corresponding to the probabilistic models in the disparity neighborhood system or configuration. The probabilistic models are independence and similarity among the neighboring disparities in the configuration. The independence probabilistic model guarantees the discontinuity at the object boundary region, and the similarity model does the continuity or the high correlation of the disparity distribution. According to the experimental results, the proposed algorithm had good estimation performance. This result showes that the derived formula generalizes the probabilistic diffusion based on Bayesian MAP algorithm for disparity estimation. Also, the proposed probabilistic models are reasonable and approximate the pure joint probability distribution very well with decreasing the computations to O(n()) from O(n()4) of the generalized formula.
Shigeki YAMADA Masato MATSUO Hajime MATSUMURA Ichizou KOGIKU Minoru KUBOTA
This paper discusses the implementation and cost- and performance- evaluations of a distributed processing network, called DONA-α, which is one of the possible physical networks mainly implementing connection-oriented public switched network functions corresponding to OSI layers 1 to 3. The first feature of the DONA-α network is that it separates a switching subsystem and a control subsystem of a conventional switching system and independently allocates them over distributed nodes as a switching node and a control node. Each DONA-α switching node is given a much smaller switching capacity than the switching subsystem of the conventional switching system and is located near subscribers. In contrast, each DONA-α control node has much higher performance than the control subsystem of the conventional switching system. This allows a large number of switching nodes to share the same control node, which controls their connection setups. This separation provides the network with greater flexibility and allows more effective utilization of network resources, such as control processors, switching fabrics, and transmission links, than ever before. The second feature of DONA-α is that it provides a network with network-wide distribution transparency. This allows network resources including software such as databases and application programs to be shared and therefore to be utilized in the network more easily and more efficiently. The results of a network performance simulation and cost calculation confirm the viability of the DONA-α network.
Komwut WIPUSITWARAKUN Hideki TODE Hiromasa IKEDA
The self-healing capability against network failure is one of indispensable features for the B-ISDN infrastructure. One problem in realizing such self-healing backbone network is the inefficient utilization of the large spare capacity designed for the failure-restoration purpose since it will be used only in the failure time that does not occur frequently. "Pool-capacity" is the concept that allows some VPs (virtual paths) to efficiently utilize this spare capacity part. Although the total capacity can be saved by using the "Pool Capacity," it is paid by less reliability of VPs caused by the emerging influence of indirect-failure. Thus, this influence of indirect-failure has to be considered in the capacity designing process so that network-designers can trade off the saving of capacity with the reliability level of VPs in their self-healing networks. In this paper, Damage Rate:DR which is the index to indicate the level of the influence caused by indirect-failure is defined and the pool-capacity design scheme with DR consideration is proposed. By the proposed scheme, the self-healing network with different cost (pool-capacity) can be designed according to the reliability level of VPs.
The conventional synthesis procedure of discrete time sparsely interconnected neural networks (DTSINNs) for associative memories may generate the cells with only self-feedback due to the sparsely interconnected structure. Although this problem is solved by increasing the number of interconnections, hardware implementation becomes very difficult. In this letter, we propose the DTSINN system which stores the 2-dimensional discrete Walsh transforms (DWTs) of memory patterns. As each element of DWT involves the information of whole sample data, our system can associate the desired memory patterns, which the conventional DTSINN fails to do.
Akihiko SUGIYAMA Kenji ANZAI Hiroshi SATO Akihiro HIRANO
This paper proposes a scalable multiecho cancellation system based on multiple autonomic and distributed echo canceler units. The proposed system does not have any common control section. Distributed control sections are equipped with in multiple echo cancelers operating autonomically. Necessary information is transferred from one unit to the next one. When the number of echoes to be canceled is changed, the necessary number of echo canceler units, each of which may be realized on a single chip, are simply plugged in or unplugged. The proposed system also provides fast convergence thanks to the novel coefficient location algorithm which consists of flat-delay estimation and constrained tap-position control. The input signal is evaluated at each tap to determine when to terminate flat-delay estimation. The number of exchanged taps is selected larger in flat-delay estimation than in constrained tap-position control. The convergence time with a colored-signal input is reduced by approximately 50% over STWQ, and 80% over full-tap NLMS algorithm. With a real speech input, the proposed system cancels the echo by about 20 dB. Tap-positions have been shown to be controlled correctly.
This paper proposes an object oriented face region detection and tracking method using range color information. Range segmentation of the objects are obtained from the complicated background using disparity histogram (DH). The facial regions among the range segmented objects are detected using skin-color transform technique that provides a facial region enhanced gray-level image. Computationally efficient matching pixel count (MPC) disparity measure is introduced to enhance the matching accuracy by removing the effect of the unexpected noise in the boundary region. Redundancy operations inherent in the area-based matching operation are removed to enhance the processing speed. For the skin-color transformation, the generalized facial color distribution (GFCD) is modeled by 2D Gaussian function in a normalized color space. Disparity difference histogram (DDH) concept from two consecutive frames is introduced to estimate the range information effectively. Detailed geometrical analysis provides exact variation of range information of moving object. The experimental results show that the proposed algorithm works well in various environments, at a rate of 1 frame per second with 512 480 resolution in general purpose workstation.