Carrier aggregation method, device, communication equipment, storage medium and program product

Abstract

The present application provides a carrier aggregation method, apparatus, communication equipment, storage medium and program product, which can be used in the field of communication technology. The method includes: obtaining multiple first carrier signals to be aggregated; the first carrier signal is a time domain signal; for each first carrier signal, when the rectangular window length required for filtering is less than the length of the first carrier signal, if the length of the first carrier signal is greater than the preset FFT length, then performing FFT based on a specific base on the first carrier signal to obtain multiple second carrier signals, and performing butterfly operation and frequency domain filtering on the multiple second carrier signals to obtain a third carrier signal; performing carrier aggregation on the multiple third carrier signals to obtain a fourth carrier signal; performing IFFT on the fourth carrier signal, and intercepting data of the target transmission length from the signal after IFFT to obtain a fifth carrier signal. The present application reduces the amount of computation and reduces the occupation of memory resources.

Description

Technical Field

[0001] The present application relates to the field of communication technology, and in particular to a carrier aggregation method, apparatus, communication equipment, storage medium, and program product. Background Art

[0002] To meet the transmission rate requirements of communication scenarios, carrier aggregation (CA) is often used to aggregate multiple carrier signals when wireless spectrum resources are limited. This improves resource utilization and increases bandwidth. Based on the continuity of the spectrum, CA is generally categorized as contiguous or non-contiguous.

[0003] The frequency domain solution for non-continuous carrier aggregation is as follows: k-fold upsampling, k-based fast Fourier transform (FFT), frequency domain filtering, superposition operation, and then an inverse fast Fourier transform (IFFT) operation as a whole.

[0004] However, the computational complexity of the above frequency domain solution is relatively high and requires more memory resources. Summary of the Invention

[0005] The present application provides a carrier aggregation method, apparatus, communication equipment, storage medium and program product to solve the problem of high computational complexity and the need to occupy more memory resources.

[0006] In a first aspect, the present application provides a carrier aggregation method, including:

[0007] Acquire a plurality of first carrier signals to be aggregated, wherein the first carrier signals are time domain signals;

[0008] For each of the first carrier signals, if the rectangular window length required for filtering is less than the length of the first carrier signal, and if the length of the first carrier signal is greater than a preset FFT length, performing an FFT based on a specific radix on the first carrier signal to obtain a plurality of second carrier signals, and performing a butterfly operation and frequency domain filtering on the plurality of second carrier signals to obtain a third carrier signal; the specific radix being obtained by rounding up the ratio of the length of the first carrier signal to the preset FFT length;

[0009] Carrier aggregating the plurality of third carrier signals to obtain a fourth carrier signal;

[0010] Perform IFFT on the fourth carrier signal, and intercept data of a target transmission length from the signal after IFFT to obtain a fifth carrier signal.

[0011] In some embodiments, performing butterfly operation and frequency domain filtering on the plurality of second carrier signals to obtain a third carrier signal includes:

[0012] According to the transformation parameters and the rectangular window length, butterfly operation and frequency domain filtering are performed on multiple second carrier signals to obtain a third carrier signal; the transformation parameters are obtained by rounding up the ratio between the target transmission length and the length of the first carrier signal.

[0013] In some embodiments, performing butterfly operation and frequency domain filtering on the plurality of second carrier signals according to the transformation parameter and the rectangular window length to obtain a third carrier signal includes:

[0014] If the transformation parameter is an even number, performing complex multiplication and complex addition operations on the data located in the first second preset length and the data located in the second rear preset length in the sixth carrier signal, respectively, to obtain a first intermediate calculated signal and a second intermediate calculated signal; the sixth carrier signal is obtained by splicing a plurality of the second carrier signals; and the second preset length is half the length of the rectangular window;

[0015] The first intermediate operation signal and the second intermediate operation signal are reversely spliced ​​to obtain a third carrier signal.

[0016] In some embodiments, performing butterfly operation and frequency domain filtering on the plurality of second carrier signals according to the transformation parameter and the rectangular window length to obtain a third carrier signal includes:

[0017] If the transformation parameter is an odd number, performing complex multiplication and complex addition operations on data of the rectangular window length at the center position of the sixth carrier signal to obtain a third intermediate operation signal; the sixth carrier signal is obtained by splicing a plurality of the fourth carrier signals;

[0018] The third intermediate operation signal is inverted to obtain a third carrier signal.

[0019] In some embodiments, further comprising:

[0020] For each of the first carrier signals, if the length of the first carrier signal is less than a preset FFT length, performing zero padding on the first carrier signal, and performing FFT and frequency domain filtering on the zero-padded first carrier signal to obtain a third carrier signal; the length of the zero-padded first carrier signal is equal to the preset FFT length;

[0021] For each of the first carrier signals, if the length of the first carrier signal is equal to a preset FFT length, performing FFT and frequency domain filtering on the first carrier signal to obtain a third carrier signal;

[0022] For each of the first carrier signals, if the length of the first carrier signal is greater than the preset FFT length, an FFT based on a specific base is performed on the first carrier signal to obtain multiple second carrier signals, and a butterfly operation and frequency domain filtering are performed on the multiple second carrier signals to obtain a third carrier signal; the specific base is obtained by rounding up the ratio between the length of the first carrier signal and the preset FFT length.

[0023] In some embodiments, performing FFT and frequency domain filtering on the first carrier signal to obtain a third carrier signal includes:

[0024] performing FFT on the first carrier signal to obtain a seventh carrier signal;

[0025] performing signal transformation processing on the seventh carrier signal according to a transformation parameter to obtain an eighth carrier signal; the transformation parameter is obtained by rounding up the ratio between the target transmission length and the length of the first carrier signal;

[0026] For the eighth carrier signal, data of the rectangular window length at the center position is selected as the third carrier signal.

[0027] In some embodiments, performing signal transformation processing on the seventh carrier signal according to the transformation parameter to obtain the eighth carrier signal includes:

[0028] If the transformation parameter is an even number, rotating the seventh carrier signal rightward by a symbol position of a first preset length to obtain an eighth carrier signal; the first preset length is half the length of the first carrier signal;

[0029] If the transformation parameter is an odd number, the seventh carrier signal is flipped to obtain an eighth carrier signal.

[0030] In some embodiments, performing carrier aggregation on a plurality of the third carrier signals to obtain a fourth carrier signal includes:

[0031] The plurality of third carrier signals are respectively assigned to corresponding frequency bands according to their corresponding sub-band identifiers, so as to implement carrier aggregation and obtain a fourth carrier signal.

[0032] In a second aspect, the present application provides a carrier aggregation device, including:

[0033] An acquisition module, configured to acquire a plurality of first carrier signals to be aggregated; the first carrier signals being time domain signals;

[0034] An FFT module is configured to, for each of the first carrier signals, perform an FFT based on a specific radix on the first carrier signal to obtain a plurality of second carrier signals if the length of the first carrier signal is greater than a preset FFT length, and to perform a butterfly operation and frequency domain filtering on the plurality of second carrier signals to obtain a third carrier signal, when a rectangular window length required for filtering is less than a length of the first carrier signal. The specific radix is ​​obtained by rounding up a ratio between the length of the first carrier signal and the preset FFT length.

[0035] an aggregation module, configured to perform carrier aggregation on a plurality of the third carrier signals to obtain a fourth carrier signal;

[0036] The IFFT module is configured to perform IFFT on the fourth carrier signal and intercept data of a target transmission length from the signal after IFFT to obtain a fifth carrier signal.

