Source: http://www.google.com/patents/US5444645?dq=6,243,373
Timestamp: 2016-09-29 09:35:02
Document Index: 522175548

Matched Legal Cases: ['art 2', 'art 2', 'art 3', 'art 3', 'art 2', 'art 3', 'art 2', 'art 3', 'art 3']

Patent US5444645 - Multi-channel pseudo random pattern generating device - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Sign inPatentsPseudo random pattern generators (11 through 1m) of respective channels generate pseudo random patterns on the basis of the same n-order generator polynomial. A pseudo random pattern calculating part calculates data X(t1), X(t2), . . . , X(tm), . . . , X(tpm) that are generated at times t1, t2, . . ....http://www.google.com/patents/US5444645?utm_source=gb-gplus-sharePatent US5444645 - Multi-channel pseudo random pattern generating deviceAdvanced Patent SearchTry the new Google Patents, with machine-classified Google Scholar results, and Japanese and South Korean patents.Publication numberUS5444645 APublication typeGrantApplication numberUS 08/137,010PCT numberPCT/JP1993/000174Publication dateAug 22, 1995Filing dateFeb 12, 1993Priority dateFeb 14, 1992Fee statusLapsedAlso published asEP0580870A1, EP0580870A4, WO1993016432A1Publication number08137010, 137010, PCT/1993/174, PCT/JP/1993/000174, PCT/JP/1993/00174, PCT/JP/93/000174, PCT/JP/93/00174, PCT/JP1993/000174, PCT/JP1993/00174, PCT/JP1993000174, PCT/JP199300174, PCT/JP93/000174, PCT/JP93/00174, PCT/JP93000174, PCT/JP9300174, US 5444645 A, US 5444645A, US-A-5444645, US5444645 A, US5444645AInventorsTomio Yoshida, Kazuhiro ShimawakiOriginal AssigneeAdvantest CorporationExport CitationBiBTeX, EndNote, RefManPatent Citations (8), Non-Patent Citations (6), Referenced by (9), Classifications (9), Legal Events (6) External Links: USPTO, USPTO Assignment, EspacenetMulti-channel pseudo random pattern generating device
US 5444645 AAbstract
Pseudo random pattern generators (11 through 1m) of respective channels generate pseudo random patterns on the basis of the same n-order generator polynomial. A pseudo random pattern calculating part calculates data X(t1), X(t2), . . . , X(tm), . . . , X(tpm) that are generated at times t1, t2, . . . , tm, . . . , tpm at intervals zk and loads them as initial values in an initial value table in the case where a pseudo random pattern is generated by a pseudo random pattern generator identical in construction with the pseudo random pattern generator of each channel. Initial value data of one of such p sets of initial values are set in the pseudo random pattern generators (11 through 1m) of the respective channels, after which the generation of a pseudo random pattern is started.
1. A multi-channel pseudo random pattern generating device including a clock signal having clock pulses and a clock period, said multi-channel pseudo random pattern generating device comprising:pseudo random pattern generators comprising first to m-th channels, each channel comprising an exclusive OR circuit and an n-stage shift register to have a common generator polynomial and initialized and driven by the clock signal to shift from one stage to another stage and generating a pseudo random pattern based on the common generator polynomial, said m being an integer equal to or greater than 2; initial value generating means for generating first to p-th sets of initial values {I1, I2, . . . , Im }, {Im+1, Im+2, . . . , Im+m }, . . . , and {I.sub.(p-1)m+1, I.sub.(p-1)m+2, . . . , I.sub.(p-1)m+m } identical to initial values obtained by repeatedly generating m times, for each set, data of n bits from n shift stages of one of said pseudo random pattern generators at time intervals zk defined by a number of the clock pulses; memory means for storing said first to p-th sets of the initial values in a table; and control means for reading m initial values of a selected set from said memory means, setting the initial values into said pseudo random pattern generators of said m channels and controlling said pseudo random pattern generators to start and stop their respective operations, wherein said time interval zk is longer than an actual pattern generating time and, representing the clock period of said clock signal by Tc, a number n of said shift stages of said pseudo random pattern generator of each channel satisfying n&gt;log2 ({&#931;zk /Tc}+1), where k=1 through mp-1. 2. The multi-channel pseudo random pattern generating device according to claim 1, wherein said initial value generating means comprises initial value calculating means for generating at least one of said p sets of initial values through calculation.
3. The multi-channel pseudo random pattern generating device according to claim 2, wherein said initial value calculating means generates said p sets of initial values through calculation.
4. The multi-channel pseudo random pattern generating device according to claim 1, wherein said initial value generating means comprises select means for selecting one of said clock signal and said fast clock and one of said pseudo random pattern generators of said m channels, and when said at least one set of initial values are generated, said control means provides said fast clock via said select means to said one pseudo random pattern generator, and sets in said pseudo random pattern generators of said m channels said one set of pattern generator, and when a pseudo random pattern is generated, said control means provides said clock signal via said select means to said pseudo random pattern generators of said m channels.
5. A multi-channel pseudo random pattern generating device including a clock signal having clock pulses and a clock period, said multi-channel pseudo random pattern generating device comprising:pseudo random pattern generators comprising first to m-th channels, each channel comprising an exclusive OR circuit and an n-stage shift register to have a common generator polynomial and initialized and driven by the clock signal to shift from one stage to another stage and generating a pseudo random pattern based on the common generator polynomial, said m being an integer equal to or greater than 2; initial value generating means, comprising high-speed pseudo random pattern generating means identical in construction to one of said pseudo random pattern generators and driven by a second clock signal having a second frequency higher than a frequency of the clock signal, for generating first to p-th sets of initial values {I1, I2, . . . , Im }, {Im+1, Im+2, . . . , Im+m }, . . . , and {I.sub.(p-1)m+1, Ip-1)m+2, . . . , Ip-1)m+m } identical to initial values obtained by repeatedly generating m times, for each set, data of n bits from n shift stages of one of said pseudo random pattern generators at time intervals zk defined by a number of the clock pulses; memory means for storing said first to p-th sets of the initial values in a table; and control means for reading m initial values of a selected set from said memory means, setting the initial values into said pseudo random pattern generators of said m channels and controlling said pseudo random pattern generators to start and stop their respective operations, wherein said time interval zk is longer than an actual pattern generating time and, representing the clock period of said clock signal by Tc, a number n of said shift stages of said pseudo random pattern generator of each channel satisfying n&gt;log2 ({&#931;zk /Tc}+1), where k=1 through mp-1. 6. The multi-channel pseudo random pattern generating device according to claim 5, wherein said high-speed pseudo random pattern generating means generates said p sets of initial values, said initial value generating means comprises memory means for storing said p sets of initial values generated by said high-speed pseudo random pattern generating means, and said control means reads out a selected one set of initial values from said memory means and sets them in said pseudo random pattern generating means of said m channels.
The present invention relates to a multi-channel pseudo random pattern generating device and, more particularly, to multiplication of the number of channels and standardization of the circuit configuration of pseudo random pattern generators in respective channels.
The basic circuit of a pseudo random pattern generator (hereinafter referred to simply as a RP generator as well) is made up of a shift register and at least one XOR (an exclusive OR circuit). FIG. 4 is a diagrammatic showing of its example, in which a generator polynomial (or generating function) is expressed by F(X) =X5 +X2 +1 and five D-FF (D type flip-flop) stages and one XOR are employed. As shown, for the generation of a pseudo random pattern (PRBS: Pseudo Random Binary Sequence) a feedback type shift register is used and, for example, the outputs from its final stage and any one of its intermediate stages are input into the XOR, whose output is fed back to the input of the shift register. Upon each input of one clock pulse (CK) into this circuit, PRBS data of one or more bits is produced from an arbitrary one or more shift stages.
As is well-known in the art, the pseudo random pattern generator having an n-order generator polynomial F(X) is usually formed by an n-stage shift register type circuit and PRBS data from each shift stage is a repetition of a pattern of successive 2n -1 bits. The outputs from any shift stages have patterns of the same sequence and they are displaced apart in phase alone. Hence, the output from any shift stage may be used as the PRBS data from the pseudo random pattern generator. It is also possible to use outputs from an arbitrary number of shift stages as random pattern data.
As depicted in FIG. 5, a conventional m-channel pseudo random pattern generating device is comprised of RP generators 11 through 1m that have different generator polynomials F1 (X), F2 (X), ..., Fm (X), respectively. Since the generator polynomials Fi (X) (where i=1 through m) differ from one another, cross-correlation of the PRBS data in the respective channels CHi can be made low.
There is the possibility that as the number m of channels used increases (more than 100, for instance), conventional multi-channel PRBS generating devices could not be implemented because the number of existing generator polynomials Fi (X) is about 100. Moreover, the RP generator in each channel is formed on the basis of a different generator polynomial, and hence has a different circuit configuration accordingly; thus, it is impossible to standardize the circuit configuration of the RP generators in the respective channels and difficult to fabricate them as IC's.
It is therefore an object of the present invention to solve the defects of the prior art and provide a multi-channel PRBS generating device which allows the number m of channels to be made larger than in the prior art and permits the use of a common circuit configuration for RP generators in respective channels.
The multi-channel PRBS generating device according to the present invention includes
pseudo random pattern generators of first to m-th (where m is an integer equal to or larger than 2) channels each formed by an n-stage shift register which is initialized and driven by a clock signal to shift from one stage to another to generate a pseudo random pattern on the basis of a common generator polynomial;
initial value generating means which generates a desired one of first to p-th (where p is an integer greater than 1) sets of initial values {I1, I2, . . . , Im }, {Im+1, Im+2, . . . , Im+m }, . . . , and {I.sub.(p-1)m+1, I.sub.(p-1)m+2, . . . , I.sub.(p-1)m+m } which are obtained by repeatedly generating m times data of n bits that are provided from n shift stages of one of the pseudo random pattern generators at time intervals zk defined by the number of clock pulses of the clock signal; and
a control part which sets the m initial values from the initial value generating means in the pseudo random pattern generators of the m channels to control them to start and stop their operation. In the present invention wherein the time interval zk is selected sufficiently longer than the time that is actually consumed for pattern generation and, letting the clock cycle of the clock signal be represented by Tc, the number n of shift stages of the pseudo random pattern generator of each channel is so selected as to satisfy
n>log2 [{Σzk /Tc}+1]
where k is from 1 to mp-1.
The above-mentioned initial values may be obtained from an initial value table or through calculations by an initial value calculation part. Alternatively, the initial values may be generated by use of a pseudo random pattern generator of the same construction of that of the pseudo random pattern generator of each channel. In the latter case, the frequency of the clock pulses that are applied to the pseudo random pattern generator for generating the initial values is selected sufficiently higher than the frequency of the clock pulses that are fed to the pseudo random pattern generator of each channel.
FIG. 1B is a diagram showing the timing of generation of initial values on the assumption that the initial values, which are computed in an initial value computation part 2 in FIG. 1A and set in pseudo random pattern generators of respective channels, are produced by a pseudo random pattern generator identical in construction with those of the respective channels.
FIG. 2 is a diagram showing how the auto-correlation function of PRBS data available from the pseudo random pattern generator of each channel in FIG. 1A varies with time τ.
FIG. 4 is a circuit diagram illustrating an example of a pseudo random pattern generator which has a generator polynomial F(X)=X5 +X2 +1 and generates PRBS data.
FIG. 5 is a block diagram showing a conventional multi-channel pseudo random pattern generating device.
According to the purpose of use, the PRBS is pre-selected to have a pattern sequence and a repetition period such that the auto-correlation value within the practical operating time becomes smaller than a practically permissible value. For example, in the case of driving a pseudo random pattern generator having 61 shift stages by a 19.44 MHz clock signal, the PRBS pattern length is about 2.3�1010 -bit and the repetition period is as long as 3000 years or more. In the case of a multi-channel PRBS generating device, it is necessary that cross-correlation values of the PRBS data of all channels that are generated become smaller than a permissible value. Incidentally, where PRBS's of the same pattern are generated in two channels at a time interval t, the cross-correlation value becomes equal to the auto-correlation value the time t away in the same PRBS data. It does not matter, in practice, to use the same pattern in the PRBS's of all channels as long as the cross-correlation value is smaller than the auto-correlation value.
Hence, one possible method to get around this problem is to generate PRBS's of the same pattern at sufficiently long time intervals in the respective channels so that the cross-correlation would not matter, in practice, within the practical operating time. Yet this method is not practical, because the time from the start of PRBS generation in one channel to that in the next channel is far longer than the actual operating time.
The present invention implements, by two methods, the multi-channel PRBS generation that satisfies the above-mentioned requirement. A first method is based on a finding that a pattern, which is generated after the elapse of time t that satisfies the above-said condition, can be preobtained by calculation. According to this method, status values of the shift register of the pseudo random pattern generator after the elapse of time intervals t1, t2, . . . are precalculated and the values thus obtained are set as initial values in the pseudo random pattern generators of respective channels, after which the generation of the PRBS data is started.
According to the other method, one pseudo random pattern generator is operated on a high-speed clock to generate sequentially status values corresponding to the above-mentioned time intervals t1, t2, . . . within a period of time sufficiently shorter than the practical operating time. These status values are set as initial values in the pseudo random pattern generators of the respective channels. The PRBS generation is then started using an ordinary clock signal.
A description will be given first, with reference to FIG. 4, of a method of calculating the shift register status values after certain elapsed time according to the above-noted first method. Letting the outputs from the D-FF's of the respective shift stages at time t be represented by X1 (t), X2 (t), X3 (t), X4 (t) and X5 (t), respectively, the D-FFs' outputs at time t+1 after the elapse of one clock time are expressed by Eq. (1). ##EQU1## In the above, the add operation of X1 (t) and X3 (t) at the fifth line in Eq. (1) is a modulo-2 add operation (i.e. an exclusive OR). Expressing the above equation in a matrix form, we have ##EQU2## Here, A becomes Eq. (3). ##EQU3## Since the outputs from the respective shift stages at time t+2 are ##EQU4## the outputs from the respective shift stages at time t+zk (i.e. zk clocks after time t) are found by Eq. (5). ##EQU5##
Eq. (5) provides the outputs from all shift stages, i.e. the internal data of the shift register (hereinafter referred to as a status value), an arbitrary clock time zk after time t. Thus, the PRBS data after the arbitrary clock time zk can be obtained by calculation.
Referring now to FIG. 1, an embodiment of the present invention is described. In this embodiment an initial value calculation part 2 sequentially calculates status values that the shift register of the pseudo random pattern generator will reach at time intervals zk specified by a control part 3, obtains p sets of initial values, each composed of m status values as initial values for RP generators 11 through 1m of m channels CH1 through CHm, and stores them in an initial value table 4 under control of the control part 3. The RP generators 11 to 1m of the m channels are identical in construction, and hence have shift registers of the same number of shift stages.
To generate PRBS data, a desired one of the sets of initial values is read out of the initial value table 4 and the initial values thus read out are set in the shift registers in the RP generators 11 through 1m, respectively. Supplied with the shift clock CK, the RP generators 11 through 1m each sequentially output a predetermined one or more shift stages. By reading out another selected set of initial values from the initial value table 4 and set them in the RP generators 11 through 1m as required, the sequence of the PRBS data that is generated could be changed.
Now, consider that the PRBS data is generated by a pseudo random pattern generator identical in construction with the pseudo random pattern (formed by n D-FF stages) of each channel that has an n-order generator polynomial F(X). Based on a status value X(t1) (hereinafter referred to as a first initial value) of n bits which are data X1 through Xn from n shift stages at an arbitrary time t1, the initial value calculation part 2 calculates a status value X(t2) (hereinafter referred to as a second initial value) after the elapse of an arbitrary time z1, using the following equation as in the case of Eq. (5). ##EQU6##
In the above, [] represents a matrix and A is also represented by a matrix.
Next, an n-bit status value X(t3) (hereinafter referred to as a third initial value) time z2 after time t2 is calculated by the following equation: ##EQU7##
Similarly, a status value X(tm) time zm-1 after time (tm-1) (an m-th initial value) is obtained by the following equation: ##EQU8##
In this way, a first set (a first group) of initial values {X(t1), X(t2), . . . , X(tm)} for pseudo random patterns of m channels are calculated (see FIG. 1B). Incidentally, the i-th initial value X(ti) will be identified by Ii as well, for the sake of simplicity.
In a likewise manner, a second set of m initial values {X(tm+1), X(tm+2), . . . , X(tm+m)} are calculated, and a p-th (where p is an integer equal to or greater than 1) set of m initial values {X(t.sub.(p-1)m+1), X(t.sub.(p-1)m+2), . . ., X(t.sub.(p-1)m+m)} are similarly calculated. The first to p-th sets of initial values thus obtained are sequentially written into the initial value table 4.
In the case of simultaneously generating PRBS data in all channels, the first to m-th initial values of that one of the plurality of initial values stored in the initial value table 4 which is specified by the control part, for example, the initial values of the first set X(t1), X(t2), . . . , X(tm) are set in the RP generators 11 through 1m, respectively, and they simultaneously start the PRBS generating operation at the timing specified by the control part 3. The status values of the m RP generators after the elapse of time t are X(t1 +t), X(t2 +t), . . . , X(tm +t), respectively. Since data from a predetermined one or more of the n shift stages of the RP generator of each channel are output as the PRBS data, the signs X(t1 +t), X(t2 +t), . . . , X(tm +t) that represent these status values will hereinafter be used to indicate the PRBS data that are generated in the respective channels after the elapse of time t.
The cross-correlation function of the output PRBS data X(ti +t) from the RP generator 1i corresponding to the output PRBS data X(tj +t) from the RP generator 1j becomes equal to the auto-correlation function of the PRBS data X(tj +t), with a time difference (a phase difference) tj -ti =Σzk (where k=i to j) between them. This will be described below.
The auto-correlation represents the general dependency of the value of data X at a certain time on the value of data at a different time. The auto-correlation function Rx(τ) of data X(t) at times t and t+τ is obtained by multiplying the values at the two times and averaging the product for an observation time T. ##EQU9##
Letting the number of shift stages of the shift register forming each RP generator and the shift clock period be represented by n and Tc, respectively, the PRBS data generally has a period of (2n -1)Tc and the auto-correlation function RX (τ) in this case can be expressed by such a graphic representation as shown in FIG. 2. Consequently, the auto-correlation function RX (τ) of the PRBS data is 1 only when τ is an integral multiple of (2n -1) and it is substantially 0 in other cases.
The cross-correlation represents the general dependency of the value of data X(t) at a certain time on the value of another data Y(t) at a certain time, and the cross-correlation function RXY (τ) is an average of the product of the value of data X(t) at time t and the value of data Y(t) at time t+τ. ##EQU10##
The cross-correlation function RXY (τ) between PRBS data X(t) and X(t+ta)=Y(t) that have a time difference ta therebetween is given as follows, by substituting X(t+ta +τ) for Y(t+τ) in Eq. (10). ##EQU11##
The cross-correlation function RXY (τ) of Eq. (11) is equal to the auto-correlation function RX (τ) of Eq. (9) in the case where τ is replaced with τ+ta. This indicates that the cross-correlation between the PRBS data X(t) and Y(t)=X(t+ta) has the same value as that of the auto-correlation function of the data X(t), with the time difference ta between them. Hence, as described previously, it can be said that the cross-correlation function between PRBS data X(ti +t) that is output from the RP generator 1i and PRBS data X(tj +t) that is output from the RP generator 1j is equal to the auto-correlation function of the data X(tj +t), with a time difference tj -ti =Σzk (where k is i through j) corresponding to the time difference ta in Eq. (11).
The value of the auto-correlation function of PRBS data having the generator polynomial F(X) is so small within the period that it does not matter in practice, as is well-known in the art. Also in the cross correlation of PRBS data in two channels (adjacent channels CHi and CHi+1, for example) that have a minimum phase difference between them, if the minimum value zk of the time difference ta or ti+1 -ti is selected sufficiently larger (100 times or so, for example) than the actual operating time of the PRBS generator and smaller than (2n -1)/Tc/mp, the cross-correlation function RXY (τ) of PRBS data in the respective channels will not become equal to the auto-correlation function RX (τ) in the actual operating state. Thus, the phase difference (time difference) zk between initial values can be freely selected within such a range. Furthermore, since the cross-correlation function RXY (τ) is a function that can be obtained simply by replacing the time τ of the auto-correlation function RX (τ) with τ+ta, the value of the cross-correlation function of the PRBS data in respective channels is also so small that it does not matter in practice.
Letting the output continuation time of the multi-channel PRBS generating device be represented by TM, the time difference (or phase difference) zk of the initial values is set to the following value, for example, for the reasons given above.
zk &#8807;100�TM                          (12)
Now, let the order of the generator polynomial F(X) and consequently the number of stages of the shift register of the pseudo random pattern generator be represented by n. In order that each RP generator 1i may keep randomness, it is necessary that the period (2n -1) �Tc (where Tc is the clock period) of PRBS data that the random generator generates be longer than the time Σzk (where k is 1 through mp-1) that would be consumed if p sets of initial values stored in the initial value table 4 are sequentially generated by the same RP generator 1i. Therefore, ##EQU12## Taking logarithms of the both sides of Eq. (14), the following equation is given:
n&gt;log2 [{&#931;zk /Tc}+1]                       (15)
For instance, in the case where the clock period Tc=3 μs, the PRBS generating device operating time TM =36000 s (=100 hours), the number m of channels=40 and the number p of initial values set=16 are employed, the number n of stages of the pseudo random pattern generator is larger than 50.
While in the above the initial values stored in the initial value table 4 are set in the RP generators 1i of m channels, it is also possible in some cases that the initial values computed in the initial value calculating part are sequentially written into the RP generators 11 through 1m at the same time they are loaded into the initial value table 4.
The RP generators 11 through 1m have the same generator polynomial and, of course, they are exactly identical in circuit construction. The output from the random pattern generating device may be obtained from any one or more shift stages.
FIG. 3 illustrates another embodiment of the present invention which utilizes the afore-mentioned second method and in which the initial value calculating part 2 is not used but instead a pseudo random pattern generator identical in construction with the RP generator 1i of each channel is operated and status values that are generated by the random pattern generator at times t1, t2, . . . , tm, tm+1, . . . , tpm (the time interval zk) are written into the initial value table 4 as initial values of p sets. In this embodiment, however, the RP generator 11, which forms one of the channels CH1 through CHm, is used as the pseudo random pattern generator for generating the initial values, and a selector 5 responds to a select signal from the control part 3 to supply the RP generator 11 with either one of a normal clock CK and a fast clock rCK of a frequency t times higher than the clock CK.
In the case of generating initial values of p sets, the fast clock rCK is selected by the selector 5 and applied to the RP generator 11, from which the initial values of the p sets are sequentially generated within a period of time sufficiently shorter than the actual operating time of the device. The control part 3 has a high-speed counter (not shown) and provides a write instruction to the initial table 4 each time the count value of the counter reaches a predetermined clock time. In the case of generating PRBS data, initial values of a desired set are read out from the initial value table 4 and are set in the RP generators 11 through 1m, and the normal clock CK is fed via the selector 5 to the RP generator 11 and to the other RP generators 12 to 1m as well, thus starting the PRBS generation. With the use of the fast clock rCK, the time for generating the initial values can be reduced down to 1/r.
In the FIG. 3 embodiment the initial values from the RP generator 1i may also be set directly in the other RP generators 12 through 1m without using the initial value table 4. In such an instance, m-1 initial values are sequentially set in the RP generators 12 through 1m in the order of generation and the supply of the fast clock rCK is stopped in the state in which the m-th initial value is generated. When the RP generator 11 is used only to generate initial values in the FIG. 1 embodiment, another channel pseudo random pattern generator is required but the selector 5 is not necessary and the fast clock rCK is provided directly to the initial value generating RP generator 11.
As described above, according to the present invention, since the relationship of Eq. (15) holds true between the number m of PRBS generating channels and the number n of stages of the shift register of each of the RP generators of respective channels that have the same generator polynomial F(X), the number m of channels can be increased, as required, by increasing the number m of stages of the shift registers.
Moreover, since the RP generators of respective channels have the same generator polynomial F(X) and hence are identical in circuit configuration, they can be designed and manufactured more easily than in the prior art using different generator polynomials for respective channels, are suitable for fabrication as an IC.
Patent CitationsCited PatentFiling datePublication dateApplicantTitleUS4649419 *Dec 17, 1985Mar 10, 1987La RadiotechniquePseudo-random binary sequency generatorUS5257282 *Jun 28, 1984Oct 26, 1993Unisys CorporationHigh speed code sequence generatorUS5268949 *Aug 31, 1992Dec 7, 1993Ando Electric Co., Ltd.Circuit for generating M-sequence pseudo-random patternUS5327365 *Aug 20, 1992Jul 5, 1994Fujitsu LimitedGenerating system of random-number sequences for a parallel computer systemEP0529512A2 *Aug 20, 1992Mar 3, 1993Fujitsu Limitedmethod and system for generating random number sequencesJPH0243594A * Title not availableJPS584442A * Title not availableJPS6319038A * Title not available* Cited by examinerNon-Patent CitationsReference1 *IEE Proceedings E. Computers & Digital Techniques, vol. 138, No. 3, May 1991, Stevenage GB, pp. 138 146, Saarinen et al VLSI implementation of Tausworthe random number generator for parallel processing environment .2IEE Proceedings E. Computers & Digital Techniques, vol. 138, No. 3, May 1991, Stevenage GB, pp. 138-146, Saarinen et al "VLSI implementation of Tausworthe random number generator for parallel processing environment".3 *Parallel Computing, vol. 15, No. , Sep. 1990, Amsterdam NL, pp. 155 164, Deak, Uniform random number generators for parallel computers .4Parallel Computing, vol. 15, No. 1/3, Sep. 1990, Amsterdam NL, pp. 155-164, Deak, "Uniform random number generators for parallel computers".5 *Proceedings of the 1989 Winter Simulation Conference, Washington D.C., pp. 459 461; Fushimi: Random number generation on parallel processors .6Proceedings of the 1989 Winter Simulation Conference, Washington D.C., pp. 459-461; Fushimi: "Random number generation on parallel processors".* Cited by examinerReferenced byCiting PatentFiling datePublication dateApplicantTitleUS5596516 *Apr 25, 1995Jan 21, 1997Ntt Mobile Communications Network Inc.Code sequence generatorUS5638309 *Jun 21, 1995Jun 10, 1997Ando Electric Co., Ltd.Pseudo-random pattern generating circuitUS6594680 *Dec 30, 1999Jul 15, 2003Texas Instruments IncorporatedPsuedo-random noise sequence generating systemUS6892337 *Aug 22, 2001May 10, 2005Cypress Semiconductor Corp.Circuit and method for testing physical layer functions of a communication networkUS6910165 *Feb 28, 2001Jun 21, 2005International Business Machines CorporationDigital random noise generatorUS7509361 *May 30, 2006Mar 24, 2009Pastemak Solutions LlcMethod and apparatus for generating random numbers for use in a field programmable gate arrayUS8418011Feb 25, 2011Apr 9, 2013Advantest CorporationTest module and test methodUS20020120898 *Feb 28, 2001Aug 29, 2002International Business Machines CorporatonDigital random noise generatorCN102150056BSep 10, 2009Aug 14, 2013爱德万测试株式会社Test module and test method* Cited by examinerClassifications U.S. Classification708/256International ClassificationH03K3/84, G06F7/58Cooperative ClassificationG06F2207/583, H03K3/84, G06F7/584, G06F2207/581European ClassificationG06F7/58P1, H03K3/84Legal EventsDateCodeEventDescriptionOct 14, 1993ASAssignmentOwner name: ADVANTEST CORPORATION, JAPANFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:YOSHIDA, TOMIO;SHIMAWAKI, KAZUHIRO;REEL/FRAME:006897/0173Effective date: 19930927Nov 28, 1995CCCertificate of correctionJan 6, 1999FPAYFee paymentYear of fee payment: 4Mar 12, 2003REMIMaintenance fee reminder mailedAug 22, 2003LAPSLapse for failure to pay maintenance feesOct 21, 2003FPExpired due to failure to pay maintenance feeEffective date: 20030822RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services