For systems in which the probability that an incorrect output is observed differs with input values, we adopt the redundant usage of n copies of identical systems which we call the n-redundant system. This paper presents a method to find the optimal redundancy of systems for minimizing the probability of dangerous errors. First, it is proved that a k-out-of-n redundancy or a mixture of two kinds of k-out-of-n redundancies minimizes the probability of D-errors under the condition that the probability of output errors including both dangerous errors and safe errors is below a specified value. Next, an algorithm is given to find the optimal series-parallel redundancy of systems by using the properties of the distance between two structure functions.

A method for the compression of ECG data is presented. The method is based on the edit distance algorithm developed in the file comparison problems. The edit distance between two sequences of symbols is defined as the number of edit operations required to transform a sequence of symbols into the other. We adopt the edit distance algorithm to obtain a list of edit operations, called edit script, which transforms a reference pulse into a pulse selected from ECG data. If the decoder knows the same reference, it can reproduce the original pulse, only from the edit script. The amount of the edit script is expected to be smaller than that of the original pulse when the two pulses look alike and thereby we can reduce the amount of space to store the data. Applying the proposed scheme to the raw data of ECG, we have achieved a high compression about 14: 1 without losing the significant features of signals.

The synchronic distance is a fundamental concept in a Petri net. Marked graphs form a subclass of Petri nets. Given a matrix D, we are interested in the problem of finding a marked graph whose synchronic distance matrix is D. It is wellknown that the synchronic disrance matrix of a marked graph is a distance matrix. In this letter, we give a matrix D such that D is a distance matrix and there does not exist a marked graph whose synchronic distance matrix is D.

The physical system is considered more suitable for measurement purposes the greater is its linearity. However, in nature and engineering there are no purely linear physical transducing systems for convertion a primary onformation. The use of the linear features of the system in the measurement process finally causes the drawbacks: systematic error due to nonlinear distortions, low ratio informative signal/ noise, the necessity to evaluate a great number of the a priori parameters of the transducer in order to receive an absolute result, low thermostability because every a priori parameter itself has a temperature dependence. To exclude these drawbacks a method has been developed using nonlinear physical systems in the base of the displacements measurement. In this work is presented the realization of the method using electretic and electrostatic transducer as a converting physical system. A contactless transducer is placed parallelly to the surface of the object which displacements are measured. The transducer is driven to harmonic oscillations. Typical time intervals between even and odd extremums of the transducer output signal are measured. The object displacements are determined according to the changes of the typical time intervals. The method itself has no errors because approximations were not made while deriving the relations. The source of the errors is inaccurate registration of the start and the end of the typical time intervals. In the work are analysed the errors related to the concrete realization devices: analogue differentiator, peak detector and analog digital transducer. It is shown that the measurement is possible only if the physical system is nonlinear. The method is generalized to that case if the function of transformation of ths system has the form f(x) and monotonous character. The results of experimental investigations confirm the theoretical conclusions.

Since semiconductor memory chip has been growing rapidly in its capacity, memory testing has become a crucial problem in RAMs. This paper proposes a new RAM test algorithm, called generalized marching test (GMT), which detects static and dynamic pattern sensitive faults (PSF) in RAM chips. The memory array with N cells is partitioned into B sets in which every two cells has a cell-distance of at least d. The proposed GMT performs the ordinary marching test in each set and finally detects PSF having cell-distance d. By changing the number of partitions B, the GMT includes the ordinary marching test for B1 and the walking test for BN. This paper demonstrates the practical GMT with B2, capable of detecting PSF, as well as other faults, such as cell stuck-at faults, coupling faults, and decoder faults with a short testing time.

Japan's PARTNERS Project, one of the programmes of ISY advocated by UN, has just started. This letter is a brief introduction of the trials being carried out by the partners in the University of Electro-communications under the Project. The focus is on the distance education and training via ETS-V overcoming the geographical extent and the cultural diversity of the Asia-Pacific Region.

The paper considers the design of two families of binary block codes developed for controlling large numbers of errors which may occur in LSI, optical disks and other devices. The semidistance codes are capable of assuring a required signal-to-noise ratio in information retrieval; the t-symmetric error correcting/all unidirectional error detecting" (t-SyEC/AUED) codes are capable of correcting t or fewer symmetric errors and also detecting any number of unidirectional errors caused by the asymmetric nature of transmission or storage madia. The paper establishes an equivalence between these families of codes, and proposes improved methods for constructing, for any values of t, a class of nonsystematic constant weight codes as well as a class of systematic codes. The constructed codes of both classes are shown to be optimal when t is O, and of asymptotically optimal order" in general cases. The number of redundant bits of the obtained nonsystematic code is of the order of (t+1/2)log2 K bits, where K is the amount of information encoded. The obtained systematic codes have redundancy of the order of (t+1)log2 K bits.

This letter considers a subclass of t-symmetric error correcting/all unidirectional error detecting (t-SyEC/AUED) codes in which the information is represented in an m-out-of-k coded form, which thus can be regarded as virtually systematic for practical purposes. For t3, previous researchers proposed methods for constructing codes of this subclass which are either optimal or of asymptotically optimal order. This letter proposes a new method for constructing, for any values of t, m and k, codes that are either optimal or of asymptotically optimal order. The redundancy of the obtained code is of the order tlog2k bits when mt.

This paper analyzes the performance of the capacity controlled digital radio system, which controls the number of modulation levels according to the amount of traffic. These analyses are performed under thermal noise and co-channel interference. As a result, the throughput improvement is approximately 16 times comparing with the fixed capacity system which has the designed outage probability of 0.1%. Theoretical results are applied to the future mobile communication system which utilizes TDMA access method or burst co-dec, and it is found that the reuse distance can be improved to 1/5 times when the designed outage probability is 0.1%.