Several papers have been shown equalization in the reception side. However, equalization in transmission side that is partial response signaling (PRS) or precoding is also possible in a two-way interactive communication such as time or frequency division duplex (TDD of FDD). This paper proposes and investigates a system which includes a transmission equalization and reception equalization based on an array antenna. This system is the extension in spatial and temporal domains. The channel capacity can be improved in the super channel which includes the transmitter and receiver array antenna.

Air interfaces of the future mobile communication are widely spreading, because of the multimedia service demands, technology trends and radio propagation conditions. Radio-Highway Networks are expected to realize the universal, seamless and multi-air-interface capability for mobile access networks, and play an important role in the future multimedia radio communications. For the radio-highway networks, this paper newly proposes natural bandpass sampling - asynchronous time division multiple access (NBS-ATDMA) method, where radio signals are natural bandpass sampled at the radio base station and are asynchronously multiplexed on the optic fiber bus link and intelligently transmitted to its desired radio control station. We theoretically analyze the loss probability of the radio signal due to collision in the network and the carrier-to-noise power ratio of received radio signals at the radio control station. Moreover, in order to reduce the loss probability, two access control methods, carrier sense and pulse width control, are proposed, and it is clarified that these improve the number of base station connected to radio highway networks.

In order to reduce the ever increasing cost for ULSI manufacturing due to the complexity of integrated circuits, dramatic simplification in the logic LSI architecture as well as the very flexible circuit configuration have been achieved using a highfunctionality device neuron-MOSFET (γMOS).In γMOS logic circuits, however, computations based on the multiple-valued logic is the key for enhancing the functionality. Therefore, much higher accuracy of processing is required. After brief description of the operational principle of γMOS logic, the relationship between the number of multiple logic levels and the functionality enhancement is discussed for further enhancing the functionality of γMOS logic circuits by increasing the number of multiple logic levels, and the accuracy requirements for the manufacturing processes are studied. The order of a few percent accuracy is required for all principal device structural parameters when it is aimed to handle 50-level multiple-valued variable in the γMOS logic circuit.

This paper describes Kleenean coefficients that are a subset of Kleenean functions for use in representing multiple-valued logic functions. A conventional multiple-valued sum-of-products expression uses product terms that are the MIN of literals and constants. In this paper, a new sum-of-products expression is allowed to sum product terms that also include variables and complements of variables. Since the conventional sum-of-products expression is complete, so also is the augmented one. A minimization method of the new expression is described besed on the binary Quine-McCluskey algorithm. The result of computer simulation shows that a saving of the number of implicants used in minimal expressions by approximately 9% on the average can be obtained for some random functions. A result for some arithmetic functions shows that the minimal solutions of MOD radix SUM, MAX and MIN functions require much fewer implicants than those of the standard sum-of-products expressions. Thus, this paper clarifies that the new expression has an advantage to reduce the number of implicants in minimal sum-of-products expressions.

In order to pave the way to B-ISDN, one of the most important issues for network providers is to identify the most efficient B-ISDN introduction strategy. This paper focuses on the costs of introducing ATM transmission systems into backbone transport networks which must provide highly reliable broad band transmission capability. In this context, the main rival to ATM is Synchronous Transfer Mode (STM); recent Synchronous Digital Hierarchy (SDH) equipment supports the establishment of advanced STM-based high speed transport networks. This paper offers a cost comparison of ATM and STM based backbone transport networks. A digital path network in STM has a hierarchical structure determined by the hierarchical multiplexing scheme employed. The minimum cost STM path network can only be determined by developing a path design method that considers all hierarchical path levels and yields the optimum balance of link cost and node cost. Virtual paths have desirable features such as non-deterministic path bandwidth and non-hierarchical and direct multiplexing capability into high speed optical transmission links. These features make it possible to implement a non-hierarchical VP network with ATM cross connect systems which can handle any bandwidth VP with a universal cell switching function. This paper shows that the non-hierarchical VP routing, which strongly minimizes link cost, can be implemented without significantly increasing node cost. Network design simulations show that the virtual path scheme, possible only in an ATM network, yields the most cost effective path network configuration.

Network functions (NFs) such as network reflection and transmission coefficients are discussed about an interconnected network consisting of a lumped distributed N-port N non-commensurate line junction network (N-port) and a M-port. The derivation of the NFs can be done quite easily regardless of the complexity of the network by considering the flow of the traveling waves and conditions of the interconnected interface of the two multi-ports. The theory of this paper has been examined with respect to interconnected networks consisting of two 3-ports in both the time and frequency domains, and has shown good results consistent with other papers. The network functions described here can be used not only for the analysis of high-speed pulse propagation in digital systems with branches but also for the analysis of microwave distributed line networks such as hybird rings. In that sense, a new analysis method is presented in this paper.

