The generator of pseudo-random noise sequence with fast results

 

The invention relates to the field of communications, in particular intended for the formation of a pseudo-random noise sequence with the ability to quickly summarize from one shift to another. The technical result is to increase the speed of summing up. one or more downloadable PN generators are controlled PDB or microprocessor with a stand-alone counter, which maintains a reference account shifts. PSH generator is usually part of the index for the seeker. Each PN generator consists of downloadable linear shift register with feedback (LSRS) or its equivalent, downloadable counter to maintain the condition index of this particular PN generator and control unit wrap-made with the possibility of receiving the command to summarize and management LTROS and counter indexes for the implementation of the lead or lag at a certain distance shift. The increase in speed is accomplished by controlling the PDB. In memory stores the state table LTROS and corresponding index numbers. State LSRO divide the total possible number of possible States. It is advisable to evenly spread the stored state by PSH circle. PDB obession way so he “jumped” to the nearest state table, and then use the control unit wrap-PN generator for summing up on the rest of the way. 3 ad and 1 C.p. f-crystals, 7 Il.

The technical field to which the invention relates

The present invention relates to the field of communications. In particular, the present invention relates to a new improved method and apparatus for forming a pseudo-random noise (PN) sequence with the ability to quickly summarize from one shift to another.

The level of technology

Pseudo-random noise (PN) sequences are typically used in communication systems with expansion of the range by the method of direct sequence, for example, described in the standard IS-95 radio interface and its derivatives, such as IS-95-A and ANSI-J-STD-008 (hereinafter referred to together as the standard IS-95), distributed by the Association of the industry of telecommunications (TIA) and used primarily in cellular systems. The standard IS-95 provides methods of modulating signal according to the principle of multiple access code division multiplexing (mdcr) for a set of communication sessions simultaneously within the ESCWA communication sessions within the same frequency band increases the total number of calls and other communications, that can be implemented in the communication system, due to the fact that among other things, increases the reuse of frequencies in comparison with other methods of wireless communication. Application of methods mdcr in the multiple access system described in U.S. patent No. 4901307 on "communication System with expansion of the range using satellite or terrestrial repeaters," and U.S. patent No. 5103459 "System and method for generating signals in a satellite telephone system MTCR".

In Fig.1 shows a highly simplified illustration of a cellular telephone system, built with the application of the standard IS-95. During operation, the group of subscriber devices 10A-d carries out radio communication by establishing one or more radio frequency RF interfaces with one or more base stations 12a-d, using mdcr-modulated radio signals. Each RF interface between the base station 12 and the subscriber apparatus 10 consists of a signal direct line of communication transmitted from the base station 12, and the signal return line communication received from the subscriber device. When using these RF interfaces communication with another user is usually done through the switching center mobile communications (CCMS) 14 and the computer 16 typically installed via a wired connection lines, although it is also known the use of additional RVC or microwave communication lines.

Each subscriber apparatus 10 communicates with one or more base stations 12 using a rake receiver (RAKE). The rake receiver (RAKE) is described in U.S. patent No. 5109390 on the Receiver with receive diversity in a cellular telephone system mdcr". The rake receiver typically consists of one or more searchers to detect direct and multipath pilot signal from the neighboring base stations and two or more pointers (taps) for receiving and combining information signals from these base stations. Seekers are described in co-pending application U.S. No. 08/316177 on "Multipath search processor for multiple access systems with expansion of the range" filed September 30, 1994 Seekers and pointers must be able to form the correct PN sequence corresponding to the PN sequence generated at the base station. PN sequences are usually formed using linear shift registers with feedback or LCROSS.

Characteristic requirement for the design of communication systems with expansion of the range by the method of direct sequencing is that the receiver must Solomenskiy apparatus using exactly the same PN sequence. In order to distinguish themselves from other base stations, the base station enters an individual shift in the formation of its PN sequences. In systems IS-95 base station have a shift equal to an integer multiple of 64 elements of the signal. Subscriber unit communicates with the base station by allocating at least one pointer to this base station. The selected index must enter a corresponding shift in its PN sequence to communicate with the base station. The transition LSAS from one shift to another is called summarizing. One way of deciding is to a temporary increase in the rate of state changes LSRS. This method call ahead, as it moves forward sequence relative to the sequence of the base station. Another way of deciding is a temporary reduction in the rate of state changes LSRS. This method is called delay, as he translates the sequence backward relative to the sequence of the base station.

