WO2012116531A1 - Réseau corrélateur et procédé de fabrication associé - Google Patents

Réseau corrélateur et procédé de fabrication associé Download PDF

Info

Publication number
WO2012116531A1
WO2012116531A1 PCT/CN2011/076719 CN2011076719W WO2012116531A1 WO 2012116531 A1 WO2012116531 A1 WO 2012116531A1 CN 2011076719 W CN2011076719 W CN 2011076719W WO 2012116531 A1 WO2012116531 A1 WO 2012116531A1
Authority
WO
WIPO (PCT)
Prior art keywords
array
data
correlator
buffer
code
Prior art date
Application number
PCT/CN2011/076719
Other languages
English (en)
Chinese (zh)
Inventor
沈承科
Original Assignee
中兴通讯股份有限公司
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 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2012116531A1 publication Critical patent/WO2012116531A1/fr

Links

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

Definitions

  • the present invention relates to a multimode soft baseband platform technology with reconfiguration functionality, and more particularly to a correlator array in a reconfigurable iterative correlation array processor and an implementation method thereof.
  • the reconfigurable multi-mode soft baseband platform is basically based on a general-purpose parallel array processor.
  • existing arrays with general-purpose computing functions are often inefficient when performing despreading correlation in a code division multiple access (CDMA) system.
  • CDMA code division multiple access
  • the main object of the present invention is to provide a correlator array and an implementation method thereof, which can realize high-speed despreading correlation and improve the efficiency of despreading correlation.
  • An correlator array including an adder array, a PN buffer, and a local cache, a first loop network and a second loop network respectively corresponding to the PN buffer and the local cache, and a switch;
  • PN buffer for storing PN code
  • the first loop network connecting the output port of the PN buffer and the input port of the adder array, for processing the input PN code, implementing the antenna Synchronous alignment of data;
  • the adder array is composed of a set of complex adders for performing positive and negative sign conversion on each antenna data according to the PN code corresponding to the antenna data, and the data after each two positive and negative sign conversion is a group. Inputting to an array of operators consisting of K/2 complex adders to complete the merging, and outputting the combined ⁇ /2 intermediate symbols to the switch;
  • the buffer contains one independent memory page, each memory unit is 1 bit or 2 bits, and the data is read and written in one cycle.
  • the local cache contains a plurality of independent memory pages, each of which has a width ( ⁇ + ⁇ ) bits for storing a complex number of ( ⁇ + ⁇ ) bits.
  • the number of the complex adders is ⁇ /2, and the scale of the adder array is ⁇ .
  • the adder array is specifically used to:
  • each signal data is converted into positive and negative sign by the sign conversion array, and each two groups are sent into an operation array composed of K/2 complex adders to complete the combination; the obtained K/2 The result is latched to the output latch array L. In ut , it is output to the switch.
  • the correlator array is used independently as a programmable soft accelerator; or integrated into a general purpose array processor for use as a programmable soft accelerator.
  • a method for implementing a correlator array comprising:
  • the switch sends the K/2 intermediate symbols from the adder array to the left or right half of the local cache with K independent pages by selection, each half having a K/2 page.
  • the synchronizing the synchronization between the PN code and the signal data by using the first loop network and the second loop network includes: synchronizing by cyclic shift.
  • Performing an iteration of the correlator array includes: simultaneously performing multiple symbols, or the same symbol but different users or paths.
  • the correlator array provided by the present invention completes the parallel despreading of the CDMA signals received by the antenna through an adder array composed of K/2 complex addition units.
  • One iteration halve the spreading factor of the CDMA symbol.
  • the correlator array is a parallel array, one iteration can be performed on multiple CDMA symbols simultaneously, or the same symbol but different users or paths, and an array with K/2 adders can only average 2N/K cycles. Completion of a CDMA symbol despreading with a spreading factor of N. Therefore, the correlator array of the present invention has a high processing speed, realizes high-speed despreading correlation, and improves the efficiency of understanding the correlation.
  • FIG. 1 is a schematic structural diagram of an application of a reconfigurable iterative correlation array of the present invention
  • FIG. 2 is a schematic structural diagram of a correlator array of the present invention
  • FIG. 3 is a schematic structural diagram of a loop network in a correlator array of the present invention.
  • FIG. 4 is a schematic structural diagram of an adder array in a correlator array of the present invention
  • FIG. 5a is a schematic structural diagram of a PN buffer in a correlator array of the present invention
  • FIG. 5b is a schematic structural diagram of a local cache in a correlator array according to the present invention.
  • FIG. 6 is a schematic diagram of a data structure in a local cache in a correlator array according to the present invention
  • FIG. 7 is a schematic diagram of an embodiment of a first-stage despreading iteration of a correlator array according to the present invention.
  • FIG. 1 is a schematic structural diagram of an application of a reconfigurable iterative correlation array according to the present invention.
  • the application of the reconfigurable iterative correlation array of the present invention includes two parts: The first part is microcode.
  • a controller composed of a buffer and a microcoder, the controller performs the following control functions according to the microcode: reading the external PN code into the PN code buffer; reading the external antenna data into the local buffer; according to the relative relationship between the PN code and the antenna data The position generates a loop control signal of two loop networks; generates an adder array control signal; and generates an output switch control signal.
  • the controller can be implemented by any general-purpose CPU or a controller in a general-purpose array processor, which is well known to those skilled in the art, and the specific implementation is not intended to limit the scope of the present invention, nor is it within the scope of the present invention.
  • the second part is a correlator array including an adder array, a PN buffer and a local cache, a switch, and a respective loop network of the PN buffer and the local cache (ie, the first loop network and the second loop network in FIG. 1).
  • the correlator array of the present invention is configured to perform CDMA despreading by successive iterative compression of CDMA spread symbols under the control of the controller.
  • the correlator array can be used alone under the control of a general-purpose CPU or integrated into a general-purpose array processor to perform CDMA signal despreading and multipath searching as a CDMA dedicated acceleration array.
  • the correlator array of the present invention includes an adder array, a PN buffer, and a local cache, and a PN cache and a local cache respectively correspond to the first loop network and the first a second loop network, and a switch F, wherein
  • the PN buffer is a dual-port data memory, a' mouth read, and e-port write, used to store the PN code.
  • the PN buffer contains K independent memory pages, each of which is 1 bit or 2 bits (complex PN code), and the data is read and written in one cycle.
  • K is related to the implementation cost. The larger the value of K, the higher the hardware implementation cost, but the processing speed will be higher. Conversely, the smaller the K, the lower the implementation cost and the lower the processing speed.
  • the local cache is a dual-port data memory, b, port read, d-port write, used to store data and arithmetic intermediate results from the receive antenna. Similar to the PN buffer, the local cache also contains K independent memory pages, each of which has a (n+n)-bit width for storing a complex number of (n+n) bits.
  • the data from the antenna is written to the local cache at the given address, and the result after each iteration is sequentially written back to the left and right half of the local cache through the output switch.
  • the PN cache and the local cache may also be single-port data memory, and the specific use is a person skilled in the art. The usual technical means of the staff, no longer repeat them here.
  • the first loop network which is connected to the output port a of the PN buffer and the input port a of the adder array, is used for cyclically shifting the input PN code to achieve synchronous alignment with the antenna data.
  • the second loop network connects the output port b of the local data buffer with the input port b of the adder array for cyclically shifting the input data from the receiving antenna to achieve synchronization with the PN code.
  • the first and second loop networks are primarily used to synchronize the locally generated PN code with the antenna input data.
  • the PN code and antenna data are placed sequentially in rows in their respective buffers. However, their starting positions are different.
  • the first and second loop networks cyclically shift the PN code and the antenna data to align them, i.e., synchronize, and then send them to the adder array.
  • the adder array is composed of a set of complex adders for performing positive and negative sign conversion on each antenna data according to the PN code corresponding to the antenna data, and the data after each two positive and negative sign conversion is a group, respectively input
  • the array of operators consisting of K/2 complex adders is merged, and the combined K/2 intermediate symbols are latched into the output latch array and output to switch F.
  • the number of complex adders is half of the scale of the adder array.
  • the scale of the adder array is K.
  • the adder array has two input ports, input port a and input port b, and an output port c.
  • input port a has K inputs, each input bit width is 1 bit or 2 bits;
  • input port b also has K inputs, each input bit width is 2n bits (used to represent one of (n+n) bits Complex);
  • Output port c has K/2 outputs, and each input is also a complex number of (n+n) bits.
  • Switch F is an alternative switch. Used to select to send K/2 intermediate symbols from the adder array to the left or right half of the local cache with K independent pages, each with a K/2 page.
  • the correlator array of the present invention can be used as a despreading correlator in a Rake receiver, a multipath searcher, and a random access channel (RACH) detector in a wireless system such as CDMAAVCDMA/CDMA2000.
  • the correlator array of the present invention can be used independently as a programmable soft accelerator or integrated into a general purpose array processor for use as a programmable soft accelerator.
  • FIG. 3 is a schematic structural diagram of a loop network in a correlator array according to the present invention.
  • the loop network converts an input vector X into an output vector Y by cyclic shift, that is, an element of the vector Y is a vector X.
  • the cyclic displacement of the elements is a vector X.
  • the specific implementation of the loop network belongs to the conventional technical means of those skilled in the art, and will not be described herein.
  • FIG. 4 is a schematic structural diagram of an adder array in the correlator array of the present invention, as shown in FIG. 4, the PN code is input to the input port a through the first loop network, and the signal data is input to the input port b through the second loop network; The synchronization between the PN code and the signal data is coordinated by the first loop network and the second loop network.
  • K PN codes from input port a and input port b and K signal data from the receiving antenna, respectively, are latched in parallel into the latch array L PN and the latch array L s ; according to their corresponding PN code
  • Each signal data is converted into a sign by a positive and negative sign conversion array, and then each two adjacent groups are fed into an adder array composed of K/2 complex adders to complete the merging; finally, this K/2
  • the result is latched into the output latch array L. In ut , it is output to the switch.
  • FIG. 5a is a schematic structural diagram of a PN buffer in a correlator array according to the present invention
  • FIG. 5b is a schematic structural diagram of a local cache in a correlator array according to the present invention.
  • each cache array has K independent caches. Storing a page, wherein the PN code storage page is 1 or 2 bits wide per unit bit, and is used for storing a 1-bit real pseudo code or a 2-bit complex pseudo code; The element is 2n bits wide and is used to store (n + n) bits of complex data.
  • each page is a dual-port data memory, an oral read, and a port write. Both are required to operate in parallel, and two cache arrays can be read in parallel by the adder array at each cycle.
  • the write port of the local data cache array is divided into left and right halves. Since the data from the adder array is only K/2, when the data is from the output of the adder array, only half of the write is written.
  • each m times oversampling chip occupies m units, and the signal sequence data is arranged from left to right in units of m units; after occupying K pages, another line is continued until the end of the line.
  • the iterative working principle is as follows: 4. Set a CDMA symbol X with a spreading factor of 256. If 8 times oversampling is performed, there are 2048 samples of data. One out of every 8 data (one per chip), a total of 256 sampled data; these 256 sampled data vectors are called original symbols, where the sub-vector consisting of any less than 256 adjacent data is called the original symbol. segment. After multiplication with the corresponding 256 PN chips, each two adjacent data is first compressed and merged by the adder, and the result is 128 intermediate data; the vector composed of the 128 intermediate data is called the intermediate symbol. , where the sub-vector consisting of any less than 128 adjacent data is called the intermediate symbol segment. Each compression iteration completes a 2:1 compression, in which all intermediate results are called intermediate symbols or intermediate symbol segments.
  • FIG. 7 is a schematic diagram of an embodiment of a first embodiment despreading iteration of a correlator array according to the present invention.
  • the first step of compression must also complete the multiplication of the signal data with the corresponding bit of the PN code. .
  • the PN code and the antenna signal data are respectively read from the PN buffer and the local data buffer, and the synchronization alignment is completed through the respective loop networks; then, the positive and negative of each antenna data is completed according to the corresponding PN code.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Radio Transmission System (AREA)

