EP2512039A1 - Verfahren und vorrichtung zur durchführung der chipkorrelation einer mehrpfadsuche - Google Patents

Verfahren und vorrichtung zur durchführung der chipkorrelation einer mehrpfadsuche Download PDF

Info

Publication number
EP2512039A1
EP2512039A1 EP10836962A EP10836962A EP2512039A1 EP 2512039 A1 EP2512039 A1 EP 2512039A1 EP 10836962 A EP10836962 A EP 10836962A EP 10836962 A EP10836962 A EP 10836962A EP 2512039 A1 EP2512039 A1 EP 2512039A1
Authority
EP
European Patent Office
Prior art keywords
chip
data
chip data
memory
correlation
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Withdrawn
Application number
EP10836962A
Other languages
English (en)
French (fr)
Other versions
EP2512039A4 (de
Inventor
Baling Wang
Yijun Shi
Liguo Feng
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Sanechips Technology Co Ltd
Original Assignee
ZTE Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by ZTE Corp filed Critical ZTE Corp
Publication of EP2512039A1 publication Critical patent/EP2512039A1/de
Publication of EP2512039A4 publication Critical patent/EP2512039A4/de
Withdrawn legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
    • H04B1/69—Spread spectrum techniques
    • H04B1/707—Spread spectrum techniques using direct sequence modulation
    • H04B1/709—Correlator structure
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
    • H04B1/69—Spread spectrum techniques
    • H04B1/707—Spread spectrum techniques using direct sequence modulation
    • H04B1/7097—Interference-related aspects
    • H04B1/711—Interference-related aspects the interference being multi-path interference
    • H04B1/7113—Determination of path profile

Definitions

  • the present invention relates to the communication field and, particularly, to a method and apparatus for implementing chip correlation for multi-path search.
  • each multi-path When carrying out the RAKE receiving, it first needs to carry out multi-path search via a searcher and then obtain the phase of each multi-path, then each multi-path can be demodulated respectively according to the multi-path phase, and finally merger is carried out thereon, so as to significantly improve the receiving effects.
  • the multi-path search of the base station is to carry out sliding correlation operation on the received antenna data flow and the local pseudo-noise (abbreviated as PN) code sequence with different phase offsets, and then to compare the accumulated result energy of each phase offset by a certain algorithm, thereby obtaining the phase information of the user data in the antenna data flow.
  • PN pseudo-noise
  • the present invention proposes a solution for implementing chip correlation for multi-path search, which is capable of significantly reducing the number of independent memories and the capacity of the memories and reducing the hardware complexity.
  • a method for implementing chip correlation for multi-path search is provided.
  • the method for implementing chip correlations for multi-path search comprises: writing a chip data into a memory array according to receiving time order of the chip data; reading the chip data, which correlation operation is needed to be carried out on within a current clock period, from the memory array according to a demand of the search; and grouping the chip data which is read out by a predetermined grouping manner and carrying out correlation operation on each chip group in the multiple chip groups obtained by the grouping and a pseudo-noise (PN) code sequence; wherein the chip data of each chip group in the multiple chip groups are multiple chip data which are received consecutively, the number of the chip data in each chip group is equal to each other, and the second chip data of each chip group is the first chip data in the next chip group according to the receiving time order of the chip data.
  • PN pseudo-noise
  • the step of writing a chip data into a memory array according to the receiving time order of the chip data comprises: as to each memory in multiple memories of the memory array, after a chip data is written into a storage location of the memory, writing next received chip data into a storage location in a next memory of the memory, wherein the relevant location of the storage location in the next memory is same as that of the storage location in the memory; and after a chip data is written into a storage location in the last memory of the multiple memories, taking the first memory in the multiple memories as a next memory of the last memory and writing next received chip data into a next storage location of the storage location the relevant location of which is the same in the first memory.
  • each memory in the multiple memories after the storage space of the memory is filled up, if a new chip data which needs to be stored in the memory is received continuously, then the chip data which is stored earliest in the memory is covered by the new chip data.
  • the step of reading the chip data which the correlation operation is needed to be carried out on within a current clock period comprises: reading the chip data which the correlation operation is needed to be carried out on within a current clock period from the memory array according to the order of the multiple memories and the order of the storage location in the each memory, wherein within each clock period, one data is read out from each memory in the multiple memories respectively.
  • the step of carrying out correlation operation on the each chip group and the PN code sequence comprises: carrying out complex multiplication on each chip data in the chip group and a corresponding PN code in the PN code sequence to obtain I path data and Q path data of a single-chip, and placing the adding 1 operation in the negating one number and adding 1 operation in the complex multiplication structure into an accumulation operation of a multi-chip; and carrying out multi-chip accumulation on the I path data, and taking the adding 1 operation in the single-chip complex multiplication as a carry bit of an adder in the multi-chip accumulation while carrying out the accumulation; and at the same time carrying out accumulation on the Q path data and taking the adding 1 operation in the single-chip complex multiplication as a carry bit of an adder in the multi-chip accumulation while carrying out the accumulation.
  • the method for implementing chip correlation can further comprises: in the case that it is determined according to the size of a search window that it is needed to continue to carry out chip correlation in the search window within the next clock period after correlation operation has been carried out on the each chip group and the PN code sequence , taking the next chip data of a designated chip data in the chip data which the correlation operation is carried out on within the current clock period as the first chip data of the first chip group which correlation operation is carried out on within the next clock period, wherein the designated chip data is the first chip data of the last chip group in the multiple chip groups.
  • an apparatus for implementing chip correlation for multi-path search is provided.
  • the apparatus for implementing chip correlation for multi-path search comprises: a write module, configured to write a chip data into a memory array according to a receiving time order of the chip data; a memory array, configured to store the chip data written by the write module; a read module, configured to read the chip data, which correlation operation is needed to be carried out on within a current clock period, from the memory array according to a demand of the search; and a correlation processing module, configured to group the chip data which is read out by a predetermined grouping manner and carrying out correlation operation on each chip group in the multiple chip groups obtained by the grouping and a PN code sequence; wherein the chip data of each chip group in the multiple chip groups are multiple chip data which are received consecutively, the number of the chip data in each chip group is equal to each other, and the second chip data of each chip group is the first chip data in the next chip group according to the receiving time order of the chip data.
  • the write module is configured to, as to each memory in multiple memories of the memory array, write next received chip data into a storage location in a next memory of the memory, after a chip data is written into a storage location of the memory, wherein the relevant location of the storage location in the next memory is same as that of the storage location in the memory; and after a chip data is written into a storage location in the last memory of the multiple memories, to take the first memory in the multiple memories as a next memory of the last memory and to write next received chip data into a next storage location of the storage location the relevant location of which is the same in the first memory.
  • the present invention by way of grouping the chip data which the correlation operation is needed to be carried out on within one clock period, a small amount of memories can be used to complete the correlation operation, thus the memory resources can be effectively saved, the costs and the hardware complexity can be reduced; moreover. Moreover, due to various grouping manners, the length of the search window can be configured flexibly and the flexibility of correlation operation can be improved. In addition, since the write, read (including reading on new line of the memories) and correlation operation are unrelated to each other in the above processing, the processing will not pause when a user handover occurs, thus the object of seamless handover can be achieved.
  • the present invention proposes a solution for implementing chip correlation for multi-path search, in which chip data are stored according to the receiving order of the chip, and the chip data which are related with the correlation operation carried out within one clock period are read out from a memory array and divided into multiple groups, then the correlation is carried out on a PN sequence with the chip group on which the correlation needs to be carried out within this period, so as to avoid the problem in relevant art that the costs of the chip are rather high when a large number of memories are used, which can effectively reduce the implementation complexity and difficulty of the hardware.
  • the width of each memory in the memory array is decided by the preciseness of the chip data, and the depth thereof is decided by factors such as the number of antennae of the RAKE receiver, the size of the search window, the size of the value K + L and so on.
  • the data correlation operation of 64 chips needs to be completed within each system clock, the data correlation of 64 chips can be divided into 8 groups in each of which there are 8-chips correlation (it can also be 4 groups in each of which there are 16-chips correlation or 2 groups in each of which there are 32-chips correlation).
  • the antenna data which are related with the correlation operation carried out within one clock period, are the antenna data of 15 chips, therefore the memory array needs to include 15 independent memories.
  • the independent memories can be increased from 15 independent memories to 16 independent memories, so as to ensure that the operation address meets an integral power of 2 for the subsequent writing and reading operations.
  • the memories in the memory array can be numbered sequentially as 0, 1, 2, ..., K + L - 1, and it is assumed that each memory stores the chip data of J chips, the storage locations of J chips are numbered as 0, 1, ..., J - 1 respectively; according to the current system timing, the received chip data are stored into the memories in the memory array sequentially, circularly and repeatedly.
  • the m-th chip data is written into the j-th chip location of the k-th memory, then the writing location of the received (m + 1)-th chip data is: (1) when k + 1 is less than K + L, it is written into the j-th chip location of the (k + 1)-th memory; (2) when k+1 is equal to K + L and j + 1 is less than J, it is written into the (j + 1)-th chip location of the 0-th memory; and (3) when k + 1 is equal to K + L and j + 1 is equal to J, it is written into the 0-th chip location of the 0-th memory.
  • the outputted chip data which are read out are: (1) the k-th to (K + L - 1)-th memories output the chip data of the j-th chip location of each memory; (2) when k is not equal to 0 and j + 1 is not equal to J, the 0-th to the (k-1)-th memories output the chip data of the (j+1)-th chip location of each memory; and (3) when k is not equal to 0 and j + 1 is equal to J, the 0-th to (k - 1)-th memories output the chip data of the 0-th chip location of each memory.
  • the storage locations of multiple memories in the memory array can be identified.
  • the lower numerals 0 to 15 are the serial numbers of 16 independent memories, assuming that the antenna data of 512 chips are stored in the memory array, then each memory needs to store the antenna data of 32 chips, therefore the storage locations of the 512 chips in the memory array can be identified using 0-511.
  • the first received chip data is stored into the storage location with the serial number 0 in the memory with the serial number 0
  • the second received chip data is stored into the first storage location in the memory with the serial number 1, i.e. the storage location with the serial number 1.
  • the next received chip data is stored into the second storage location in the memory with the serial number 0, i.e. the storage location with the serial number 16, and so on.
  • the next chip data is stored into the storage location with the serial number 0 of the memory with the serial 0 to overlap the previously stored chip data, and then the next round of storage is carried out.
  • the chip data stored in the memory array are the latest chip data, and during subsequent reading, it needs to sequentially read multiple chip data according to the location of the chip data which currently needs to be read out in the memory array. For example, in the memory array structure shown in Fig. 3 , assuming that the reading is from the storage location 1, 16 chip data are read out. In this way, the stored chip data will be read out sequentially from the read storage locations 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, and 16.
  • the method for implementing chip correlation for multi-path search comprises:
  • step S106 taking that 64-times chip rate is used as the system clock and the data correlation operation of 64 chips needs to be completed within each system clock as an example, the data correlation of 64 chips can be divided into 8 groups in each of which there are 8-chips correlation; as shown in Fig. 2 , the number of chips related with the correlation operation carried out each time is 15. It is assumed that the chip correlation is carried out from storage location 0.
  • the first group of correlated chip data are chip data stored in storage locations 0 to 7
  • the second group of correlated chip data are chip data stored in storage locations 1 to 8
  • the third group of correlated chip data are chip data stored in storage locations 2 to 9
  • the fourth group of correlated chip data are chip data stored in storage locations 3 to 10
  • the fifth group of correlated chip data are chip data stored in storage locations 4 to 11
  • the sixth group of correlated chip data are chip data stored in storage locations 5 to 12
  • the seventh group of correlated chip data are chip data stored in storage locations 6 to 13
  • the eighth group of correlated chip data are chip data stored in storage locations 7 to 14 (here, the length of the search window in 8, and if the grouping mode is changed to be four groups in each of which there are sixteen chips, then the length of the search window is changed to be 16).
  • Fig. 2 It can be seen from Fig. 2 that by virtue of the above processing, a small number of memories can be used to complete correlation operation by way of grouping the chip data on which the correlation operation needs to be carried out within one clock period, thus the memory resources can be effectively saved, the costs and the hardware complexity can be reduced. Moreover, due to various grouping modes, the length of the search window can be configured flexibly and the flexibility of correlation operation can be improved. In addition, since the writing, reading (including linefeed reading of the memories) and correlation operation are unrelated to each other in the above processing, the processing will not pause when a user handover occurs, thus the object of seamless handover can be achieved.
  • the chip data related with the correlation operation within one clock period will be read out simultaneously and sent into 8 correlation devices which are used for carrying out correlation operation simultaneously, and these 8 correlation devices carry out correlation operation in parallel and output the result.
  • the next chip data of a designated chip data of the chip data on which the correlation operation is carried out within the current clock period is used as the first chip data of the first chip group on which the correlation operation is carried out within the next clock period, wherein the designated chip data is the first chip data of the last chip group in multiple chip groups.
  • the chip data, stored in the locations from 0 to 7, of the chip data related to the correlation operation and stored in the location from 0 to 14 are the initial chip data of these 8 chip groups.
  • the correlation operation is carried out during the next period, since the correlation operation has been carried out on the chip data stored in the locations from 0 to 7, it needs to carry out the correlation operation within the next clock period on 15 chip data (i.e. the chip data stored in the storage locations from 8 to 22) starting from the next chip data of the chip data stored in the last storage location 7.
  • the shift rotation can be carried out on the output of the multiple memories by an operation of choosing one from more than one with one-level in this embodiment.
  • the cyclic shift can be carried out on the output of the multiple memories by an operation of choosing one from more than one with two-levels.
  • Fig. 4 shows the process of carrying out cyclic shift on the output of four memories by an operation of choosing 1 from 2 with two-levels.
  • an operation module 1 of choosing one from more than one in the figure can select data 0 or 1 as the output of the first level
  • an operation module 3 of choosing one from more than one can select data 1 or 2 as the output
  • an operation module 5 of choosing one from more than one can select data 2 or 3 as the output
  • an operation module 2 of choosing one from more than one can select the output data of the operation module 5 of choosing one from more than one or the operation module 1 of choosing one from more than one, that is to say, data 0' can be any one of data 0 to 3 which are initially inputted, so as to achieve the purpose of complete rotation.
  • data 1', 2', and 3' can also be the data after the complete rotation.
  • each multi-chooser how to select the inputted data can be indicated by a bit signal.
  • the operation modules 1 and 2 of choosing one from more than one they can be indicated by two bits, for example, they can be indicated by "01", wherein the first bit "0" indicates the operation module 1 of choosing one from more than one to select data 0 at left side as the input, the second bit "1" indicates the operation module 2 of choosing one from more than one to select the output of the operation module 5 of choosing one from more than one at right side as the input, correspondingly, if the one from more operation modules 1 and 2 select according to the indication of "01 ", then correspondingly, as to the one from more operation modules 3 and 4, one from more operation modules 5 and 6, one from more operation modules 7 and 8 also carry out indication via "01", so that the finally outputted data 0', 1', 2', and 3' are data after the cyclic shift.
  • the correlation operation when carried out on the chip data, it needs to carry out complex correlation on the PN code with the antenna data (chip data) outputted by the data rotation module.
  • a complex multiplication apparatus shown in Fig. 5 can be used, wherein it needs to carry out +1 (adding 1) operation on dat_i and dat_q respectively and finally output dat_i2 and dat_q2.
  • the output result needs the +1 operation. Therefore, the +1 operation in Fig. 5 preferably can be shifted to be performed after the selector so as to obtain the transformation form shown in Fig. 6 .
  • the adder tree of the multi-chips and the complex multiplier can be combined to obtain an implementation manner of the correlation of the data of multi-chips with the PN code.
  • the 8-chips data correlation of data correlation method which uses this manner is as shown in Fig. 7 , wherein this method shifts the +1 operation in the negating one number and +1 operation which needs to be carried out during complex multiplication into the adder tree for the multi-chips accumulation as a carry signal of the adder in the adder tree.
  • the structure based on Fig. 5 can be improved.
  • the complex multiplication is carried out on each chip data in the chip group with a corresponding PN code in the PN code sequence to obtain I path data and Q path data of a single chip, and the adding 1 operation in the negating one number and adding 1 operation in the complex multiplication structure is placed in the accumulation operation of the multi-chips; and then the accumulation of the multi-chips is carried out on the I path data, and the adding 1 operation in the single-chip complex multiplication is taken as a carry of an adder in the multi-chips accumulation while carrying out the accumulation; and at the same time the accumulation of the multi-chips is carried out on the Q path data, and the adding 1 operation in the single-chip complex multiplication is taken as a carry of the adder in the multi-chips accumulation while carrying out the accumulation.
  • the structure configuration of the memory array is as follows: since it needs to complete the data correlation for 64 chips within each clock, here the data correlation of 64 chips is divided into 8 groups in which each of there are 8-chips correlation, and thus as shown in Fig. 2 , the antenna data required are the antenna data of 15 chips. Therefore, the antenna data memory array needs 15 independent memories. Taking the implementation requirements into account, it can be changed from the 15 independent memories to 16 independent memories. Assuming that the antenna data of 512 chips are stored in the antenna memory array, then each memory needs to store the antenna data of 32 chips, and the location in the memory array of these 512 chips are identified with number 0-511, as shown in Fig. 3 . When the system supports multi-antenna data stream, each chip in the 512 chips in Fig.
  • each chip in Fig. 3 can store one chip data in multi-antenna data, i.e., performing the storage firstly according to the chip, the chip data of different antenna are differentiated in each chip; and each chip in Fig. 3 can store the chip data from the same antenna, i.e., performing the differentiation and storage according to the antenna, and chips are then differentiated in each antenna.
  • the antenna data input from the front end is written into the antenna data memory array according to the system time.
  • the memory array writing control can generate the writing address of the memory array according to the system timing, wherein the writing address is the same for each memory in the memory array, a writing enabling is used to differentiate which memory in the memory array they are written into; then a writing enabling signal of each memory in the memory array is generated according to the system timing, and the antenna data are written into a corresponding address unit of the memory the writing enabling input of which is effective.
  • the writing control method for the memory array is as follows: the writing control method is designed according to a system timing counter (GlbCnt) and the structure of the memory array.
  • the memory array stores the antenna data of 512 chips, i.e. antenna data of 2 symbols, the antenna data when GlbCnt is equal to 0 chip can be stored into the location 0 of the memory array, and the antenna data when GlbCnt is equal to 1 chip can be stored in the location 1 of the memory array, and so on, the antenna data when GlbCnt is equal to 511 can be stored into the location 511 of the memory array, so as to complete the first cycle of the data writing of the memory array.
  • the antenna data of 512 chips i.e. antenna data of 2 symbols
  • the antenna data when GlbCnt is equal to 0 chip can be stored into the location 0 of the memory array
  • the antenna data when GlbCnt is equal to 1 chip can be stored in the location 1 of the memory array
  • the antenna data when GlbCnt is equal to 512 is stored into the location 0 of the memory array
  • the antenna data when GlbCnt is equal to 513 is stored into the location 1 of the memory array
  • antenna data when GlbCnt is equal to 1023 is stored into the location 511 of the memory array, so as to complete the second cycle.
  • the subsequent series cycles are completed.
  • the antenna data are sequentially written into the memory array according to the system timing counter and the structure of the memory array.
  • the required antenna data can be read out from the memory array according to an input control signal which is inputted into the memory array reading control.
  • a group reading address in the memory array is generated according to the input control signal which is inputted into the memory array reading control
  • a reading address group selection signal of each memory in the memory array is generated according to the input control signal which is inputted into the memory array reading control
  • each memory in the memory array obtain the reading address thereof according to the group selection signal
  • a reading enabling signal of the memory array is generated according to the input control signal which is inputted into the memory array reading control and the reading data of each memory in the memory array are output.
  • the memory array reading control method when performing the reading from the memory array, will relate to the control information of several aspects, including control information such as the initial chip data of the user, searching window count, correlation count, antenna number, etc., and the memory array reading control logic obtains the reading initial location of each correlation operation according to these control information, and then decides the reading address of each memory in the memory array according to the reading initial location, thus the corresponding antenna data are read out from the memory array.
  • control information such as the initial chip data of the user, searching window count, correlation count, antenna number, etc.
  • the cyclic shift is carried out on the antenna data, which are outputted from the antenna data memory array, according to a control signal which is inputted into the data rotation module (as shown in Fig. 8 , the cyclic shift is carried out on the data of memory 0 to memory N in the memory array) to obtain the antenna data having been shifted.
  • the number of cyclic shift which the data rotation module will implement can be graded according to the number of memories in the memory array, and an intra-grading cyclic shift is first carried out on the data according to the grading results, then an inter-grading cyclic shift is carried out, and finally the antenna data having been cyclic shifted are obtained and outputted, i.e. such as the method shown in Fig.
  • the cyclic shift of 4 data is divided into the form of 2-grade 2 x 2, the first grade carries out the cyclic shift of 2 data, the second grade further carries out the cyclic shift of 2 data on the basis of the first grade cyclic shift, the particular process of which has been described in the above, which will not be described here.
  • a complex correlation operation is carried out on the antenna data from the data rotation module with the PN code of the PN generator, then complex accumulation between(or among) multi-chips is carried out to obtain the correlation result of multi-searching window offset location.
  • Fig. 5 As to the correlation of PN code and antenna data, preferably, complex multiplication and multi-chips accumulation can be taken into account together.
  • the adding 1 operation in Fig. 5 is shifted after the selector. Since only pn_i is required as to the I path, then the output result needs the adding 1 operation, thus obtaining the transformation form in Fig. 6 .
  • the complex multiplier and the adder tree of multi-chips in Fig. 6 can be combined to obtain an implementation of the correlation of the data of multi-chip and PN code, and the 8-chips data correlation of data correlation method which uses this mode is as shown in Fig. 7 , which method shifts the adding 1 operation in the negating one number and adding 1 operation which needs to be carried out during complex multiplication into the adder tree of the subsequent multi-chip accumulation as a carry (bit) signal of the adder in the adder tree.
  • the flexibility of the correlation operation is reduced due to the use of fixed searching window, and when handover occurs between users, invalid correlation calculation will be introduced, which cause waiting, and it needs to cache a large number of antenna data, while the user of the searching window according to the above processing of the present invention can be changed flexibly, and the used memory resources can be reduced and the implementation complexity of hardware can be reduced (the number of memories and the number of logic devices such as adder are reduced); since there is no correlation between the steps of the above processing of this embodiment, even a user handover occurs, it will not cause waiting and can achieve seamless handover.
  • an apparatus for implementing chip correlation for multi-path search is provided.
  • Fig. 9 is a structural block diagram of an apparatus for implementing chip correlation for multi-path search according to the method embodiments of the present invention.
  • the apparatus for implementing chip correlation for multi-path search according to this embodiment comprises: a receiving module 92, a writing module 94, a memory array 96, a reading module 98, and a correlation processing module 99, and hereinafter the above structures will be described in detail:
  • the manner described above can also be used.
  • the correlation processing module carries out the grouping
  • the manner shown in Fig. 4 can also be used to perform the rotation of the chip data
  • the manners shown in Figs. 5, 6 , or 7 are used to carry out complex multiplication and adding 1 operation.
  • the operating process and operating principles of the apparatus according to this embodiment have been described in detail in the method portion, which will not be described here redundantly, the description of the corresponding portion in the method can be referred to.
  • the chip data on which the correlation operation needs to be carried out within one clock period by way of grouping the chip data on which the correlation operation needs to be carried out within one clock period, a small number of memories can be used to complete the correlation operation, thus the memory resources can be effectively saved, the costs and the hardware complexity can be reduced; moreover, due to various grouping manners, the length of the searching window can be configured flexibly and the flexibility of the correlation operation can be improved; in addition, since the writing, reading (including linefeed reading of the memories) and the correlation operations are unrelated to each other in the above processing, the processing will not pause when user handover occurs, thus the purpose of seamless handover can be achieved.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Radio Transmission System (AREA)
  • Synchronisation In Digital Transmission Systems (AREA)
  • Variable-Direction Aerials And Aerial Arrays (AREA)
  • Radar Systems Or Details Thereof (AREA)
EP10836962.0A 2009-12-16 2010-07-08 Verfahren und vorrichtung zur durchführung der chipkorrelation einer mehrpfadsuche Withdrawn EP2512039A4 (de)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN200910254061.XA CN102104395B (zh) 2009-12-16 2009-12-16 用于多径搜索的码片相关实现方法和装置
PCT/CN2010/075068 WO2011072525A1 (zh) 2009-12-16 2010-07-08 用于多径搜索的码片相关实现方法和装置

Publications (2)

Publication Number Publication Date
EP2512039A1 true EP2512039A1 (de) 2012-10-17
EP2512039A4 EP2512039A4 (de) 2014-04-23

Family

ID=44156958

Family Applications (1)

Application Number Title Priority Date Filing Date
EP10836962.0A Withdrawn EP2512039A4 (de) 2009-12-16 2010-07-08 Verfahren und vorrichtung zur durchführung der chipkorrelation einer mehrpfadsuche

Country Status (4)

Country Link
EP (1) EP2512039A4 (de)
CN (1) CN102104395B (de)
RU (1) RU2565251C2 (de)
WO (1) WO2011072525A1 (de)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103248396B (zh) * 2012-02-02 2016-09-07 中兴通讯股份有限公司 多径搜索的方法及装置
CN103326741B (zh) * 2012-03-20 2016-09-07 中兴通讯股份有限公司 多径搜索的方法和装置

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1209817A2 (de) * 2000-11-24 2002-05-29 Nec Corporation Wegesucher für einen Spreizspektrumempfänger
CN1941647A (zh) * 2005-09-29 2007-04-04 展讯通信（上海）有限公司 一种cdma通信系统的多径搜索方法

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH117737A (ja) * 1997-06-17 1999-01-12 Funai Electric Co Ltd ディスク装置
RU2145152C1 (ru) * 1998-10-08 2000-01-27 Гармонов Александр Васильевич Способ ортогональной разнесенной передачи-приема сигнала в сотовой системе радиосвязи с кодовым разделением каналов
US20030128748A1 (en) * 2002-01-10 2003-07-10 Rasekh Rifaat Path search for CDMA implementation
CN1235360C (zh) * 2002-11-11 2006-01-04 华为技术有限公司 数据流锁存装置及其方法
RU2242088C2 (ru) * 2002-12-15 2004-12-10 Гармонов Александр Васильевич Способ приема многолучевого сигнала, способ уточнения числа и временных задержек компонент многолучевого сигнала и приемник многолучевого сигнала
US7738606B2 (en) * 2005-03-24 2010-06-15 Novatel Inc. System and method for making correlation measurements utilizing pulse shape measurements

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1209817A2 (de) * 2000-11-24 2002-05-29 Nec Corporation Wegesucher für einen Spreizspektrumempfänger
CN1941647A (zh) * 2005-09-29 2007-04-04 展讯通信（上海）有限公司 一种cdma通信系统的多径搜索方法

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of WO2011072525A1 *

Also Published As

Publication number Publication date
WO2011072525A1 (zh) 2011-06-23
EP2512039A4 (de) 2014-04-23
RU2565251C2 (ru) 2015-10-20
CN102104395A (zh) 2011-06-22
CN102104395B (zh) 2014-03-12
RU2012129721A (ru) 2014-01-27

Similar Documents

Publication Publication Date Title
AU767051B2 (en) Programmable matched filter searcher
KR100632319B1 (ko) Ｃｄｍａ 통신시스템의 플렉시블 코릴레이션 및 큐잉
CN101192847B (zh) 一种峰值搜索和排序的装置及峰值排序方法
CN1237297A (zh) 同时多代码序列产生器和采用其的码分多址无线接收机
US8526548B2 (en) Matched filter circuit apparatus in the base band process system of the terminal device and method thereof
CN100380849C (zh) 移动通信系统中用于搜索小区和多径的装置和方法
EP2512039A1 (de) Verfahren und vorrichtung zur durchführung der chipkorrelation einer mehrpfadsuche
JP2004254326A (ja) 統合セル探索のためのデュアルモードモデム及びその方法
EP1908177B1 (de) Korrelator zur primärzellensuche unter verwendung einer speicherarchitektur
US7035318B2 (en) Receiving unit and semiconductor device
US20050169353A1 (en) Post despreading interpolation in CDMA systems
JP2001223611A (ja) 受信装置
CN101295997A (zh) 耙式接收器
JP2004072418A (ja) 遅延プロファイル作成方法および遅延プロファイル作成装置
CN1458756B (zh) 宽带码分多址多径分集接收机的数据缓存方法和装置
KR100313924B1 (ko) 이동통신 시스템의 신호 검색 장치 및 방법
CN102655421B (zh) 一种相关器阵列及其实现方法
EP2745411B1 (de) Dynamische leistungsskalierung eines zwischensymbolpuffers im zusammenhang mit kovarianzberechnungen
CN101714890B (zh) 一种利用两帧数据提高sync码搜索准确率的方法及装置
KR100786105B1 (ko) 이동 통신 시스템의 신호 탐색 장치 및 방법
CN103051357B (zh) 多径对齐累加方法及装置
Eo et al. High speed code acquisition for wideband CDMA system
CN1905396A (zh) 一种多径搜索和能量测量装置及接收机
KR20040061553A (ko) 다중경로 탐색 장치
JP2009033322A (ja) データ処理装置及びその制御方法

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20120329

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO SE SI SK SM TR

DAX Request for extension of the european patent (deleted)
A4 Supplementary search report drawn up and despatched

Effective date: 20140325

RIC1 Information provided on ipc code assigned before grant

Ipc: H04B 1/709 20110101AFI20140319BHEP

Ipc: H04B 1/7113 20110101ALI20140319BHEP

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: ZTE MICROELECTRONICS TECHNOLOGY CO., LTD.

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: SANECHIPS TECHNOLOGY CO., LTD.

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: EXAMINATION IS IN PROGRESS

17Q First examination report despatched

Effective date: 20190313

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: EXAMINATION IS IN PROGRESS

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN

18D Application deemed to be withdrawn

Effective date: 20210202