This paper presents implicit representation of binary decision diagrams (implicit BDDs) as a new effecient data structure for Boolean functions. A well-known method of representing graphs by binary decision diagrams (BDDs) is applied to BDDs themselves. Namely, it is a BDD representation of BDDs. Regularity in the structure of BDDs representing certain Boolean functions contributes to significant reduction in size of the resulting implicit BDD repersentation. Since the implicit BDDs also provide canonical forms for Boolean functions, the equivalence of the two implicit BDD forms is decided in time proportional to the representation size. We also show an algorithm to maniqulate Boolean functions on this implicit data structure.

Understanding unknown objects in images is one of the most important fields of the computer vision. We are confronted with the problem of dealing with the ambiguity of the image information about unknown objects in the scene. The purpose of this paper is to propose a new object recognition method based on the fuzzy relation system and the fuzzy integral. In order to deal with the ambiguity of the image information, we apply the fuzzy theory to object recognition subjects. Firstly, we define the degree of similarity based on the fuzzy relation system among input images and object models. In the next, to avoid the uncertainty of relations between the input image and the 2-D aspects of models, we integrate the degree of similarity obtained from several input images by the fuzzy integral. This proposing method makes it possible to recognize the unknown objects correctly under the ambiguity of the image information. And the validity of our method is confirmed by the experiments with six kinds of chairs.

This paper proposes an integrated interference suppression scheme which realizes interference-resistant satellite digital signal transmission systems. It employs a notch filter in the receiving side to suppress the co-channel interference (CCI) signal. Moreover, the proposed scheme employs an adaptive equalizer combined with a forward error correction (FEC) scheme to improve the Pe (probability of error) performance degradation due to the inter-symbol interference caused by notch filtering of the desired signal. In the typical frequency modulation (FM) CCI environment with a BWi/FN of 2.3 (BWi: interference signal required bandwidth, fN: one half the Nyquist bandwidth of the desired signal), a Δf / fN of 1.05 (Δf: interference frequency offset) and a D/U of 3 dB (desired to undesired (interference) signal power ratio), the proposed scheme improves the required Eb/NO by 1.5 dB at a Pe of 10-4 compared to that without an adaptive equalizer.

An 8-to 10-bit CMOS A/D converter with a conversion rate of more than 16 megasample/second is required in consumer video systems. Subranging architecture is widely used to realize such A/D converters. This architecture, however, exhibits an reference voltage error caused by resistor ladder loadings. The error has been discussed with respect to a flash A/D converter by Dingwall. However, it can not be applied for a subranging A/D converter as it is. The analysis of this error is very important in realizing the desired accuracy of a subranging A/D converter. This paper describes a static analysis to improve the linearity, and reports the results of this analysis for two typical types, one with invividual comparator arrays for coarse and fine A/D conversions, and the other with the same comparator array for both conversions. This analysis makes it clear that a subranging A/D converter has unique saw-tooth characteristic in fine linearity errors. Furthermore, this analysis clarifies what conditions are necessary to achieve the desired accuracy. It is necessary, for example, that the product of the total input capacitance of the comparators C, the conversion rate fs and the total ladder resistance R is less than 0.03 in A/D converters with individual comparator arrays and 0.016 in A/D converters with the same comparator array in order to achieve 10-bit accuracy.

A direct gradient descent learning algorithm of energy function in Hopfield neural networks is proposed. The gradient descent learning is not performed on usual error functions, but the Hopfield energy functions directly. We demonstrate the algorithm by testing it on an analog-to-digital conversion and an associative memory problems.

Shortened prime codes (SPR-codes) are presented, which can maintain the fixed code weight for any arbitrary number of codewords while still preserve the same cross and auto-correlation constraints as original prime codes. The use of SPR-codes can reduce both cost and power loss of optical encoders/decoders. Tunable all-optical SPR-code encoders are also designed, which are based on rapidly tunable optical delay lines. It is shown that using this type of encoders not only can further reduce the coding power loss, but also can achieve a very cost-effective fashion.

This paper describes the performance of a predistorter implementation to a superluminescent diode (SLD) in fiber-optic wireless systems under the optical reflection. SLD intensity noise and 3rd-order intermodulation distortion (IM3) are experimentally compared with those of DFB-and FP-LD. It is observed that the IM3 of SLD has ideal 3rd characteristics and output noise remains unchanged against the number of optical connectors. It is also found that the predistorter reduces IM3 by 8 dB. Receiver sensitivity of the system is discussed from the view point of overall design. the BER performance of an SLD with predistorter using a π/4-QPSK signal as a subcarrier is also described theoretically and experimentally.

This paper describes a novel shared file system, whose main features are enhanced security and its concurrency control mechanism. The system is especially suitable for access from mobile hosts. Users can edit their shared files concurrently. Shared files are encrypted and decrypted only by clients, and the file server cannot know the contents. The server asynchronously receives the edited parts, which are already encrypted, and merges them into the current version, deciphering neither the stored file nor the encrypted editing data. We call the mechanism 'privacy enhanced merging'. The mechanism and the underlying encryption algorithm, shared file data structure and procedures followed by clients and the server are shown.

