Recherche Images Maps Play YouTube Actualités Gmail Drive Plus »
Connexion
Les utilisateurs de lecteurs d'écran peuvent cliquer sur ce lien pour activer le mode d'accessibilité. Celui-ci propose les mêmes fonctionnalités principales, mais il est optimisé pour votre lecteur d'écran.

Brevets

  1. Recherche avancée dans les brevets
Numéro de publicationUS20080247443 A1
Type de publicationDemande
Numéro de demandeUS 12/141,822
Date de publication9 oct. 2008
Date de dépôt18 juin 2008
Date de priorité22 mars 2001
Autre référence de publicationUS7400668, US7620097, US8406281, US20040008640, US20090103594, US20090104930, US20100220706, WO2003067780A1
Numéro de publication12141822, 141822, US 2008/0247443 A1, US 2008/247443 A1, US 20080247443 A1, US 20080247443A1, US 2008247443 A1, US 2008247443A1, US-A1-20080247443, US-A1-2008247443, US2008/0247443A1, US2008/247443A1, US20080247443 A1, US20080247443A1, US2008247443 A1, US2008247443A1
InventeursGhobad Heidari, Kuor-Hsin Chang, Paul L. Master, Eugene B. Hogenauer, Walter James Scheuermann
Cessionnaire d'origineQst Holdings, Llc
Exporter la citationBiBTeX, EndNote, RefMan
Liens externes: USPTO, Cession USPTO, Espacenet
Method and system for implementing a system acquisition function for use with a communication device
US 20080247443 A1
Résumé
A system acquisition module and corresponding method for facilitating PN code searching which has a PN sequence generator configurable to generate a plurality of PN sequences. The module and method also includes computational units configurable to correlate each received signal sample of a plurality of received signal samples with a corresponding PN sequence of the plurality of PN sequences, and further configurable to provide other hardware resources. A number of computational units from the plurality of computational units are selectively configured to correlate the received signal samples with the PN sequences—the number depending upon availability of the plurality of computational units from providing the other hardware resources. In another embodiment, a communication device having a system acquisition function is provided which includes the system acquisition module and a receiver configured to receive signals, where a plurality of configurable computational units are selectively configurable to implement the PN sequence generator.
Images(7)
Previous page
Next page
Revendications(58)
1. A system for implementing a system acquisition function to facilitate PN code searching, comprising:
a PN sequence generator configured to generate a plurality of PN sequences; and
a plurality of computational units configurable to correlate a received signal sample with a PN sequence generated by the PN sequence generator, the correlation being executed in a parallel manner;
wherein a number of computational units from the plurality of computational units are selectively configured to correlate the received signal sample with the PN sequence, the number of computational units which are selectively configured to correlate the received signal with the PN sequence depends on availability of the plurality of computational units.
2. The system according to claim 1 wherein the plurality of PN sequences are generated in a sequential manner;
wherein the plurality of PN sequences includes a first PN sequence and a second PN sequence, the second PN sequence immediately following the first PN sequence; and
wherein the start of the second PN sequence is determined by shifting the first PN sequence.
3. The system according to claim 1 wherein the PN sequence has M components; and
wherein the number of computational units selectively configured to correlate the received signal sample with the PN sequence is M or smaller.
4. The system according to claim 3 wherein the number of computational units selectively configured to correlate the received signal sample with the PN sequence is capable of being reduced if a clock rate driving the plurality of computational units is increased.
5. The system according to claim 3 wherein the number of computational units selectively configured to correlate the received signal with the PN sequence is capable of being reduced if the availability of the plurality of computational units is reduced.
6. The system according to claim 1 wherein the received signal sample is correlated with the PN sequence as soon as the received signal sample is received.
7. The system according to claim 6 wherein after correlating the received signal sample with the PN sequence, the received signal sample is discarded.
8. The system according to claim 1 wherein one or more of the plurality of computational units are configurable to implement another function when the PN code searching is not needed.
9. The system according to claim 1 wherein the system acquisition function is performed by a communication device.
10. The system according to claim 9 wherein the communication device is a mobile phone for use in a CDMA communication system.
11. A system acquisition module for facilitating PN code searching, comprising:
a PN sequence generator configured to generate a plurality of PN sequences; and
a plurality of computational units configurable to correlate a plurality of received signal samples with the plurality of PN sequences;
wherein each of the plurality of received signal samples is correlated with a corresponding one of the plurality of PN sequences; and
wherein a number of computational units from the plurality of computational units are selectively configured to correlate the plurality of received signal samples with the plurality of PN sequences, the number of computational units which are selectively configured to correlate the plurality of received signal samples with the plurality of PN sequences depends on availability of the plurality of computational units.
12. The system acquisition module according to claim 11 wherein the plurality of received signal samples is received in a sequential manner;
wherein the plurality of PN sequences is generated in a sequential order and starting positions of any two adjacent PN sequences are offset by a chip.
13. The system acquisition module according to claim 12 wherein the plurality of PN sequences includes a first PN sequence and a second PN sequence, the second PN sequence immediately following the first PN sequence; and
wherein the start of the second PN sequence is determined by shifting the first PN sequence.
14. The system acquisition module according to claim 12 wherein each of the plurality of received signal samples is correlated with the corresponding one of the plurality of PN sequences as soon as each of the plurality of received signal samples is received.
15. The system acquisition module according to claim 14 wherein after correlating a received signal sample with a corresponding PN sequence, the received signal sample is discarded.
16. The system acquisition module according to claim 11 wherein each of the plurality of PN sequences has M components; and
wherein the number of computational units selectively configured to correlate the plurality of received signal samples with the plurality of PN sequences is M.
17. The system acquisition module according to claim 11 wherein the number of computational units which are selectively configured to correlate the plurality of received signal samples with the plurality of PN sequences is capable of being reduced if a clock rate driving the plurality of computational units is increased.
18. The system acquisition module according to claim 11 wherein the number of computational units which are selectively configured to correlate the plurality of received signal samples with the plurality of PN sequences is capable of being reduced if the availability of the plurality of computational units is reduced.
19. The system acquisition module according to claim 11 wherein one or more of the plurality of computational units are configurable to implement another function when the PN code searching is not needed.
20. The system acquisition module according to claim 11 wherein the system acquisition module is located in a communication device.
21. The system acquisition module according to claim 20 wherein the communication device is a mobile phone for use in a CDMA communication system.
22. A communication device having a system acquisition function, comprising:
a receiver configured to receive a plurality of signal samples;
a PN sequence generator configured to generate a plurality of PN sequences, the PN sequence generator being implemented by selectively using one or more of a first plurality of configurable computational units; and
a correlator configured to correlate the plurality of signal samples with the plurality of PN sequences, the correlator being implemented by selectively using one or more of a second plurality of configurable computational units, the number of configurable computational units to be selectively used to implement the correlator depending on availability of the second plurality of configurable computational units.
23. The communication device according to claim 22 wherein the plurality of signal samples is received in a sequential manner;
wherein the plurality of PN sequences is generated in a sequential order; and
wherein each of the plurality of signal samples is correlated with a corresponding one of the plurality of PN sequences.
24. The communication device according to claim 23 wherein the plurality of PN sequences includes a first PN sequence and a second PN sequence, the second PN sequence immediately following the first PN sequence; and
wherein the start of the second PN sequence is determined by shifting the first PN sequence.
25. The communication device according to claim 23 wherein each of the plurality of signal samples is correlated with the corresponding one of the plurality of PN sequences as soon as each of the plurality of signal samples is received.
26. The communication device according to claim 25 wherein after correlating a signal sample with a corresponding PN sequence, the signal sample is discarded.
27. The communication device according to claim 22 wherein each of the plurality of PN sequences has M components; and
wherein the number of configurable computational units to be selectively used to implement the correlator to correlate the plurality of signal samples with the plurality of PN sequences is M.
28. The communication device according to claim 22 wherein the number of configurable computational units which are to be selectively used to implement the correlator to correlate the plurality of signal samples with the plurality of PN sequences is capable of being reduced if a clock rate driving the second plurality of configurable computational units is increased.
29. The communication device according to claim 22 wherein the number of configurable computational units which are to be selectively used to implement the correlator to correlate the plurality of signal samples with the plurality of PN sequences is capable of being reduced if the availability of the second plurality of configurable computational units is reduced.
30. The communication device according to claim 22 wherein one or more of the second plurality of configurable computational units are configurable to implement another function when the system acquisition function is not needed.
31. The communication device according to claim 22 wherein the communication device is a mobile phone for use in a CDMA communication system.
32. A communication device having a system acquisition function, comprising:
a receiver configured to receive a plurality of signals;
a PN sequence generator configured to generate a plurality of PN sequences, the PN sequence generator being implemented by selectively using one or more of a plurality of configurable computational units; and
a correlator configured to correlate the plurality of signals with the plurality of PN sequences, the correlator being implemented by selectively using one or more of the plurality of configurable computational units;
wherein the number of configurable computational units to be selectively used to implement the correlator depend on availability of the plurality of configurable computational units.
33. The communication device according to claim 32 wherein the plurality of signals is received in a sequential manner;
wherein the plurality of PN sequences is generated in a sequential order; and
wherein each of the plurality of signals is correlated with a corresponding one of the plurality of PN sequences.
34. The communication device according to claim 33 wherein the plurality of PN sequences includes a first PN sequence and a second PN sequence, the second PN sequence immediately following the first PN sequence; and
wherein the start of the second PN sequence is determined by shifting the first PN sequence.
35. The communication device according to claim 32 wherein each of the plurality of signals is correlated with the corresponding one of the plurality of PN sequences as soon as each of the plurality of signals is received.
36. The communication device according to claim 35 wherein after correlating a signal with a corresponding PN sequence, the signal is discarded.
37. The communication device according to claim 32 wherein each of the plurality of PN sequences has M components; and
wherein the number of configurable computational units to be selectively used to implement the correlator to correlate the plurality of signals with the plurality of PN sequences is M or smaller.
38. The communication device according to claim 32 wherein the number of configurable computational units which are to be selectively used to implement the correlator to correlate the plurality of signals with the plurality of PN sequences is capable of being reduced if a clock rate driving the plurality of configurable computational units is increased.
39. The communication device according to claim 32 wherein the number of configurable computational units which are to be selectively used to implement the correlator to correlate the plurality of signals with the plurality of PN sequences is capable of being reduced if the availability of the plurality of configurable computational units is reduced.
40. The communication device according to claim 32 wherein one or more of the plurality of configurable computational units are configurable to implement another function when the system acquisition function is not needed.
41. The communication device according to claim 32 wherein the communication device is a mobile phone for use in a CDMA communication system.
42. A system for implementing a system acquisition function to facilitate PN code searching, comprising:
a PN sequence generator configured to generate a plurality of PN codes, one or more PN codes making up a PN sequence; and
a plurality of computational units configurable to correlate a plurality of received signals with a plurality of PN sequences;
wherein a number of computational units from the plurality of computational units are selectively configured to correlate the plurality of received signals;
wherein for each received signal, each configured computational unit correlates the received signal with a corresponding PN code of a first PN sequence and stores a correlation result, all the configured computational units perform their respective correlations upon receiving the received signal and in a parallel manner.
43. The system of claim 42 wherein after each received signal is correlated, a second PN sequence is generated by shifting the first PN sequence and adding an additional PN code; and
wherein upon receiving a next received signal, each configured computational unit correlates the next received signal with a corresponding PN code of the second PN sequence and accumulates a correlation result with the correlation result from the previously correlated received signal.
44. The system of claim 42 wherein the number of configured computational units is scalable.
45. The system of claim 42 wherein the number of configured computational units is capable of being reduced if performance of the plurality of computational units is increased.
46. The system of claim 42 wherein after each received signal is correlated, the received signal is discarded.
47. A method for implementing a system acquisition function to facilitate PN code searching, comprising:
maintaining a plurality of configurable computational units;
receiving a plurality of signals;
configuring one or more of the plurality of configurable computational units to implement a PN sequence generator to generate a plurality of PN sequences;
configuring one or more of the plurality of configurable computational units to implement a correlator to correlate the plurality of signals with the plurality of PN sequences; and
correlating each one of the plurality of signals with a corresponding one of the plurality of PN sequences at the time when each one of the plurality of signals is received;
wherein the number of configurable computational units used to implement the correlator depends on availability of the plurality of configurable computational units.
48. The method of claim 47 further comprising:
generating the plurality of PN sequences in a sequential manner, wherein the plurality of PN sequences include a first PN sequence and second PN sequence, the second PN sequence immediately following the first PN sequence, and wherein the start of the second PN sequence is determined by shifting the first PN sequence.
49. The method of claim 47 wherein the number of configurable computational units used to implement the correlator is capable of being reduced if a clock rate driving the plurality of configurable computational units is increased.
50. The method of claim 47 wherein the number of configurable computational units used to implement the correlator is capable of being reduced if the availability of the plurality of configurable computational units is reduced.
51. The method of claim 47 wherein one or more of the plurality of configurable computational units are configurable to implement another function when the system acquisition function is not needed.
52. A communication device utilizing the method of claim 47.
53. The method of claim 52 wherein the communication device is a mobile phone for use in a CDMA communication system.
54. A method for implementing a system acquisition function to facilitate PN code searching, comprising:
generating a first PN sequence, the first PN sequence being made up of a plurality of PN codes;
receiving a first signal;
correlating the first signal with the first PN sequence upon receiving the first signal;
storing a correlation result from the correlation between the first signal and the first PN sequence;
generating a second PN sequence by shifting the first PN sequence and adding an additional PN code;
receiving a second signal;
correlating the second signal with the second PN sequence;
accumulating a correlation result from the correlation between the second signal and the second PN sequence with the correlation result from the correlation between the first signal and the first PN sequence; and
repeating the above generating, receiving, correlating and accumulating steps with each received signal and each newly generated PN sequence.
55. The method of claim 54 wherein the generating step further comprises:
configuring one or more of a plurality of configurable computational units to implement the generation function; and
wherein the correlating step further comprises:
configuring one or more of the plurality of configurable computational units to implement the correlation function, the number of configurable computational units to be configured to implement the correlation function depends on the availability of the plurality of configurable computational units.
56. The method of claim 55 wherein the number of configurable computational units to be configured to implement the correlation function is capable of being reduced if a clock rate driving the plurality of configurable computational units is increased.
57. The method of claim 55 wherein the number of configurable computational units to be configured to implement the correlation function is capable of being reduced if the availability of the plurality of configurable computational units is reduced.
58. The method of claim 55 wherein one or more of the plurality of configurable computational units are configurable to implement another function when the system acquisition function is not needed.
Description
    CROSS-REFERENCES TO RELATED APPLICATION(S)
  • [0001]
    This application is a continuation of U.S. patent application Ser. No. 10/067,496, filed Feb. 4, 2002, which is a continuation-in-part application of U.S. patent application Ser. No. 09/815,122, filed on Mar. 22, 2001, now U.S. Pat. No. 6,836,839, issued Dec. 28, 2004, the disclosures of each of the aforementioned applications are hereby incorporated by reference in their entirety as if set forth in full herein for all purposes.
  • BACKGROUND OF THE INVENTION
  • [0002]
    The present invention generally relates to a system acquisition function. More specifically, the present invention relates to a method and system for implementing a system acquisition function for use with a communication device.
  • [0003]
    In CDMA communication systems, each base station differentiates amongst one another by using an unique PN code. A communication device, such as a mobile phone, is equipped with a system acquisition function, typically embodied in a searcher, to search for and locate the PN codes of the base stations within the vicinity of the mobile phone. Upon power-on, one of the initial tasks of the mobile phone is to find the strongest pilot signal from the nearby base stations as soon as possible. The task of finding the strongest pilot signal is commonly known as system or pilot acquisition and is usually performed by a searcher within the mobile phone.
  • [0004]
    Under one conventional approach, the system acquisition function within the mobile phone is implemented in the form of the searcher using a serial search technique that only utilizes a set of complex correlators to search for the correlation peak from one PN code offset to another. This approach consumes less power and requires less hardware; however, the search for the correlation peak may take longer.
  • [0005]
    Under another conventional approach, the searcher within the mobile phone is implemented using a traditional parallel search technique that utilizes several sets of fixed, dedicated correlators to compute the correlation peak in a concurrent manner. This other approach may shorten the search time but it does so at cost of incurring more hardware and power consumption. Furthermore, since the acquisition mode is typically less active than other modes, the exclusive use of fixed, dedicated correlators often results in a waste of hardware resources within the mobile phone.
  • [0006]
    More specifically, system or pilot acquisition in a CDMA communication system is typically performed as follows. Each base station continually broadcasts its own unique PN code in a periodic manner. One PN code from one base station differs from another PN code from another base station by an offset. Before a PN code can be identified by the mobile phone, the mobile phone first searches for signals at a particular frequency. As a result, only signals from base stations transmitting at that particular frequency are received by the mobile phone.
  • [0007]
    Next, the PN code of the base station which transmits the strongest pilot signal is identified and synchronized. The mobile phone receives signals from different base stations and these received signals are added up. Typically, the received signals are stored by the mobile phone before the correlation process begins. The mobile phone has a local PN sequence generator which is capable of generating sequences of PN codes. Initially, before the PN code of the base station which transmits the strongest pilot signal is identified, the PN sequence generator generates an initial PN code. This initial PN code is correlated with the received signals by a correlator residing in the mobile phone. Correlation is done to determine the power level of the received signals. The correlation results are examined to determine if the received signals representing the PN code of the transmitting base station fall within an acceptable time delay from the initial PN code to qualify as the strongest pilot signal. If the correlation results are below a predetermined threshold, i.e., the initial PN code generated by the local PN sequence generator does not qualify as the strongest pilot signal, then the local PN sequence generator shifts by one chip to generate another PN code and this other PN code is correlated with the received signals. The generation of PN codes and the correlation of these codes with the received signals continue until the strongest pilot signal is identified.
  • [0008]
    When the strongest pilot signal is identified, the PN code generated by the PN sequence generator and used to identify the strongest pilot signal is synchronized with the PN code of the base station which transmits the strongest pilot signal. Once the synchronization of the PN code is achieved, the mobile phone is able to communicate with the base station.
  • [0009]
    Furthermore, after pilot acquisition is completed, the mobile phone continues searching for nearby strong pilot signals and maintains a list to keep track of such signals. This process is commonly called set maintenance. That is, in addition to the strongest pilot signal, the mobile phone also searches for and keeps track of a number of additional pilot signals (and their associated PN codes) with different levels of signal strength. For example, the mobile phone may maintain an active set which keeps track of additional multipaths associated with the pilot signal of the base station that the mobile phone is currently communicating with, a candidate set with pilot signals whose strengths exceed certain threshold, and a neighbor set that includes pilot signals from cells that are in the vicinity of the cells that the mobile phone is communicating with. Maintaining a number of additional pilot signals (and their associated PN codes) facilitates the handoff process. A handoff typically occurs when a mobile phone is roaming from one area to another. This happens when a pilot signal transmitted from another base station is stronger than the one that the mobile phone is currently communicating with. The candidate set may be used to more efficiently identify the new base station transmitting the strongest pilot signal. This is because the strongest pilot signal is more likely to be one of the signals included in the candidate set. Hence, the associated PN code can be retrieved more quickly and communication with the new base station likewise can be established in a shorter period of time.
  • [0010]
    As can be seen above, the received signals need to be stored by the mobile phone so they can be subsequently used for correlation purposes. Furthermore, generation of the PN codes by the PN sequence generator is done in a sequential manner by shifting the current PN code.
  • [0011]
    Hence, it would be desirable to provide a method and system to implement a searcher for use with a mobile phone to more efficiently identify the PN code of the base station which transmits the strongest pilot signal.
  • SUMMARY OF THE INVENTION
  • [0012]
    A method and system for implementing a system acquisition function for use with a communication device is provided. According to one exemplary embodiment of the system, the system acquisition function is embodied in a searcher. The searcher is embedded in the communication device, such as, a mobile phone. The searcher includes one or more computational units which are used to perform a PN sequence generation function to generate PN sequences. Each PN sequence is comprised of a number of PN chips. The searcher further includes a number of computational units which are used to correlate received signal samples with the PN chips generated by the PN sequence generation function. As each signal sample is received by the communication device, the received signal sample is correlated (complex multiplied) with a PN sequence in a parallel manner using the computational units. The sample correlation results are then respectively accumulated within each computational unit that conducts the corresponding sample correlation. As the next signal sample is received, this newly received signal sample is similarly correlated with the next PN sequence in a parallel manner. Likewise, the sample correlation results are also accumulated. The foregoing process is repeated until all the signal samples needed to complete a signal correlation are received and correlated with the PN sequences. The number of PN chips within a PN sequence used to correlate with each received signal sample is equivalent to a correlation length chosen such that the correlation results between each received signal sample and the locally generated PN sequence are sufficiently reliable to determine whether the strongest pilot is found.
  • [0013]
    According to another aspect of the system, the computational units are implemented using adaptive hardware resources. The number of computational units which are used to implement the PN sequence generation function and the correlation function are adjustable depending on, for example, the amount of available adaptive hardware resources.
  • [0014]
    Reference to the remaining portions of the specification, including the drawings and claims, will realize other features and advantages of the present invention. Further features and advantages of the present invention, as well as the structure and operation of various embodiments of the present invention, are described in detail below with respect to accompanying drawings, like reference numbers indicate identical or functionally similar elements.
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • [0015]
    FIG. 1 is a simplified diagram illustrating an exemplary embodiment of an M-node having four (4) computational units in accordance with the present invention;
  • [0016]
    FIG. 2 is a simplified diagram illustrating an exemplary method for performing correlations in accordance with the present invention;
  • [0017]
    FIG. 3 is a simplified diagram illustrating the exemplary method as shown in FIG. 2 for performing an additional round of correlations in accordance with the present invention;
  • [0018]
    FIG. 4 is a simplified diagram illustrating a second exemplary method for performing correlations in accordance with the present invention;
  • [0019]
    FIG. 5 is a simplified diagram illustrating a third exemplary method for performing correlations in accordance with the present invention;
  • [0020]
    FIG. 6 is a block diagram illustrating an exemplary system embodiment in accordance with the present invention;
  • [0021]
    FIG. 7 is a flow diagram illustrating a first exemplary method embodiment in accordance with the present invention; and
  • [0022]
    FIG. 8 is a flow diagram illustrating a second exemplary method embodiment in accordance with the present invention.
  • DETAILED DESCRIPTION OF THE INVENTION
  • [0023]
    The present invention in the form of one or more exemplary embodiments will now be described. FIG. 1 is a simplified diagram illustrating an exemplary embodiment of the present invention. Referring to FIG. 1, there is shown a searcher 10 having a number of computational units 12 a-m. The searcher 10 can be located in any type of communication device, such as a mobile phone. As will be further demonstrated below, each computational unit 12 a-m correlates the received signal samples with a corresponding PN code. In an exemplary embodiment, these computational units 12 a-m are implemented using reconfigurable hardware resources within an adaptive computing architecture. Details relating to the adaptive computing architecture and how reconfigurable hardware resources are used to implement functions on an on-demand basis are disclosed in U.S. Pat. No. 6,836,839, issued Dec. 28, 2004, the disclosure of which is hereby incorporated by reference in their entirety as if set forth in full herein for all purposes. It should be understood that while the present invention is described as being in the searcher 10, it will be appreciated by a person of ordinary skill in the art that the present invention can be implemented in other manners within a communication device. For example, some or all of the functionality of the present invention as described herein may be implemented outside of the searcher 10 in other parts of the communication device.
  • [0024]
    In an exemplary embodiment, the computational units 12 a-m are arranged in a sequential order and configured to calculate the correlations between the received signal samples and a number of PN sequences. The start of any two adjacent PN sequences is offset by one chip. More specifically, the computational units 12 a-m correlate each received signal sample with their corresponding components of a PN sequence in a parallel manner.
  • [0025]
    The PN sequences used by the computational units 12 a-m are generated in a successive, offset order. The starting position of each successive PN sequence is only one chip off from the preceding PN sequence. The PN chips of each PN sequence can be provided to the computational units 12 a-m in a number of ways. For example, the PN chips can be generated by either a PN sequence generator implemented in the form of another computational unit (not shown) or a RISC processor. As will be described further below, each PN chip is shifted into a corresponding computational unit 12 a-m. Each computational unit 12 a-m includes a local memory for storing its corresponding PN chip.
  • [0026]
    FIG. 2 illustrates an exemplary method for performing correlations in accordance with the present invention. Assume the time duration of a received signal sample is Td, that is, one signal sample is received every Td. Then, conversely, the frequency of the received signal sample is 1/Td=fd.
  • [0027]
    Referring to FIG. 2, there are m computational units 20 a-m within the searcher 10. At time to, signal sample R0 is received by a receiver (not shown) located within the communication device. Signal sample R0 is then correlated with the PN sequence, P0P1 . . . PM−1. The PN sequence, P0P1. . . PM−1, is generated by a PN sequence generator (as shown in FIG. 6) located within the communication device. Since there are M PN chips within the PN sequence, M computational units 20 a-m are used to do the correlations in parallel. Hence, each computational unit 20 a-m correlates the signal sample R0 with one PN chip. For example, computational unit 20 a correlates R0 with P0 to generate correlation result R0P0. The collective correlation results generated by the computational units 20 a-m are as follows: R0P0, R0P1, . . . , R0PM−1. The correlations are performed and the correlation results are respectively accumulated into the computational units 20 a-m before the next signal sample R1 is received at time t1. The signal sample R0 may then be discarded after the correlations are performed.
  • [0028]
    At time t1, signal sample R1 is received. Signal sample R1 is then correlated with a second PN sequence, P1P2 . . . PM. The PN sequence, P1P2 . . . PM, is only a shift of the PN sequence used at time t0 plus a newly generated PN chip PM. That is, the start of the new PN sequence is offset by one chip from the preceding PN sequence. Consequently, the new PN sequence can be supplied to or propagated through the computational units 20 a-m as follows. Except for the last computational unit 20 m, each computational unit 20 a-1 receives its corresponding PN chip for the next correlation from its neighbor. The last computational unit 20 m receives its corresponding PN chip PM from the PN sequence generator. In other words, except for the first computational unit 20 a, each remaining computational unit 20 b-m passes its current PN chip to its neighbor in the same direction. As to the first computational unit 20 a, its current PN chip is discarded; and as to the last computational unit 20 m, as mentioned above, the PN sequence generator provides the next PN chip. For example, after the correlations are completed for the received signal sample R0 (which is some time before time t1), computational unit 20 a discards its current PN chip P0 and receives its next PN chip (which will be P1) from computational unit 20 b; computational unit 20 m passes its current PN chip PM−1 to its neighboring computational unit 201 (not shown) and receives its next PN chip PM from the PN sequence generator; and the remaining computational units 20 b-1 pass their current PN chips respectively to their neighbors in one direction and receive their next PN chips respectively from their neighbors in the other direction.
  • [0029]
    Again, since there are M PN codes within a PN sequence, M computational units 20 a-m are used to do the correlations in parallel. This time around, the collective correlation results generated by the computational units 20 a-m are as follows: R1P1R1P2, . . . ,R1PM. The correlations are performed and the results are accumulated with the correlation results that were done at time t0 before the next signal sample R2 is received at time t2. Hence, for example, before time t2, computational unit 20 a contains correlation results R0P0 and R1P1. The foregoing process is repeated until the last signal sample Rn−1 is received at time tn−1 and then correlated with the PN sequence, Pn−1Pn . . . PM+n−2 generating the following collective correlation results: Rn−1Pn−1, Rn−1Pn, . . . ,Rn−1PM+n−2.
  • [0030]
    At the end of the time period, tn−1+Td, the correlation results for the received signal samples, R0R1 . . . Rn−1, with n different PN sequences that are offset by one chip between the start of any two adjacent PN sequences, are then obtained. For example, R0P0+R1P1+. . . +Rn−1Pn−l represent the correlation results accumulated at computational unit 20 a. Also, at the end of the time period, tn−1+Td, M different PN code offsets have been searched. If the number of PN codes that need to be searched is M or fewer, then the entire search process is completed at the end of the time period tn−1+Td.
  • [0031]
    If the number of PN codes that need to be searched is more than M, then a second round of search or correlations (or additional rounds if necessary) may be performed. The length (time-wise) of a round of correlations is the time period tn−1+Td. For example, FIG. 3 illustrates this second round of correlations. Before the second round of correlations begins, the accumulated correlation results in each of the computational unit 20 a-m are transferred and stored in other memory locations and then cleared. Referring to FIG. 3, in the second round of correlations, the received signal sample Rn is correlated by the computational units 20 a-m with the PN sequence, Pn+MPn+M+1 . . . Pn+2M−1 at time tn. The correlation results are then accumulated at each of the computational unit 20-a-m.
  • [0032]
    At time tn+1, the signal sample Rn+1 is correlated with the next PN sequence, Pn+M+1Pn+M+2 . . . Pn+2M. Similarly, the start of this next PN sequence is offset from the preceding PN sequence by one chip and a new PN chip is added at the end. This process will continue until the second round of correlations is completed. For the second round of real-time correlations, another M PN offsets (PM, PM+1, . . . ,P2M+1) are searched. The correlation results are then stored and cleared from each computational unit 20 a-m before the next round of correlations starts.
  • [0033]
    According to the exemplary method shown in FIG. 2, all the received signal samples Rx are not stored first and then later used for correlation purposes. Instead, as each signal sample Rx is received, the signal sample Rx is correlated with M PN codes and then accumulated. The collective correlation results for all the received signal samples Rx are then examined to identify the PN sequence which corresponds to the strongest pilot signal. Hence, the collective correlation results for the received signal samples Rx can be derived much faster. In addition, since all the received signal samples Rx need not be stored before the correlation function is performed, the memory overhead and hardware requirements and costs correspondingly become less.
  • [0034]
    As can be seen from FIG. 2, for each time period Td, M computational units 20 a-m are used to correlate a received signal sample Rx with a PN sequence which has M PN codes. For each time period Td, each computational unit 20 a-m performs one correlation. As a result, with M computational units 20 a-m, M correlations are collectively performed. As will be further described below, the number of computational units 20 a-m which are used to perform the correlations is scalable. That is, the number of computational units 20 a-m may vary depending on the amount of hardware resources available and the clock rate that is used to drive each computational unit.
  • [0035]
    Referring back to FIG. 2, for each time period Td and a PN sequence with M PN codes, each computational unit performs one correlation thereby resulting in M correlations being performed. However, each computational unit is not necessarily restricted to performing one correlation during each time period Td.
  • [0036]
    Each computational unit may perform two or more correlations per time period Td. While M correlations are to be performed per time period Td, these M correlations may be collectively performed by a fewer number of computational units. For example, referring to FIG. 4, there are M/2 computational units. In this case, each of the M/2 computational units is driven to perform two (2) correlations within the time period Td; for instance, computational unit 30 a performs two (2) correlations and generates correlation results R0P0 and R0P1. In order to perform two (2) correlations with the time period Td, each computational unit is driven at a higher clock rate to increase the speed of execution.
  • [0037]
    In another example, as shown in FIG. 5, there are M/4 computational units. In this case, each of the M/4 computational units is driven to perform four (4) correlations within the time period Td; for instance, computational unit 40 a performs four (4) correlations and generates correlation results R0P0, R0P1, R0P2 and R0P3. In order to perform four (4) correlations with the time period Td, each computational unit is driven at an even higher clock rate to increase the speed of execution.
  • [0038]
    FIG. 6 is a block diagram illustrating an exemplary system 100 embodiment in accordance with the present invention. As illustrated, an exemplary system 100, for implementing a system acquisition function to facilitate PN code searching, comprises: a PN sequence generator 110 configured to generate a plurality of PN sequences; and a searcher 10 having a plurality of computational units 20 a-20 m forming a correlator 130 and configurable to correlate a received signal sample (from receiver 120) with a PN sequence generated by the PN sequence generator, the correlations being executed in a parallel manner. As discussed above, the plurality of PN sequences are generated in a sequential manner; the plurality of PN sequences includes a first PN sequence and a second PN sequence, the second PN sequence immediately following the first PN sequence; and the start of the second PN sequence is determined by shifting the first PN sequence. In addition, a number of computational units from the plurality of computational units are selectively configured to correlate the received signal sample with the PN sequence, with the number of computational units which are selectively configured to correlate the received signal with the PN sequence depending on availability of the plurality of computational units.
  • [0039]
    FIG. 7 is a flow diagram illustrating a first exemplary method embodiment for implementing a system acquisition function to facilitate the PN code searching in accordance with the present invention. The first exemplary method begins with generating a first PN sequence, the first PN sequence being made up of a plurality of PN chips, step 205, and receiving a first signal sample, step 210. The first signal sample is correlated with the first PN sequence upon receiving the first signal sample, step 215, and a correlation result from the correlation between the first signal sample and the first PN sequence is stored, step 220. A second PN sequence is generated by shifting the first PN sequence and adding an additional PN chip, step 225, and a second signal sample is received, step 230. The second signal sample is correlated with the second PN sequence, step 235, and the methodology accumulates a correlation result from the correlation between the second signal sample and the second PN sequence with the correlation result from the correlation between the first signal sample and the first PN sequence, step 240. The method then repeats the above generating, receiving, correlating and accumulating steps with each received signal and each newly generated PN sequence, step 245.
  • [0040]
    FIG. 8 is a flow diagram illustrating a second exemplary method embodiment for implementing a system acquisition function to facilitate PN code searching in accordance with the present invention. The second exemplary method begins with maintaining a plurality of configurable computational units, step 305, and receiving a plurality of signal samples, step 310. One or more of the plurality of configurable computational units are configured to implement a PN sequence generator to generate a plurality of PN sequences, step 315. One or more of the plurality of configurable computational units are configured to implement a correlator to correlate the plurality of signal samples with the plurality of PN sequences, step 320. Each one of the plurality of signal samples is correlated with a corresponding one of the plurality of PN sequences at the time when each one of the plurality of signal samples is received, step 325. As discussed above, the number of configurable computational units used to implement the correlator depends on availability of the plurality of configurable computational units. In addition, the method may also provide for generating the plurality of PN sequences in a sequential manner, wherein the plurality of PN sequences includes a first PN sequence and second PN sequence, the second PN sequence immediately following the first PN sequence, and wherein the start of the second PN sequence is determined by shifting the first PN sequence.
  • [0041]
    Based on the disclosure provided herein, a person of ordinary skill in the art should be able to determine the appropriate number of computational units to be used to implement the PN sequence generation function and the correlation function in accordance with the present invention. The number of computational units which can be used depends on a number of factors, such as the availability of the configurable hardware resources, the incoming signal rate or, conversely, the signal period, and the available clock rates, etc. For instance, if only a limited number of computational units can be used, then the clock rate may need to be driven higher in order to perform the requisite number of correlations. Conversely, if additional hardware resources are available, additional computational units driven at a lower clock rate may be implemented to perform the same number of correlations. For another instance, if the signal period is shortened, then additional computational units may be needed to perform the requisite number of correlations within the signal period.
  • [0042]
    The present invention as described above can also be used to provide more efficient set maintenance. Signals from the base station which previously transmitted the strongest pilot signal can be searched and correlated more quickly to confirm that this base station continues to be the one transmitting the strongest pilot signal. Likewise, signals from the base stations which correspond to the candidate set and the neighbor set respectively can also be searched and correlated more quickly to update the status of the neighbor set and the neighbor set. A candidate set may be searched more frequently than a neighbor set. As a result, the set maintenance update cycle is reduced.
  • [0043]
    Moreover, while the above disclosure provided above is described in connection with a searcher 10, it should be understood that the present invention is not restricted to use with a searcher and that the present invention is applicable to and can be used with any communication devices which are capable of performing a system acquisition function.
  • [0044]
    It is understood that the present invention as described above is applicable to a CDMA communication system but that a person of ordinary skill in the art should know of other ways and/or methods to apply the present invention to other types of communication systems.
  • [0045]
    Furthermore, it is to be understood that the present invention as described above can be implemented in the form of control logic using software, hardware or a combination of both. Based on the disclosure provided herein, a person of ordinary skill in the art will know of other ways and/or methods to implement the present invention.
  • [0046]
    It is further understood that the examples and embodiments described herein are for illustrative purposes only and that various modifications or changes in light thereof will be suggested to persons skilled in the art and are to be included within the spirit and purview of this application and scope of the appended claims. All publications, patents, and patent applications cited herein are hereby incorporated by reference for all purposes in their entirety.