In Fig.2 shows a typical known configuration LSRS. The elements of this configuration are part of the essential elements of a typical pointer or IP the claim or demodulation (not shown). In systems IS-95 requires two LTROS: one for channel I and one for channel Q. Each of these LSAS slightly different from the standard LSRO the fact that the number of States increased from 215-1 to 215due to the inclusion condition, called condition-insert. The exact nature of the PN sequence generated LSAS, is determined by the selected polynomial, which is implemented by the configuration of the provisions of the allotments. Internal operations LSRO 210 does not have a significant impact on the function of deciding. For the purposes of this example LSRO 210 simply moves from one state to the next in its desired sequence each time the signal is given LSRO VCL, and remains in its current state whenever the signal LCROSS is missing.

The signal LSASL formed by the block 200 management announcement. When LSRS does not summed, the signal LSRO VCL will be activated once per period of the element signal so that LSRS STATE will form a new state with the speed of signal elements. When the control microprocessor, digital signal processor (PDB) or separate hardware (not shown) receives the signal COMANDATE, which meant LSREAL, to exercise the change of shift.

The signal LSASL also controls the counter 220. This counter is used to track the condition is LSRO, by forming the index, which is listed as CROSSCUT. All these items are returned in original condition by the usual reset, which will coordinate LSRO SCAT and CROSSOSTOMA in a given position. As LCROSS controls and counter 220 and LSRO 210, and they are both either together are moving forward or not moving at all, CROSSCUT can be used to determine where LSRO VCL in this PN sequence.