Abstract

La présente invention concerne un réseau corrélateur et un procédé de fabrication associé. Le réseau corrélateur désétale des signaux d'accès multiple par répartition de code (CDMA) reçus par des antennes en parallèle avec un réseau additionneur composé de K/2 additionneurs complexes et les facteurs d'étalement des signaux CDMA sont divisés par deux à chaque itération. Comme le réseau corrélateur selon l'invention est un réseau parallèle, chaque itération peut être exécutée simultanément pour de multiples signaux CDMA ou sur le même symbole provenant d'utilisateurs différents ou de trajets différents et un réseau comprenant K/2 additionneurs n'a en moyenne besoin que de 2N/K périodes pour achever le désétalage d'un symbole CDMA ayant un facteur d'étalement N. De ce fait, le corrélateur selon la présente invention présente une vitesse élevée de traitement, ce qui assure une corrélation de désétalement à grande vitesse et améliore l'efficacité de la corrélation de désétalement.
PCT/CN2011/076719 2011-03-02 2011-06-30 Réseau corrélateur et procédé de fabrication associé WO2012116531A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201110050106.9 2011-03-02
CN201110050106.9A CN102655421B (zh) 2011-03-02 2011-03-02 一种相关器阵列及其实现方法

Publications (1)

Publication Number Publication Date
WO2012116531A1 true WO2012116531A1 (fr) 2012-09-07