Citations de brevets
Brevet cité Date de dépôt Date de publication Déposant Titre
US3938639 *28 nov. 197317 févr. 1976The Cornelius CompanyPortable dispenser for mixed beverages
US4076145 *9 août 197628 févr. 1978The Cornelius CompanyMethod and apparatus for dispensing a beverage
US4146793 *12 avr. 197627 mars 1979Siemens AgX-ray devices using epoxy resins strengthened with carbonic fibrous material
US4181242 *30 mai 19781 janv. 1980The Cornelius CompanyMethod and apparatus for dispensing a beverage
US4252253 *21 févr. 197824 févr. 1981Mcneil CorporationDrink dispenser having central control of plural dispensing stations
US4377246 *11 mai 198122 mars 1983The Cornelius CompanyApparatus for dispensing a carbonated beverage
US4577782 *2 mai 198325 mars 1986The Cornelius CompanyBeverage dispensing station
US4578799 *5 oct. 198325 mars 1986Codenoll Technology CorporationMethod and apparatus for recovering data and clock information from a self-clocking data stream
US4719056 *21 juin 198512 janv. 1988Isoworth LimitedFluid treatment
US4726494 *29 déc. 198623 févr. 1988Isoworth LimitedBeverage dipensing apparatus
US4800492 *13 mai 198724 janv. 1989The Coca-Cola CompanyData logger for a post-mix beverage dispensing system
US4811214 *14 nov. 19867 mars 1989Princeton UniversityMultinode reconfigurable pipeline computer
US4901887 *8 août 198820 févr. 1990Burton John WBeverage dispensing system
US4905231 *3 mai 198827 févr. 1990American Telephone And Telegraph Company, At&T Bell LaboratoriesMulti-media virtual circuit
US4982876 *8 août 19888 janv. 1991Isoworth LimitedCarbonation apparatus
US4993604 *28 août 198619 févr. 1991The Coca-Cola CompanyLow-cost post-mix beverage dispenser and syrup supply system therefor
US5090015 *6 févr. 198918 févr. 1992Motorola, Inc.Programmable array logic self-checking system
US5099418 *14 juin 199024 mars 1992Hughes Aircraft CompanyDistributed data driven process
US5176002 *10 avr. 19915 janv. 1993Process Systems International, Inc.Method of controlling vapor loss from containers of volatile chemicals
US5177700 *24 déc. 19875 janv. 1993Ant Nachrichtentechnik GmbhNon-recursive half-band filter
US5190189 *30 oct. 19902 mars 1993Imi Cornelius Inc.Low height beverage dispensing apparatus
US5193151 *30 août 19899 mars 1993Digital Equipment CorporationDelay-based congestion avoidance in computer networks
US5193718 *25 juin 199116 mars 1993Imi Cornelius Inc.Quick electronic disconnect for a beverage dispensing valve
US5280711 *25 févr. 199325 janv. 1994Imi Cornelius Inc.Low cost beverage dispensing apparatus
US5297400 *17 févr. 199329 mars 1994Maytag CorporationLiquid dispensing assembly for a refrigerator
US5379343 *26 févr. 19933 janv. 1995Motorola, Inc.Detection of unauthorized use of software applications in communication units
US5381546 *11 mars 199310 janv. 1995Gte Laboratories IncorporatedControl process for allocating services in communications systems
US5381550 *10 janv. 199410 janv. 1995Thinking Machines CorporationSystem and method for compiling a source code supporting data parallel variables
US5388062 *6 mai 19937 févr. 1995Thomson Consumer Electronics, Inc.Reconfigurable programmable digital filter architecture useful in communication receiver
US5388212 *13 août 19937 févr. 1995Motorola Inc.Detecting unauthorized modification of communication unit based on comparison between stored hardware identification code and hardware identification code generated from operational platform identification code
US5392960 *13 nov. 199228 févr. 1995Wilshire PartnersPostmix beverage dispenser and a method for making a beverage dispenser
US5490165 *28 oct. 19936 févr. 1996Qualcomm IncorporatedDemodulation element assignment in a system capable of receiving multiple signals
US5491823 *25 janv. 199413 févr. 1996Silicon Graphics, Inc.Loop scheduler
US5594657 *7 juin 199514 janv. 1997Lucent Technologies Inc.System for synthesizing field programmable gate array implementations from high level circuit descriptions
US5600810 *9 déc. 19944 févr. 1997Mitsubishi Electric Information Technology Center America, Inc.Scaleable very long instruction word processor with parallelism matching
US5600844 *5 avr. 19934 févr. 1997Shaw; Venson M.Single chip integrated circuit system architecture for document installation set computing
US5602833 *19 déc. 199411 févr. 1997Qualcomm IncorporatedMethod and apparatus for using Walsh shift keying in a spread spectrum communication system
US5603043 *3 avr. 199511 févr. 1997Giga Operations CorporationSystem for compiling algorithmic language source code for implementation in programmable hardware
US5607083 *21 mai 19934 mars 1997Imi Cornelius Inc.Beverage dispensing valve
US5608643 *1 sept. 19944 mars 1997General Programming Holdings, Inc.System for managing multiple dispensing units and method of operation
US5611867 *12 avr. 199518 mars 1997Maytag CorporationMethod of selecting a wash cycle for an appliance
US5706191 *23 mai 19976 janv. 1998Gas Research InstituteAppliance interface apparatus and automated residence management system
US5706976 *21 déc. 199513 janv. 1998Purkey; Jay FloydVending machine inventory control device
US5712996 *1 mars 199427 janv. 1998Siemens AktiengesellschaftProcess for dividing instructions of a computer program into instruction groups for parallel processing
US5720002 *17 avr. 199517 févr. 1998Motorola Inc.Neural network and method of using same
US5721693 *3 janv. 199624 févr. 1998Lg Electronics Inc.Electric home appliance real use state information collection and analysis apparatus
US5721854 *27 août 199624 févr. 1998International Business Machines CorporationMethod and apparatus for dynamic conversion of computer instructions
US5729754 *17 mai 199517 mars 1998Estes; Mark D.Associative network method and apparatus
US5732563 *23 mai 199431 mars 1998Imi Cornelius Inc.Electronically controlled beverage dispenser
US5734808 *28 sept. 199431 mars 1998Namco Ltd.Pipeline processing device, clipping processing device, three-dimensional simulator device and pipeline processing method
US5860021 *24 avr. 199712 janv. 1999Klingman; Edwin E.Single chip microcontroller having down-loadable memory organization supporting "shadow" personality, optimized for bi-directional data transfers over a communication channel
US5862961 *14 oct. 199726 janv. 1999Imi Cornelius Inc.Connection device for dispensing fluid from a bottle
US5870427 *1 juin 19959 févr. 1999Qualcomm IncorporatedMethod for multi-mode handoff using preliminary time alignment of a mobile station operating in analog mode
US5873045 *29 oct. 199716 févr. 1999International Business Machines CorporationMobile client computer with radio frequency transceiver
US5881106 *30 août 19959 mars 1999Sgs-Thomson Microelectronics S.A.Signal processing circuit to implement a Viterbi algorithm
US5884284 *6 août 199716 mars 1999Continental Cablevision, Inc.Telecommunication user account management system and method
US5886537 *5 mai 199723 mars 1999Macias; Nicholas J.Self-reconfigurable parallel processor made from regularly-connected self-dual code/data processing cells
US5887174 *18 juin 199623 mars 1999International Business Machines CorporationSystem, method, and program product for instruction scheduling in the presence of hardware lookahead accomplished by the rescheduling of idle slots
US5889816 *2 févr. 199630 mars 1999Lucent Technologies, Inc.Wireless adapter architecture for mobile computing
US5889989 *16 sept. 199630 mars 1999The Research Foundation Of State University Of New YorkLoad sharing controller for optimizing monetary cost
US5890014 *5 août 199630 mars 1999Micronet Technology, Inc.System for transparently identifying and matching an input/output profile to optimal input/output device parameters
US6016395 *18 oct. 199618 janv. 2000Samsung Electronics Co., Ltd.Programming a vector processor and parallel programming of an asymmetric dual multiprocessor comprised of a vector processor and a risc processor
US6021186 *14 nov. 19971 févr. 2000Ricoh Company Ltd.Automatic capture and processing of facsimile transmissions
US6021492 *9 oct. 19961 févr. 2000Hewlett-Packard CompanySoftware metering management of remote computing devices
US6023742 *18 juil. 19978 févr. 2000University Of WashingtonReconfigurable computing architecture for providing pipelined data paths
US6023755 *22 juil. 19988 févr. 2000Virtual Computer CorporationComputer with programmable arrays which are reconfigurable in response to instructions to be executed
US6028610 *9 mars 199822 févr. 2000Sun Microsystems, Inc.Geometry instructions for decompression of three-dimensional graphics data
US6036166 *25 sept. 199814 mars 2000Imi Cornelius Inc.Chamber valve
US6173389 *4 déc. 19989 janv. 2001Billions Of Operations Per Second, Inc.Methods and apparatus for dynamic very long instruction word sub-instruction selection for execution time parallelism in an indirect very long instruction word processor
US6175854 *11 juin 199616 janv. 2001Ameritech Services, Inc.Computer system architecture and method for multi-user, real-time applications
US6175892 *19 juin 199816 janv. 2001Hitachi America. Ltd.Registers and methods for accessing registers for use in a single instruction multiple data system
US6181981 *15 mai 199630 janv. 2001Marconi Communications LimitedApparatus and method for improved vending machine inventory maintenance
US6185418 *7 nov. 19976 févr. 2001Lucent Technologies Inc.Adaptive digital radio communication system
US6192070 *2 janv. 199820 févr. 2001Mitsubishi Electric Research Laboratories, Inc.Universal modem for digital video, audio and data communications
US6192255 *15 déc. 199220 févr. 2001Texas Instruments IncorporatedCommunication system and methods for enhanced information transfer
US6192388 *20 juin 199620 févr. 2001Avid Technology, Inc.Detecting available computers to participate in computationally complex distributed processing problem
US6195788 *9 oct. 199827 févr. 2001Altera CorporationMapping heterogeneous logic elements in a programmable logic device
US6346824 *27 juil. 200012 févr. 2002Xilinx, Inc.Dedicated function fabric for use in field programmable gate arrays
US6347346 *30 juin 199912 févr. 2002Chameleon Systems, Inc.Local memory unit system with global access for use on reconfigurable chips
US6349248 *28 déc. 199919 févr. 2002General Electric CompanyMethod and system for predicting failures in a power resistive grid of a vehicle
US6349394 *31 mars 199919 févr. 2002International Business Machines CorporationPerformance monitoring in a NUMA computer
US6507947 *20 août 199914 janv. 2003Hewlett-Packard CompanyProgrammatic synthesis of processor element arrays
US6510138 *25 févr. 199921 janv. 2003Fairchild Semiconductor CorporationNetwork switch with head of line input buffer queue clearing
US6510510 *22 déc. 199821 janv. 2003Analog Devices, Inc.Digital signal processor having distributed register file
US6526570 *24 avr. 200025 févr. 2003Sun Microsystems, Inc.File portability techniques
US6675265 *11 juin 20016 janv. 2004Hewlett-Packard Development Company, L.P.Multiprocessor cache coherence system and method in which processor nodes and input/output nodes are equal participants
US6675284 *20 août 19996 janv. 2004Stmicroelectronics LimitedIntegrated circuit with multiple processing cores
US6691148 *24 déc. 199810 févr. 2004Verizon Corporate Services Group Inc.Framework for providing quality of service requirements in a distributed object-oriented computer system
US6694380 *27 déc. 199917 févr. 2004Intel CorporationMapping requests from a processing unit that uses memory-mapped input-output space
US6854002 *16 mai 20038 févr. 2005Stmicroelectronics NvEfficient interpolator for high speed timing recovery
US6859434 *1 oct. 200222 févr. 2005Comsys Communication & Signal Processing Ltd.Data transfer scheme in a communications system incorporating multiple processing elements
US6986142 *14 sept. 200010 janv. 2006Texas Instruments IncorporatedMicrophone/speaker system with context switching in processor
US20030023649 *25 sept. 200230 janv. 2003Yamaha CorporationDigital filtering method and device and sound image localizing device
US20040006584 *8 août 20018 janv. 2004Ivo VandeweerdArray of parallel programmable processing engines and deterministic method of operating the same
US20040010645 *21 mai 200315 janv. 2004Quicksilver Technology, Inc.Uniform interface for a functional node in an adaptive computing engine
US20040015970 *6 mars 200222 janv. 2004Scheuermann W. JamesMethod and system for data flow control of execution nodes of an adaptive computing engine (ACE)
US20040025159 *21 mai 20035 févr. 2004Quicksilver Technology, Inc.Hardware task manager
US20050044344 *21 août 200324 févr. 2005Quicksilver Technology, Inc.System, method and software for static and dynamic programming and configuration of an adaptive computing architecture
US20060031660 *30 sept. 20059 févr. 2006Master Paul LApparatus, method, system and executable module for configuration and operation of adaptive integrated circuitry having fixed, application specific computational elements
Référencé par
Brevet citant Date de dépôt Date de publication Déposant Titre
US977905114 oct. 20163 oct. 2017Jonathan GlickmanComputer system and a computer device
Classifications
Classification aux États-Unis375/150, 375/E01.002
Classification internationaleH04B1/707, G06F15/78
Classification coopérativeG06F15/7867, H04B1/708, H04B2201/70711
Classification européenneH04B1/708, G06F15/78R