In Fig.3 shows the principle timing diagram that illustrates the announcement by timing. The signal ELEMENTTEXT shows the rate of signal elements. Signals BS and BS are PN sequences of two different base stations. Each sequence runs through the same sequence of States, denoted as S0, S1..., but as noted above, the base station differ shift between their respective PN sequences. This shift is shown in this example, is only 2 element signal. As noted above, the base station stando affect the implementation of deciding. The signal LSRO represents the state LTROS, which will exist inside a pointer or selector in the subscriber apparatus. This signal is shown initially agreed with BS. While communicating (or search) BS signal LSRO VCL will be entered once for the period of the element signal, and LCROSS will remain consistent with BS. In the further description will demonstrate how you can bring LSAS to agree with BS. Based on the relative provisions LSRO, BS and BS, this will be achieved by firing on two elements of the signal. First ahead of the curve designated as advance 1. When LCROSS is in S2, is added to the input signal LSRO VCL. In LSRO goes into S3, and BS still remains in S2. Then comes the expected LSREAL and translates LSRS in S4. It should be noted that BS is S5, and BS in S3, so LSRO (and hence its index or finder) is not consistent with any one of these base stations, and therefore does not link with any of them. A second ahead of the curve, designated as apareunia, occurs when additional input signal LSASL when LCROSS is in S4. This forces LSRO go to S5, where he will now be aligned with BS. Sleduushiy Fig.4 shows the principle timing diagram, which illustrates the announcement by lag. Shows the signals are the same signals and conditions that were described above for the lead. The difference is that LSAS will be brought out of alignment with BS to agree with BS. This will require a lag of 2 elements. Instead of additional inputs LSASL that increase the rate of change LSAS (used for timing), some of the inputs LCROSS will be skipped. These gaps (shown by dashes on the ground missing entries are marked as sebastiania and sebastiania, and force LSAS to stay in S3, while MS continues to move through S4 in S5. Meanwhile BS moves from S1 to S3. When LCROSS will be entered again with normal speed of signal elements, LCROSS will be coordinated with BS.

In normal communications LSRO pointers must perform the summation in several situations. One situation occurs when the selection pointer. Each pointer must be allocated to the position in which the seeker has detected pilot signal. Short summing can be performed when the pointer is allocated for array signal is remapped more strongly the. Pointers can be remapped from one base station to the neighboring base stations located with large shifts relative to the first. After the release of the subscriber from the energy saving mode is usually required to re-install the signs. In most situations, it is advisable to minimize the time required to bring the pointer, because at the time of deciding the pointer cannot be used for communication. The above examples illustrate the ability of deciding on by lead or lag of one element of the signal over the period of the element signal. For example, in the standard IS-95 maximum time required for switching is half PSH circle or 13,33 MS. It would be advisable to ensure faster processing of pointers or seekers for a variety of reasons, including those listed above.

The invention

Proposed new and improved method and apparatus for generation of pseudorandom noise sequences with fast results. One or more downloadable PN generators are controlled PDB or microprocessor with a stand-alone counter, which maintains a master account shifts. PSH generator is usually part of the decree is also in the function of deciding and can manage one or more directions and/or seekers. Each PN generator consists of downloadable linear shift register with feedback (LSRS) or its equivalent, downloadable counter to maintain the condition index of this particular PN generator and controller summing made with the possibility of receiving the command to summarize and management LTROS and counter indexes for the implementation of the lead or lag at a certain distance shift.

The increase in speed is accomplished by controlling the PDB. In memory stores the state table LTROS and corresponding index numbers. These States LSRO divide the total possible number of possible States. It is advisable to evenly spread the stored state by PSH circle. PDB provides a quick summary at the expense of a two-stage process. First PN generator is loaded so that it "jumped" to the nearest state table, and then use the control unit wrap-PN generator for summing up on the rest of the way.

When the pointer move to a specific shift, is calculated position determined by adding this offset to the current value of the Autonomous etalonnage index is loaded into the counter of a specific index, and the state LSRO loaded in LSAS specific pointer. After LCROSS and the counter is loaded, they effectively "jump" to a position very close to the selected table, with some inaccuracy due to the processing time required to perform these operations. Then PDB simultaneously reads the counter value PN generator and is offline reference counter to determine a new current shift. The current shift is subtracted from the desired shift. The difference determines the residual correction shift. Residual adjustment is performed on the summary sent to the control unit by summing PN generator, which causes the advance or the delay for the supply of the PN generator accurately to the desired shift.

The speed increases in proportion to the number of PSH States stored in the PDB. Time to summarize in any position (it should be noted that the previous state of the PN generator is not used) is determined by the total number of PSH States, divided by the number of States stored in the PDB, and multiplied by the speed of processing of the control unit by summing (if the provisions of stored States evenly spaced).

Pre the ha to the desired new shift directly on command to summarize, received in the control unit of tabulation. As the typical speed of deciding on comprise one element of the signal element signal to advance or delay the announcement at a great distance on PSH circle would take a long time. On average, the announcement would be half PSH circle. Because usually wrap can go in any direction by lead or lag, the average announcement is _ PSH circle, and therefore the corresponding average time sum will be equal to the number of States divided by the speed of deciding.

In this exemplary embodiment of the invention there are 215possible States. In PDB is stored 16 PSH States and the corresponding index values, which are evenly spaced on PSH circle (a distance of 2048 elements signal). This approximate PN generator can summarize with a speed of 7 elements signal for the time element signal when ahead or 1 element signal for the time element signal with the delay. The maximum time to summarize is the time of the 256 elements of the signal plus the time required for PDB to cause the jump. Any provision in any interval of 2048 elements is to them and advance with a speed of 7 elements of the signal element signal or jump in the nearest stored position behind him and delay at the rate of 1 element signal element signal. With the increase of stored States is twice the maximum interval sum is reduced to 1024 and is twice reduced the maximum time to summarize (not taking into account the insignificant processing time in the PDB).

This method can be used for various types of PN sequences. It is possible to provide the memory space in the PDB depending on the desired speed of deciding. The above-described exemplary embodiments LSRO, counter and control unit summarizing work well in this invention, however, the proposed method is not limited to this configuration. Any downloadable generator sequences associated with the control device announcement, can be configured in accordance with the present invention.

Brief description of drawings

Further essential features, objectives and advantages of the invention are explained detailed description of examples with reference to the accompanying drawings, which used the same reference designations and in which

Fig.1 depicts a block diagram of a cellular telephone system;

Fig.2 depicts a block diagram of the known PN generator;

Fig.3 depicts times illustrating a typical delay in PN generator;

Fig.5 depicts a block diagram in accordance with an exemplary variant of the invention; and

Fig.6 depicts a timing diagram illustrating a more rapid advance in the PN generator;

Fig.7 depicts the algorithm operations implementation of the present invention.

Detailed description of preferred embodiments of the invention

In Fig.5 shows a structural diagram according to the present invention. LSRO 520, the counter 530 and block 540 management summed to represent functions that are related to this invention, which will be used for PN formation in the index, the seeker, or a combination of pointer and seeker. For describing the present invention it is not necessary to describe fully the pointer or the finder. In the further description mentions only pointers, although experts in the art it will be clear that the described methods of forming the PN sequence and summing can be used for signs, and for seekers. In this example embodiment of the invention these elements are connected with PDB 500. For simplicity and without prejudice to the generalization shows only a single pointer, but in practice, for PDB 500 will be podsolized together with pointers and seekers to perform parts of their tasks. Although it is not mandatory, but if PDB is already connected to the directions, the present invention can be implemented with lower additional costs. PDB 500 is also connected to the counter 510. This counter does not specifically associated with any one index, and is used in connection with all the pointers. You only need one such counter regardless of the number of pointers.

After initialization of the demodulator used in this invention, by using the signal reset output signal LSRO 520, CROSSOSTOMA, consistent with the corresponding index value CROSSCUT contained in counter 530. Since, as noted above, different base stations are isolated from each other by individual shifts in the common PN sequence that is shared by all the devices performing communication in the system mdcr, it is important to-one correspondence between the signals CROSSOSTOMA and CROSSCUT. The same signal reset will return to the initial state, the counter 510, the output of which, SVOBODNYE will be used as a common reference. The signal reset ispolzuetsa management announcement.

The counter 510 will serve as a time standard. Its output signal, SVOBODNYY, scores among the number of States in this PN sequence (215in this example) with a speed of one state over the period of the element signal. It should be noted that this counter is not used, the enable signal, as it works offline.

The signal SVOBODNYY not have to be precisely aligned with any particular counter PN sequences in the system. Enough to SVOBODNYY updated at a rate of one time per element signal and therefore kept constant offset relative to the system as a whole. After establishing a connection with any base station, the base station may inform the subscriber apparatus, a specific shift used it in establishing its PN sequence. Based on this information you can calculate the difference between the signal SVOBODNYY and valid PSH phase system and to introduce it as a constant factor in any future calculations of shifts. SVOBODNYIE served in PDB 500 for use in such calculations.

LSRO 520 generates an output signal CROSSOSTOMA on the basis of which it is possible to generate P IS LCRAS: one for channel I and one for channel Q. However, this is not a mandatory requirement for the implementation of the present invention. LSAS will be ahead of one state in the PN sequence once during each clock cycle in which activated LSRAEL. Accordingly, since CROSSCUT serves as an index for signal CROSSOSTOMA, it will be updated to reflect the current signal CROSSOSTOMA. LSASL formed by the block 540 management of deciding. In steady state LCROSS will be entered once for each element of the signal, as described above. LSASL you can enter with a higher speed to perform the summation by advance, or can be suspended to perform a summing delay. Block 540 management summarizing forms LSASL in accordance with the signal COMANDATE issued to him PDB 500. COMANDATE will indicate to the control unit by summing whether it should implement the advance or delay, and number of signal elements. In Fig.5 CROSSCUT depicted fed to block 540 management announcement. In some embodiments of the control devices summing is the current index LSRS. However, this does not t the specific execution control unit summation. The only requirement is that PDB 500 can output the signal COMANDATE unit 540 controls the connection and then introduced a corresponding shift in CROSSOSTOMA and the corresponding index CROSSCUT.

In Fig.6 depicts a timing diagram faster by summing ahead than described in the well-known analogue. As in the description relating to Fig.3 and 4, BS and BSZ represent the index of the PN sequence used two different base stations in communication with the subscriber unit, the index of the PN sequence which is shown by LSRO. It should be noted that the BSF has shift on the five elements relative to BS. Clock frequency control LSRO six times higher than the speed of signal elements. (This example is provided for demonstration, in the described embodiment of the invention uses a clock frequency that is eight times higher than the rate of signal elements, and according to IS-95 base station spaced at a multiple of 64 elements of the signal). Originally LSRO agreed with BS. He carries out ahead in the sequence once per element signal, as shown when you enter LSRAEL. With this configuration, part of LSRAEL, designated as "ahead of the 5 elements". Here LCROSS is entered for the entire period of the element signal. State LSRO persived once per clock cycle. In the absence of deciding LSAS will be updated once per period of the element signal, and in this case it is updated six times. Thus, LSRO made ahead of five shifts and now agreed with BS. Usually LSRO synchronized in speed of signal elements, multiplied by some integer N, can advance with a speed of N-1 elements of the signal over the period of the element signal. In this exemplary implementation of the invention possible lead on seven elements of the signal over the period of the element signal. Lag also performed with the speed of one element of the signal over the period of the element signal, as described in connection with Fig.(4) above. These numbers serve only to illustrate this example. The features of the invention do not depend on whether the block 540 is running by summing over slow or quick summary in response to the signal COMANDATE from PDB 500, although the maximum speed of deciding in any position PSH of the circle will depend on these numbers.

LSRO 520 is also connected to the PDB 500 to load n on the counter 530 to load values, CROSSCUT’, in counter 530. It should be noted that the output signal of the counter 530, CROSSCUT, which is the index value CROSSOSTOMA, is also entered in PDB 500. CROSSOSTOMA not required for PDB 500, because its position is contained in the signal CROSSCUT, and measures are taken to ensure proper coordination of signals CROSSOSTOMA and CROSSCUT. In the known counters and LSAS described above, the download is not required. Quite simply returning to its original state, which they agree, and the summing is performed by the control unit wrap-like block 540 management announcement, which can adjust their shifts at any arbitrary position. However, as noted above, summing up at any arbitrary position PSH circle may take a considerable amount of time.

Configuration PDB 500, LSRO 520, counter 530 and unit 540 controls the tabulation shown in Fig.5, does not preclude the use of the above described known sum at the rate of one element signal element signal. However, due to the use of the boot flag LSRO 520 and counter 530 together with the counter 510 and some additional operations, VIPA see the essence of the invention. In Fig.7 shows the algorithm to perform operations for performing quick summing up. These operations are described in detail below.

The procedure begins at block 700 reset to negotiate signals CROSSOSTOMA and CROSSCUT and installation of signal SVOBODNYY to its original value. It does not matter are consistent SVOBODNYY and CROSSCUT after initialization. It should be remembered that in this exemplary embodiment of the invention is a set of pointers, and the following operations can be performed with any of a number of available pointers. For simplicity, in the description of the following operations all references refer to the pointer, which is the purpose of deciding.

In block 710, the decision to move the pointer to any shift, denoted as SHIFT. This shift is calculated based on the local shear defined by the signal SVOBODNYY. There are a number of reasons for deciding pointer. May be the situation when the subscriber unit is attempting to capture a signal, that is, at the moment is not in communication with the base station. As a result of searching throughout PSH circle or part returned some possible shifts among kotoryu the counter and signal SVOBODNYY. The difference determines the SHIFT'. Perhaps mobile subscriber unit communicates with the base station, which gives the position of the shift to neighboring base stations. In this case, the base station may provide an offset of the entire system, which can be aligned or not aligned with the signal SVOBODNYY, as described above. The right shift can be calculated by comparing the systematic shift of the base station and comparing it with the difference between signals SVOBODNYY and CROSSCUT pointer that communicates with the base station. For the purposes of the present description, the OFFSET is calculated relative to the time standard subscriber apparatus contained in the signal SVOBODNYY.

In block 720 reads the value of signal SVOBODNYY. The FREE ACCOUNT is the output signal of the counter 510, which stores the reference index, loop through the total number of PSH States (215in this exemplary embodiment). Since the counter is updated once per period of the element signal, and the period element of the signal are known, the output signal of the counter can also be used as a time standard. For PDB 500 must be secured position. Details RealMedia, and on the width of the bus, through which he communicates. In circumstances when you want to perform multiple reads to transmit all bits of the signal SVOBODNYY in PDB, specialists in the art will know many ways to solve this problem without an accompanying change in the signal SVOBODNYY destroying data. One way is to capture the value in a register that is not updated until, until the end of the reading. This allows you to seamlessly continue SVOBODNYY, as required by the invention. The fact that this fixation may be slightly out of date when it will be available in the PDB 500, does not matter.

In block 730 PDB 500 calculates the estimated desired position, Z, which, being loaded into the counter 530, will cause it to shift, denoted as SHIFT, on the basis of the signal SVOBODNYY:Z=SVOBODNYY+SHIFT.

Then in block 740 PDB 500 calculates the position of the nearest jump, Z’. This provision should jump to select from a table of values stored in memory PDB. The table will contain the index values to be loaded into counter 530 and the corresponding state LSAS for download in LSRO 520. After loading these values LSRO effectively summing up, which is performed by block 540 management announcement, so here we use a different term.

Usually it is advisable to choose such provisions jumps, which will provide the shortest time, the maximum sum that corresponds to the choice of the positions equally spaced around PSH circle. You can select other provisions jumps, at the same time, the maximum sum will depend on the greatest distances to PSH the circle between the stored jump. For certain distributions of valid shifts of base stations in the system, this type of explode, although it increases the maximum sum that can reduce the average time to summarize. You can include a huge variety of species diversity, which fall under the scope of the invention.

Another factor is the trade-off between storage requirements in memory and speed of deciding. As will be clear from the following operations, if you keep in memory all the States, then wrap in any position can be a really instant. Storing only two States will reduce the maximum time of the lock twice. Storing four States will reduce the time to summarize in 4 times and so on, As noted above, this is the cops signal PSH circle, consisting of 215the signal elements.

To determine the closest optimum position of the jump you need to know the speed of deciding on by lead and lag unit 540 controls the tabulation. If, for example, the speed of deciding either by timing or by lag is one element of the signal in the time element of the signal Z’ can be calculated simply by rounding to the nearest position jump. You can then issue a command to summarize by lag, if Z<Z’, and by timing, if Z>Z’. (Operation command to summarize will be described below with reference to block 790). If in an alternative example, the speed of advance is higher than the speed lag, simple rounding will not be optimal. Using this approximate version LSRS can make the announcement ahead 1792 element signal for the amount of time that would be required to summarize by lag on the 256 elements of the signal. Therefore, it is necessary to find Z’ to Z - 1792<Z’<Z+256. In this case, you can reach any position in the interval 2048 way forward from a position jump on the 7 elements of the signal over the period of the element signal or lag position with ernative, which, although not optimal, but it is easier to compute. Just need to find the nearest position of the jump, which is less than Z, and move it in Z, since the advance is the quickest method of deciding. In this case, Z’=Z-Z mod N, where N is the total number of signal elements, divided by the number of provisions of the jump (assuming uniform spacing). In this exemplary embodiment, N=215/16=2048. Specialists in the art will understand that any of these procedures, locate the position of the jump, you can easily take in PDB 500; the equation shown in block 740, serves as an example only.

In block 750 PDB 500 finds in the status table LSRO, S’, which corresponds to the value of the index determined by the position of the jump Z’:S’= (Z’), where the State represents the state table containing status LSRO, labeled with the index position of the jump.

In block 760 PDB 500 enters the S’ signal CROSSOSTOMA’ and Z’ in CROSSCUT’ and simultaneously loads them in LSRO 520 and counter 530 by inputting the signal LCROSS. Problems recording signals CROSSOSTOMA and CROSSCUT on the bus, having a smaller width in bits than SVOBODNYY similar to the problems associated with cityukraine counter and LSRO, while loading in the different parts of the Bank. Another alternative is to download the Bank register, and then download counter 530 and LSRO 520. The implementation details are irrelevant - all that is required is that after the load operation completes signals CROSSOSTOMA and CROSSCUT were correctly aligned. It should be remembered that CROSSCUT is the only index that identifies the sequence numbers of the States through which cycles CROSSOSTOMA. It is mandatory that CROSSCUT was accurate reference signal CROSSOSTOMA. This requirement is easy to meet any specialist in this field of technology.

Now let us proceed to block 770. PDB 500 simultaneously reads CROSSCUT and SVOBODNYY. PDB 500 will use these values to determine the current shift following the perfect jump. It is important that these two values of the output signal of the counter are read simultaneously. Typical through the implementation of this task is to load these two values in registers in one clock cycle, then the PDB 500 will be able to perform as many reads as you need to load all the values.

In block 780 PDB 500 calculates the residual p is equal to the absolute Z position minus the short position jump Z’. It represents the value of deciding not performed during the jump. In addition, some time was spent PDB 500 to perform the above described operations. During this time SVOBODNYY moved forward by a certain amount, which was not included in the original calculation of z In the above description of block 740 discussed residual sum on the basis of different procedures for the selection of the position of the jump. Although these calculated values of the residual sum useful for planning purposes, they are not necessary to perform operations of the present invention. The signal VELICIRAPTOR calculated with the new reading of the shift between the signals CROSSCUT and SVOBODNYY, contains all the information required to complete the sum to the desired shift marked the SHIFT.

Another minor optimization in order to minimize the time of deciding can be done by calculating the average number of signal elements, which moves SVOBODNYY until PDB handles leap, and adding this number to calculate z For most podvedeny it will not have any effect, since the block 540 management summarizing wipolo jump, which will reduce the time of the maximum sum.

Finally, in block 790 PDB 500 outputs a signal COMANDATE in block 540 management summing up to sum LSRO 520 and counter 530 on the value contained in the signal VELICIRAPTOR. COMANDATE will specify whether to run ahead or lag and how much of the signal elements. After block 540 management announcement completes the task initiated by the signal COMANDATE, PN sequence generated through CROSSOSTOMA will contain the exact shift, determined in block 710.

Thus, there is described a method and apparatus for generation of pseudorandom noise sequences with fast results. This description will enable any person skilled in the art to make or use the invention. For specialists in the art will be apparent various modifications of the embodiments of the invention, and its General principles can be applied to create other options without the use of creative effort. Therefore, the present invention is not limited to the illustrated specific options, and has the widest scope, the corresponding goluzinoi noise (PN) sequence with a quick summing up, containing a digital signal processor (PDB) uploaded linear shift register with feedback (LSAS) for the formation of the PSH state and receive a startup values from PDB loaded counter indexes to ensure the index States LTROS and receive a startup values from the PDB, a managed control unit for summing the correction of the speed change state in the downloadable LTROS and respectively loaded in the counter indexes in response to commands from the PDB, the reference counter for the issuance of a standard state in the PDB, and the state table for storing a subset of the PSH state and the corresponding values of the indexes to be able to search for PDB.

2. Generator PN sequence with a quick announcement on p. 1, characterized in that the quick summary to the desired shift is performed PDB through the following operations: (a) specify the boot value from a state table for simultaneous downloads in the download LTROS and loadable counter indexes based on a reference state and the desired shift, (b) simultaneously load boot-values, (C) determine the magnitude of the residual sum from the received position and the desired shift, d) give the team managed the residual sum.