Family

ID=46730961

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2011/076719 WO2012116531A1 (fr) 2011-03-02 2011-06-30 Réseau corrélateur et procédé de fabrication associé

Country Status (2)

Country Link
CN (1) CN102655421B (fr)
WO (1) WO2012116531A1 (fr)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1267150A (zh) * 1999-03-12 2000-09-20 日本电气株式会社 实现低电流消耗的相关器
US6212223B1 (en) * 1997-04-24 2001-04-03 Sharp Kabushiki Kaisha Demodulation and correlation for spread spectrum communications
CN1774869A (zh) * 2003-04-14 2006-05-17 松下电器产业株式会社 相关值计算电路

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20000060910A (ko) * 1999-03-22 2000-10-16 김영환 Ｃｄｍａ 시스템의 복합형 정합여파기 및 그 운용방법
CN200950582Y (zh) * 2006-01-17 2007-09-19 凯明信息科技股份有限公司 码分多址系统中用于降低接收干扰的装置

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6212223B1 (en) * 1997-04-24 2001-04-03 Sharp Kabushiki Kaisha Demodulation and correlation for spread spectrum communications
CN1267150A (zh) * 1999-03-12 2000-09-20 日本电气株式会社 实现低电流消耗的相关器
CN1774869A (zh) * 2003-04-14 2006-05-17 松下电器产业株式会社 相关值计算电路

