CN103838703B - Method and apparatus for realizing signal transacting based on big points Fourier transformation - Google Patents
Method and apparatus for realizing signal transacting based on big points Fourier transformation Download PDFInfo
- Publication number
- CN103838703B CN103838703B CN201210488471.2A CN201210488471A CN103838703B CN 103838703 B CN103838703 B CN 103838703B CN 201210488471 A CN201210488471 A CN 201210488471A CN 103838703 B CN103838703 B CN 103838703B
- Authority
- CN
- China
- Prior art keywords
- fourier transform
- signal
- sequence length
- sequence
- processed
- 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.)
- Active
Links
Landscapes
- Complex Calculations (AREA)
Abstract
本发明的目的是提供一种用于基于大点数傅里叶变换对信号进行处理的方法和设备。具体地，将待处理信号所对应的大点数傅里叶变换转换为二维小点数傅里叶变换；根据第二序列长度，对第一傅里叶变换结果及旋转因子的乘积重复执行第二傅里叶变换，以获得经大点数傅里叶变换所得的结果信号。与现有技术相比，本发明通过根据对待处理信号所对应的以目标序列长度为点数的大点数傅里叶变换转换为二维小点数傅里叶变换时对应的第二序列长度，对第一傅里叶变换结果及所述旋转因子的乘积重复执行所述第二傅里叶变换，实现了仅运用小点数傅里叶变换加上乘积因子，即可实现大点数的傅里叶变换，不仅降低了算法复杂度，也降低了硬件设备的资源开销。
The object of the present invention is to provide a method and a device for processing signals based on the large-point Fourier transform. Specifically, the large-point Fourier transform corresponding to the signal to be processed is converted into a two-dimensional small-point Fourier transform; according to the second sequence length, the product of the first Fourier transform and the twiddle factor is repeatedly executed for the second Fourier transform to obtain the result signal obtained by large-point Fourier transform. Compared with the prior art, the present invention converts the second sequence length corresponding to the two-dimensional small-point Fourier transform from the large-point Fourier transform corresponding to the target sequence length to the two-dimensional small-point Fourier transform according to the signal to be processed. The product of a Fourier transform result and the twiddle factor repeatedly executes the second Fourier transform, realizing the Fourier transform of a large number of points only by using the Fourier transform of a small number of points plus a multiplication factor, It not only reduces the complexity of the algorithm, but also reduces the resource overhead of the hardware device.
Description
Technical Field
The invention relates to the technical field of signal processing, in particular to a technology for realizing signal processing based on large-point Fourier transform.
Background
FFT/IFFT (Fast Fourier Transform/Inverse Transform) is a common technique in signal processing. However, in the conventional method for converting a small-point-number frequency domain signal into a large-point-number time domain signal or converting a small-point-number time domain signal into a large-point-number frequency domain signal, a large-point (large size) FFT/IFFT or an up-sampling/down-sampling method is generally adopted, but the former requires a large amount of hardware resources, and the latter is implemented with lower accuracy than the former. E.g., for Cooley-TukeyFFT algorithm converts length N to N1N2Is decomposed into two-dimensional shorter sequence DFTs, i.e., N2Sub N1Point DFT and N1Sub N2Point DFT, to a certain extent, realizes a large number of points FFT with a shorter sequence FFT:
wherein,n＝N2n1+n2，k＝N1k2+k1however, this method still requires the calculation of N2Sub N1Point DFT and N1Sub N2Point DFT, therefore, the hardware resources required for this method and its algorithm complexity still need to be further improved.
Disclosure of Invention
The invention aims to provide a method and equipment for realizing signal processing based on large-point Fourier transform.
According to an aspect of the present invention, there is provided a method for implementing signal processing based on a large-point fourier transform, wherein the method comprises the steps of:
a, converting a large-point Fourier transform corresponding to a signal to be processed into a two-dimensional small-point Fourier transform, wherein the two-dimensional small-point Fourier transform comprises a first Fourier transform based on a first sequence length, a second Fourier transform based on a second sequence length and a corresponding twiddle factor, the signal to be processed meets a signal sparsity threshold, the product of the first sequence length and the second sequence length is a target sequence length of the large-point Fourier transform, and the second sequence length is matched with sequence length information of the signal to be processed;
b, repeatedly executing the second Fourier transform on the product of the first Fourier transform result and the twiddle factor according to the second sequence length to obtain a result signal obtained by the large-point Fourier transform, wherein the first Fourier transform result corresponds to a signal sequence corresponding to the second sequence length in the signal to be processed;
wherein the Fourier transform comprises an FFT or IFFT.
According to another aspect of the present invention, there is also provided a signal processing apparatus for implementing signal processing based on a large-point fourier transform, wherein the signal processing apparatus includes:
the device comprises a conversion device and a processing device, wherein the conversion device is used for converting a large-point Fourier transform corresponding to a signal to be processed into a two-dimensional small-point Fourier transform, the two-dimensional small-point Fourier transform comprises a first Fourier transform based on a first sequence length, a second Fourier transform based on a second sequence length and a corresponding twiddle factor, the signal to be processed meets a signal sparsity threshold, the product of the first sequence length and the second sequence length is a target sequence length of the large-point Fourier transform, and the second sequence length is matched with sequence length information of the signal to be processed;
executing means, configured to repeatedly execute the second fourier transform on a product of a first fourier transform result and the twiddle factor according to the second sequence length to obtain a resultant signal obtained by the large-point fourier transform, where the first fourier transform result corresponds to a signal sequence corresponding to the second sequence length in the signal to be processed;
wherein the Fourier transform comprises an FFT or IFFT.
According to yet another aspect of the present invention, there is also provided a PRACH transmitting apparatus, wherein the PRACH transmitting apparatus includes the aforementioned signal processing apparatus for implementing signal processing based on a large point number fourier transform according to another aspect of the present invention.
According to still another aspect of the present invention, a user equipment is also provided, wherein the user equipment comprises the aforementioned signal processing device for implementing signal processing based on large point fourier transform according to another aspect of the present invention.
Compared with the prior art, the method and the device have the advantages that the second Fourier transform is repeatedly executed on the product of the first Fourier transform result and the twiddle factor according to the second sequence length corresponding to the signal to be processed when the large-point Fourier transform with the target sequence length as the point is converted into the two-dimensional small-point Fourier transform, so that the large-point Fourier transform can be realized only by adding the small-point Fourier transform and the multiplication factor, and compared with the existing large-point Fourier algorithm, the algorithm complexity is reduced, and the resource overhead of hardware equipment is also reduced. Furthermore, the invention can also take the ZC root sequence to be transmitted by the PRACH as the signal to be processed, and further reduces the algorithm complexity of devices such as a PRACH transmitter and the resource expense of hardware devices by applying the large-point Fourier transform method.
Drawings
Other features, objects and advantages of the invention will become more apparent upon reading of the detailed description of non-limiting embodiments made with reference to the following drawings:
FIG. 1 shows a schematic diagram of an apparatus for implementing signal processing based on a large-point Fourier transform, according to an aspect of the present invention;
FIG. 2 is a schematic diagram of an apparatus for performing signal processing based on a large-point Fourier transform in accordance with a preferred embodiment of the present invention;
fig. 3 is a diagram illustrating a PRACH transmission procedure at a UE side for implementing signal processing based on a large-point fourier transform according to a preferred embodiment of the present invention;
FIG. 4 illustrates a flow diagram of a method for implementing signal processing based on a large-point Fourier transform in accordance with another aspect of the disclosure;
fig. 5 shows a flow chart of a method for implementing signal processing based on a large-point fourier transform according to a preferred embodiment of the present invention.
The same or similar reference numbers in the drawings identify the same or similar elements.
Detailed Description
The present invention is described in further detail below with reference to the attached drawing figures.
Fig. 1 shows a signal processing device 1 for implementing signal processing based on a large-point fourier transform according to an aspect of the present invention, wherein the signal processing device 1 comprises conversion means 11 and execution means 12. Specifically, the conversion device 11 converts a large-point fourier transform corresponding to a signal to be processed into a two-dimensional small-point fourier transform, where the two-dimensional small-point fourier transform includes a first fourier transform based on a first sequence length, a second fourier transform based on a second sequence length, and a corresponding twiddle factor, where the signal to be processed satisfies a signal sparsity threshold, a product of the first sequence length and the second sequence length is a target sequence length of the large-point fourier transform, and the second sequence length matches sequence length information of the signal to be processed; the executing device 12 repeatedly executes the second fourier transform on the product of the first fourier transform result and the twiddle factor according to the second sequence length to obtain a resultant signal obtained by the large-point fourier transform, wherein the first fourier transform result corresponds to a signal sequence corresponding to the second sequence length in the signal to be processed; wherein the Fourier transform comprises an FFT or IFFT. Here, the signal processing apparatus 1 includes, but is not limited to, an electronic product for fourier transforming a signal, such as a PRACH transmitter, UE, etc. generating a preamble sequence in LTE, which includes an electronic apparatus capable of automatically performing numerical calculation and information processing according to instructions set in advance or stored, and hardware thereof includes, but is not limited to, a microprocessor, an Application Specific Integrated Circuit (ASIC), a programmable gate array (FPGA), a digital processor (DSP), an embedded apparatus, etc. Here, the base station refers to a device, such as an eNB base station, which connects a fixed part and a radio part in a mobile communication system and connects to a mobile station by radio transmission over the air. Here, the UE refers to a part of terminating wireless transmission from or to a network in a mobile communication device, and adapting the capability of a terminal device to the wireless transmission, that is, a device for a user to access to the mobile network, and includes, but is not limited to, any electronic product, such as a tablet computer, a smart phone, a PDA, a vehicle-mounted computer, etc., which can perform man-machine interaction with the user through a keyboard, a touch panel, or a voice control device, and can perform mutual transmission and reception of signals with a base station through the mobile network to achieve transmission of mobile communication signals. Here, the mobile network includes, but is not limited to, GSM, 3G, LTE-Advanced, Wi-Fi, WiMax, WCDMA, CDMA2000, TD-SCDMA, HSPA, LTD, etc. It should be understood by those skilled in the art that the above-mentioned signal processing apparatus 1, UE and base station are only examples, and other existing or future signal processing apparatuses 1, UEs or base stations may be applicable to the present invention, and are included in the scope of the present invention and are herein incorporated by reference.
Specifically, the conversion device 11 converts a large-point fourier transform corresponding to a signal to be processed into a two-dimensional small-point fourier transform, where the two-dimensional small-point fourier transform includes a first fourier transform based on a first sequence length, a second fourier transform based on a second sequence length, and a corresponding twiddle factor, where the signal to be processed satisfies a signal sparsity threshold, a product of the first sequence length and the second sequence length is a target sequence length of the large-point fourier transform, and the second sequence length is matched with sequence length information of the signal to be processedAnd (4) preparing. Here, the matching of the second sequence length with the sequence length information of the signal to be processed means that the second sequence length is greater than or equal to the sequence length information of the signal to be processed, for example, the size requirement of fourier transform is satisfied, for example, 2n。
For example, assume that it is desired to convert the length to N1Is carried out for a finite length sequence x (N) of N ═ N1N2Point Fourier transform such as FFT operation, i.e. x (N) is only in the range of N0-N1If the value of-1 is "1", and if there are other N, x (N) ═ 0 ", then the finite length sequence x (N) satisfies the signal sparsity threshold, then the conversion device 11 can convert the large-point fourier transform corresponding to x (N) into the two-dimensional small-point fourier transform when performing FFT operation on x (N), for example, N ═ N of x (N) can be obtained according to the Cooley-Tukey FFT algorithm1N2Point fourier transform, as explained with FFT as an example:
wherein,n＝N2n1+n2，k＝N1k2+k1the conversion device 11 converts the large-point Fourier transform corresponding to x (N) into two-dimensional small-point Fourier transform, i.e. N2Sub N1Point FFT and N1Sub N2A point FFT, wherein the two-dimensional decimal point number Fourier transform comprises a first Fourier transform based on a first sequence length, i.e., an inner loop FFT in equation (1), i.e., a point FFTIf N24576 and x (N) are assumed to have a sequence length of 839, the sequence of x (N) may be zero-padded, and if the size requirement of FFT is satisfied, e.g., the sequence of x (N) is zero-padded to 1024, the large-point FFT of N24576 may be converted into a two-dimensional small-point FFT of N24 × 1024, i.e., 1024 times of 24-point FFT are performed first, and then 24 times of 1024-point FFT are performed to obtain two-dimensional small-point FFTAnd (5) a few FFT.
It should be understood by those skilled in the art that the above-mentioned manner of transforming a large-point fourier transform into a two-dimensional small-point fourier transform is merely exemplary, and other existing or hereafter-occurring manners of transforming a large-point fourier transform into a two-dimensional small-point fourier transform may be applicable to the present invention, and are included within the scope of the present invention and are incorporated herein by reference.
The executing device 12 repeatedly executes the second fourier transform on the product of the first fourier transform result and the twiddle factor according to the second sequence length to obtain a resultant signal obtained by the large-point fourier transform, wherein the first fourier transform result corresponds to a signal sequence corresponding to the second sequence length in the signal to be processed; wherein the Fourier transform comprises an FFT or IFFT. Specifically, the executing device 12, based on each second sequence length, first performs a first fourier transform based on the first sequence length on the signal to be processed to obtain a corresponding first fourier transform result; then, the second fourier transform is repeatedly performed on the product of the first fourier transform result and the twiddle factor according to the second sequence length to obtain a resultant signal obtained by the large-point fourier transform.
For example, in the above example, the conversion device 11 decomposes x (N) into N2Each length is N1When expressed in a matrix, the sequence of (1) has:
if orderThenIf the sequence length of x (N) is 839, N ═ 23 needs to be performed on it576, the conversion device 11 may zero-fill the sequence of x (N) to obtain N24 × 1024, N1＝24，N21024, that is, the conversion device 11 converts the large-point FFT with N24576 into the two-dimensional small-point FFT with N24 × 1024, and the corresponding matrixIf the decomposition matrix corresponding to the x (n) sequence does not satisfy that only the first column has a value, the matrix can be converted into a matrix satisfying that only the first column has a value by means of, for example, a block matrix, a matrix transformation, or the like, and the executing device 12 first performs a first fourier transform based on the first sequence length on the signal to be processed according to each second sequence length to obtain a corresponding first fourier transform result, if the formula (1) is used, the matrix only needs to be continuously distributed, and if the decomposition matrix corresponding to the x (n) sequence does not satisfy that only the first column has a value:
when n is2When the content is equal to 0, the content,wherein,
when n is2When the number is equal to 1, the alloy is put into a container,
wherein n is2＝0，x'(n)＝x(0)，n2When the number is equal to 1, the alloy is put into a container,
when n is2When the number is equal to 2, the alloy is put into a container,
wherein n is2When 0, x' (n) is x (0), n2When the number is equal to 1, the alloy is put into a container,
n2when the number is equal to 2, the alloy is put into a container,
by analogy, as can be seen from the above analysis, the execution device 12 first obtains the length n of each second sequence2Corresponding first Fourier transform result, the first Fourier transform result only ANDWherein the first Fourier transform result corresponds to the length N of the second sequence in the signal x (N) to be processed2A corresponding signal sequence; the execution means 12 then again follow the second sequence length N2From the above derivation, the executing device 12 performs the second fourier transform repeatedly on the product of the first fourier transform result and the twiddle factor to obtain the resultant signal obtained by the large-point fourier transform, and when performing the second fourier transform, it is actually performed on N of the new sequence x' (N)2Point N1Second decimal point FFT, i.e. only N has to be performed2Point N1The small-point FFT of the second dimension omits N in the traditional large-point FFT1Point N2The small number of points FFT in this dimension. The invention realizes that the Fourier transform of the large point can be realized only by adding the product factor to the Fourier transform of the small point, and not only reduces the complexity of the algorithm but also reduces the resource expense of hardware equipment compared with the existing Fourier algorithm of the large point.
It will be understood by those skilled in the art that the matrix representation of the signals to be processed is merely exemplary, and other existing or future matrix representations of the signals to be processed may be suitable for the present invention, and are included within the scope of the present invention and are hereby incorporated by reference.
It will be understood by those skilled in the art that the above-described manner of performing the second fourier transform is merely exemplary, and other existing or future manners of performing the second fourier transform, such as may be applicable to the present invention, are also included within the scope of the present invention and are hereby incorporated by reference.
The various devices of the signal processing apparatus 1 are constantly in operation. Specifically, the conversion device 11 continuously converts a large-point fourier transform corresponding to a signal to be processed into a two-dimensional small-point fourier transform, where the two-dimensional small-point fourier transform includes a first fourier transform based on a first sequence length, a second fourier transform based on a second sequence length, and a corresponding twiddle factor, where the signal to be processed satisfies a signal sparsity threshold, a product of the first sequence length and the second sequence length is a target sequence length of the large-point fourier transform, and the second sequence length matches sequence length information of the signal to be processed; the executing device 12 repeatedly executes the second fourier transform on the product of the first fourier transform result and the twiddle factor according to the second sequence length to obtain a resultant signal obtained by the large-point fourier transform, wherein the first fourier transform result corresponds to a signal sequence corresponding to the second sequence length in the signal to be processed; wherein the Fourier transform comprises an FFT or IFFT. It should be understood by those skilled in the art that "continuously" means that each device of the signal processing apparatus 1 continuously performs the conversion of the two-dimensional decimal fourier transform and the repeated execution of the second fourier transform, respectively, until the signal processing apparatus 1 stops the conversion of the two-dimensional decimal fourier transform for a longer time.
Fig. 2 shows a schematic diagram of an apparatus for implementing signal processing based on large-point fourier transform according to a preferred embodiment of the present invention, wherein the signal processing apparatus 1 includes signal acquiring means 13 ', cyclic shift means 14', converting means 11 'and executing means 12'. Specifically, the signal acquiring device 13' takes a ZC root sequence to be transmitted through the PRACH as the signal to be processed; the cyclic shift device 14' performs cyclic shift on the signal to be processed to obtain the length of the target sequence of the large-point Fourier transform; the conversion device 11' converts a large-point Fourier transform corresponding to a signal to be processed into a two-dimensional small-point Fourier transform, wherein the two-dimensional small-point Fourier transform includes a first Fourier transform based on a first sequence length, a second Fourier transform based on a second sequence length, and a corresponding twiddle factor, wherein the signal to be processed satisfies a signal sparsity threshold, a product of the first sequence length and the second sequence length is a target sequence length of the large-point Fourier transform, and the second sequence length matches with sequence length information of the signal to be processed; the executing device 12' repeatedly executes the second fourier transform on the product of the first fourier transform result and the twiddle factor according to the second sequence length to obtain a resultant signal obtained by the large-point fourier transform, wherein the first fourier transform result corresponds to a signal sequence corresponding to the second sequence length in the signal to be processed; wherein the Fourier transform comprises an FFT or IFFT. Here, the conversion device 11 'and the execution device 12' are respectively the same as or similar to the corresponding devices in the embodiment of fig. 1, and for the sake of brevity, are not described again and are included herein by reference.
Specifically, the signal acquiring device 13' takes the ZC root sequence to be transmitted through the PRACH as the signal to be processed. For example, assume that in a 3GPP LTE system, when a UE initiates a random access procedure, a physical layer at a UE end learns parameter information of a random access preamble SEQUENCE, such as a logical ROOT SEQUENCE index RACH _ ROOT _ SEQUENCE, from an upper layer, and obtains an actually used u by looking up a table (for example, looking up tables 5.7.2-4 and 5.7.2-5 in 3GPP protocols TS 362.11-870) according to the parameter to generate a ZC ROOT SEQUENCE:
according to parameters such as format preamble format of the random access preamble sequence, cyclic shift value configuration Ncs, preamble sequence group type identifier High-speed-flag, and the like, the length and cyclic shift value of the random access preamble ZC sequence are determined, and then the signal acquisition device 13' may use the ZC root sequence to be transmitted through the PRACH as the signal to be processed, as shown in fig. 3, a schematic diagram of the transmission process of the PRACH at the UE end is shown.
For example, in the above example, the cyclic shift device 14 ' may determine, by using the parameter cyclic shift value configuration Ncs, the number of bits that can be cyclically shifted for the ZC root sequence, and obtain the target sequence length of the large-point fourier transform, and if it is assumed that the signal acquisition device 13 ' obtains preamble format preamble 0 by looking up a random access channel configuration index prach-configuration index, and if the cyclic shift value Ncs is 13 and the length Nzc of the ZC root sequence is 839, the cyclic shift device 14 ' cyclically shifts the ZC root sequence according to the cyclic shift value Ncs 13, and obtains the target sequence length of the large-point fourier transform, such as 24576.
Preferably, the signal obtaining device 13' may further perform zero padding on the ZC root sequence to obtain the signal to be processed, where the sequence length information of the signal to be processed matches with the length information of the ZC root sequence. For example, the signal obtaining device 13 'first obtains preamble format 0 through random access channel configuration index prach-configuration index table lookup, where Ncs is 13, and Nzc is 839, then the signal obtaining device 13' may further perform zero padding on the ZC root sequence, for example, zero padding the ZC root sequence to 1024, so that it satisfies the size of fourier transform, and obtain the signal to be processed, where the sequence length information of the signal to be processed matches the length information of the ZC root sequence.
More preferably, the signal processing apparatus 1 further includes second sequence determining means (not shown) and first sequence determining means (not shown). Specifically, the second sequence determining means takes the sequence length information of the signal to be processed after zero padding as the second sequence length; the first sequence determining device determines the first sequence length according to the target sequence length and the second sequence length.
Specifically, the second sequence determining means takes the sequence length information of the signal to be processed after zero padding as the second sequence length. For example, as described above, if the signal acquiring device 13' zero-fills the ZC root sequence to 1024, the second sequence determining device uses the sequence length information of the ZC root sequence after zero-filling as the second sequence length, that is, N2＝1024。
The first sequence determining device determines the first sequence length according to the target sequence length and the second sequence length. For example, assuming that the cyclic shift device 14' obtains the target sequence length of the large-point fourier transform as N24576, the second sequence length determined by the second sequence determination device, i.e., N, in the above example2The first sequence determining means may then N/N10242As the length of the first sequence, i.e. N1＝24。
Preferably, the signal processing apparatus 1 further comprises an inserting means (not shown), in particular, the inserting means inserts a corresponding cyclic prefix in the resultant signal obtained by the large-point fourier transform for transmission via the PRACH. For example, assuming that the target sequence length for the cyclic shift device 14 ' to obtain the large-point fourier transform is N24576, the inserting device inserts the corresponding cyclic prefix CP into the resultant signal y (N) obtained by performing the large-point fourier transform on the ZC root sequence acquired by the signal acquiring device 13 ' by the executing device 12 ' for transmission via the PRACH, as shown in fig. 3.
More preferably, for the resultant signal obtained by the fourier transform of the large number of points, when the corresponding preamble format includes format 2 or 3, the inserting device may further copy the resultant signal, and insert a corresponding cyclic prefix into the copied resultant signal for transmission via the PRACH. For example, assuming that the ZC root sequence obtained by the signal obtaining means 13 ' is in preamble format 2 or 3 to generate a preamble sequence, and the cyclic shift means 14 ' obtains the target sequence length N ═ 2 × 24576 of the large-point-number fourier transform, the inserting means performs the large-point-number fourier transform on the ZC root sequence obtained by the signal obtaining means 13 ' to obtain a result signal y (N) and first copies the result signal, and then inserts a corresponding cyclic prefix CP into the copied result signal for transmission via the PRACH, as shown in fig. 3.
Fig. 4 illustrates a flow diagram of a method for implementing signal processing based on a large-point fourier transform in accordance with another aspect of the disclosure.
Specifically, in step S1, the signal processing apparatus 1 converts a large-point fourier transform corresponding to a signal to be processed into a two-dimensional small-point fourier transform, wherein the two-dimensional small-point fourier transform includes a first fourier transform based on a first sequence length, a second fourier transform based on a second sequence length, and a corresponding twiddle factor, wherein the signal to be processed satisfies a signal sparsity threshold, a product of the first sequence length and the second sequence length is a target sequence length of the large-point fourier transform, and the second sequence length matches sequence length information of the signal to be processed; in step S2, the signal processing apparatus 1 repeatedly performs the second fourier transform on the product of the first fourier transform result and the twiddle factor according to the second sequence length to obtain a resultant signal obtained by the large-point fourier transform, wherein the first fourier transform result corresponds to a signal sequence corresponding to the second sequence length in the signal to be processed; wherein the Fourier transform comprises an FFT or IFFT. Here, the signal processing apparatus 1 includes, but is not limited to, an electronic product for fourier transforming a signal, such as a PRACH transmitter, UE, etc. generating a preamble sequence in LTE, which includes an electronic apparatus capable of automatically performing numerical calculation and information processing according to instructions set in advance or stored, and hardware thereof includes, but is not limited to, a microprocessor, an Application Specific Integrated Circuit (ASIC), a programmable gate array (FPGA), a digital processor (DSP), an embedded apparatus, etc. Here, the base station refers to a device, such as an eNB base station, which connects a fixed part and a radio part in a mobile communication system and connects to a mobile station by radio transmission over the air. Here, the UE refers to a part of terminating wireless transmission from or to a network in a mobile communication device, and adapting the capability of a terminal device to the wireless transmission, that is, a device for a user to access to the mobile network, and includes, but is not limited to, any electronic product, such as a tablet computer, a smart phone, a PDA, a vehicle-mounted computer, etc., which can perform man-machine interaction with the user through a keyboard, a touch panel, or a voice control device, and can perform mutual transmission and reception of signals with a base station through the mobile network to achieve transmission of mobile communication signals. Here, the mobile network includes, but is not limited to, GSM, 3G, LTE-Advanced, Wi-Fi, WiMax, WCDMA, CDMA2000, TD-SCDMA, HSPA, LTD, etc. It should be understood by those skilled in the art that the above-mentioned signal processing apparatus 1, UE and base station are only examples, and other existing or future signal processing apparatuses 1, UEs or base stations may be applicable to the present invention, and are included in the scope of the present invention and are herein incorporated by reference.
Specifically, in step S1, the signal processing apparatus 1 converts a large-point fourier transform corresponding to a signal to be processed into a two-dimensional small-point fourier transform, wherein the two-dimensional small-point fourier transform includes a first fourier transform based on a first sequence length, a second fourier transform based on a second sequence length, and a corresponding twiddle factor, wherein the signal to be processed satisfies a signal sparsity threshold, a product of the first sequence length and the second sequence length is a target sequence length of the large-point fourier transform, and the second sequence length matches sequence length information of the signal to be processed. Here, the matching of the second sequence length with the sequence length information of the signal to be processed means that the second sequence length is greater than or equal to the sequence length of the signal to be processedDegree information, e.g. size requirements for Fourier transform such as 2n。
For example, assume that it is desired to convert the length to N1Is carried out for a finite length sequence x (N) of N ═ N1N2Point Fourier transform such as FFT operation, i.e. x (N) is only in the range of N0-N1If the value of-1 is "1", and if there is another N, x (N) ═ 0, then the finite length sequence x (N) satisfies the signal sparsity threshold, then in step S1, when the signal processing apparatus 1 performs FFT operation on x (N), the large-point fourier transform corresponding to x (N) can be converted into a two-dimensional small-point fourier transform, for example, according to the Cooley-Tukey FFT algorithm, N ═ N of x (N) × can be obtained1N2Point fourier transform, as explained with FFT as an example:
wherein,n＝N2n1+n2，k＝N1k2+k1then, in step S1, the signal processing device 1 converts the large-point fourier transform corresponding to x (N) into a two-dimensional small-point fourier transform, i.e., N2Sub N1Point FFT and N1Sub N2A point FFT, wherein the two-dimensional decimal point Fourier transform comprises a first Fourier transform based on a first sequence length, equation (3)Corresponding twiddle factorIf N24576 and x (N) are assumed to have a sequence length of 839, the sequence of x (N) may be zero-padded, and if the size requirement of FFT is satisfied, e.g., the sequence of x (N) is zero-padded to 1024, the large-point FFT of N24576 may be converted into a two-dimensional small-point FFT of N24 × 1024, i.e., 1024 times of 24-point FFT are performed first, and then 24 times of 1024-point FFT are performedThe number of dimension points is FFT.
It should be understood by those skilled in the art that the above-mentioned manner of transforming a large-point fourier transform into a two-dimensional small-point fourier transform is merely exemplary, and other existing or hereafter-occurring manners of transforming a large-point fourier transform into a two-dimensional small-point fourier transform may be applicable to the present invention, and are included within the scope of the present invention and are incorporated herein by reference.
In step S2, the signal processing apparatus 1 repeatedly performs the second fourier transform on the product of the first fourier transform result and the twiddle factor according to the second sequence length to obtain a resultant signal obtained by the large-point fourier transform, wherein the first fourier transform result corresponds to a signal sequence corresponding to the second sequence length in the signal to be processed; wherein the Fourier transform comprises an FFT or IFFT. Specifically, in step S2, the signal processing apparatus 1 first performs a first fourier transform based on the first sequence length on the signal to be processed based on each second sequence length, to obtain a corresponding first fourier transform result; then, the second fourier transform is repeatedly performed on the product of the first fourier transform result and the twiddle factor according to the second sequence length to obtain a resultant signal obtained by the large-point fourier transform.
For example, as described above, in step S1, the signal processing apparatus 1 decomposes x (N) into N2Each length is N1When expressed in a matrix, the sequence of (1) has:
if orderThenIf the sequence length of x (N) is 839 and a large-point FFT with N ═ 23576 needs to be performed on the sequence length, in step S1, the signal processing apparatus 1 may zero-fill the sequence of x (N) to obtain N ═ 24 × 1024, N ═ 24 ×, N1＝24，N2In step S1, the signal processing device 1 converts the large-point FFT with N24576 into a two-dimensional small-point FFT with N24 × 1024, and the corresponding matrixIf the decomposition matrix corresponding to the x (n) sequence does not satisfy that only the first column has a value, the matrix may be converted into a matrix satisfying the value of only the first column by means of, for example, a block matrix, a matrix transformation, or the like, in step S2, the signal processing apparatus 1 first performs a first fourier transform based on each second sequence length on the signal to be processed to obtain a corresponding first fourier transform result, if the matrix satisfies the value of only the first column, based on equation (3):
when n is2When the content is equal to 0, the content,wherein,
when n is2When the number is equal to 1, the alloy is put into a container,
wherein n is2＝0，x'(n)＝x(0)，n2When the number is equal to 1, the alloy is put into a container,
when n is2When the number is equal to 2, the alloy is put into a container,
wherein n is2When 0, x' (n) is x (0), n2When the number is equal to 1, the alloy is put into a container,
n2when the number is equal to 2, the alloy is put into a container,
……
by analogy, as can be seen from the above analysis, in step S2, the signal processing apparatus 1 first obtains the length n of each second sequence2A corresponding first Fourier transform result, wherein the first Fourier transform result corresponds to a signal sequence corresponding to the second sequence length in the signal to be processed, and the first Fourier transform result only corresponds to the second sequence lengthWherein the first Fourier transform result corresponds to the length N of the second sequence in the signal x (N) to be processed2A corresponding signal sequence; then, in step S2, the signal processing device 1 again follows the second sequence length N2As can be seen from the above derivation, the signal processing apparatus 1, when performing the second fourier transform, actually performs the second fourier transform on N of the new sequence x' (N) in step S2, by repeatedly performing the second fourier transform on the product of the first fourier transform result and the twiddle factor to obtain the resultant signal obtained by the large-point fourier transform2Point N1Second decimal point FFT, i.e. only N has to be performed2Point N1The small-point FFT of the second dimension omits N in the traditional large-point FFT1Point N2The small number of points FFT in this dimension. The invention realizes the application of only small pointsThe Fourier transform of the large point number can be realized by adding the multiplication factor to the Fourier transform of the number, and compared with the existing large point number Fourier algorithm, the algorithm complexity is reduced, and the resource expense of hardware equipment is also reduced.
It will be understood by those skilled in the art that the matrix representation of the signals to be processed is merely exemplary, and other existing or future matrix representations of the signals to be processed may be suitable for the present invention, and are included within the scope of the present invention and are hereby incorporated by reference.
It will be understood by those skilled in the art that the above-described manner of performing the second fourier transform is merely exemplary, and other existing or future manners of performing the second fourier transform, such as may be applicable to the present invention, are also included within the scope of the present invention and are hereby incorporated by reference.
The signal processing device 1 is continuously operated between the various steps. Specifically, in step S1, the signal processing apparatus 1 continuously converts a large-point fourier transform corresponding to a signal to be processed into a two-dimensional small-point fourier transform, wherein the two-dimensional small-point fourier transform includes a first fourier transform based on a first sequence length, a second fourier transform based on a second sequence length, and a corresponding twiddle factor, wherein the signal to be processed satisfies a signal sparsity threshold, a product of the first sequence length and the second sequence length is a target sequence length of the large-point fourier transform, and the second sequence length matches sequence length information of the signal to be processed; in step S2, the signal processing apparatus 1 repeatedly performs the second fourier transform on the product of the first fourier transform result and the twiddle factor according to the second sequence length to obtain a resultant signal obtained by the large-point fourier transform, wherein the first fourier transform result corresponds to the signal sequence corresponding to the second sequence length in the signal to be processed; wherein the Fourier transform comprises an FFT or IFFT. It should be understood by those skilled in the art that "continuously" means that each device of the signal processing apparatus 1 continuously performs the conversion of the two-dimensional decimal fourier transform and the repeated execution of the second fourier transform, respectively, until the signal processing apparatus 1 stops the conversion of the two-dimensional decimal fourier transform for a longer time.
Fig. 5 shows a flow chart of a method for implementing signal processing based on a large-point fourier transform according to a preferred embodiment of the present invention.
Wherein, the signal processing apparatus 1 includes step S3 ', step S4', step S1 ', and step S2'. Specifically, in step S3', the signal processing apparatus 1 takes the ZC root sequence to be transmitted by the PRACH as the signal to be processed; in step S4', the signal processing apparatus 1 performs cyclic shift on the signal to be processed to obtain a target sequence length of the large-point fourier transform; in step S1', the signal processing apparatus 1 converts a large-point fourier transform corresponding to a signal to be processed into a two-dimensional small-point fourier transform, wherein the two-dimensional small-point fourier transform includes a first fourier transform based on a first sequence length, a second fourier transform based on a second sequence length, and a corresponding twiddle factor, wherein the signal to be processed satisfies a signal sparsity threshold, a product of the first sequence length and the second sequence length is a target sequence length of the large-point fourier transform, and the second sequence length matches sequence length information of the signal to be processed; in step S2', the signal processing apparatus 1 repeatedly performs the second fourier transform on the product of the first fourier transform result and the twiddle factor according to the second sequence length to obtain a resultant signal obtained by the large-point fourier transform, wherein the first fourier transform result corresponds to the signal sequence corresponding to the second sequence length in the signal to be processed; wherein the Fourier transform comprises an FFT or IFFT. Here, the contents of step S1 'and step S2' are the same as or similar to the contents of the corresponding steps in the embodiment of fig. 4, and are not repeated for brevity and are included herein by way of reference.
Specifically, in step S3', the signal processing apparatus 1 takes the ZC root sequence to be transmitted through the PRACH as the signal to be processed. For example, assume that in a 3GPP LTE system, when a UE initiates a random access procedure, a physical layer at a UE end learns parameter information of a random access preamble SEQUENCE, such as a logical ROOT SEQUENCE index RACH _ ROOT _ SEQUENCE, from an upper layer, and obtains an actually used u by looking up a table (for example, looking up tables 5.7.2-4 and 5.7.2-5 in 3GPP protocols TS 362.11-870) according to the parameter to generate a ZC ROOT SEQUENCE:
according to parameters such as format preamble format of the random access preamble sequence, cyclic shift value configuration Ncs, preamble sequence group type identifier High-speed-flag, and the like, the length and cyclic shift value of the random access preamble ZC sequence are determined, then in step S3', the signal processing device 1 may use the ZC root sequence to be transmitted through the PRACH as the signal to be processed, as shown in fig. 3, a schematic diagram of the transmission process of the PRACH at the UE end.
In step S4 ', the signal processing apparatus 1 performs cyclic shift on the signal to be processed to obtain the target sequence length of the large-point fourier transform, for example, as described above, in step S4', the signal processing apparatus 1 may determine the number of bits that can perform cyclic shift on the ZC root sequence by the parameter cyclic shift value configuration Ncs to obtain the target sequence length of the large-point fourier transform, for example, assuming that in step S3 ', the signal processing apparatus 1 obtains preamble sequence format preamble format 0 by using a random access channel configuration index prach-configuration index lookup table, corresponding to the cyclic shift value Ncs 13, the length Nzc 839 of the ZC root sequence, and then in step S4', the signal processing apparatus 1 performs cyclic shift on the ZC root sequence according to the cyclic shift value Ncs 13 to obtain the target sequence length of the large-point fourier transform, such as 76.
Preferably, in step S3', the signal processing apparatus 1 may further perform zero padding on the ZC root sequence to obtain the signal to be processed, wherein the sequence length information of the signal to be processed matches the length information of the ZC root sequence. For example, in step S3 ', the signal processing device 1 first obtains preamble format 0 by table lookup of the rach-configuration index, where the corresponding cyclic shift value Ncs is 13 and the length Nzc of the ZC root sequence is 839, and then in step S3', the signal processing device 1 may further perform zero padding on the ZC root sequence, such as zero padding the ZC root sequence to 1024 so as to satisfy the size of fourier transform, and obtain the signal to be processed, where the sequence length information of the signal to be processed matches the length information of the ZC root sequence.
More preferably, the signal processing apparatus 1 further includes step S5 '(not shown) and step S6' (not shown). Specifically, in step S5', the signal processing apparatus 1 takes the sequence length information of the zero-padded signal to be processed as the second sequence length; in step S6', the signal processing apparatus 1 determines the first sequence length from the target sequence length and the second sequence length.
Specifically, in step S5', the signal processing apparatus 1 takes the sequence length information of the zero-padded signal to be processed as the second sequence length. For example, as in the above example, in step S3 ', the signal processing apparatus 1 zero-fills the ZC root sequence to 1024, and in step S5', the signal processing apparatus 1 takes the sequence length information of the ZC root sequence after zero-filling as the second sequence length, that is, N2＝1024。
In step S6', the signal processing apparatus 1 determines the first sequence length from the target sequence length and the second sequence length. For example, assuming that the signal processing device 1 obtains the target sequence length of the large-point fourier transform as N24576 in step S4', in the following example, the signal processing device 1 determines the second sequence length, that is, N, in step S5 ″2When the signal processing apparatus 1 is determined to be 1024, in step S6', the signal processing apparatus 1 may compare N/N2As the length of the first sequence, i.e. N1＝24。
Preferably, the signal processing apparatus 1 further includes step S7 '(not shown), and in particular, in step S7', the signal processing apparatus 1 inserts a corresponding cyclic prefix in the resultant signal obtained by the large-point fourier transform for transmission via the PRACH. For example, assuming that in step S4 ', the target sequence length for which the signal processing apparatus 1 obtains the large-point fourier transform is N24576, then in step S7', the signal processing apparatus 1 inserts a corresponding cyclic prefix CP into a resultant signal y (N) through which the large-point fourier transform is performed in step S2 'on the ZC root sequence acquired in step S3' for transmission through the PRACH, as shown in fig. 3.
More preferably, in step S7', the signal processing apparatus 1 may further copy, when the corresponding preamble format includes format 2 or 3, the resultant signal obtained through the large-point fourier transform, and insert a corresponding cyclic prefix into the copied resultant signal for transmission via the PRACH. For example, assuming that in step S3 ', the ZC root sequence obtained by the signal processing device 1 is in preamble format 2 or 3 to generate a preamble sequence, and in step S4 ', the signal processing device 1 obtains a target sequence length of the large-point fourier transform as N2 × 24576, then in step S7 ', the signal processing device 1 will first copy the result signal obtained by performing the large-point fourier transform on the ZC root sequence obtained in step S3 ' in step S2 ', and then insert a corresponding cyclic prefix CP into the copied result signal for transmission via the PRACH, as shown in fig. 3.
It should be noted that the present invention may be implemented in software and/or in a combination of software and hardware, for example, as an Application Specific Integrated Circuit (ASIC), a general purpose computer or any other similar hardware device. In one embodiment, the software program of the present invention may be executed by a processor to implement the steps or functions described above. Also, the software programs (including associated data structures) of the present invention can be stored in a computer readable recording medium, such as RAM memory, magnetic or optical drive or diskette and the like. Further, some of the steps or functions of the present invention may be implemented in hardware, for example, as circuitry that cooperates with the processor to perform various steps or functions.
In addition, some of the present invention can be applied as a computer program product, such as computer program instructions, which when executed by a computer, can invoke or provide the method and/or technical solution according to the present invention through the operation of the computer. Program instructions which invoke the methods of the present invention may be stored on a fixed or removable recording medium and/or transmitted via a data stream on a broadcast or other signal-bearing medium and/or stored within a working memory of a computer device operating in accordance with the program instructions. An embodiment according to the invention herein comprises an apparatus comprising a memory for storing computer program instructions and a processor for executing the program instructions, wherein the computer program instructions, when executed by the processor, trigger the apparatus to perform a method and/or solution according to embodiments of the invention as described above.
It will be evident to those skilled in the art that the invention is not limited to the details of the foregoing illustrative embodiments, and that the present invention may be embodied in other specific forms without departing from the spirit or essential attributes thereof. The present embodiments are therefore to be considered in all respects as illustrative and not restrictive, the scope of the invention being indicated by the appended claims rather than by the foregoing description, and all changes which come within the meaning and range of equivalency of the claims are therefore intended to be embraced therein. Any reference sign in a claim should not be construed as limiting the claim concerned. Furthermore, it is obvious that the word "comprising" does not exclude other elements or steps, and the singular does not exclude the plural. A plurality of units or means recited in the apparatus claims may also be implemented by one unit or means in software or hardware. The terms first, second, etc. are used to denote names, but not any particular order.
Claims (14)
1. A method for processing a signal based on a large-point fourier transform, wherein the method comprises the steps of:
a, converting a large-point Fourier transform corresponding to a signal to be processed into a two-dimensional small-point Fourier transform, wherein the two-dimensional small-point Fourier transform comprises a first Fourier transform based on a first sequence length, a second Fourier transform based on a second sequence length and a corresponding twiddle factor, and the signal to be processed meets a signal sparsity threshold, and the first sequence length and the second sequence length meet the signal sparsity thresholdThe product of the column lengths is the length of the target sequence of the large-point Fourier transform, and the length of the second sequence is greater than or equal to the sequence length information of the signal to be processed, wherein if the length is N1The signal to be processed is only N is 0-N1-1 has a value, and the other n is 0, then the signal to be processed satisfies the signal sparsity threshold;
b, obtaining a first Fourier transform result corresponding to each natural number smaller than the second sequence length, and repeatedly executing the second Fourier transform on the product of the first Fourier transform result and the twiddle factor according to the second sequence length to obtain a result signal obtained by the large-point Fourier transform, wherein the first Fourier transform result corresponds to a signal sequence corresponding to the second sequence length in the signal to be processed;
wherein the Fourier transform comprises an FFT or IFFT.
2. The method of claim 1, wherein the method further comprises:
x, taking a ZC root sequence to be transmitted through the PRACH as the signal to be processed;
-cyclically shifting the signal to be processed to obtain a target sequence length for the large point number fourier transform.
3. The method of claim 2, wherein the step x comprises:
-zero padding the ZC root sequence to obtain the signal to be processed, wherein the sequence length information of the signal to be processed matches the length information of the ZC root sequence.
4. The method of claim 3, wherein the method further comprises:
-taking the sequence length information of the zero-padded signal to be processed as the second sequence length;
-determining the first sequence length based on the target sequence length and the second sequence length.
5. The method of any of claims 2 to 4, wherein the method further comprises:
r inserts corresponding cyclic prefix in the result signal obtained by the large-point Fourier transform for sending through PRACH.
6. The method of claim 5, wherein the step r comprises:
-for the resulting signal resulting from the large point number fourier transform, when the corresponding preamble format comprises format 2 or 3, duplicating the resulting signal and inserting a corresponding cyclic prefix in the duplicated resulting signal for transmission via the PRACH.
7. A signal processing apparatus for processing a signal based on a large-point fourier transform, wherein the signal processing apparatus comprises:
the device comprises a conversion device and a processing device, wherein the conversion device is used for converting a large-point Fourier transform corresponding to a signal to be processed into a two-dimensional small-point Fourier transform, the two-dimensional small-point Fourier transform comprises a first Fourier transform based on a first sequence length, a second Fourier transform based on a second sequence length and a corresponding twiddle factor, the signal to be processed meets a signal sparsity threshold, the product of the first sequence length and the second sequence length is a target sequence length of the large-point Fourier transform, the second sequence length is greater than or equal to sequence length information of the signal to be processed, and if the length is N, the length is N1The signal to be processed is only N is 0-N1-1 has a value, and the other n is 0, then the signal to be processed satisfies the signal sparsity threshold;
executing means for obtaining a first fourier transform result corresponding to each natural number smaller than the second sequence length, and repeatedly executing the second fourier transform on a product of the first fourier transform result and the twiddle factor according to the second sequence length to obtain a resultant signal obtained by the large-point fourier transform, wherein the first fourier transform result corresponds to a signal sequence corresponding to the second sequence length in the signal to be processed;
wherein the Fourier transform comprises an FFT or IFFT.
8. The signal processing apparatus according to claim 7, wherein the signal processing apparatus further comprises:
a signal acquisition device, configured to use a ZC root sequence to be transmitted through a PRACH as the signal to be processed;
and the cyclic shift device is used for carrying out cyclic shift on the signal to be processed so as to obtain the length of the target sequence of the large-point Fourier transform.
9. The signal processing apparatus of claim 8, wherein the signal acquisition device is configured to:
-zero padding the ZC root sequence to obtain the signal to be processed, wherein the sequence length information of the signal to be processed matches the length information of the ZC root sequence.
10. The signal processing apparatus of claim 9, wherein the signal processing apparatus further comprises:
a second sequence determining device, configured to use sequence length information of the zero-padded signal to be processed as the second sequence length;
and the first sequence determining device is used for determining the first sequence length according to the target sequence length and the second sequence length.
11. The signal processing apparatus according to any one of claims 8 to 10, further comprising:
and inserting a corresponding cyclic prefix into the result signal obtained by the large-point Fourier transform for transmission through the PRACH.
12. The signal processing apparatus of claim 11, wherein the insertion means is configured to:
-for the resulting signal resulting from the large point number fourier transform, when the corresponding preamble format comprises format 2 or 3, duplicating the resulting signal and inserting a corresponding cyclic prefix in the duplicated resulting signal for transmission via the PRACH.
13. A PRACH transmission apparatus, wherein the PRACH transmission apparatus comprises the signal processing apparatus of any one of claims 7 to 12.
14. A user equipment, wherein the user equipment comprises a signal processing device according to any one of claims 7 to 12.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210488471.2A CN103838703B (en) | 2012-11-26 | 2012-11-26 | Method and apparatus for realizing signal transacting based on big points Fourier transformation |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210488471.2A CN103838703B (en) | 2012-11-26 | 2012-11-26 | Method and apparatus for realizing signal transacting based on big points Fourier transformation |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103838703A CN103838703A (en) | 2014-06-04 |
| CN103838703B true CN103838703B (en) | 2017-11-24 |
Family
ID=50802219
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210488471.2A Active CN103838703B (en) | 2012-11-26 | 2012-11-26 | Method and apparatus for realizing signal transacting based on big points Fourier transformation |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103838703B (en) |
Families Citing this family (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR102477093B1 (en) * | 2015-10-13 | 2022-12-13 | 삼성전자주식회사 | Apparatus and Method for performing Fourier transform |
| CN106649199A (en) * | 2016-12-23 | 2017-05-10 | 东华大学 | Football robot extra-large point FFT algorithm based on SMP |
| DE102019208002A1 (en) * | 2019-05-31 | 2020-12-03 | Robert Bosch Gmbh | Method and device for processing a sensor signal |
| CN114189935B (en) * | 2020-09-15 | 2025-05-06 | 大唐移动通信设备有限公司 | A PRACH detection method, device, electronic device and storage medium |
| CN114356409B (en) * | 2021-01-29 | 2024-06-18 | 展讯半导体(成都)有限公司 | Method, equipment, device and storage medium for processing zero point DFT with modulo 6 as base |
| CN115577221A (en) * | 2022-11-18 | 2023-01-06 | 北京红山微电子技术有限公司 | Signal processing method and device, twiddle factor optimization method and terminal equipment |
| CN119415814B (en) * | 2024-10-21 | 2025-11-04 | 杭州电子科技大学 | A Fast FFT Processing Method for Extremely Large Number of Points |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101504638A (en) * | 2009-03-19 | 2009-08-12 | 北京理工大学 | Point-variable assembly line FFT processor |
| CN101860395A (en) * | 2010-05-31 | 2010-10-13 | 合肥东芯通信股份有限公司 | Method and equipment for generating preamble sequence |
| CN101958855A (en) * | 2009-07-13 | 2011-01-26 | 联芯科技有限公司 | Method, device and system for generating PRACH baseband signal |
| CN102004720A (en) * | 2010-11-09 | 2011-04-06 | 无锡中星微电子有限公司 | Variable-length fast fourier transform circuit and implementation method |
| CN102185685A (en) * | 2011-05-11 | 2011-09-14 | 京信通信系统（中国）有限公司 | Random access signal transmission method and system for mobile terminal |
| CN102364456A (en) * | 2011-10-18 | 2012-02-29 | 广州晶锐信息技术有限公司 | 64-point fast Fourier transform (FFT) calculator |
| CN102387108A (en) * | 2010-08-30 | 2012-03-21 | 中兴通讯股份有限公司 | Transmission method and device for physical random access channel signal |
-
2012
- 2012-11-26 CN CN201210488471.2A patent/CN103838703B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101504638A (en) * | 2009-03-19 | 2009-08-12 | 北京理工大学 | Point-variable assembly line FFT processor |
| CN101958855A (en) * | 2009-07-13 | 2011-01-26 | 联芯科技有限公司 | Method, device and system for generating PRACH baseband signal |
| CN101860395A (en) * | 2010-05-31 | 2010-10-13 | 合肥东芯通信股份有限公司 | Method and equipment for generating preamble sequence |
| CN102387108A (en) * | 2010-08-30 | 2012-03-21 | 中兴通讯股份有限公司 | Transmission method and device for physical random access channel signal |
| CN102004720A (en) * | 2010-11-09 | 2011-04-06 | 无锡中星微电子有限公司 | Variable-length fast fourier transform circuit and implementation method |
| CN102185685A (en) * | 2011-05-11 | 2011-09-14 | 京信通信系统（中国）有限公司 | Random access signal transmission method and system for mobile terminal |
| CN102364456A (en) * | 2011-10-18 | 2012-02-29 | 广州晶锐信息技术有限公司 | 64-point fast Fourier transform (FFT) calculator |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103838703A (en) | 2014-06-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103838703B (en) | Method and apparatus for realizing signal transacting based on big points Fourier transformation | |
| WO2018200577A1 (en) | Digital communication using lattice division multiplexing | |
| US20110122938A1 (en) | Communication device and method | |
| CN102185685A (en) | Random access signal transmission method and system for mobile terminal | |
| CN114090948A (en) | Twiddle factor determination method and device, electronic equipment and storage medium | |
| CN101640550B (en) | Method and device for detecting precursor | |
| CN102932123B (en) | Method and system for detecting sounding reference signal (SRS) | |
| CN102104951A (en) | Method and device for timing shift estimation | |
| CN106470179A (en) | Mobile terminal upward signal generation method and device | |
| CN104821856B (en) | A Noise Power Estimation Method for OFDM Spectrum Sensing | |
| CN103873219B (en) | The IDFT and subcarrier maps implementation method of a kind of PRACH baseband signals | |
| CN101408871B (en) | Efficient realization method and device of digital cross-correlator | |
| CN102958188B (en) | Random access lead code generating method | |
| CN102832981A (en) | Method and apparatus for determining time synchronization position | |
| CN101789916B (en) | Signal processing method, system and equipment based on relevance | |
| CN115396272A (en) | Data processing method, device, equipment and storage medium | |
| KR101183658B1 (en) | Apparatus and method of executing discrete fourier transform fast | |
| CN104393947A (en) | Method and device for realizing frequency domain ZC (zadoff-chu) sequence | |
| CN101860508B (en) | Multiplexing device and method for FFT transform | |
| CN106612153B (en) | The synchronous method designed suitable for the synchronizing symbol of general filtering multicarrier waveform | |
| CN104202280A (en) | Hardware implementation for channel equalization of MIMO-OFDM (multiple-input multiple-output and orthogonal frequency division multiplexing) system | |
| CN118826982A (en) | Signal sending method, device and communication equipment | |
| JP5515910B2 (en) | Sequence generation device, wireless communication device, sequence generation method, and sequence generation program | |
| CN103988565B (en) | Accidental access method, user equipment, base station and system | |
| Orozco-Galvan et al. | Reconfigurable architecture based on FPGA for OFDM transmitter |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CP03 | Change of name, title or address |
Address after: No. 388, ningqiao Road, Pudong New Area free trade test area, Shanghai City, Shanghai Patentee after: NOKIA SHANGHAI BELL Co.,Ltd. Address before: 201206 Pudong New Area Jinqiao Ning Road, Shanghai, No. 388 Patentee before: ALCATEL-LUCENT SHANGHAI BELL Co.,Ltd. |
|
| CP03 | Change of name, title or address | ||
| CP03 | Change of name, title or address |
Address after: No.388 ningqiao Road, pilot Free Trade Zone, Pudong New Area, Shanghai, 201206 Patentee after: Nokia Communications (Shanghai) Co., Ltd. Country or region after: China Address before: No.388 ningqiao Road, pilot Free Trade Zone, Pudong New Area, Shanghai, 201206 Patentee before: NOKIA SHANGHAI BELL Co.,Ltd. Country or region before: China |