3. Execution method of forming a pseudo-random noise (PN) sequence with fast results, namely, that (a) find the value of the index and the corresponding state of the PN generator in the state table based on the desired shift value of a reference state, (b) simultaneously load the VS generator mentioned the state of the PN generator and the value of the index, (C) perform any desired residual summary based on the current readings of the values of the reference condition and the index values of the PN generator.

4. The manner of forming the pseudo-random noise (PN) sequence with a quick announcement, namely that a) determine the desired shift, (b) read the reference condition, (C) calculate the estimated absolute position of the state by summing the desired shift from the reference condition, (d) find the nearest value of the index contained in the state table, e) retrieve the state of a linear shift register with feedback (LSRO), corresponding to the closest value of the index, from a state table, f) simultaneously load the nearest value of the index counter index and status LSRS in LTROS, g) at the same time read the texts by summing the difference with updated reference state and the desired offset and subtracting from this sum the current index, and (i) give a command to the control unit wrap-run residual announcement.

 

Same patents:

The invention relates to telecommunications, and more specifically to synchronization of the transceivers of different users, to synchronize, based on the orthogonal sequences with optimized correlation properties

The invention relates to a synchronization method scrambling code in the communication system mdcr

The invention relates to a structure of a communication channel for communication systems

The invention relates to the field of radio and can be used in the receiving device, for example, in the communication system with code division multiplexing