[0037] In a third aspect, the present application provides a communication device, comprising: a processor and a memory communicatively connected to the processor;

[0038] The memory stores computer-executable instructions;

[0039] The processor executes the computer-executable instructions stored in the memory to implement the carrier aggregation method as described in any one of the first aspects.

[0040] In a fourth aspect, the present application provides a computer-readable storage medium, wherein the computer-readable storage medium stores computer-executable instructions, and when the computer-executable instructions are executed by a processor, they are used to implement the carrier aggregation method described in any one of the first aspects.

[0041] In a fifth aspect, the present application provides a computer program product, including a computer program, which, when executed by a processor, implements the carrier aggregation method described in any one of the first aspects.

[0042] The carrier aggregation method, apparatus, communication equipment, storage medium and program product provided by the present application are similar to the related art in that k-fold upsampling is performed by interpolation and zero padding and then a basis k-FFT is performed, which is equivalent to performing FFT on the original signal and then expanding it k-1 times in the frequency domain in the frequency domain. However, the present application omits the upsampling operation and directly performs an FFT based on a specific base on the first carrier signal when the length of the first carrier signal is greater than the preset FFT length, thereby reducing the amount of computation. Moreover, since the data required for filtering can be obtained through FFT, there is no need to expand it k-1 times in the frequency domain. The butterfly operation and frequency domain filtering are directly combined, which further reduces the amount of computation and reduces the occupation of memory resources. BRIEF DESCRIPTION OF THE DRAWINGS

[0043] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present application and, together with the description, serve to explain the principles of the present application.

[0044] Figure 1 is a schematic diagram of a time domain solution in the related art;

[0045] Figure 2 is a schematic diagram of a frequency domain solution in the related art;

[0046] Figure 3 This is a schematic diagram of a large-point FFT operation process in the related art;

[0047] Figure 4 This is a schematic diagram of an application scenario provided by this application;

[0048] Figure 5 This is a flowchart of a carrier aggregation method provided by this application;

[0049] Figure 6 This is a schematic diagram of a carrier aggregation process provided by this application;

[0050] Figure 7 This is a flowchart of another carrier aggregation method provided by this application;

[0051] Figure 8 This is a flowchart of another carrier aggregation method provided by this application;

[0052] Figure 9 This is a flowchart of another carrier aggregation method provided by this application;

[0053] Figure 10 This is a schematic diagram of a p-FFT processing flow provided by this application;

[0054] Figure 11 This is a schematic diagram of a butterfly operation and frequency domain filtering operation provided by this application;

[0055] Figure 12 This is a schematic diagram of another carrier aggregation process provided by this application;

[0056] Figure 13 This is a structural diagram of a carrier aggregation device provided by this application;

[0057] Figure 14 This is a structural diagram of a communication device provided by this application.

[0058] The above drawings illustrate specific embodiments of the present application, which will be described in more detail below. These drawings and the textual description are not intended to limit the scope of the present application in any way, but rather to illustrate the concepts of the present application to those skilled in the art by reference to specific embodiments. DETAILED DESCRIPTION

[0059] Exemplary embodiments will be described in detail herein, with examples illustrated in the accompanying drawings. In the following description, when referring to the drawings, identical numerals in different figures represent identical or similar elements, unless otherwise indicated. The embodiments described in the following exemplary embodiments are not intended to represent all embodiments consistent with the present application. Rather, they are merely examples of apparatus and methods consistent with certain aspects of the present application, as detailed in the appended claims.

[0060] To meet the transmission rate requirements of communication scenarios, such as the data service rate requirements of satellite communications, carrier aggregation (CA) is often used to combine multiple carrier signals when wireless spectrum resources are limited, thereby improving resource utilization and increasing bandwidth. Based on spectrum continuity, CA is generally categorized as contiguous or non-contiguous. Non-contiguous CA does not require carrier contiguousness, offering greater flexibility but also greater aggregation difficulty.

[0061] Non-continuous carrier aggregation schemes can be categorized into time-domain and frequency-domain schemes. The difference lies in the way low-rate data is upsampled, filtered, and aggregated.

[0062] Below, taking the need to aggregate N signals within a specified time t, these N signals are non-continuous carrier signals, and the target transmission rate q of the transmitter is k times the symbol rate v (unit: symbol / second) of the signal as an example, the time domain solution and frequency domain solution in the related technology are introduced respectively.

[0063] The time domain solution in the related art is to perform upsampling, low-pass filtering, and carrier aggregation in the time domain in sequence. Figure 1 , which shows a time domain solution. First, each signal is upsampled k times (k-1 zero values ​​are inserted between consecutive adjacent symbols) to obtain N upsampled signals. Since k-fold upsampling will produce k-1 image frequencies in the frequency domain, each upsampled signal needs to be convolved with the time domain data through a Q-order low-pass filter to remove the image frequencies. Then, the time domain signal frequency shift operation is performed on each of the N signals. After the time domain signal frequency shift operation, the N signals are superimposed on the time domain signals to obtain an aggregated signal. Then, L length of data is intercepted from the aggregated signal and the L length of data is transmitted.

[0064] The k-fold upsampling and time-domain filtering require NQkvt multiplications and N(Q-1)kvt additions, resulting in high computational complexity. Because time-domain filtering involves convolution of the data with a low-pass filter, computational complexity increases exponentially with the filter coefficients, data length, and number of carriers.

[0065] The frequency domain solution in related technologies is to perform upsampling, FFT, frequency domain filtering, frequency domain carrier aggregation, and IFFT as a whole. Figure 2 , which shows a frequency domain solution. First, N signals are upsampled k times, and FFT is performed on the N upsampled signals to transform from the time domain to the frequency domain. The N frequency domain signals are frequency-domain filtered, and the N filtered signals are frequency-domain carrier aggregated. The aggregated signal is subjected to an overall IFFT, and then L-length data is intercepted from the IFFT signal, and the L-length data is sent. Since the time domain data is transformed into the frequency domain for filtering and the carrier is aggregated, the overall IFFT is performed, and the computational complexity is mainly in the N FFT operations and the 1 IFFT operation. Without considering the FFT capability of the chip, the FFT and IFFT of the frequency domain solution require (N+1)*log2(kvt) / 2 complex multiplications and (N+1)*log2(kvt) complex additions, which is less computationally complex than the time domain solution. However, in actual applications, the large-point FFT operation in the frequency domain solution poses a challenge to the chip's computing performance.

[0066] The following is a specific processing flow of a frequency domain solution in practical applications:

[0067] Step 1: The transmitter completes the coding, modulation, shaping and filtering processes to generate a basic signal. The symbol rate of the basic signal is v. The basic signal includes n symbols generated within a time t, where n = vt, and n can be regarded as the length of the basic signal.

[0068] Step 2: The transmitter calculates the symbol length L required to be generated at time t based on the target transmission rate q, and calculates the number of sampling points s for each subband based on the sampling rate b of each subband. The formula is as follows:

[0069] L=qt

[0070] s=bt

[0071] Where q is the target transmission rate (in symbols per second), L is the symbol length required for one transmission (in symbols), b is the subband sampling rate, and s is the number of sampling points in the subband. The target transmission rate and sampling rate are known parameters.

[0072] Step 3: The transmitter performs k-fold upsampling on each basic signal.

[0073] For example, the symbol rate of the base signal is increased to the target transmission rate by interpolation and zero padding. The upsampled signal introduces k-1 image frequencies, which are subsequently removed by filtering. The value of k is obtained from the following formula:

