Parallel scrambling system
5 claims: 5 independent, 0 dependent
- 1(57)【特許請求の範囲】 【請求項1】 M-ビット(M≧1)インタリーブド並列スクランブルを行うため、n(n 1)個の並列信号を発生させる第1並列信号発生器および該第1並列信号発生器からのn個の並列信号および前記n(n 1)個の入力信号に対し排他的OR演算を行うn(n 1)個の排他的ORゲートを有する第1排他的ORゲート回路を含むM-ビットインタリーブド並列スクランブラと、 該M-ビットインタリーブド並列スクランブラからの信号を受信し、受信された信号をM-ビット単位に多重化し、多重化された信号を出力するM-ビットインタリーブドマルチプレクサと、 前記多重化された信号を受信してM-ビット単位に逆多重化し、n(n 1)個の逆多重化された信号を出力するためのM-ビットインタリーブドデマルチプレクサと、 M-ビットインタリーブド並列デスクランブルを行って、前記n個の入力信号を復元するため、前記第1並列信号発生器と同一の構造を有する第2並列信号発生器、および前記n個の逆多重化された信号および前記第2並列信号発生器からのn個の並列信号に対し排他的OR演算を行うためのn(n 1)個の排他的ORゲートを有する第2排他的ORゲート回路を含むM-ビットインタリーブド並列デスクランブラとを具備したことを特徴とする並列スクランブルシステム。
- 2【請求項2】 請求項1において、前記M-ビットインタリーブド並列スクランブラの特性多項式がn次(n 1)である場合、前記第1並列信号発生器は、それぞれM(M 1)個のシフトレジスタを順次に連結して構成した第1ないし第nシフトレジスタ群、および該n個のシフトレジスタ群のうち特性多項式内に含まれた項(X K )の指数(K、ただし、1≦K≦n)に該当する各シフトレジスタ群の最終シフトレジスタの出力を連続的に排他的OR演算した後、前記第1シフトレジスタ群内の第1番目のシフトレジスタにその結果を出力し、前記全てのシフトレジスタ群を順次に連結した手段を具備したことを特徴とする並列スクランブルシステム。
- 3【請求項3】 請求項2において、前記第1並列信号発生器は、前記第nシフトレジスタ群の最終シフトレジスタから第1並列信号を発生させ、残りの並列信号は所定のシフトレジスタの出力を排他的OR演算して発生させる手段をさらに具備したことを特徴とする並列スクランブルシステム。
- 4【請求項4】 請求項1において、前記M-ビットインタリーブド並列スクランブラの特性多項式がn次(n 1)である場合、前記第1並列信号発生器は、M(M 1)個のシフトレジスタを順次に連結して構成した第1ないし第nシフトレジスタ群、および前記第nシフトレジスタ群内の最終シフトレジスタの出力が前記第1シフトレジスタ群内の第1番目のシフトレジスタに出力され、同時に特性多項式内に含まれた項(X K )の指数(K、ただし、1≦K≦n)のうちnを除く指数に対応する各シフトレジスタ群の最終シフトレジスタの出力とそれぞれ排他的OR演算された後、次に上位のシフトレジスタ群の1番目のシフトレジスタにその結果を出力し、前記全てのシフトレジスタ群が順次に連結された手段を具備したことを特徴とする並列スクランブルシステム。
- 5【請求項5】 請求項4において、前記第1並列信号発生器は、前記第nシフトレジスタ群内の前記最終シフトレジスタから第1並列信号を発生させ、残りの並列信号を、所定のシフトレジスタの出力を排他的OR演算して発生させる手段をさらに具備したことを特徴とする並列スクランブルシステム。
Independent claims5
133 paragraphs, as filed
Description: TECHNICAL FIELD [Detailed description of the invention]
【0001】
[Industrial application field]
The present invention relates to a parallel scrambling system of signals in a system using an M-bit (M 1) interleaved multiplexer / demultiplexer.
【0002】
[Conventional technology]
A system using a conventional M-bit (M 1) interleaved multiplexer has an input signal A, as shown in FIG.<sub>0</sub> Or A<sub>N-1</sub> Is multiplexed by the M-bit interleaved multiplexer 11, and the multiplexed transmission signal is scrambled by the series scrambler 12. On the other hand, a system using an M-bit (M 1) interleaved demultiplexer receives the scrambled signal B, descrambles it with the serial descramble 15, and descrambles the signal, as shown in FIG. Is demultiplexed by the M-bit interleaved demultiplexer 16 and the original signal A<sub>0</sub> Or A<sub>N-1</sub> Is configured to restore. Here, the series scrambler 12 and the series descrambler 15 include series generators 13, 14 and exclusive OR (XOR) gate circuits 17, 18 of the same structure, respectively.
【0003】
In FIGS. 7 and 8, S indicates the sequence generated by the series generators 13 and 14, and B indicates the scrambled signal. The series generators 13 and 14 of the system shown in FIGS. 7 and 8 can be composed of a simple series generator and a modular series generator. FIG. 9 shows the configuration of a simple series generator, FIG. 10 shows the configuration of a modular series generator, and FIG. 11 shows another example of a simple series generator, which is an actual circuit diagram using a D flip-flop and an XOR gate. Is shown.
【0004】
In FIGS. 9 and 10, each block indicates a shift register (or flip-flop), and a number (1 or 0) in the block indicates the initial state of the shift register.
【0005】
Furthermore, as a typical example of a system using a conventional M-bit interleaved multiplexer, an SDH (Synchronous Digital Hierarchy Based System) transmission system recommended by CCITT can be mentioned, and in this system, the M-8 is used. It is adopted.
【0006】
[Problems to be Solved by the Invention]
However, in such a conventional scramble system, when the signal input to the multiplexer is, for example, a STM-1 (Synchronous Transport Module) signal of 155.520 Mbps, the high-speed transmission signal after multiplexing is scrambled, so that the speed is high. It had to be composed of processing elements, and therefore had many problems in terms of manufacturing cost and power consumption.
【0007】
Moreover, in the conventional scramble system, when the input signal is 16 STM-1 signals, the transmitted signal STM-16 after multiplexing is scrambled, so that it must be realized by a high-speed processing element of 2.48 GHz. However, this is practically almost impossible to achieve.
【0008】
An object of the present invention is to solve the above problems, to perform parallel scrambling and transmission of an input signal before multiplexing the input signal, and to perform parallel descramble after demultiplexing on the receiving side. The purpose is to provide a parallel scramble system that can restore the original signal.
【0009】
[Means for solving problems]
In order to achieve such an object, the present invention performs a first parallel signal generator that generates n (n> 1) parallel signals in order to perform M-bit (M 1) interleaved parallel scrambling. First exclusive with n (n> 1) exclusive OR gates that perform exclusive OR operations on n parallel signals from the first parallel signal generator and the n (n> 1) input signals. Receives a signal from an M-bit interleaved parallel scrambler including a target OR gate circuit and the M-bit interleaved parallel scrambler, multiplexes the received signal in M-bit units, and multiplexes the signal. An M-bit interleaved multiplexer that outputs the above, and an M for receiving the multiplexed signal, demultiplexing it in M-bit units, and outputting n (n> 1) demultiplexed signals. -A second parallel signal generator having the same structure as the first parallel signal generator in order to perform M-bit interleaved parallel descramble with a bit interleaved demultiplexer to restore the n input signals. , And n (n> 1) exclusive OR gates for performing exclusive OR operations on the n demultiplexed signals and n parallel signals from the second parallel signal generator. It is equipped with an M-bit interleaved parallel descriptor including a second exclusive OR gate circuit having the same.
【0010】
[Example]
Hereinafter, examples of the present invention will be described in detail with reference to the attached drawings.
【0011】
1 and 2 show the configuration of an embodiment of the present invention.
【0012】
As shown in FIG. 1, the parallel scramble system is input signal A before being multiplexed by the M-bit interleaved multiplexer 22.<sub>0</sub> Or A<sub>N-1</sub> Is scrambled by the M-bit (M 1) interleaved parallel scrambler 21, while the parallel scrambled signal B is received by the M-bit interleaved demultiplexer 24 as shown in FIG. The original signal A is multiplexed and demultiplexed by the M-bit interleaved parallel descrambler 26.<sub>0</sub> Or A<sub>N-1</sub> Is designed to be restored.
【0013】
Scramble in one embodiment of the invention comprising an M-bit interleaved multiplexer is an M-bit interleaved input signal before multiplexing, instead of scrambling the multiplexed signal (ie, conventional serial scrambling). Scramble in parallel. Further, the descramble in the first embodiment of the present invention provided with the M-bit interleaved demultiplexer performs M-bit interleaved parallel descramble of the demultiplexed signal. The M-bit interleaved parallel scrambler 21 and the M-bit interleaved parallel descrambler 26 are parallel series generators 23,25 and parallel series generators 23,25 with the same structure, respectively.<sub>0</sub> Or T<sub>N-1</sub> And includes an XOR gate circuit that performs an exclusive OR operation on the input signal.
【0014】
Here, the sequence T generated by the M-bit interleaved parallel scrambler 21<sub>i</sub> (i = 0,1, ..., N-1) is called a parallel series, and B indicates a scrambled and multiplexed transmission signal. In this case, the M-bit interleaved parallel scrambler 21 (hereinafter referred to as MBIPS) to which the present invention is applied performs the following three steps.
【0015】
In the first step, the series S generated from the series generator 13 shown in FIG. 7 and the parallel series T generated from MBIPS.<sub>i</sub> Seeking a relationship with. In the second step, each parallel series T<sub>i</sub> Find the shift register generator (hereinafter referred to as SRG) that generates. In the third step, parallel series T<sub>i</sub> The sum of the SRGs corresponding to is taken and all parallel series are generated as one SRG.
【0016】
(1) Series S generated by the series generator and parallel series T generated by MBIPS<sub>i</sub> Relationship with: Series S generated by the series series generator 13 shown in Fig. 7 is expressed as follows.
【0017】
[Number 1]
S = (S<sub>0</sub>, S<sub>1</sub>, ..., S<sub>M-1</sub>: S<sub>M</sub>, S<sub>M + 1</sub>, ..., S<sub>2M-1</sub>: : S<sub>(N-1) M</sub>, S<sub>(N-1) M + 1</sub>, ..., S<sub>NM-1</sub>: ) Therefore, in order for MBIPS to become MBIPS for the scrambler shown in Fig. 7, the parallel series T<sub>i</sub> Must be as follows.
【0018】
[Number 2]
T<sub>0</sub>= (S<sub>0</sub>, S<sub>1</sub>, ..., S<sub>M-1</sub>: S<sub>NM</sub>, S<sub>NM + 1</sub>: : S<sub>NM + M-1</sub>: ) T<sub>i</sub>= (S<sub>M</sub>, S<sub>M + 1</sub>, S<sub>2M-1</sub>: S<sub>(N + 1) M</sub>, S<sub>(N + 1) M + 1</sub>, ..., S<sub>(N + 1) M + M-1</sub>: ) T<sub>N-1</sub>= (S<sub>(N-1) M</sub>, S<sub>(N-1) M + 1</sub>, ..., S<sub>NM-1</sub>: S<sub>(2N-1) M</sub>, S<sub>(2N-1) M + 1</sub>, ..., S<sub>2NM-1</sub>; ) That is, parallel series T<sub>i</sub> Interleaving in M-bit units must be the sequence S generated by the series generator. In other words, parallel series T<sub>i</sub>Is a series in which the series S is decimmed by MN and interleaved by M.
【0019】
(2) SRG to generate each parallel series: The series series generator 13 shown in Fig. 7 can be composed of a module composed of n shift registers (hereinafter referred to as MSRG), and its generation polynomial is G (hereinafter referred to as MSRG). x), initial state polynomial D<sub>0</sub> Let it be (x). Furthermore, the series S generated by these scramblers is described as follows.
【0020】
[Number 3]
S = S<sub>MSRG</sub>[G (x), D<sub>0</sub>(x)] Therefore, by the following decimation and interleaving theorem, the parallel series T<sub>i</sub> MSRG can be obtained.
【0021】
Theorem 1 (Decimation): [0022]
[Outside 1]
<img file="JP2612397B2_D0001.tif" />【0023】
I-th L-decimated series of U<sub>i</sub> And. Then [0024]
[Number 4]
<img file="JP2612397B2_D0002.tif" />【0025】
Is. Theorem 2 (Interleave): Series S<sub>MSRG</sub>[G (x), D<sub>0</sub><sup>i</sup>(x)], i = 0,1, Let T be the sequence interleaving L-1. Then [0026]
[Number 5]
<img file="JP2612397B2_D0003.tif" />【0027】
Is.
【0028】
For example, consider a 4: 1 byte-interleaved parallel scrambler for the scrambler in Figure 9 used in SDH systems (ie M = 8, N = 4). The scrambler in Figure 9 has a simple SRG (SSRG) structure with characteristic polynomials C (x) = X.<sup>7</sup> + X<sup>6</sup> +1 and initial state polynomial D<sub>0C</sub>(x) = X<sup>6</sup> + X<sup>5</sup> + X<sup>4</sup> + X<sup>3</sup> + X<sup>2</sup> + X<sup>1</sup> Has +1. The MSRG that produces the same series is shown in Figure 10, and its generation polynomial G (x) is X.<sup>7</sup> + X + 1 and initial state polynomial D<sub>0</sub> (x) is X<sup>6</sup> + X<sup>5</sup> + X<sup>4</sup> + X<sup>3</sup> + X<sup>2</sup> + X [Specifically, the series generated from MSRG is always generated from SSRG, and the characteristic polynomial C (x) of SSRG is X.<sup>n</sup> G (x<sup>-1</sup>) (Where n indicates the degree of the characteristic polynomial (or generation polynomial)), the initial state polynomial D<sub>0C</sub>(x) is X<sup>n</sup> D<sub>0</sub> Must be the same as (x) divided by G (x)]. Therefore, the sequence 32 (= MN) -decimated by Theorem 1 is expressed as follows.
【0029】
[Number 6]
V<sub>0</sub>= S<sub>MSRG</sub>[G'(x), X<sup>6</sup>+ X<sup>5</sup>+ X<sup>3</sup>+ X<sup>2</sup>+ X +1], V<sub>1</sub>= S<sub>MSRG</sub>[G'(x), X<sup>6</sup>+ X<sup>5</sup>+ X<sup>2</sup>+ X +1], V<sub>2</sub>= S<sub>MSRG</sub>[G'(x), X<sup>6</sup>+ X<sup>5</sup>+ X<sup>2</sup>], V<sub>3</sub>= S<sub>MSRG</sub>[G'(x), X<sup>6</sup>+ X<sup>4</sup>+ X<sup>2</sup>], V<sub>4</sub>= S<sub>MSRG</sub>[G'(x), X<sup>6</sup>+ X<sup>4</sup>+ X<sup>3</sup>+ X<sup>2</sup>+ X], V<sub>5</sub>= S<sub>MSRG</sub>[G'(x), X<sup>6</sup>+ X<sup>5</sup>+ X<sup>4</sup>+ X<sup>3</sup>+ X<sup>2</sup>+1], V<sub>6</sub>= S<sub>MSRG</sub>[G'(x), X<sup>6</sup>+1], V<sub>7</sub>= S<sub>MSRG</sub>[G'(x), X<sup>3</sup>], However, G'(x) is X<sup>7</sup>+ X +1.
【0030】
Using Theorem 2 and the relationship between the parallel series and the series generated by the scrambler in FIG. 7, the parallel series is expressed as follows.
【0031】
[Number 7]
T<sub>0</sub>= S<sub>MSRG</sub>[G (x<sup>8</sup>), X<sup>55</sup> + X<sup>54</sup> + X<sup>53</sup> + X<sup>52</sup> + X<sup>51</sup> + X<sup>50</sup> + X<sup>49</sup> + X<sup>47</sup> + X<sup>46</sup> + X<sup>45</sup> + X<sup>42</sup> + X<sup>36</sup> + X<sup>35</sup> + X<sup>34</sup> + X<sup>31</sup> + X<sup>27</sup> + X<sup>26</sup> + X<sup>24</sup> + X<sup>23</sup> + X<sup>22</sup> + X<sup>21</sup> + X<sup>20</sup> + X<sup>19</sup> + X<sup>18</sup> + X<sup>15</sup> + X<sup>14</sup> + X <sup>11</sup> + X<sup>7</sup>+ X<sup>6</sup>+ X<sup>2</sup>+ X] ... (1) In the same way, T<sub>1</sub> , T<sub>2</sub> , T<sub>3</sub> Can be sought.
【0032】
(3) Sum SRG: The method of generating one MSRG or all parallel series as SSRG from the SRG that generates each parallel relation is made possible by the following theorem.
【0033】
Theorem 3 (Specific example of sum SSSRG): Parallel series T<sub>0</sub> The sequence generated from the i-th shift register of SSRG that generates W<sub>j</sub>, i = 0,1, ..., M<sub>n-1</sub> And. In addition, a<sub>j</sub><sup>i</sup>, i = 0,1, ..., N-1, j = 0,1, ..., n-1 [0034]
[Outside 2]
<img file="JP2612397B2_D0004.tif" />【0035】
Have a value of 0 or 1 that satisfies. However, m is the smallest integer that satisfies mMN = 1 modulo (period of series S), and G'(x) is the generation polynomial of the MN-decimated series of series S. Then, the parallel series can be expressed as follows.
【0036】
[Number 8]
<img file="JP2612397B2_D0005.tif" />【0037】
Theorem 4 (Specific example of sum MSRG): Parallel sequence sequence T<sub>0</sub> The sequence generated from the i-th shift register of MSRG that generates W'<sub>i</sub> , i = 0,1, ..., M<sub>n-1</sub> And. In addition, b<sub>j</sub><sup>i</sup>, i = 0,1, ..., N-1, j = 0,1, ..., n-1 [0038]
[Outside 3]
<img file="JP2612397B2_D0006.tif" />【0039】
Have a value of 0 or 1 that satisfies. Therefore, the parallel series can be expressed as follows.
【0040】
[Number 9]
<img file="JP2612397B2_D0007.tif" />【0041】
For example, consider a 4: 1 byte-interleaved parallel scrambler for the scrambler shown in Figure 9. Then, since the period of the sequence generated from the scrambler is 127, m of Theorem 3 becomes 4 (because MN = 32). Therefore, the parallel relation can be expressed by Theorem 3 as follows.
【0042】
[Number 10]
T<sub>0</sub>= W<sub>0</sub>, T<sub>1</sub>= W<sub>8</sub>+ W<sub>16</sub> + W<sub>32</sub> , T<sub>2</sub>= W<sub>8</sub>+ W<sub>32</sub> , T<sub>3</sub>= W<sub>8</sub>+ W<sub>24</sub> + W<sub>48</sub>This equation and the 0th parallel series T from equation (1)<sub>0</sub> After finding the SSRG that generates, theorem 3 can be used to find the MBIPS based on the SSRG structure as shown in Fig. 3. By the same method, theorem 4 can be used to obtain MBIPS based on MSRG as shown in Fig. 4.
【0043】
FIG. 3 shows an example of an M-bit interleaved parallel scrambler configured by the method described above, and FIG. 4 shows another example of an M-bit interleaved parallel scrambler.
【0044】
In FIG. 3, the M-bit parallel scrambler (MBIPS) includes a group of seven shift registers configured by sequentially concatenating eight shift registers. In this case, the number of shift register groups is seven, which is the seventh-order generation polynomial (C (x) = X) in this embodiment.<sup>7</sup> + X<sup>6</sup> This is because +1) is used. These seven shift register groups are also sequentially concatenated. However, after performing an exclusive OR operation on the output of the final shift register (leftmost shift register) of the 7th shift register group (leftmost shift register group) and the output of the final shift register of the 6th shift register group, the first The result is output to the first shift register (rightmost shift register) of the shift register group (rightmost shift register group).
【0045】
In this embodiment, four parallel scramble signals T from the seven shift register groups described above.<sub>0</sub> Or T<sub>3</sub> Is configured to generate. However, the 0th scramble signal T<sub>0</sub> Is generated from the last shift register of the 7th shift register group, and the remaining scramble signal T<sub>1</sub> Or T<sub>3</sub> Is generated by using the shift register and XOR gate mentioned above.
【0046】
In FIG. 4, the M-bit interleaved parallel scrambler MBIPS is composed of seven shift register groups each consisting of eight shift registers connected in sequence. These seven shift register groups are also sequentially concatenated. However, the output of the final shift register group of the 7th shift register group is output to the 1st shift register of the 1st shift register group, and at the same time, the output of the final shift register of the 1st shift register group is subjected to an exclusive OR operation. After that, the result is output to the first shift register of the second shift register.
【0047】
In this embodiment, as in FIG. 3, four parallel scramble signals T from the above-mentioned seven shift register groups.<sub>0</sub> Or T<sub>3</sub> Is configured to generate. However, the 0th scramble signal T<sub>0</sub> Is generated from the last shift register of the 7th shift register group, and the remaining scramble signal T<sub>1</sub> Or T<sub>3</sub> Was generated using the shift register and exclusive OR gate described above.
【0048】
FIG. 5 shows an example of MBIPS based on the SSRG structure, which generates 16 parallel scrambled signals. MBIPS is configured by the same method as in Fig. 3. FIG. 6 shows an example of MBIPS based on the MSRG structure, and shows another example of generating 16 parallel scrambled signals. MBIPS is configured by the same method as in Fig. 4.
【0049】
In FIGS. 3 to 6, the number 1 or 0 in each shift register indicates the initial state of the shift register, respectively.
【0050】
[Effect of the invention]
As described above, the present invention can perform parallel scrambling before multiplexing and can operate the scrambler at the same speed as the transmission speed of the input signal, thus reducing production costs and power consumption. It has the effect of being able to.
[Simple explanation of drawings]
[Figure 1]
It is a block diagram which shows the scrambler of one Example of this invention.
[Figure 2]
It is a block diagram which shows the descrambler of one Example of this invention.
[Fig. 3]
It is a block diagram which shows an example of the M-bit interleaved parallel scrambler.
[Fig. 4]
It is a block diagram which shows another example of M-bit interleaved parallel scrambler.
[Fig. 5]
It is a block diagram which shows an example of MBIPS based on SSRG structure.
[Fig. 6]
It is a block diagram which shows an example of MBIPS based on MSRG structure.
[Fig. 7]
It is a block diagram which shows the conventional example of the system using the M-bit interleaved multiplexer.
[Fig. 8]
It is a block diagram which shows the conventional example of the system using the M-bit interleaved demultiplexer.
[Fig. 9]
It is a block diagram which shows the structure of a simple series generator.
[Fig. 10]
It is a block diagram which shows the structure of a modular series generator.
[Fig. 11]
It is a block diagram which shows the structure of another example of a simple series generator.
[Explanation of symbols]
21 M-bit interleaved parallel scrambler 26 M-bit interleaved parallel desk rambler 22 M-bit interleaved multiplexer 24 M-bit interleaved demultiplexer 23,25 Parallel series generator
18 sheets
Sheet 1 Sheet 2 Sheet 3 Sheet 4 Sheet 5 Sheet 6 Sheet 7 Sheet 8 Sheet 9 Sheet 10 Sheet 11 Sheet 12 Sheet 13 Sheet 14 Sheet 15 Sheet 16 Sheet 17 Sheet 18
Every citation, both ways
| Document | Relation | Office |
|---|---|---|
| JP1213042A | Cites | Japan |
| JP457532A | Cites | Japan |
9 members in 5 offices
Priority claims5
| Document | Office | Kind | Date |
|---|---|---|---|
| 920001803 | Republic of Korea | A | |
| 920001803 | Republic of Korea | A | |
| 9201803 | – | – | – |
| 19921803 | Republic of Korea | – | – |
| KR19920001803 | – | – | – |
Members9
| Document | Office | Kind | |
|---|---|---|---|
| GB9211137D0 | United Kingdom | D0 | |
| GB2264028A | United Kingdom | A | |
| FR2687262A1 | France | A1 | |
| US5241602A | United States of America | A | |
| FR2687262B1 | France | B1 | |
| JPH06276175A | Japan | A | |
| KR940009843B1 | Republic of Korea | B1 | |
| GB2264028B | United Kingdom | B | |
| JP2612397B2This record | Japan | B2 |
14 legal events, as the office reported them to INPADOC
Over the term
Point at a mark for the eventEvents
| Event | Code | |
|---|---|---|
| Renewal fee payment (event date is renewal date of database)FPAY | FPAY | |
| Cancellation because of completion of termEXPY | EXPY | |
| Renewal fee payment (event date is renewal date of database)FPAY | FPAY | |
| Renewal fee payment (event date is renewal date of database)FPAY | FPAY | |
| Renewal fee payment (event date is renewal date of database)FPAY | FPAY | |
| Renewal fee payment (event date is renewal date of database)FPAY | FPAY | |
| Renewal fee payment (event date is renewal date of database)FPAY | FPAY | |
| Renewal fee payment (event date is renewal date of database)FPAY | FPAY | |
| Renewal fee payment (event date is renewal date of database)FPAY | FPAY | |
| Renewal fee payment (event date is renewal date of database)FPAY | FPAY | |
| Renewal fee payment (event date is renewal date of database)FPAY | FPAY | |
| Receipt of annual feesJAPANESE INTERMEDIATE CODE: R250R250 | R250 | |
| Receipt of annual feesJAPANESE INTERMEDIATE CODE: R250R250 | R250 | |
| Receipt of annual feesJAPANESE INTERMEDIATE CODE: R250R250 | R250 |
Numbers
- Publication
- 2612397
- Publication, DOCDB
- 2612397
- Publication, EPODOC
- JP2612397B
- Application
- 4141835
- Application, DOCDB
- 14183592
- Application, EPODOC
- JP19920141835
Titles2
- Japanese
- 並列スクランブルシステム
- English
- [Title of Invention] Parallel scramble system
Classification
- CPC, 4
- H04J3/047
- H04K1/04
- H04J2203/0089
- H04L25/03872
- IPC, 7
- H04B1 69
- H04J3 00
- H04J3 04
- H04J13 00
- H04L7 00
- H04L25 03
- H04Q11 04