The invention relates to broadband communication systems based on spread spectrum via a direct pseudo-random sequence and can be used, in particular, in satellite communication systems or terrestrial communication systems with multiple access based on code division channels

The invention relates to data transmission in the communication system, multiple access, code-division multiplexing, in particular to the transmission and reception of data with high speed transmission

The invention relates to the provision of reliable data transfer

The invention relates to the field of radio communications

The invention relates to a wireless communication system

The invention relates to the field of railway transport

The invention relates to digital data transmission

The invention relates to a mobile communication system to transmit information over the channel, the pilot signal

The invention relates to a data transmission method in a mobile communication system

The invention relates to a device and method for signal transmission of the control channel data rate (RDM) in the mobile communication system using the method of high speed data transmission (autonomic neuropathy), and, in particular, to a device and method for Gating or repetition of the signal transmission channel RDM

FIELD: radio communications.

SUBSTANCE: proposed method intended for single-ended radio communications between mobile objects whose routes have common initial center involves radio communications with aid of low-power intermediate transceiving stations equipped with non-directional antennas and dropped from mobile object, these intermediate transceiving drop stations being produced in advance on mentioned mobile objects and destroyed upon completion of radio communications. Proposed radio communication system is characterized in reduced space requirement which enhances its effectiveness in joint functioning of several radio communication systems.

EFFECT: reduced mass and size of transceiver stations, enhanced noise immunity and electromagnetic safety of personnel.

1 cl, 7 dwg, 1 tbl

Up!