[0074] k=ceil(L / n)

[0075] Here, ceil represents a ceiling function. Specifically, ceil(x) is the smallest integer greater than or equal to x.

[0076] Step 4: Perform FFT operation on each upsampled signal to convert the time domain signal into a frequency domain signal.

[0077] The length of the upsampled signal is kn, requiring an FFT operation with kn points. The chip has a length limit for the FFT function's input and output; the FFT input data must be no longer than the specified length. If the upsampled signal is longer than the specified length, the upsampled signal must be decomposed into multiple data points of the specified length, and then FFTs are performed on each of them, followed by a butterfly operation, to obtain a frequency domain signal of length kn.

[0078] For example, see Figure 3 , which shows a large-point FFT operation process, where the upsampled data refers to the signal obtained after k-fold upsampling in step 3. For each upsampled signal, a decimation-based radix-k-FFT operation is first performed. The radix-k-FF operation includes: for each upsampled signal, decimating the data at intervals of k to obtain k decimated data, where the length of the decimated data is n, and determining whether n is greater than a specified length m.

[0079] Continue to see Figure 3 In the first case, if n is less than m, the extracted data is padded with zeros to make the length of the zero-padded data equal to m, and then an m-point FFT operation is performed on the zero-padded data. A butterfly operation is performed on the data obtained by the m-point FFT operation to obtain the data after the base k-FFT operation, and the data is output.