Also Published As

Publication number Publication date
CN102655421A (zh) 2012-09-05
CN102655421B (zh) 2014-11-05

Similar Documents

Publication Publication Date Title
Mera et al. Compact domain-specific co-processor for accelerating module lattice-based KEM
US20030122697A1 (en) Method and system for a programmable code generator
US8526548B2 (en) Matched filter circuit apparatus in the base band process system of the terminal device and method thereof
WO2005076493A1 (fr) Interpolation post-desetalement dans des systemes amrc
Mera et al. Compact domain-specific co-processor for accelerating module lattice-based key encapsulation mechanism
US20060184599A1 (en) Correlation architecture for use in software-defined radio systems
WO2012116531A1 (fr) Réseau corrélateur et procédé de fabrication associé
WO2011072525A1 (fr) Procédé et dispositif destinés à réaliser la corrélation des bribes dans une recherche sur trajets multiples
Rajagopal et al. On-line arithmetic for detection in digital communication receivers
Chugh et al. Design and implementation of configurable W-CDMA rake receiver architectures on FPGA
CN100571054C (zh) 宽带码分多址通信系统中下行链路多径搜索方法及其装置
JP2007166350A (ja) ゲートアレイプログラム装置、測定装置、プログラム
US9270324B2 (en) Efficient generation of spreading sequence correlations using lookup tables
WO2015101012A1 (fr) Procédé et unité arithmétique vectorielle pour réaliser le désembrouillage et le désétalement, et support de stockage informatique
Garzia et al. Implementation of the W-CDMA cell search on a MPSoC designed for software defined radios
Guo et al. Low complexity System-on-Chip architectures of Parallel-Residue-Compensation in CDMA systems
JP3583349B2 (ja) 受信機および逆拡散符号生成方法
Wang et al. Optimized implementations of stream cipher ZUC-256 algorithm
Alshawi et al. Low complexity FPGA-implementation of a reconfigurable SIC multiuser detector for wireless applications
Platov et al. System design approach for RSFQ multiuser detector
WO2013167033A2 (fr) Procédé et dispositif de reduction du taux d'erreur dans un système de communication amrc
Sriram et al. Efficient pseudo-noise sequence generation for spread-spectrum applications
Garzia et al. Implementation of W-CDMA slot synchronization on a reconfigurable System-on-Chip
KR100664563B1 (ko) 비동기시스템의 효율적인 피이지씨 장치
Olsson et al. Distributed Asynchronous Custom DSP Systems Applied on Successive Interference Cancellation

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 11860000

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 11860000

Country of ref document: EP

Kind code of ref document: A1