RDES cryptosystem is an n-round DES in which an probabilistic swapping is added onto the right half of the input in each round. It is more effective than a simple increase of DES rounds for a countermeasure against differential attack. In this paper, we show that the RDES is also effective against linear cryptanalysis. We applied Matsui's search algorithm to find the best expression for RDES-1 and RDES-2. The results are as follows: (a) The 16-round RDES-1 is approximately as strong as a 22-round DES, and the 16-round RDES-2 is approximately as strong as a 29-round DES. (b) Linear cryptanalysis for a 16-round RDES-1 and a 16-round RDES-2 requires more than 264 known-plaintexts.

This paper presents the performance of optically controlled MESFETs as photodetectors. The optical performance characteristics such as optic-to-electric responsivity, and BER for a π/4-QPSK signal are experimentally investigated. Measurements are performed by using MMIC compatible MESFETs. Experimental results are also evaluated in comparison with calculated PIN-PD limit. Optic-to-electric responsivity has high gain at lower received optical powers. It is shown experimentally that MESFET photodetectors improve the permissible optical power by 6 dB compared to the PIN-PD limit. Optically controlled MESFETs will provide a novel receivers for fiber-optic systems.

The SAR distributions over a homogeneous human model exposed to a near field of a short electric dipole in the resonant frequency region were calculated with the spatial resolution of 1cm3 which approximated 1g tissue by using the FDTD method with the expansion technique. The dependences of the SAR distribution on the distance between the model and the source and on frequency were investigated. It was shown that the large local SAR appeared in the parts of the body nearest to the source when the source was located at 20cm from the body, whereas the local SAR were largest in the narrow sections such as the neck and legs when the source was farther than 80cm from the model. It was also shown that, for the near-field exposure in the resonant frequency region, the profile of the layer averaged SAR distribution along the main axis of the body of the human model depended little on frequency, and that the SAR distribution in the section perpendicular to the main axis of the human body depended on frequency. The maximum local SAR per gram tissue over the whole body model was also determined, showing that the ratios of the maximum local SAR to the whole-body averaged SAR for the near-field exposure were at most several times as large as the corresponding ratio for the far-field exposure, when the small source located farther than 20cm from the surface of the human model.

It is important to find the best linear expression to estimate the vulnerability of cryptosystems to Linear Cryptanalysis. This paper shows the results of the best linear expressions search of FEAL-N (N32) and discusses the security of FEAL against Linear Cryptanalysis. We improve Matsui's search algorithm which determines the best linear expressions, and apply it to FEAL. The improved search algorithm finds all the best linear expression of FEAL-N (N32) much faster than the original; the required time is decreased from over three months to about two and a half days. We find the best linear expressions of FEAL-7, FEAL-15, and FEAL-31 with deviations of 1.152-8, 1.482-20, and 1.992-41, respectively. These linear expressions have higher deviations than those derived from Bi-ham's 4-round iterative linear approximations. Using these data we calculated the number of known plaintexts required to attack FEAL-8, FEAL-16, and FEAL-32. It is proved that FEAL-32 is secure against Linear Cryptanalysis.

Mathematical morphology is inheriently suitable for range image processing because it can deal with the shape of a function in a natural and intuitive way. In this paper, a new approach to the extraction of the corner-edge-surface structure from 3D range images is proposed. Morphological operations are utilized for segmenting range images into smooth surface regions and high-variation surface regions, where the high-variation surface regions are further segmented into regions of edge type and regions of corner type. A new 3D feature, HV-skeleton, can be extracted for each high-variation surface region. The HV-skeletons can be thought of as the skeletons of high-variation surface regions and are useful for feature matching. The 3D features extracted by our approach are invariant to 3D translations and rotations, and can be utilized for higher-level vision tasks such as registration and recognition. Experimental results show that the new 3D feature extraction method works well for both simple geometric objects and complex shaped objects such as human faces.

We have developed a neutron imaging system based on the penumbral imaging technique. The system consists of a penumbral aperture and a sensitive neutron detector. The aperture was made from a thick (6 cm) tungsten block with a toroidal taper. It can effectively block 14-MeV neutrons and provide a satisfactory sharp, isoplanatic (space-invariant) point spread function (PSF). A two-dimensional scintillator array, which is coupled with a gated two-stage image intensifier system and a CCD camera, was used as a sensitive neutron detector. It can record the neutron image with high sensitivity and high signal-to-noise ratio. The reconstruction was performed with a Wiener filter. The spatial resolution of the reconstructed neutron image was estimated to be 31 µm by computer simulation. Experimental demonstration has been achieved by imaging 14-MeV deuterium-tritium neutrons emitted from a laser-imploded target.