[0080] The second case ( Figure 3 (not shown), if n is equal to m, then the extracted data is directly subjected to an m-point FFT operation, and a butterfly operation is performed on the data obtained by the m-point FFT operation to obtain data after a k-based FFT operation, and the data is output.

[0081] Continue to see Figure 3In the third case, if n is greater than m, a radix p-FFT operation is first performed on the decimated data, and then a butterfly operation is performed on the data after the radix p-FFT operation to obtain the data after the radix k-FFT operation, and the data is output. The radix p-FFT operation includes: first calculating the decimation interval p, then decimating data at intervals p for each decimated data to obtain p new decimated data, and the length of the new decimated data is L1; then determining whether L1 is equal to the specified length m; if L1 is equal to m, performing an m-point FFT operation on the new decimated data; if L1 is less than m, padding the new decimated data with zeros to make the length of the zero-padded data equal to m, then performing an m-point FFT operation on the zero-padded data, and performing a butterfly operation on the data obtained by the m-point FFT operation to obtain the data after the radix p-FFT operation.

[0082] The p-value is obtained by the following formula:

[0083] p=ceil(L1 / m)

[0084] Wherein, L1 is the length of the extracted data, and m is the specified length.

[0085] Therefore, when the base k-FFT is combined with the base p-FFT, the intermediate memory size required to implement the FFT operation is 2m+(2p-1)m+(2k-1)pm symbols, and the complex multiplication is k[p*log2(m) / 2+(p 2 -p)m]+(k 2 -k)pm times, complex addition is k[p*log2(m)+(p 2 -p)m]+(k 2 -k)pm times.

[0086] Step 5: Perform frequency domain filtering on each FFT signal.

[0087] Specifically, frequency domain filtering is implemented by adding a rectangular window to the frequency domain and intercepting data of a specific length. For example, if the signal after FFT is intercepted with a length of l symbols starting from index i, the expressions of the rectangular window length l and index i are as follows:

[0088] l=skpm / L

[0089] i=kpm / 2-l / 2

[0090] Step 6: Frequency shift + carrier aggregation: According to the subband number, the filtered frequency domain signal is moved to the corresponding frequency band in a cyclic shift manner, and the filtered frequency domain signal is superimposed.

[0091] The complex addition operations required for aggregating N frequency domain signals are N kpm, and the intermediate memory size required for cyclic shift is at most L symbol lengths.

[0092] Step 7: Perform an IFFT operation on the frequency domain signal after the superposition operation to obtain the time domain signal.

[0093] Step 8: Truncate the time domain signal output by IFFT to a length of L, and transmit the time domain signal of length L.

[0094] Because frequency-domain filtering typically uses a rectangular window, the computational complexity of the above-mentioned frequency-domain solution is simpler than that of time-domain filtering. Furthermore, regardless of the number of carriers, only a single IFFT is required, so the computational complexity does not increase exponentially as with time-domain solutions. However, the k-fold upsampling in the frequency-domain solution introduces the effects of mirror frequencies. Performing FFT operations on large amounts of data increases computational complexity and memory usage. Furthermore, performing cyclic shifts on large amounts of data consumes a large amount of memory, posing a significant challenge to the chip's FFT capabilities.

[0095] Based on this, the present application proposes a carrier aggregation method, apparatus, communication equipment, storage medium and program product, aiming to solve the above technical problems.

[0096] In response to the complex signal processing problem of non-continuous carrier aggregation technology, this application optimizes the frequency domain solution in the relevant technology based on the signal data characteristics of the transmitting end. By omitting upsampling and simplifying frequency domain shifting, the amount of data processing is reduced. At the same time, it has the advantages of low computational complexity and simple process, which greatly saves load while increasing bandwidth.

[0097] The technical solutions of the embodiments of the present application can be applied to various communication systems, such as satellite communication systems, Long Term Evolution (LTE) systems, LTE frequency division duplex (FDD) systems, LTE time division duplex (TDD) systems, Universal Mobile Telecommunication System (UMTS), Worldwide Interoperability for Microwave Access (WiMAX) communication systems, future fifth generation (5G) communication systems or new radio access technology (NR), vehicle-to-XV2X (V2X), where V2X may include vehicle-to-network (V2N), vehicle-to-vehicle (V2V), vehicle-to-infrastructure (V2I), vehicle-to-pedestrian (V2P), etc., Long Term Evolution-Vehicle (LTE-V), Internet of Vehicles, and machine type communication (M2C). type communication (MTC), Internet of Things (IoT), Long Term Evolution-Machine (LTE-M), Machine to Machine (M2M), etc.

[0098] Figure 4 This is a schematic diagram of an application scenario provided by this application. Figure 4 As shown, the application scenario is a communication system, which may include at least two network devices, and this application does not limit this. Figure 4 The communication system 10 shown includes two network devices: a network device 101 and a network device 102 .

[0099] Each of the aforementioned network devices may be configured with multiple antennas. These multiple antennas may include at least one transmitting antenna for sending signals and at least one receiving antenna for receiving signals. Furthermore, each network device also includes a transmitter chain and a receiver chain. Those skilled in the art will appreciate that these may include multiple components related to signal transmission and reception (e.g., processors, modulators, multiplexers, demodulators, demultiplexers, or antennas). Therefore, network devices can communicate with each other using multi-antenna technology.

[0100] Optionally, the communication system may further include other network entities such as a network controller and a mobility management entity, but the embodiments of the present application are not limited thereto.

[0101] In the embodiment of the present application, the network device can be any device with wireless transceiver function. The device includes but is not limited to: evolved Node B (eNB), Radio Network Controller (RNC), Node B (NB), Base Station Controller (BSC), Base Transceiver Station (BTS), Home Base Station (e.g., Home evolved NodeB, or HomeNode B, HNB), Base Band Unit (BBU), Access Point (AP) in Wireless Fidelity (WIFI) system, wireless relay node, wireless backhaul node, transmission point (TP) or transmission and reception point (TRP), etc., and can also be a gNB in ​​5G, such as NR, system, or a transmission point (TRP or TP), one or a group of (including multiple antenna panels) antenna panels of a base station in a 5G system, or a network node constituting a gNB or a transmission point, such as a baseband unit (BBU) or a distributed unit (DU), etc.

[0102] In some deployments, a gNB may include a centralized unit (CU) and a DU. The gNB may also include an active antenna unit (AAU). The CU implements some gNB functions, while the DU implements some gNB functions. For example, the CU is responsible for processing non-real-time protocols and services, and implementing the functions of the radio resource control (RRC) and packet data convergence protocol (PDCP) layers. The DU is responsible for processing physical layer protocols and real-time services, and implementing the functions of the radio link control (RLC), media access control (MAC), and physical (PHY) layers. The AAU implements some physical layer processing functions, RF processing, and active antenna-related functions. Because RRC layer information ultimately becomes PHY layer information, or is converted from PHY layer information, in this architecture, higher-layer signaling, such as RRC layer signaling, can also be considered to be sent by the DU, or by both the DU and the AAU. It is understood that a network device can be a device that includes one or more of a CU node, a DU node, or an AAU node. In addition, the CU may be classified as a network device in an access network (radio access network, RAN), or may be classified as a network device in a core network (core network, CN), which is not limited in this application.

[0103] In one application scenario, the communication system is a base station communication system. The network equipment in the base station communication system includes base stations and mobile stations. Several spatially separated base stations fully or partially cover the same area to achieve spatial diversity. Each base station can independently send signals to the mobile station, and the mobile station can receive signals from each base station.

[0104] In another application scenario, the communication system is a satellite communication system. The network equipment in the satellite communication system includes satellite equipment and ground equipment. Each satellite equipment can send a signal to the ground equipment respectively, and the ground equipment receives the signal from each satellite equipment.

[0105] For ease of description, this application refers to a network device that sends a signal as a sending end device, and a network device that receives a signal as a receiving end device.

[0106] It should be noted that the signals involved in this application can also be called data or other suitable names, and this application does not limit this.

[0107] The carrier aggregation method provided in this application is performed by a carrier aggregation apparatus, which is integrated into a communication device. The communication device can be provided as the above-mentioned network device.

[0108] The following specific embodiments describe in detail the technical solution of the present application and how the technical solution of the present application solves the above-mentioned technical problems. The following specific embodiments can be combined with each other, and the same or similar concepts or processes may not be repeated in some embodiments. The embodiments of the present application will be described below in conjunction with the accompanying drawings.

[0109] Figure 5 This is a flowchart of a carrier aggregation method provided by this application. Figure 5 As shown, the carrier aggregation method provided in this embodiment includes the following steps:

[0110] Step S101: Acquire a plurality of first carrier signals to be aggregated; the first carrier signals are time domain signals.

[0111] The multiple first carrier signals to be aggregated are non-continuous carrier signals. The symbol rate of the first carrier signal is v (in symbols per second). The first carrier signal includes n symbols generated within a time t, each symbol can be regarded as a data point, and the first carrier signal is n-point data. Where n = vt, n can be regarded as the length of the first carrier signal.

[0112] In this embodiment, the transmitting end device completes the encoding, modulation, shaping and filtering processes to generate a first carrier signal.

[0113] In this embodiment, the transmitting device also calculates a target transmission length L based on a target transmission rate q (in symbols / second). The target transmission length is the symbol length that needs to be generated at time t, and calculates the number of sampling points s for each subband based on the sampling rate b of each subband. The formula is as follows:

[0114] L=qt

[0115] s=bt

[0116] Among them, the target emission rate q and sampling rate b are known parameters.

[0117] In step S102, for each first carrier signal, when the rectangular window length required for filtering is less than the length of the first carrier signal, if the length of the first carrier signal is greater than a preset FFT length, an FFT based on a specific base is performed on the first carrier signal to obtain multiple second carrier signals, and butterfly operations and frequency domain filtering are performed on the multiple second carrier signals to obtain a third carrier signal.

[0118] The rectangular window length l required for filtering can be set according to actual needs and is not limited in this embodiment. Optionally, l = sn / L. The preset FFT length is the specified length m of the FFT. The specific cardinality is obtained by rounding up the ratio between the length of the first carrier signal and the preset FFT length. Exemplarily, the specific cardinality p = ceil (n / m).

[0119] In this embodiment, when l is less than n, each first carrier signal is subjected to an FFT and frequency-domain filtering to obtain multiple third carrier signals, with one first carrier signal corresponding to one third carrier signal. If the length of the third carrier signal is l, the third carrier signal is l-point data. Specifically, if the length of the first carrier signal is greater than the preset FFT length, the first carrier signal is first subjected to an FFT based on a specific radix, followed by frequency filtering. Furthermore, by combining butterfly operations with frequency-domain filtering, the amount of computation can be further reduced.

[0120] Step S103: Carrier aggregate the multiple third carrier signals to obtain a fourth carrier signal.

[0121] This step aggregates multiple third carrier signals into a fourth carrier signal.

[0122] Step S104 , performing IFFT on the fourth carrier signal, and intercepting data of a target transmission length from the IFFT-processed signal to obtain a fifth carrier signal.

[0123] In this step, the fourth carrier signal is converted from the frequency domain to the time domain using IFFT. A fifth carrier signal is then extracted from the IFFT-processed signal. The fifth carrier signal has a length of L, and thus represents L points of data. The fifth carrier signal is the signal to be transmitted to the receiving device. Accordingly, the transmitting device can send the fifth carrier signal to the receiving device.

[0124] Figure 6 This is a schematic diagram of a carrier aggregation process provided by this application. Figure 6 As shown, N carrier signals include carrier 1, carrier 2, ..., carrier N. Each carrier signal contains n symbols, or vt data points. The carrier aggregation process includes performing a filtered FFT on each carrier signal to obtain l data points, performing spectrum shifting and aggregation on the N l-point data points, performing an IFFT and truncation on the data points to obtain L data points, and then transmitting the L data points.

[0125] In the related art, k-fold upsampling is performed by interpolation and zero padding, and then a basis k-FFT is performed. In the frequency domain, it is equivalent to performing FFT on the original signal and then expanding it k-1 times in the frequency domain. However, the present application omits the upsampling operation. When the length of the first carrier signal is greater than the preset FFT length, the first carrier signal is directly subjected to an FFT based on a specific basis, thereby reducing the amount of computation. Moreover, since the data required for filtering can be obtained through FFT, there is no need to expand it k-1 times in the frequency domain. The butterfly operation and frequency domain filtering are directly combined, which further reduces the amount of computation and reduces the occupation of memory resources.

[0126] Figure 7 This is a flowchart of another carrier aggregation method provided by this application. Figure 7 As shown, this embodiment is used for Figure 5 Based on the carrier aggregation method provided in the illustrated embodiment, the case where the length of the first carrier signal is equal to the preset FFT length is described. The carrier aggregation method provided in this embodiment includes the following steps:

[0127] Step S201: Acquire a plurality of first carrier signals to be aggregated; the first carrier signals are time domain signals, and the length of the first carrier signals is equal to a preset FFT length.

[0128] The preset FFT length refers to the specified length of the FFT, which can be determined according to the FFT algorithm actually used and is not limited in this embodiment.

[0129] In this embodiment, the implementation of step S201 is similar to the implementation of step S101 in the previous embodiment, and will not be repeated here.

[0130] In this embodiment, after the first carrier signal is acquired, it is first determined whether the length of the first carrier signal is equal to the preset FFT length. If so, step S202 is executed.

[0131] Step S202 : When the rectangular window length required for filtering is less than the length of the first carrier signal, perform FFT and frequency domain filtering on each first carrier signal to obtain a plurality of third carrier signals.

[0132] The rectangular window length l required for filtering can be set according to actual needs, and is not limited in this embodiment. Optionally, l=sn / L.

[0133] In some embodiments, for each first carrier signal, the following steps S2021 to S2023 are respectively performed to implement the operation of performing FFT and frequency domain filtering on each first carrier signal to obtain multiple third carrier signals.

[0134] Step S2021: Perform FFT on the first carrier signal to obtain a seventh carrier signal.

[0135] The seventh carrier signal is a signal obtained by performing FFT on the first carrier signal. The FFT algorithm required for the FFT operation can be selected according to actual needs, and this application does not limit this.

[0136] Step S2022: Perform signal transformation processing on the seventh carrier signal according to the transformation parameters to obtain an eighth carrier signal.

[0137] The transformation parameter is obtained by rounding up the ratio of the target transmission length to the length of the first carrier signal. For example, the transformation parameter k=ceil(L / n).

[0138] In some embodiments, based on the parity of the transformation parameters, different signal transformation processes may be performed on the seventh carrier signal. Accordingly, step S2022 is specifically implemented as follows:

[0139] If the transformation parameter is an even number, the seventh carrier signal is rotated rightward by the symbol position of the first preset length to obtain the eighth carrier signal; if the transformation parameter is an odd number, the seventh carrier signal is flipped to obtain the eighth carrier signal.

[0140] The first preset length is half of the length of the first carrier signal, for example, the first preset length is n / 2.

[0141] This embodiment provides two signal transformation processing methods. Specifically, when the transformation parameter is an even number, the rotation operation is used to adjust the phase of the seventh carrier signal. In particular, when processing a periodic or symmetrical signal, certain specific frequency components can be placed at the center of the seventh carrier signal through rotation, which is convenient for subsequent processing; if the seventh carrier signal contains multiple frequency components, and the positions of these components in the spectrum are related to the rotation amount n / 2, this operation can help concentrate the frequency components of interest in the center part of the output data. When the transformation parameter is an odd number, flipping the seventh carrier signal is equivalent to time-reversing the signal in the time domain. Although the flipping changes the relative positions of the frequency components, it retains the phase information of the original signal (except for possible phase reversal).

[0142] Step S2023: For the eighth carrier signal, select data of the rectangular window length at the center position as the third carrier signal.

[0143] For example, in the eighth carrier signal, a rectangular window (ie, a continuous frequency range) is selected, and the data within the window is retained, while the data outside the window is set to zero or ignored.

[0144] In this embodiment, an FFT is first performed. After the FFT, the signal is represented in complex form, where each complex number corresponds to a frequency component in the frequency domain. The purpose of frequency domain filtering is to modify the amplitude and / or phase of these frequency components to achieve the desired signal processing effect. Specifically, frequency domain filtering is implemented using rectangular window interception. This interception method is simple and direct. By first transforming the signal according to the transformation parameters and then intercepting data of a certain length, the noise and interference components in the eighth carrier signal can be removed, thereby improving the signal-to-noise ratio and transmission quality of the signal. At the same time, since data of the rectangular window length at the center position is selected, the accuracy and stability of the filtering effect can be further ensured.

[0145] Step S203: Carrier aggregate the multiple third carrier signals to obtain a fourth carrier signal.

[0146] In some embodiments, step S203 is specifically implemented as: assigning multiple third carrier signals to corresponding frequency bands according to their corresponding sub-band identifiers, so as to achieve carrier aggregation and obtain the fourth carrier signal.

[0147] For any first carrier signal, if the first carrier signal has a corresponding subband, then the third carrier signal obtained by performing FFT and frequency domain filtering on the first carrier signal also corresponds to the subband. The subband identifier is used to uniquely identify the subband to distinguish different subbands. Exemplarily, the subband identifier is the subband number.

[0148] There are multiple frequency bands in the entire frequency band, each of which represents a sub-band. This step assigns the third carrier signal to the corresponding frequency band according to its corresponding sub-band identifier, thereby realizing the frequency domain shift of the carrier signal. The entire frequency band can be regarded as a complete carrier signal, that is, the fourth carrier signal.

[0149] It should be noted that, for those frequency bands that do not have corresponding third carrier signals, the value can be directly assigned to 0.

[0150] The solution of this embodiment moves the third carrier signal to the corresponding frequency band by directly assigning a value on the corresponding frequency band according to the sub-band identifier, without performing an overlay operation on the third carrier signal. This carrier aggregation method is simpler and easier to implement, simplifies the existing carrier aggregation process, and reduces the difficulty of aggregation.

[0151] Step S204 , performing IFFT on the fourth carrier signal, and intercepting data of a target transmission length from the IFFT-processed signal to obtain a fifth carrier signal.

[0152] In this embodiment, the implementation of step S204 is similar to the implementation of step S104 in the previous embodiment, and will not be repeated here.

[0153] This embodiment describes the case where n is equal to m. If n=m, it means that the length of the first carrier signal meets the length specified by FFT, and FFT can be directly performed on the first carrier signal. This processing method is simple and efficient.

[0154] Figure 8 This is a flowchart of another carrier aggregation method provided by this application, such as Figure 8 As shown, this embodiment is used for Figure 5 Based on the carrier aggregation method provided in the illustrated embodiment, the case where the length of the first carrier signal is less than the preset FFT length is described. The process includes the following steps:

[0155] Step S301: Acquire a plurality of first carrier signals to be aggregated; the first carrier signals are time domain signals, and the length of the first carrier signals is less than a preset FFT length.

[0156] The preset FFT length refers to the length specified by the FFT, which can be determined according to the FFT algorithm actually used, and is not limited in this embodiment.

[0157] In this embodiment, the implementation of step S301 is similar to the implementation of step S101 in the above embodiment, and will not be described again here.

[0158] In this embodiment, after acquiring the first carrier signal, it is first determined whether the length of the first carrier signal is equal to the preset FFT length. If it is less than the preset FFT length, step S302 is executed.

[0159] Step S302: When the rectangular window length required for filtering is less than the length of the first carrier signal, for each first carrier signal, the first carrier signal is padded with zeros at the tail, and the zero-padded first carrier signal is subjected to FFT and frequency domain filtering to obtain multiple third carrier signals.

[0160] The rectangular window length l required for filtering can be set according to actual needs, and is not limited in this embodiment. Optionally, l=sn / L.

[0161] The length of the first carrier signal after zero padding is m. In this embodiment, the first carrier signal whose length does not reach the preset FFT length is padded with zeros to make the length of the first carrier signal long enough, so that FFT and frequency domain filtering are performed only when the length reaches the preset FFT length.

[0162] In some embodiments, the implementation method of performing FFT and frequency domain filtering on the zero-padded first carrier signal to obtain multiple third carrier signals is the same as the implementation method of performing FFT and frequency domain filtering on each first carrier signal in step S202 to obtain multiple third carrier signals, and will not be repeated here.

[0163] Step S303: Carrier aggregate the multiple third carrier signals to obtain a fourth carrier signal.

[0164] Step S304 , performing IFFT on the fourth carrier signal, and intercepting data of a target transmission length from the IFFT-processed signal to obtain a fifth carrier signal.

[0165] In this embodiment, the implementation of step S303 - step S304 is similar to the implementation of step S203 - step S204 in the above embodiment, and will not be repeated here.

[0166] Figure 9 This is a flowchart of another carrier aggregation method provided by this application, such as Figure 9 As shown, this embodiment is used for Figure 5 Based on the carrier aggregation method provided in the illustrated embodiment, the case where the length of the first carrier signal is greater than the preset FFT length is described. The process includes the following steps:

[0167] Step S401: Acquire a plurality of first carrier signals to be aggregated; the first carrier signals are time domain signals, and the length of the first carrier signals is greater than a preset FFT length.

[0168] The preset FFT length refers to the length specified by the FFT, which can be determined according to the FFT algorithm actually used, and is not limited in this embodiment.

[0169] In this embodiment, the implementation of step S401 is similar to the implementation of step S101 in the above embodiment, and will not be repeated here.

[0170] In this embodiment, after acquiring the first carrier signal, it is first determined whether the length of the first carrier signal is equal to the preset FFT length. If it is, step S402 is executed.

[0171] Step S402, when the rectangular window length required for filtering is less than the length of the first carrier signal, for each first carrier signal, perform FFT based on a specific base on the first carrier signal to obtain multiple second carrier signals, and perform butterfly operation and frequency domain filtering on the multiple second carrier signals to obtain a third carrier signal.

[0172] In this embodiment, the implementation of step S402 is similar to the implementation of step S102 in the above embodiment, and will not be repeated here.

[0173] See also Figure 10, which shows a processing flow of a base p-FFT, where p represents a specific base number. The processing flow includes: performing a base p-FFT on the first carrier signal in an extraction manner to extract multiple data: X(1), X(2), ..., X(p), performing FFT operation on each data to obtain multiple FFT data: FFT(1), FFT(2), ..., FFT(p), and then performing point multiplication operation on the multiple FFT data to obtain multiple point multiplication data: Y(1), Y(2), ..., Y(p), and the point multiplication coefficients are W1(1), W1(2), ..., W1(p), and then performing complex multiplication operation on the multiple point multiplication data to obtain multiple second carrier signals: S(1), S(2), ..., S(p). Among them, W2 1,1 Represents the weight corresponding to the first data in X(1), W2 1,2 The weight corresponding to the second data in Table X(1), and so on, W2 1,p The weight corresponding to the pth data in Table X(1); W2 2,1 Represents the weight corresponding to the first data in X(2), W2 2,2 The weight corresponding to the second data in Table X(2), and so on, W2 2,p The weight corresponding to the pth data in Table X(2); W2 p,1 Represents the weight corresponding to the first data in X(p), W2 p,2 The weight corresponding to the second data in table X(p), and so on, W2 p,p The weight corresponding to the p-th data in table X(p).

[0174] In some embodiments, performing a butterfly operation and frequency-domain filtering on the plurality of second carrier signals to obtain a third carrier signal is specifically implemented by performing a butterfly operation and frequency-domain filtering on the plurality of second carrier signals according to a transformation parameter and a rectangular window length to obtain the third carrier signal. The transformation parameter is obtained by rounding up the ratio of the target transmission length to the length of the first carrier signal. Exemplarily, the transformation parameter k = ceil(L / n).

[0175] This embodiment combines butterfly operation and frequency domain filtering to further reduce the amount of computation. Furthermore, based on the parity of the transformation parameters, butterfly operation and frequency domain filtering in different ways can be performed on multiple second carrier signals.

[0176] In some embodiments, if the transformation parameter is an even number, butterfly operation and frequency domain filtering are performed on multiple second carrier signals according to the transformation parameter and the rectangular window length to obtain a third carrier signal. The specific implementation is as follows: complex multiplication and complex addition operations are performed on the data located in the front second preset length and the data located in the rear second preset length in the sixth carrier signal to obtain a first intermediate operation signal and a second intermediate operation signal; and the first intermediate operation signal and the second intermediate operation signal are reversely spliced ​​to obtain the third carrier signal.

[0177] The sixth carrier signal is obtained by splicing a plurality of second carrier signals, and the second preset length is half the length of the rectangular window. For example, the second preset length is 1 / 2.

[0178] By performing complex multiplication and complex addition operations on the data located in the first 1 / 2 and the data located in the last 1 / 2 of the sixth carrier signal respectively to realize butterfly operation, and then reversely splicing the data after the operation, filtering is realized, which can improve signal quality and enhance the signal's anti-interference ability.

[0179] In some embodiments, if the transform parameter is an odd number, butterfly operations and frequency domain filtering are performed on the plurality of second carrier signals according to the transform parameter and the rectangular window length to obtain the third carrier signal. This is specifically implemented by: performing complex multiplication and complex addition operations on the data of the rectangular window length at the center position of the sixth carrier signal to obtain a third intermediate calculated signal; and flipping the third intermediate calculated signal to obtain the third carrier signal. The sixth carrier signal is obtained by concatenating the plurality of fourth carrier signals.

[0180] Butterfly operation is realized through complex multiplication and complex addition operations, and filtering is realized by intercepting data of the rectangular window length at the center position of the sixth carrier signal and performing a flip operation, which can improve signal quality and enhance the signal's anti-interference ability.

[0181] See also Figure 11 , which shows a schematic diagram of a butterfly operation and frequency domain filtering operation. When k is an even number, considering the filtered radix p-FFT, complex multiplication and complex addition operations are performed on the first 1 / 2 and the last 1 / 2 of the data in the sixth carrier signal, respectively, to obtain a first intermediate operation signal a and a second intermediate operation signal b, which are then reversely concatenated to obtain a third carrier signal. When k is an odd number, considering the filtered radix p-FFT, complex multiplication and complex addition operations are performed on the data of length 1 at the center position of the sixth carrier signal to obtain a third intermediate operation signal c, which is then flipped to obtain a third carrier signal.

[0182] The intermediate memory size required to implement step S402 is 2m+(p-1)m+l symbols. The required complex multiplications are p*log2(m) / 2+(p-1)l times, and the complex additions are p*log2(m)+(p-1)l times.

[0183] Step S403: Aggregate multiple third carrier signals to obtain a fourth carrier signal.

[0184] Step S404: Perform IFFT on the fourth carrier signal, and intercept data of the target transmission length from the signal after IFFT to obtain a fifth carrier signal.

[0185] In this embodiment, the implementation manners of steps S403-S404 are the same as those of steps S103-S104 in the above embodiment, and will not be elaborated here.

[0186] In some embodiments, the IFFT operation can also use the FFT operation idea, that is, only calculate the complex multiplications and complex additions of the intercepted data. Then the required complex multiplications are k[p*log2(m) / 2+(p 2 -p)m]+(k-1)L times, and the complex additions are k[p*log2(m) / 2+(p 2 -p)m]+(k-1)L times.

[0187] Compared with the frequency domain scheme in the related art, the present application mainly simplifies the processing flow of the frequency domain scheme, and at the same time takes filtering into account in the FFT operation and optimizes the implementation of frequency shift, achieving the purpose of reducing the amount of processed data, reducing the operation complexity, and reducing the memory occupation.

[0188] First, after k-fold upsampling in the way of interpolation and zero padding and then performing base k-FFT, it is equivalent to performing FFT on the base signal and then expanding k-1 times in the frequency domain. Therefore, the present application omits the k-fold upsampling operation and reduces the amount of FFT operation data.

[0189] Second, taking frequency domain filtering into account in the FFT processing further reduces the operation amount and memory occupation. Refer to Figure 12 , since all the data required for frequency domain filtering can be obtained from the FFT result of the base signal. In the case of l<n, when the length n of the base signal is ≤m, frequency domain filtering can be directly performed after the base signal performs FFT, without expanding the FFT data of the base signal k-1 times to reduce the memory occupation. When the length n of the base signal is >m, combining the butterfly operation with frequency domain filtering when performing base p-FFT in the decimation manner on the base signal can also further reduce the operation.

[0190] This application can improve the data transmission rate of satellite signals by aggregating discontinuous and unequal bandwidth carrier signals when spectrum resources are fragmented and there are no large continuous spectrum segments.

[0191] The following is a comparison of the computational complexity of the present application and related technologies. For the sake of comparison, it is assumed that all carrier signals have the same bandwidth.

[0192] 1. Comparison with existing time domain solutions:

[0193] The amount of computation required for complex multiplication in the existing time domain solution is: (Q+1)KNvt, and the amount of computation required for complex addition in the existing time domain solution is: (Q-1)KNvt.

[0194] The amount of calculation required for complex multiplication in this application is: N(p*log2(m) / 2+(p-1)l)+k[p*log2(m) / 2+(p 2 -p)m]+(k-1)L; The amount of calculation required for complex addition in this application: N(p*log2(m)+(p-1)l)+k[p*log2(m) / 2+(p 2 -p)m]+(k-1)L.

[0195] Regarding the optimization factor: The ratio of the amount of complex multiplication required by this application to the existing time domain solution is less than The ratio of the amount of complex addition required by this application to the existing time domain solution is less than

[0196]

[0197] 2. Comparison with existing frequency domain solutions:

[0198] The computational complexity of the complex multiplication required by the existing frequency domain solution is: (N+1){k[p*log2(m) / 2+(p 2 -p)m]+(k 2 -k)pm}; the computational complexity of the complex addition required by the existing frequency domain solution is: (N+1){k[p*log2(m)+(p 2 -p)m]+(k 2 -k)pm}+Nkpm.

[0199] The amount of calculation required for complex multiplication in this application is: N(p*log2(m) / 2+(p-1)l)+k[p*log2(m) / 2+(p 2 -p)m]+(k-1)L; The amount of calculation required for complex addition in this application: N(p*log2(m)+(p-1)l)+k[p*log2(m) / 2+(p 2 -p)m]+(k-1)L.

[0200] Regarding the optimization factor: the ratio of the computational complexity of the complex multiplication of this application to the existing frequency domain solution is less than The ratio of the computational complexity of the complex addition of this application to the frequency domain solution is less than

[0201] 3. This application uses less memory, requiring only intermediate data memory during FFT and IFFT. Compared to existing frequency domain solutions, this application optimizes the symbol size by 2kpm-l+L.

[0202] Figure 13 This is a structural diagram of a carrier aggregation device provided by this application, such as Figure 13 As shown, in this embodiment, the carrier aggregation device 50 can be set in a communication device, and the carrier aggregation device 50 includes:

[0203] An acquisition module 501 is configured to acquire a plurality of first carrier signals to be aggregated; the first carrier signals are time domain signals;

[0204] An FFT module 502 is configured to, for each first carrier signal, perform an FFT based on a specific radix on the first carrier signal to obtain a plurality of second carrier signals if the length of the rectangular window required for filtering is less than the length of the first carrier signal and the length of the first carrier signal is greater than a preset FFT length, and perform a butterfly operation and frequency domain filtering on the plurality of second carrier signals to obtain a third carrier signal; the specific radix being obtained by rounding up a ratio between the length of the first carrier signal and the preset FFT length;

[0205] an aggregation module 503, configured to perform carrier aggregation on a plurality of third carrier signals to obtain a fourth carrier signal;

[0206] The IFFT module 504 is configured to perform IFFT on the fourth carrier signal and extract data of a target transmission length from the IFFT-processed signal to obtain a fifth carrier signal.

[0207] In some embodiments, when performing butterfly operations and frequency domain filtering on the plurality of second carrier signals to obtain the third carrier signal, the FFT module 502 is specifically configured to:

[0208] According to the transformation parameter and the rectangular window length, butterfly operation and frequency domain filtering are performed on the plurality of second carrier signals to obtain a third carrier signal; the transformation parameter is obtained by rounding up the ratio between the target transmission length and the length of the first carrier signal.

[0209] In some embodiments, when the FFT module 502 performs butterfly operations and frequency domain filtering on the plurality of second carrier signals according to the transformation parameters and the rectangular window length to obtain the third carrier signal, it is specifically configured to:

[0210] If the transformation parameter is an even number, performing complex multiplication and complex addition operations on the data located in the first second preset length and the data located in the second rear preset length in the sixth carrier signal, respectively, to obtain a first intermediate calculated signal and a second intermediate calculated signal; the sixth carrier signal is obtained by concatenating the plurality of second carrier signals; and the second preset length is half the length of the rectangular window;

[0211] The first intermediate operation signal and the second intermediate operation signal are reversely spliced ​​to obtain a third carrier signal.

[0212] In some embodiments, when the FFT module 502 performs butterfly operations and frequency domain filtering on the plurality of second carrier signals according to the transformation parameters and the rectangular window length to obtain the third carrier signal, it is specifically configured to:

[0213] If the transformation parameter is an odd number, performing complex multiplication and complex addition operations on data of the rectangular window length at the center position of the sixth carrier signal to obtain a third intermediate operation signal; the sixth carrier signal is obtained by splicing multiple fourth carrier signals;

[0214] The third intermediate operation signal is inverted to obtain a third carrier signal.

[0215] In some embodiments, the FFT module 502 is further configured to:

[0216] For each first carrier signal, if the length of the first carrier signal is less than a preset FFT length, padding the first carrier signal with zeros, and performing FFT and frequency domain filtering on the zero-padded first carrier signal to obtain a third carrier signal; the length of the zero-padded first carrier signal is equal to the preset FFT length;

[0217] For each first carrier signal, if the length of the first carrier signal is equal to the preset FFT length, FFT and frequency domain filtering are performed on the first carrier signal to obtain a third carrier signal.

[0218] In some embodiments, the FFT module 502, when performing FFT and frequency domain filtering on the first carrier signal to obtain the third carrier signal, is specifically configured to:

[0219] Performing FFT on the first carrier signal to obtain a seventh carrier signal;

[0220] performing signal transformation processing on the seventh carrier signal according to a transformation parameter to obtain an eighth carrier signal; the transformation parameter is obtained by rounding up a ratio between a target transmission length and a length of the first carrier signal;

[0221] For the eighth carrier signal, data of the rectangular window length at the center position is selected as the third carrier signal.

[0222] In some embodiments, the FFT module 502, when performing signal transformation processing on the seventh carrier signal according to the transformation parameters to obtain the eighth carrier signal, is specifically configured to:

[0223] If the transformation parameter is an even number, the seventh carrier signal is rotated rightward by a symbol position of a first preset length to obtain an eighth carrier signal; the first preset length is half the length of the first carrier signal;

[0224] If the transformation parameter is an odd number, the seventh carrier signal is flipped to obtain an eighth carrier signal.

[0225] In some embodiments, the aggregation module 503 is configured to:

[0226] The multiple third carrier signals are respectively assigned to corresponding frequency bands according to their corresponding sub-band identifiers to achieve carrier aggregation and obtain a fourth carrier signal.

[0227] The carrier aggregation device 50 provided in this embodiment can implement the technical solution of the corresponding method embodiment. Its implementation principle and technical effects are similar to those of the corresponding method embodiment and will not be repeated here.

[0228] An embodiment of the present application also provides a communication device. Figure 14 This is a schematic diagram of the structure of a communication device provided by this application. Figure 14 As shown, the communication device 60 includes: a processor 601 and a memory 602 communicatively connected to the processor 601 .

[0229] The memory 602 stores computer-executable instructions; the processor 601 executes the computer-executable instructions stored in the memory 602 to implement the carrier aggregation method provided in this application.

[0230] In the embodiment of the present application, the memory 602 and the processor 601 are connected via a bus. The bus may be an Industry Standard Architecture (ISA) bus, a Peripheral Component Interconnect (PCI) bus, or an Extended Industry Standard Architecture (EISA) bus. The bus may be divided into an address bus, a data bus, a control bus, and the like.

[0231] The components, their connections and relationships, and their functions shown herein are merely examples and are not intended to limit the implementation of the present application described and / or claimed herein. The various components are interconnected using different buses and can be mounted on a common motherboard or in other ways as needed.

[0232] In an exemplary embodiment, a computer-readable storage medium is further provided, in which computer-executable instructions are stored. When the computer-executable instructions are executed by a processor, they are used to implement the carrier aggregation method provided in the present application.

[0233] In an exemplary embodiment, a computer program product is further provided, including a computer program. When the computer program in the computer program product is executed by a processor, it is used to implement the carrier aggregation method provided in the present application.

[0234] Those skilled in the art will readily appreciate other embodiments of the present application after considering the specification and practicing the invention disclosed herein. This application is intended to cover any variations, uses, or adaptations of the present application that follow the general principles of the present application and include common knowledge or customary techniques in the art not disclosed herein. The description and examples are to be considered merely as exemplary, and the true scope and spirit of the present application are indicated by the claims.

[0235] It should be understood that the present application is not limited to the exact structure described above and shown in the drawings, and that various modifications and changes may be made without departing from the scope thereof. The scope of the present application is limited only by the appended claims.

Claims

1. A carrier aggregation method, characterized in that: include: Acquire a plurality of first carrier signals to be aggregated, wherein the first carrier signals are time domain signals; For each of the first carrier signals, if the rectangular window length required for filtering is less than the length of the first carrier signal, and if the length of the first carrier signal is greater than a preset fast Fourier transform (FFT) length, performing an FFT based on a specific radix on the first carrier signal to obtain a plurality of second carrier signals, and performing a butterfly operation and frequency domain filtering on the plurality of second carrier signals to obtain a third carrier signal; the specific radix being obtained by rounding up the ratio between the length of the first carrier signal and the preset FFT length; Carrier aggregating the plurality of third carrier signals to obtain a fourth carrier signal; An inverse fast Fourier transform (IFFT) is performed on the fourth carrier signal, and data of a target transmission length is intercepted from the signal after the IFFT, so as to obtain a fifth carrier signal.

2. The method according to claim 1, characterized in that The performing butterfly operation and frequency domain filtering on the plurality of second carrier signals to obtain a third carrier signal includes: According to the transformation parameters and the rectangular window length, butterfly operation and frequency domain filtering are performed on multiple second carrier signals to obtain a third carrier signal; the transformation parameters are obtained by rounding up the ratio between the target transmission length and the length of the first carrier signal.

3. The method according to claim 2, characterized in that The step of performing butterfly operation and frequency domain filtering on the plurality of second carrier signals according to the transformation parameter and the rectangular window length to obtain a third carrier signal includes: If the transformation parameter is an even number, performing complex multiplication and complex addition operations on the data located in the first second preset length and the data located in the second rear preset length in the sixth carrier signal, respectively, to obtain a first intermediate calculated signal and a second intermediate calculated signal; the sixth carrier signal is obtained by splicing a plurality of the second carrier signals; and the second preset length is half the length of the rectangular window; The first intermediate operation signal and the second intermediate operation signal are reversely spliced ​​to obtain a third carrier signal.

4. The method according to claim 2, characterized in that The step of performing butterfly operation and frequency domain filtering on the plurality of second carrier signals according to the transformation parameter and the rectangular window length to obtain a third carrier signal includes: If the transformation parameter is an odd number, performing complex multiplication and complex addition operations on data of the rectangular window length at the center position of the sixth carrier signal to obtain a third intermediate operation signal; the sixth carrier signal is obtained by splicing a plurality of the second carrier signals; The third intermediate operation signal is inverted to obtain a third carrier signal.

5. The method according to claim 1, wherein Also includes: For each of the first carrier signals, if the length of the first carrier signal is less than a preset FFT length, performing zero padding on the first carrier signal, and performing FFT and frequency domain filtering on the zero-padded first carrier signal to obtain a third carrier signal; the length of the zero-padded first carrier signal is equal to the preset FFT length; For each of the first carrier signals, if the length of the first carrier signal is equal to the preset FFT length, FFT and frequency domain filtering are performed on the first carrier signal to obtain a third carrier signal.

6. The method according to claim 5, characterized in that The performing FFT and frequency domain filtering on the first carrier signal to obtain a third carrier signal includes: performing FFT on the first carrier signal to obtain a seventh carrier signal; performing signal transformation processing on the seventh carrier signal according to a transformation parameter to obtain an eighth carrier signal; the transformation parameter is obtained by rounding up the ratio between the target transmission length and the length of the first carrier signal; For the eighth carrier signal, data of the rectangular window length at the center position is selected as the third carrier signal.

7. The method according to claim 6, characterized in that The performing signal transformation processing on the seventh carrier signal according to the transformation parameter to obtain an eighth carrier signal includes: If the transformation parameter is an even number, rotating the seventh carrier signal rightward by a symbol position of a first preset length to obtain an eighth carrier signal; the first preset length is half the length of the first carrier signal; If the transformation parameter is an odd number, the seventh carrier signal is flipped to obtain an eighth carrier signal.

8. The method according to claim 1, characterized in that The performing carrier aggregation on the plurality of third carrier signals to obtain a fourth carrier signal includes: The plurality of third carrier signals are respectively assigned to corresponding frequency bands according to their corresponding sub-band identifiers, so as to implement carrier aggregation and obtain a fourth carrier signal.

9. A carrier aggregation device, characterized in that: include: An acquisition module, configured to acquire a plurality of first carrier signals to be aggregated; the first carrier signals being time domain signals; An FFT module is configured to, for each of the first carrier signals, perform an FFT based on a specific radix on the first carrier signal to obtain a plurality of second carrier signals if the length of the first carrier signal is greater than a preset FFT length, and to perform a butterfly operation and frequency domain filtering on the plurality of second carrier signals to obtain a third carrier signal, when a rectangular window length required for filtering is less than a length of the first carrier signal. The specific radix is ​​obtained by rounding up a ratio between the length of the first carrier signal and the preset FFT length. an aggregation module, configured to perform carrier aggregation on a plurality of the third carrier signals to obtain a fourth carrier signal; The IFFT module is configured to perform IFFT on the fourth carrier signal and intercept data of a target transmission length from the signal after IFFT to obtain a fifth carrier signal.

10. A communication device, characterized in that: include: a processor and a memory communicatively connected to the processor; The memory stores computer-executable instructions; The processor executes the computer-executable instructions stored in the memory to implement the carrier aggregation method according to any one of claims 1 to 8.

11. A computer-readable storage medium, characterized in that The computer-readable storage medium stores computer-executable instructions, which, when executed by a processor, are used to implement the carrier aggregation method according to any one of claims 1 to 8.

12. A computer program product comprising a computer program, characterized in that When the computer program is executed by a processor, the carrier aggregation method according to any one of claims 1 to 8 is implemented.

Images