Signal processing method, communication node, medium, and program product

Abstract

The present application discloses a signal processing method, a communication node, a medium, and a program product. The method comprises: performing bit selection on mother code codewords to determine a bit-selected sequence corresponding to each of the mother code codewords; performing code block interleaving on each bit-selected sequence on the basis of a first data characteristic to determine an interleaved sequence; performing code block concatenation on interleaved sequences in order to determine a concatenated output sequence; scrambling the concatenated output sequence to determine a scrambled sequence; modulating the scrambled sequence to determine a modulation symbol sequence; and mapping the modulation symbol sequence to a transmission layer. The first data characteristic comprises at least one of the following: layer indication information; port indication information; the number of transmission layers; the number of transmission layers and a preset threshold for the number of transmission layers; rank indication information and a preset threshold for a rank; and the number of ports and a preset threshold for the number of ports. An input data block comprises: a transport block; or a transport block and a transport block CRC. The signal transmission performance is improved.

Description

Signal processing methods, communication nodes, media and software products Technical Field

[0001] This application relates to the field of communication technology, and in particular to a signal processing method, communication node, medium, and program product. Background Technology

[0002] 6th generation mobile communication system (6 th 6G (6th Generation Mobile Communication System) is the next generation of mobile communication system that can promote the rapid development and maturity of industrial internet, Internet of Things, artificial intelligence, virtual reality, autonomous driving, robotics and metaverse.

[0003] However, existing fifth-generation mobile communication systems (5G) th In the New Radio (NR) technology of Generation Mobile Communication System (5G), the coding module and the Multiple-Input Multiple-Output (MIMO) module are independent of each other. While each module maintains a near-optimal design, the overall design is not optimal and is difficult to adapt to the performance requirements of the 6G framework for channel coding. Summary of the Invention

[0004] This application provides a signal processing method, communication node, medium, and program product. Based on compatibility with 5G NR channel coding design, it comprehensively considers the relationship between coding and spatial channels in MIMO for signal transmission, thereby improving signal transmission performance.

[0005] To achieve the above objectives, embodiments of this application provide a signal processing method applied to a first communication node, comprising:

[0006] The input data block is segmented into code blocks and a cyclic redundancy check (CRC) bit sequence is added to determine at least one code block bit sequence.

[0007] Channel coding is performed on the bit sequence of each code block to determine the mother codeword corresponding to the bit sequence of each code block;

[0008] Perform bit selection on each mother codeword to determine the bit selection sequence corresponding to each mother codeword;

[0009] Based on the first data feature, the selected bits are interleaved into code blocks to determine the interleaved sequence;

[0010] The interleaved sequences are concatenated into code blocks in order to determine the output sequence after concatenation.

[0011] The concatenated output sequence is scrambled to determine the scrambled sequence.

[0012] The scrambled sequence is modulated to determine the modulation symbol sequence;

[0013] Map the modulation symbol sequence to the transport layer;

[0014] The first data feature includes at least one of the following: layer indication information; port indication information; number of transmission layers; number of transmission layers and a preset threshold for the number of transmission layers; rank indication information and a preset threshold for the rank; number of ports and a preset threshold for the number of ports.

[0015] The input data block includes: a transport block; or a transport block and a transport block CRC.

[0016] To achieve the above objectives, embodiments of this application provide a signal processing method applied to a second communication node, comprising:

[0017] De-layer mapping is performed on the modulation symbol sequence of each layer in the transport layer to determine the modulation symbol sequence;

[0018] Demodulate the modulation symbol sequence to determine the scrambled sequence;

[0019] The scrambled sequence is descrambled to determine the concatenated output sequence;

[0020] The concatenated output sequence is deconcatenated to determine the interleaved sequence;

[0021] Based on the first data feature, the interleaved sequence is deinterleaved into code blocks to determine at least one bit-selected sequence.

[0022] Perform de-bit selection on the sequence after each bit selection to determine the mother codeword corresponding to each bit selection sequence;

[0023] Channel decoding is performed on each mother codeword to determine the code block bit sequence corresponding to each mother codeword;

[0024] The output data block is determined by performing decoding block segmentation and decoding block cyclic redundancy check bit sequence on the bit sequence of each code block;

[0025] The first data feature includes at least one of the following: layer indication information; port indication information; number of transmission layers; number of transmission layers and a preset threshold for the number of transmission layers; rank indication information and a preset threshold for the rank; number of ports and a preset threshold for the number of ports.

[0026] The output data block includes: a transport block; or a transport block and a transport block CRC.

[0027] To achieve the above objectives, embodiments of this application provide a communication node, including: a memory, a processor, a program stored in the memory and executable on the processor, and a data bus for implementing communication between the processor and the memory. When the program is executed by the processor, it implements the steps of the signal processing method as described in any of the embodiments of this application.

[0028] To achieve the above objectives, embodiments of this application provide a storage medium for computer-readable storage, wherein the storage medium stores one or more programs, which can be executed by one or more processors to implement the steps of the signal processing method of any embodiment of this application.

[0029] To achieve the above objectives, embodiments of this application provide a computer program product, including a computer program, which, when executed by a processor, implements the steps of any of the signal processing methods described in the embodiments of this application.

[0030] The signal processing method, communication node, medium, and program product provided in this application embodiment determine at least one code block bit sequence by segmenting the input data block into code blocks and adding a cyclic redundancy check (CRC) bit sequence to each code block bit sequence; performing channel coding on each code block bit sequence to determine a parent codeword corresponding to each code block bit sequence; performing bit selection on each parent codeword to determine a bit-selected sequence corresponding to each parent codeword; performing code block interleaving on each bit-selected sequence according to a first data feature to determine an interleaved sequence; concatenating the interleaved sequences in sequence to determine a concatenated output sequence; scrambling the concatenated output sequence to determine a scrambled sequence; modulating the scrambled sequence to determine a modulation symbol sequence; and mapping the modulation symbol sequence to the transport layer. The first data feature includes at least one of the following: layer indication information; port indication information; number of transport layers; a preset threshold for the number of transport layers; rank indication information and a preset threshold for the rank; number of ports and a preset threshold for the number of ports. The input data block includes: a transport block; or a transport block and a transport block CRC. By adopting the above technical solution, the data characteristics related to the spatial channel in MIMO are taken into account in the signal transmission. Based on the existing channel coding of Jianyou, the relationship between the coding module and the MIMO module is comprehensively considered, thereby improving the signal transmission performance. Attached Figure Description

[0031] Figure 1 is a schematic diagram of the architecture of a communication system provided in an embodiment of this application;

[0032] Figure 2 is a flowchart of a signal processing method provided in an embodiment of this application;

[0033] Figure 3 is a flowchart of a signal processing method provided in an embodiment of this application;

[0034] Figure 4 is a flowchart illustrating a signal processing method provided in an embodiment of this application;

[0035] Figure 5 is a flowchart illustrating a signal processing method provided in an embodiment of this application;

[0036] Figure 6 is a structural example diagram of a signal processing device provided in an embodiment of this application;

[0037] Figure 7 is a structural example diagram of a signal deprocessing device provided in an embodiment of this application;

[0038] Figure 8 is a structural example diagram of a wireless transmitting device provided in an embodiment of this application;

[0039] Figure 9 is a structural example diagram of a wireless receiving device provided in an embodiment of this application;

[0040] Figure 10 is a schematic diagram of a signal processing device provided in an embodiment of this application;

[0041] Figure 11 is a schematic diagram of a signal processing device provided in an embodiment of this application;

[0042] Figure 12 is a schematic diagram of the structure of a communication node provided in an embodiment of this application. Detailed Implementation

[0043] To make the objectives, technical solutions, and advantages of this application clearer, the embodiments of this application will be described in detail below with reference to the accompanying drawings. It should be noted that, unless otherwise specified, the embodiments and features described in these embodiments can be arbitrarily combined with each other.

[0044] The steps illustrated in the flowchart in the accompanying drawings can be executed in a computer system such as a set of computer-executable instructions. Furthermore, although a logical order is shown in the flowchart, in some cases the steps shown or described may be performed in a different order than that presented here.

[0045] The signal processing method provided in this application embodiment can be applied to wireless communication systems. Based on the current 5G NR communication system, where the coding module and MIMO module are independent and each maintains near-optimal channel coding design, the method comprehensively considers the relationship between spatial channels in coding and MIMO for signal transmission.

[0046] Wireless communication systems are widely deployed to provide a variety of telecommunications services, such as telephone, video, data, messaging, and broadcasting. Typical wireless communication systems may employ multiple access technologies that enable communication with multiple users by sharing available system resources. Examples of such multiple access technologies include Code Division Multiple Access (CDMA) systems, Time Division Multiple Access (TDMA) systems, Frequency Division Multiple Access (FDMA) systems, Orthogonal Frequency Division Multiple Access (OFDMA) systems, Single-Carrier Frequency-Division Multiple Access (SC-FDMA) systems, and Time Division-Synchronous Code Division Multiple Access (TD-SCDMA) systems. These multiple access technologies have been adopted by various telecommunications standards to provide a common protocol enabling different wireless devices to communicate at the city, national, regional, and even global levels.

[0047] The cellular concept proposed by Bell Labs in the early 1970s led to the rapid development of mobile communications, which can be roughly divided into the following stages:

[0048] The first generation of mobile communication systems used frequency division multiple access (FDMA) analog modulation.

[0049] Second-generation cellular systems employ Time Division Multiple Access (TDMA) and Code Division Multiple Access (CDMA) digital modulation schemes, increasing system capacity and using independent channels for signaling transmission, significantly improving system performance. These primarily include the Global System for Mobile Communications (GSM) in Northern Europe and Interim Standard-95 (IS-95) in North America.

[0050] The third-generation mobile communication system, International Mobile Telecommunications-2000 (IMT-2000), offers greater system capacity to meet the requirements of multimedia communication. It mainly includes CDMA2000 in North America, Wideband Code Division Multiple Access (WCDMA) in Europe, and TD-SCDMA in China. R99 is the official version of WCDMA; High Speed ​​Packet Access (HSPA) is the 3.5G evolution of WCDMA.

[0051] Fourth-generation mobile communication systems primarily employ Orthogonal Frequency Division Multiplexing (OFDM) and Multiple-Input Multiple-Output (MIMO) technologies, enabling truly high-speed broadband access. The first version of Long Term Evolution (LTE) was Release 8 (Rel-8), completed in September 2007. Due to widespread interest from operators, LTE gradually became the most mainstream 4G mobile communication standard globally. Starting in 2009, 3GPP began standardizing LTE-Advanced. As a significant technological advancement, the LTE-Advanced standard was released as Release 10, with performance indicators fully meeting the requirements of IMT-Advanced (Rel-10 LTE achieves a peak rate of 375 Mbit / s with a single antenna across five 0MHz bandwidths). In terms of channel coding, LTE / LTE-Advanced largely retains the Turbo code used in 3G as the forward error correction code for the data channel. LTE has made some optimizations to the structure of Turbo codes, which reduces decoding complexity and improves performance to some extent. The control channel uses tail-biting convolutional codes, which slightly improves performance compared to classic zero-tail bit convolutional codes because they do not require additional tail bits.

[0052] The fifth-generation mobile communication system, IMT-2020, is a new generation of broadband mobile communication technology characterized by high speed, low latency, and massive connectivity. 5G communication infrastructure serves as the network infrastructure for realizing the interconnection of humans, machines, and things. The International Telecommunication Union (ITU) defines three main application scenarios for 5G: Enhanced Mobile Broadband (eMBB), Ultra-Reliable and Low-Latency Communications (uRLLC), and Massive Machine-Type Communications (mMTC). To support high-speed transmission and better coverage, key 5G technologies employ Low-Density Parity-Check (LDPC), the Polar channel coding scheme, and high-performance massive MIMO technology. To support low latency and high reliability, 5G utilizes technologies such as short frames, fast feedback, and multi-layer / multi-site data retransmission.

[0053] 6G, or the sixth-generation mobile communication standard, is also known as the IMT-2030 mobile communication standard. It will promote the rapid development and maturity of the industrial internet, the Internet of Things, artificial intelligence, virtual reality, autonomous driving, robotics, and the metaverse. Around 2030, 6G will achieve large-scale commercial use worldwide. In 2023, the International Telecommunication Union (ITU) Radio Sector released recommendations on the 6G framework and overall objectives, providing guidance for the research and development of 6G technology. The ITU proposed that the goal of 6G technology is to achieve higher data transmission speeds, lower latency, higher reliability, wider network connectivity, and better security in the future.

[0054] The wireless interface is often the decisive factor in a mobile communication system; in other words, the evolution of wireless interface technology directly determines the transformation of mobile communication systems. A wireless interface typically includes transceivers (base stations and terminals) and an air channel. The transceiver itself consists of three parts: baseband, intermediate frequency (IF), and radio frequency (RF). In wireless interface technology, baseband processing is often the most crucial; therefore, this discussion will focus on the baseband processing flow.

[0055] Based on the encoding method used by the transmitting end to encode the information sequence, the receiving end can process the received data accordingly to reliably recover the original information sequence. The encoding method must be visible to both the transmitting and receiving ends. Generally, the encoding method is based on forward error correction (FEC) coding, also known as channel coding. FEC adds redundant information to the information sequence. The receiving end can use this redundant information to reliably recover the original information sequence.

[0056] Some common FEC codes include convolutional codes, Turbo codes, LDPC codes, and polar codes. In FEC encoding, a k-bit information sequence is FEC encoded to obtain an n-bit FEC codeword (with nk redundant bits), and the FEC code rate is k / n. Convolutional coding can easily encode blocks of arbitrary size, and Turbo coding, by utilizing two coded components that operate on the information sequence and by employing interleaving methods that support different code sizes, can support different information sequence sizes.

[0057] LDPC codes are linear block codes that can be defined using a very sparse parity check matrix or a bipartite graph. It is precisely the sparsity of its parity check matrix that enables low-complexity encoding and decoding, thus making LDPC practical. Through various practical and theoretical proofs, LDPC codes have demonstrated to be the best-performing channel code in Additive White Gaussian Noise (AWGN) channels, with performance very close to the Shannon limit and superior to convolutional codes and Turbo codes.

[0058] The data channel of the 5G NR mobile communication system adopts quasi-cyclic LDPC (QC-LDPC) codes. Due to the simple description of quasi-cyclic LDPC encoding and the simple decoder structure, it is used in various communication standards. Quasi-cyclic LDPC encoding can also be called structured LDPC encoding. Its binary parity check matrix H is an mb×Zc row and nb×Zc column matrix, composed of mb×nb block matrices. Each block matrix is ​​a different power of a basic permutation matrix of size Zc×Zc, obtained by right-circularly shifting (or left-circularly shifting 1) a unit matrix by 1 bit; alternatively, each block matrix can be considered a submatrix obtained by right-circularly shifting (or left-circularly shifting) a Zc×Zc identity matrix by several bits. For a binary parity check matrix H, if each Zc×Zc is replaced with an element "0" or an element "1", the zero-block matrix is ​​replaced with "0", and the cyclic shift block matrix of the identity matrix is ​​replaced with "1", the corresponding matrix is ​​called the base graph, but the specific shift values ​​are not distinguished. The base graph is an intermediate product of the design of the QC-LDPC parity check matrix. At this point, as long as the cyclic shift values ​​and the submatrix size are known, a quasi-cyclic LDPC code can be determined. All shift values ​​corresponding to each submatrix constitute an mb×nb matrix, which can be called the base matrix Hb, the shift coefficient parity check matrix, or the parity check matrix of the base graph. The submatrix size can be called the expansion factor, the lift size, or the submatrix size; here, it is described as the lift size. Because the quasi-cyclic LDPC code is very compact and simple in structure, and is very beneficial for decoder implementation, it is also called a structured LDPC code.

[0059] Since quasi-cyclic LDPC codewords are systematic codes, meaning the systematic bits in the codeword are equal to the information bits before encoding, only the parity bits need to be calculated in quasi-cyclic LDPC encoding. Quasi-cyclic LDPC encoding can be performed based on the parity check matrix described above. For example, the parity check matrix H can be described as two parts: H = [Hs; Hp], where Hs corresponds to the systematic bit matrix and Hp corresponds to the parity bit matrix. According to the LDPC encoding principle, for a quasi-cyclic LDPC codeword C (including the systematic bits Cs and the parity bits Cp), the condition H × C = 0 is satisfied, i.e., [Hs; Hp] × [Cs; Cp] = 0; thus, Hs × Cs = Hp × Cp, and Cp = (Hp)⁻¹ × Hs × Cs, where '×' in the formula is a binary matrix multiplication calculation, and (x)⁻¹ is a binary matrix inversion calculation; thus, the parity bits Cp of the quasi-cyclic LDPC codeword can be calculated, thereby obtaining the quasi-cyclic LDPC codeword C = [Cs; Cp].

[0060] Polar codes are a recently proposed type of linear block code. They were proposed by Professor Erdal Arikan in 2009. Polar codes are rigorously constructed codes for Binary Discrete Symmetric Channels (BSCs), achieving the channel capacity of BSCs. The construction and coding principles of polar codes have significant theoretical implications in information theory, pointing the way for code design efforts. The basic idea of ​​polar codes is to utilize the polarization phenomenon of channels, placing bits carrying more information in an "ideal channel" for transmission, while placing known bits ("frozen bits") in a "non-ideal channel." Channel polarization is a ubiquitous phenomenon, widely present not only in BSC channels but also in AWGN channels. It becomes more pronounced with increasing code length. In 2016, polar codes were adopted by the 5G standard as a control channel coding scheme.

[0061] Modulation refers to the process of transmitting information onto a signal suitable for a channel. Modulation generally includes baseband mapping and quadrature modulation. Baseband mapping is the process of mapping a binary bit stream onto a constellation diagram under various modulation methods; while quadrature modulation is the process of shifting the baseband channel onto a carrier wave, which is a spectrum shifting process. Here, modulation mainly refers to baseband mapping. Commonly used modulation methods include: Binary Phase Shift Keying (BPSK), Quadrature Phase Shift Keying (QPSK), Multi-Quadrature Amplitude Modulation (MQAM), and Multi-Amplitude Phase Shift Keying (MAPSK), etc.

[0062] At the transmitting end, the transport block to be transmitted needs to be segmented into multiple smaller transport blocks. Then, each of these smaller transport blocks undergoes FEC coding. The transport block to be transmitted has a certain transport block size (TBS) and coding rate. The FEC coding rate is generally defined as the ratio of the number of bits in the original information bit sequence entering the encoder to the number of bits in the actual transmitted bit sequence (or rate-matched output sequence, or bit-selected output sequence). In 4G LTE and 5G NR communication systems, the transport block size is relatively flexible, thus meeting the various data packet size requirements of mobile communication systems. Furthermore, 4G and 5G communication systems use a Modulation and Coding Scheme (MCS) index to indicate different combinations of modulation order and coding rate R. The TBS index is determined through control information such as Downlink Control Information (DCI) or Channel Quality Indication (CQI), and the size of the actual information bit sequence is determined jointly based on the number of resource blocks (RBs) and the TBS index. Channel types can include data channels and control channels. Data channels generally carry data from user equipment (UE), while control channels carry control information, including MCS index number, channel information, DCI, CQI, and other control information. Bandwidth generally refers to the spectrum width allocated by the system for data transmission. Data transmission directions include uplink data and downlink data. Uplink data generally refers to data transmitted from the UE to the base station, while downlink data refers to data transmitted from the base station to the UE.

[0063] Physical channel mapping refers to mapping modulation symbols onto physical channel resources, such as the spreading code channel in a CDMA system or a subchannel or resource block (composed of multiple subcarriers) in an OFDM system.

[0064] Hybrid Automatic Repeat Request (HARQ) is a crucial link adaptation technique in digital communication systems. The implementation process is as follows: the receiver decodes the received HARQ data packets. If the decoding is correct, it sends an ACK (Acknowledgement) message to the sender, instructing the sender to transmit a new HARQ data packet. If decoding fails, it sends a NACK (Negative Acknowledgement) message to the sender, requesting the sender to retransmit the HARQ data packet. By performing incremental redundancy (IR) or Chase merging decoding on the retransmitted data packets, the receiver can improve the decoding success probability and achieve high reliability requirements for link transmission.

[0065] LTE technology is a 4G (Fourth Generation) wireless cellular communication technology. LTE uses OFDM technology, where subcarriers and OFDM symbols constitute the wireless physical time-frequency resources of the LTE system. OFDM technology is currently widely used in wireless communication. Due to the use of a cyclic prefix (CP), the Cyclic Prefix Orthogonal Frequency Division Multiplexing (CP-OFDM) system can effectively solve the multipath delay problem and divide the frequency-selective channel into a set of parallel, flat channels. This greatly simplifies the channel estimation method and provides high channel estimation accuracy. Discrete Fourier Transform-spread Orthogonal Frequency Division Multiplexing (DFT-S-OFDM) is a digital waveform, also known as DFT-spread OFDM, DFT-precoded OFDM, or Transform Precoding, which can be used to transmit data over wide radio frequency (RF) channels. This technology is actually a combination of two different technologies: Discrete Fourier Transform (DFT) and Orthogonal Frequency Division Multiplexing (OFDM), added before the Inverse Fast Fourier Transform (IFFT) module. It's an orthogonal frequency division multiplexing form used in advanced wireless systems to reduce the peak-to-average power ratio (PAPR), allowing power amplifiers to operate more efficiently. In 4G, the uplink waveform is DFT-S-OFDM, and the downlink waveform is CP-OFDM. In 5G (Fifth Generation) wireless cellular communication technology, the uplink supports both CP-OFDM and DFT-S-OFDM waveforms, while the downlink only supports CP-OFDM. DFT precoding, also known as transform precoding, enables semi-static switching between the two waveforms by enabling or disabling the transform precoder through higher-layer configuration signaling.

[0066] In wireless communication networks, transmitters can encode information data according to specific error correction and decoding schemes to improve communication reliability. Transmitters can then modulate the encoded information onto frequency subcarriers for transmission according to specific modulation schemes. Transmitters can use various modulation techniques. In some cases, transmitters may use modulation techniques based on Quadrature Amplitude Modulation (QAM). Modulation schemes can have specific constellation diagrams, with constellation points located in the complex plane. Constellation points can also be called constellation symbols or modulation symbols. Transmissions generated using a specific modulation scheme can carry information data bits represented by constellation symbols, which come from a set of constellation symbols defined for that modulation scheme.

[0067] QAM is a modulation method that modulates amplitude on two orthogonal carriers. These two carriers are typically sine waves with a phase difference of 90 degrees (π / 2), hence the name "orthogonal carriers." The modulation method is named after this. QAM is a widely used modulation technique in digital communication. The transmission characteristics of QAM signals can be intuitively understood through the representation of constellation diagrams. In a constellation diagram, each constellation point corresponds to a specific value in the transmitted signal set. These points are usually arranged in a square grid with equal spacing in the horizontal and vertical directions, forming a two-dimensional geometric figure that facilitates observation of signal distribution. In digital communication, data is usually represented using binary numbers, so the number of constellation points is often a power of 2. As the number of constellation points increases, the amount of information that each symbol can transmit also increases. However, if the average energy of the constellation diagram remains constant, increasing the number of constellation points will lead to a decrease in the distance between the constellation points. In this case, interference between signals will increase, thereby increasing the bit error rate and reducing communication reliability.

[0068] Traditional modulation methods (such as QAM and PSK) use uniformly distributed signal points on the constellation diagram, but this method is not always optimal. Channel capacity generally refers to the maximum transmission rate of a channel, derived from the bandwidth and signal-to-noise ratio (SNR) it supports. This channel capacity is often referred to as "Shannon capacity." QAM-based transmission using uniformly distributed QAM symbols may not achieve Shannon capacity. For example, uniform QAM can asymptotically approach the capacity SNR curve by about 1.53 dB. However, in practical communication channels, according to Shannon theory, signals with a Gaussian distribution are closer to the optimal power distribution, resulting in data transmission rates closer to Shannon capacity, reducing average power, and improving spectral efficiency. Typically, shaping modulation mainly includes two categories: geometric shaping (GS) and probabilistic shaping (PS). In geometric constellation shaping, each constellation point in the complex plane appears with approximately equal probability, but the positions of these points are adjusted to make the signal amplitude distribution closer to a Gaussian distribution, reducing the frequency of high-energy symbols. In terms of constellation diagram form, the smaller the amplitude, the denser the constellation points; the larger the amplitude, the sparser the points. In probabilistic constellation shaping (also known as probabilistic amplitude shaping (PAS)), a more traditional (e.g., grid-like) symbol distribution is used in the complex plane, but the probabilities of using the corresponding constellation symbols are not equal. In this method, each symbol of the input signal is mapped to a point in the constellation diagram, and by adjusting the emission probabilities of each point in the constellation diagram, the signal probability distribution is made closer to the target probability distribution.

[0069] In some respects, a distribution matcher (DM) can be applied to transform a sequence of k uniformly distributed bit sequences (e.g., information bits) into a sequence of n symbols (codewords) with a desired or target probability distribution. An example of a DM is the Constant Composition Distribution Matcher (CCDM). A characteristic of CCDM is that all symbol sequences output by CCDM have the same component (a single component). A component is an ordered set of occurrences of each symbol in a set of M symbols from which the symbols in the DM output sequence originate. When applying DM to constellation shaping, the set of M symbols can be based on a modulation scheme. For example, the set of M modulation symbols or modulation symbol letters for 16-QAM is {±1, ±3}. As another example, the set of M modulation symbols or modulation symbol letters for 64-QAM is {±1, ±3, ±5, ±7}. Therefore, in the context of constellation shaping, a component can also be referred to as a modulation symbol distribution, which may include the number of occurrences of each symbol in the set of M symbols associated with the modulation scheme. While CCDM can provide constellations with non-uniform distributions or shapes, it may not handle short data packets well due to the use of a single component. Therefore, the rate loss when using CCDM for short-distance data packet transmission may be higher.

[0070] HARQ is a crucial link adaptation technology in digital communication systems. The implementation process is as follows: the receiver decodes the received HARQ data packets. If the decoding is correct, it sends an ACK (Acknowledgement) message to the sender, instructing the sender to transmit a new HARQ data packet. If decoding fails, it sends a NACK (Negative Acknowledgement) message to the sender, requesting retransmission of the HARQ data packet. By performing IR or Chase merging decoding on multiple retransmitted data packets, the receiver can improve the success rate of decoding, achieving high reliability requirements for link transmission.

[0071] The signal processing method provided in this application embodiment can be applied to various communication systems. For example, the communication system can be an LTE system, a 5G communication system, a 5G-A communication system, a Wi-Fi system, a 3rd generation partnership project (3GPP) related communication system, a future evolution communication system (such as a 6th generation (6G) or a 7th generation (7G) communication system), or a system integrating multiple systems, etc. This application embodiment does not limit this. Figure 1 is a schematic diagram of the architecture of a communication system provided in this application embodiment. The channel coding method provided in this application embodiment is described below using the communication system 100 shown in Figure 1 as an example. Figure 1 is only a schematic diagram and does not constitute a limitation on the applicable scenarios of the technical solution provided in this application. As shown in Figure 1, the communication system 100 may include one or more network devices (i.e., base stations) and one or more terminal devices. For example, the communication system 100 may include a base station 110, terminal device 120, terminal device 130, terminal device 140, and a core network 150. It should be clarified that a network device can be understood as a base station.

[0072] Network device 110 can provide communication services to terminal devices 120, 130, and 140, and can also connect to the core network 150. For example, network device 110 communicates with terminal device 120 via a wireless network. When terminal device 120 sends data, the wireless communication module can encode the information for transmission. Specifically, the wireless communication module can acquire a certain number of information bits to be transmitted to access network device 110 through the channel. These information bits may be generated by the processing module, received from other devices, or stored in the storage module. These information bits may be contained in one or more TBs, and TBs can be segmented to generate multiple code blocks (CBs).

[0073] When the transmission direction of the communication system 100 is uplink, the terminal device 120 is the transmitter and the access network device 110 is the receiver. When the transmission direction of the communication system 100 is downlink, the access network device 110 is the transmitter and the terminal device 120 is the receiver.

[0074] The technical solutions provided in this application can be applied to various wireless communication systems. For example, the technical solutions provided in this application are mainly applied to future communication systems, such as sixth-generation mobile communication systems, next-generation wireless local area network systems, etc. The 6G mobile communication system described in this application includes non-standalone (NSA) 6G mobile communication systems and / or standalone (SA) 6G mobile communication systems.

[0075] The channel coding method proposed in this optional embodiment can be used in next-generation mobile communication systems or other wireless communication systems. The data transmission direction is either from the base station to the mobile user (downlink transmission service data) or from the mobile user to the base station (uplink transmission service data). Mobile users include: mobile devices, access terminals, user terminals, user stations, user units, mobile stations, remote stations, remote terminals, user agents, user equipment, user devices, or other terms. Base stations include access points (APs), or may be referred to as node B, radio network controller (RNC), evolved Node B (eNB), base station controller (BSC), base transceiver station (BTS), base station (BS), transceiver function (TF), radio router, radio transceiver, basic service unit, extended service unit, radio base station (RBS), or other terms.

[0076] Base stations can provide communication coverage for macro cells, pico cells, home cells, and / or other types of cells. A macro cell can cover a relatively large geographic area (e.g., a radius of several kilometers) and can allow unrestricted access for UEs with a service subscription. A pico cell may cover a relatively small geographic area and may allow unrestricted access for UEs with a service subscription. A femto cell can cover a relatively small geographic area (e.g., a home) and can allow restricted access for UEs associated with a femto cell (e.g., UEs in a Closed Subscriber Group (CSG)). The ABS of a macro cell can be referred to as a macro BS. The BS of a pico cell can be referred to as a pico BS. The BS used for a femto cell may be referred to as a femto BS or a home BS. The terms “eNB,” “base station,” “NR BS,” “gNB,” “TRP,” “AP,” “node B,” “5G NB,” “hNB,” “6G NB,” “iNB,” “7G NB,” and “cell” are used interchangeably here.

[0077] A network controller can be coupled to one or more (e.g., a group of) business units (BSs) and can provide coordination and control for these BSs. The network controller can communicate with the BSs via backhaul. BSs can also communicate with each other, for example, directly or indirectly via wireless or wired backhaul.

[0078] UEs can be distributed throughout the wireless network, and each UE can be fixed or mobile. A UE can communicate with one or more BSs in the wireless network.

[0079] UE can also be referred to as access terminal, terminal, mobile station, user unit, station, etc. UE can be a cellular phone (e.g., smartphone), personal digital assistant (PDA), wireless modem, wireless communication device, handheld device, laptop, cordless phone, wireless local loop (WLL) station, tablet, camera, gaming device, netbook, smartbook, ultrabook, medical device or equipment, biometric sensor / device, wearable device (smartwatch, smart clothing, smart glasses, smart wristband, smart jewelry (e.g., smart ring, smart bracelet)), entertainment device (e.g., music or video device or satellite radio), vehicle component or sensor, smart meter / sensor, industrial manufacturing equipment, GPS device, or any other suitable device configured to communicate via wireless or wired media.

[0080] In 5G mobile communication systems, the Channel State Information (CSI) feedback from the terminal to the base station supports both implicit CSI feedback and feedback based on channel reciprocity. Implicit feedback quantifies and feeds back information such as Channel Quality Indicator (CQI), Precoding Matrix Indicator (PMI), Rank Indicator (RI), and Channel Rank Indicator (CNI). To address the different accuracy requirements of single-user (SU) and multi-user (MU) systems, NR supports two types of codebooks for CSI feedback: a standard-precision Type I codebook and a high-precision Type II codebook. Reciprocity-based CSI feedback can be further divided into feedback based on full channel reciprocity and feedback based on partial channel reciprocity, depending on the feedback conditions. CSI includes the following measurement information: CQI, PMI, CSI-RS Resource Indicator (CRI), Synchronization Signal / PBCH Block (SSB) Resource Indicator (SSBRI), Layer Indicator (LI), RI, and Layer 1 Reference Signal Received Power (L1-RSRP). SSBRI, LI, and L1-RSRP are feedback parameters newly added in 5G compared to 4G. L1 indicates the strongest column in PMI and is used for PT-RS reference signal mapping. SSBRI and L1-RSRP are used for beam management; SSBRI indicates the beam index, and L1-RSRP indicates the beam strength.

[0081] As described above, in a 5G NR system, the coding module and the MIMO module are independent of each other, and each module maintains a near-optimal design, but the overall design is not optimal. Based on the research and development requirements of 6G technology, the spectral efficiency of 6G needs to be 1.5 times and 3 times that of 5G, urgently requiring further improvement in the performance gain of 6G channel coding. Therefore, it is necessary to comprehensively consider the optimization design of coding and MIMO while maintaining compatibility with existing channel coding designs. To solve the above problems, this application provides a signal processing method that, while maintaining compatibility with 5G NR channel coding designs, comprehensively considers the relationship between spatial channels in coding and MIMO for signal transmission, thereby improving signal transmission performance. The signal processing method provided in this application can be implemented in a communication node, which can be a transmitting communication device used in next-generation 6G communication systems and subsequent communication systems (6G and beyond), such as a base station, terminal, relay station, or satellite communication device, or a transmitting communication device in a next-generation fixed access wireless communication system, such as an access point (AC) or terminal. This application does not impose any limitations on this. In some possible implementations, signal processing methods can be implemented by calling computer-readable instructions stored in memory.

[0082] In one exemplary embodiment, Figure 2 is a flowchart of a signal processing method provided in an embodiment of this application. This method can be applied to a wireless communication system, taking into account the relationship between coding and spatial channels in MIMO for signal transmission. This method can be executed by a signal processing device, which can be implemented by software and / or hardware and integrated on a communication node. This method can be applied to a first communication node, which can be a transmitting communication device in a wireless communication system. This embodiment of the application does not limit this.

[0083] As shown in Figure 2, the data processing method provided in this embodiment of the application specifically includes the following steps:

[0084] S101. Perform code block segmentation and add cyclic redundancy check (CRC) bit sequences to the input data block to determine at least one code block bit sequence.

[0085] The input data block includes: a transport block; or a transport block and a transport block CRC.

[0086] In this embodiment, a transport block can be specifically understood as a data unit transmitted between the physical layer and the Media Access Control (MAC) layer.

[0087] In a specific example, when signal transmission is required and the required transmission block is obtained, a CRC bit sequence is first calculated based on a given CRC polynomial and the input transmission block. This CRC bit sequence is then added to the transmission block to obtain the input data block. That is, the input data block can contain only the transmission block, or it can contain both the transmission block and its CRC. Furthermore, based on the number of code blocks in the input data block, it is segmented into code blocks, and a CRC bit sequence is added to each segmented code block. Each code block after adding the CRC bit sequence is defined as a code block bit sequence.

[0088] In some examples, the number of code blocks C in the input data block can be determined first. If C is greater than 1, the input data block is segmented into code blocks, and a CRC bit sequence is added to each resulting code block or code block group.

[0089] In some examples, a block CRC bit sequence can be added to each segmented block.

[0090] In some examples, assuming there are N code blocks after code block segmentation, the N code blocks are divided into M groups, and a code block group CRC bit sequence is added to each group. The code block group CRC is generated based on the data of the code block group and a CRC generator polynomial encoding.

[0091] S102. Perform channel coding on each code block bit sequence to determine the mother codeword corresponding to each code block bit sequence.

[0092] In a specific example, each input code block bit sequence is individually LDPC-encoded or Polar-encoded to obtain the mother codeword corresponding to each code block bit sequence.

[0093] In some examples, such as when the input is a sequence of C code blocks, each of the C input code block bit sequences will be individually LDPC encoded or Polar encoded to generate C mother codewords of length N.

[0094] It should be clarified that this step involves generating a mother codeword of length N by channel coding the information bit sequence.

[0095] It should be clarified that redundant information can be added to the original data stream, enabling the receiver to detect and correct signal errors caused by the transmission medium, while improving the reliability of data transmission.

[0096] S103. Perform bit selection on each mother codeword to determine the bit selection sequence corresponding to each mother codeword.

[0097] In a specific example, bit selection is performed on each input mother codeword to obtain the bit-selected sequence corresponding to each mother codeword.

[0098] In some examples, such as when the input is C mother codewords of length N, the C mother codewords of length N will be bit-selected individually to obtain C bit-selected sequences of length E.

[0099] In some examples, each channel-coded mother codeword of length N can be written separately into a circular buffer of length Ncb. Then, based on the redundant version of this HARQ transmission, Er codeword bits are individually selected from the circular buffer to generate C bit selection sequences. Here, Er is a positive integer greater than 1, Er is the length of the bit selection sequence of the r-th code block, and r is the code block index. It can be understood that E corresponds to the case where the bit selection sequences of each code block are equal, but may also include cases where they are unequal; Er corresponds to the length of the bit selection sequence of each code block.

[0100] It should be clarified that the purpose of bit selection is to adapt the length of the output codeword to the code rate requirement by punching (selecting some bits) or repeating.

[0101] S104. Based on the first data characteristics, the selected sequences of each bit are interleaved to determine the interleaved sequence.

[0102] The first data feature includes at least one of the following: layer indication information; port indication information; number of transmission layers; number of transmission layers and a preset threshold for the number of transmission layers; rank indication information and a preset threshold for the rank; number of ports and a preset threshold for the number of ports.

[0103] In this embodiment, the first data feature can be specifically understood as information used to indicate the spatial channel characteristics in MIMO.

[0104] In a specific example, code block interleaving is performed on the selected sequence of each bit according to the interleaving core parameters that are directly affected or determined by the first data feature, so as to obtain the interleaved sequence corresponding to each selected bit sequence.

[0105] In some examples, such as when the input is a sequence of C selected bits, each selected bit sequence will be interleaved according to the first data feature to obtain C interleaved output sequences.

[0106] It should be clarified that the code block interleaving proposed in the embodiments of this application for selecting each bit sequence based on the first data feature means that the first data feature directly affects or determines the core interleaving parameters, such as interleaving depth or interleaving pattern, rather than in an indirect or implicit way.

[0107] It is important to clarify that code block interleaving refers to only changing the position index of the input data bits. In other words, only the position of the input data is shifted, without changing the data bits themselves.

[0108] It should be clarified that code block interleaving maps consecutive codeword bits within a code block to discrete positions, improving diversity gain and thus better overcoming channel fading.

[0109] In some examples, the preset threshold for the number of transport layers is a positive integer. In one example, the preset threshold for the number of transport layers is 1. In another example, the preset threshold for the number of transport layers is 2.

[0110] In some examples, the first data feature includes layer indication information.

[0111] In some examples, the first data feature includes the number of transport layers.

[0112] In some examples, the first data feature includes layer indication information and the number of transport layers.

[0113] In some examples, the first data feature includes layer indication information, the number of transport layers, and a preset threshold for the number of transport layers.

[0114] In some examples, the first data feature may also include the link direction; wherein the link direction includes the downlink direction or the uplink direction.

[0115] In some examples, the first data feature may also include a basic graph index; wherein the basic graph index is used to indicate one of the multiple basic graph matrices.

[0116] In some examples, the first data feature includes port indication information.

[0117] In some examples, the first data feature includes port indication information and the transport layer number.

[0118] In some examples, the code block interleaving operation includes at least one of the following: row read-in, column read-out; row permutation; column permutation.

[0119] In some examples, the code block interleaving operation includes at least: row read-in and column read-out.

[0120] In some examples, the code block interleaving operations include at least: row read-in, row permutation, and column read-out.

[0121] In some examples, the code block interleaving operation includes at least: column in and row out.

[0122] In some examples, the code block interleaving operations include at least: column read-in, column permutation, and row read-out.

[0123] Optionally, the number of columns in the deinterleaver is equal to the number of rows in the deinterleaver, and the number of rows in the deinterleaver is equal to the number of columns in the deinterleaver.

[0124] S105. Concatenate the interleaved sequences into code blocks in order to determine the output sequence after concatenation.

[0125] In a specific example, each interleaved sequence is concatenated into code blocks in sequence to obtain the concatenated output sequence.

[0126] S106. Scramble the concatenated output sequence to determine the scrambled sequence.

[0127] In some examples, the concatenated input output sequence can be subjected to a binary XOR operation (or modulo-2 addition) using the generated pseudo-random sequence. In other examples, if the bit to be scrambled is a placeholder bit, the scrambled bit will be either 1 or the original bit.

[0128] S107. Modulate the scrambled sequence to determine the modulation symbol sequence.

[0129] In a specific example, the scrambled sequence is modulated to obtain a codeword stream, that is, a modulated symbol sequence.

[0130] S108. Map the modulation symbol sequence to the transport layer.

[0131] In a specific example, since the transport layer can contain multiple layers, after obtaining the modulation symbol sequence, the modulation symbols can be mapped to one or more layers in the transport layer according to the input order of the modulation symbol sequence, thus obtaining the modulation symbol sequences of each layer in the transport layer. Then, each layer's modulation symbol sequence can be mapped to one or more antenna ports, and the data symbols of each antenna port can be mapped to resource elements. An inverse Fourier transform is performed on the resource element symbols to obtain OFDM waveforms, which are then transmitted through intermediate frequency (IF) and radio frequency (RF) circuits to achieve signal transmission.

[0132] The signal processing method provided in this application embodiment determines at least one code block bit sequence by segmenting the input data block into code blocks and adding a cyclic redundancy check (CRC) bit sequence to the code block; performing channel coding on each code block bit sequence to determine the corresponding master codeword; performing bit selection on each master codeword to determine the bit-selected sequence corresponding to each master codeword; performing code block interleaving on each bit-selected sequence according to a first data feature to determine the interleaved sequence; concatenating the interleaved sequences in sequence to determine the concatenated output sequence; scrambling the concatenated output sequence to determine the scrambled sequence; modulating the scrambled sequence to determine the modulation symbol sequence; and mapping the modulation symbol sequence to the transport layer. The first data feature includes at least one of the following: layer indication information; port indication information; number of transport layers; a preset threshold for the number of transport layers; rank indication information and a preset threshold for the rank; number of ports and a preset threshold for the number of ports. The input data block includes: a transport block; or a transport block and a transport block CRC. By adopting the above technical solution, the data characteristics related to the spatial channel in MIMO are taken into account in the signal transmission. Based on the existing channel coding of Jianyou, the relationship between the coding module and the MIMO module is comprehensively considered, thereby improving the signal transmission performance.

[0133] In one embodiment, the selected bit sequence is interleaved with code blocks according to a first data feature to determine the interleaved sequence, including:

[0134] Bit interleaving information is determined based on the first data feature; the bit interleaving information includes at least one of the following: interleaving depth; bit interleaving index; interleaving pattern; wherein the length of the bit interleaving index is equal to the length of the bit-selected sequence;

[0135] The selected bits are interleaved using bit interleaving information to determine the interleaved sequence.

[0136] In a specific example, bit interleaving information is determined based on at least one of the following: layer indication information corresponding to the first data feature; port indication information; number of transmission layers; preset threshold of the number of transmission layers; rank indication information and preset threshold of the rank; number of ports and preset threshold of the ports. The bit interleaving information is then used to perform code block interleaving on the selected bit sequence to obtain the interleaved sequence.

[0137] In one embodiment, the first data feature is obtained based on control information;

[0138] The control information includes at least one of the following:

[0139] Downlink control information (DCI) sent from the base station to the terminal;

[0140] Uplink control information (UCI) sent by the terminal to the base station;

[0141] Radio Resource Control (RRC) signaling messages;

[0142] Media Access Control (MAC) element information.

[0143] In some examples, the first data feature may be predefined.

[0144] In one embodiment, the layer indication information includes at least one of the following:

[0145] Best layer indication information;

[0146] Worst-case indicator information;

[0147] Ideally, there should be M1 layers of indicator information;

[0148] The worst M2 layers indicate information.

[0149] Where M1 and M2 are positive integers greater than or equal to 1.

[0150] In some examples, M1 and M2 can be preset fixed values, or they can be configured by the base station.

[0151] In some examples, layer indication information can be used to indicate the mapping of the first bits of a bit-selected sequence to the transport layer indicated by the layer indication information in multiple transport layers. Here, the first bits refer to the bits in the bit-selected sequence that are first from the start position. For example, a preset number of bits can be set for the bit-selected sequence starting from the start position; this preset number may depend on the transport layer's carrying capacity.

[0152] In some examples, the layer indication information can be used to indicate the mapping of the first bits of the bit-selected sequence to the best M1 transport layer indicated by the layer indication information among multiple transport layers.

[0153] In some examples, the layer indication information can be used to indicate that the later bits of the bit-selected sequence will be mapped to the worst M2 transport layer indicated by the layer indication information among multiple transport layers. Here, the later bits refer to the bits in the bit-selected sequence that are located after the end position. For example, it can be a preset number of bits in the bit-selected sequence that are reversed from the end position. This preset number may depend on the transport layer carrying capacity to which the data will be mapped.

[0154] In some examples, the port indication information includes at least one of the following:

[0155] Best port indication information;

[0156] Worst-case port indication information;

[0157] Ideally, M1 port information should be provided.

[0158] Worst M2 port indication information.

[0159] Where M1 and M2 are positive integers greater than or equal to 1.

[0160] In one embodiment, modulating the scrambled sequence to determine the modulation symbol sequence includes:

[0161] The scrambled bit sequence is sequentially grouped into groups of QM bits to determine multiple bit groups;

[0162] Each bit group is sequentially mapped to a constellation modulation symbol to determine the modulation symbol sequence;

[0163] Where QM is the modulation order.

[0164] In a specific example, a scrambled bit sequence of length M bits can be divided into multiple bit groups of QM bits each, and each bit group can be mapped to a constellation modulation symbol in turn to obtain a complex symbol modulation sequence of length M symbols.

[0165] In one embodiment, the modulation method for modulating the scrambled sequence includes at least one of the following:

[0166] π / 2-Binary Phase Shift Keying (BPSK) modulation;

[0167] Quadrature phase shift keying (QPSK) modulation;

[0168] Hexadecimal quadrature amplitude (QAM) modulation;

[0169] 64-bit QAM modulation;

[0170] 256-base QAM modulation;

[0171] 1024-base QAM modulation.

[0172] In some examples, the modulation scheme may include: QPSK, 16QAM, 64QAM.

[0173] In some examples, the modulation scheme may include: QPSK, 16QAM, 64QAM, 256QAM.

[0174] In some examples, the modulation scheme may include: QPSK, 16QAM, 64QAM, 256QAM, 1024QAM.

[0175] In some examples, the modulation scheme may include: QPSK, 16QAM, 64QAM, 256QAM, 1024QAM, 2048QAM.

[0176] In some examples, the modulation scheme may include: π / 2-BPSK, QPSK, 16QAM, 64QAM.

[0177] In some examples, the modulation scheme may include: π / 2-BPSK, QPSK, 16QAM, 64QAM, 256QAM.

[0178] In some examples, the modulation scheme may include: π / 2-BPSK, QPSK, 16QAM, 64QAM, 256QAM, 1024QAM.

[0179] In some examples, the modulation method may be generalized shaping modulation, geometric shaping modulation, or AI-generated modulation.

[0180] In one embodiment, mapping the modulation symbol sequence to the transport layer includes:

[0181] The modulation symbol sequence is divided into groups of L modulation symbols according to the input order from front to back;

[0182] The modulation symbols are mapped to the transport layer in a round-robin fashion, in ascending order of layer index.

[0183] Where L is the number of transport layers.

[0184] In one embodiment, the selected bit sequence is interleaved with code blocks according to a first data feature to determine the interleaved sequence, including:

[0185] Based on the first data characteristics and modulation order, the selected bits are interleaved into code blocks to determine the interleaved sequence.

[0186] In a specific example, when performing code block interleaving on the selected sequence of each bit based on the first data feature, not only the first data feature but also the influence of the modulation order on the code block interleaving needs to be considered. That is, the code block interleaving for the selected sequence of each bit can be completed solely based on the first data feature, solely based on the modulation order, or simultaneously based on both the first data feature and the modulation order.

[0187] In one embodiment, the selected sequence of bits is subjected to code block interleaving based on a first data feature and a modulation order, including at least one of the following:

[0188] Based on the modulation order, the number of transmission layers, and a preset threshold for the number of transmission layers, the selected bits are interleaved into code blocks.

[0189] Based on the modulation order, layer indication information, number of transmission layers, and preset threshold for the number of transmission layers, the sequence of selected bits is interleaved into code blocks.

[0190] The first interleaving is performed on the selected sequence of each bit according to the modulation order to determine the sequence after the first interleaving. The second interleaving is performed on the sequence after the first interleaving according to the first data feature.

[0191] The selected bits are then interleaved in blocks according to the first data feature and the modulation order; wherein the number of rows of the block interleaving is determined according to the first data feature.

[0192] In one embodiment, the selected bit sequence is subjected to code block interleaving based on the modulation order, the number of transmission layers, and a preset threshold for the number of transmission layers, including:

[0193] If the number of transmission layers is greater than a preset threshold, the sequence of selected bits is interleaved according to the number of transmission layers.

[0194] When the number of transmission layers is less than or equal to a preset threshold, the sequence of selected bits is interleaved according to the modulation order.

[0195] In some examples, the sequence of selected bits is interleaved according to the modulation order and the number of transmission layers, including:

[0196] When the number of transport layers is greater than 1, the sequence of selected bits is interleaved according to the number of transport layers.

[0197] When the number of transmission layers is equal to 1, the sequence of selected bits is interleaved according to the modulation order.

[0198] In some examples, when the number of transport layers is greater than a preset threshold, the input bit selection sequence is used to perform row-in and column-out code block interleaving; where the number of interleaving rows is obtained based on the number of transport layers.

[0199] In some examples, when the number of transport layers is less than or equal to a preset threshold, the input bit selection sequence is interleaved with row-read and column-read code blocks; where the number of interleaver rows is obtained based on the modulation order.

[0200] In one embodiment, the selected bit sequence is subjected to code block interleaving based on the modulation order, layer indication information, number of transmission layers, and a preset threshold for the number of transmission layers, including:

[0201] When the number of transport layers is greater than a preset threshold, the sequence of selected bits is interleaved according to the layer indication information and the number of transport layers.

[0202] When the number of transmission layers is less than or equal to a preset threshold, the sequence of selected bits is interleaved according to the modulation order and the number of transmission layers.

[0203] In some examples, when the number of transport layers is greater than a preset threshold, the input bit selection sequence is interleaved with row-read and column-read code blocks; where the number of interleaver rows is obtained based on the number of transport layers, and row permutation operation is also required between row-read and column-read based on the layer indication information.

[0204] In some examples, when the number of transport layers is less than or equal to a preset threshold, the input bit selection sequence is interleaved with row read-in and column read-out code blocks; where the number of interleaver rows is obtained based on the modulation order, and row permutation operation is also required between row read-in and column read-out based on the layer indication information.

[0205] In one embodiment, the first step of interleaving is row-to-column interleaving based on the modulation order; the second step of interleaving is row-to-column interleaving based on the number of transmission layers.

[0206] In some examples, the first step of interleaving is performed on the sequence after each bit is selected according to the modulation order. This includes performing row-column interleaving on the input sequence after each bit is selected, with the number of rows equal to the modulation order, to obtain the sequence after the first step of interleaving. The corresponding row-column interleaver is a row-in, column-out row-column interleaver.

[0207] In some examples, a second interleaving step is performed on the first interleaving sequence based on the first data feature, including: performing row-column interleaving on each input first interleaving sequence with the number of rows equal to the number of transport layers to obtain an interleaved sequence, the corresponding row-column interleaver being a row-in, column-out row-column interleaver.

[0208] In some examples, for each row-column interleaving, the approach can be to read the input data by rows, perform row permutation, and then read the columns. The row permutation is performed based on layer instruction information.

[0209] In one embodiment, the selected bit sequence is block-interleaved according to a first data feature and a modulation order, including:

[0210] Read the selected bit sequence line by line;

[0211] The selected bits of the sequence are permuted according to the modulation order and layer indication information;

[0212] Read the sequence of bits selected after row permutation from row and column.

[0213] In one exemplary embodiment, Figure 3 is a flowchart of a signal processing method provided in an embodiment of this application. This method can be applied to a wireless communication system, taking into account the relationship between coding and spatial channels in MIMO for signal transmission. This method can be executed by a signal processing device, which can be implemented by software and / or hardware and integrated on a communication node. This method can be applied to a second communication node, which can be a receiving communication device in a wireless communication system. This embodiment of the application does not limit this.

[0214] As shown in Figure 3, the signal processing method provided in this embodiment of the application specifically includes the following steps:

[0215] S201. Perform de-layer mapping on the modulation symbol sequence of each layer in the transmission layer to determine the modulation symbol sequence.

[0216] In a specific example, this step is the reverse step of S108, and it applies to all technical features and / or sub-implementations of S108.

[0217] S202. Demodulate the modulation symbol sequence to determine the scrambled sequence.

[0218] In a specific example, the constellation points on the constellation diagram are demapped, that is, the modulation symbol sequence is demodulated. This step is the reverse step of S107 and is applicable to all technical features and / or sub-implementations of S107.

[0219] S203. Descramble the scrambled sequence and determine the concatenated output sequence.

[0220] In a specific example, this step is the reverse step of scrambling in S106, and it applies to all technical features and / or sub-implementations of S106.

[0221] S204. Deconcatenate the code blocks of the concatenated output sequence to determine the interleaved sequence.

[0222] In a specific example, the concatenated output sequence of the input concatenation is deconcatenated (segmented) to obtain a soft bit sequence of C code blocks, which is also the interleaved sequence of C code blocks. This step is the reverse step of code block concatenation in S105 and is applicable to all technical features and / or sub-implementations of S105.

[0223] S205. Based on the first data characteristics, the interleaved sequence is deinterleaved into code blocks to determine at least one bit selected sequence.

[0224] The first data feature includes at least one of the following: layer indication information; port indication information; number of transmission layers; number of transmission layers and a preset threshold for the number of transmission layers; rank indication information and a preset threshold for the rank; number of ports and a preset threshold for the number of ports.

[0225] In a specific example, the interleaved sequence of C code blocks, i.e., the code block deinterleaving operation is performed on the C code blocks as a bit sequence, to obtain the C deinterleaved soft-output codeword sequence, i.e., the C deinterleaved bit-selected sequence. This step is the reverse step of code block interleaving in S104, and it is applicable to all technical features and / or sub-implementations of S104.

[0226] It should be clarified that the decoding block interleaving proposed in the embodiments of this application for selecting each bit sequence based on the first data feature means that the first data feature directly affects or determines the core parameters of interleaving, such as interleaving depth or interleaving pattern, rather than in an indirect or implicit way.

[0227] In some examples, the preset threshold for the number of transport layers is a positive integer. In one example, the preset threshold for the number of transport layers is 1. In another example, the preset threshold for the number of transport layers is 2.

[0228] In some examples, the first data feature includes layer indication information.

[0229] In some examples, the first data feature includes the number of transport layers.

[0230] In some examples, the first data feature includes layer indication information and the number of transport layers.

[0231] In some examples, the first data feature includes layer indication information, the number of transport layers, and a preset threshold for the number of transport layers.

[0232] In some examples, the first data feature may also include the link direction; wherein the link direction includes the downlink direction or the uplink direction.

[0233] In some examples, the first data feature may also include a basic graph index; wherein the basic graph index is used to indicate one of the multiple basic graph matrices.

[0234] In some examples, the first data feature includes port indication information.

[0235] In some examples, the first data feature includes port indication information and the transport layer number.

[0236] In some examples, the code block deinterleaving operation includes at least one of the following: row-in, column-out; row permutation; column permutation.

[0237] In some examples, the code block deinterleaving operation includes at least: row read-in and column read-out.

[0238] In some examples, the code block deinterleaving operation includes at least: row read-in, row permutation, and column read-out.

[0239] In some examples, the code block deinterleaving operation includes at least: column in and row out.

[0240] In some examples, the code block deinterleaving operation includes at least: column read-in, column permutation, and row read-out.

[0241] Optionally, the number of columns in the deinterleaver is equal to the number of rows in the deinterleaver, and the number of rows in the deinterleaver is equal to the number of columns in the deinterleaver.

[0242] S206. Perform de-bit selection on the sequence after each bit selection to determine the mother codeword corresponding to each bit selection sequence.

[0243] In a specific example, this step is the reverse step of bit selection in S103, and it applies to all technical features and / or sub-implementations of S103.

[0244] S207. Perform channel decoding on each mother codeword to determine the code block bit sequence corresponding to each mother codeword.

[0245] In a specific example, each code block sequence in the C input mother codewords can be individually LDPC decoded or Polar decoded to generate C decoded code blocks of length N, which are C code block bit sequences corresponding to the mother codewords. This step is the inverse step of channel coding in S102 and is applicable to all technical features and / or sub-implementations of S102.

[0246] S208. Perform decoding block segmentation and decoding block cyclic redundancy check bit sequence on the bit sequence of each code block to determine the output data block.

[0247] The output data block includes: a transport block; or a transport block and a transport block CRC.

[0248] In a specific example, based on the given CRC polynomial and the bit sequence of each code block, a CRC check is performed on the transport block to determine whether the transport block has been correctly received. This step is also the reverse step of S101 and applies to all technical features and / or sub-implementations of S101.

[0249] In one embodiment, deinterleaving the interleaved sequence according to a first data feature to determine at least one bit-selected sequence includes:

[0250] Bit interleaving information is determined based on the first data feature; the bit interleaving information includes at least one of the following: interleaving depth; bit interleaving index; interleaving pattern; wherein the length of the interleaving index is equal to the length of the bit-selected sequence;

[0251] By deinterleaving the interleaved sequence with bit interleaving information, at least one bit-selected sequence is determined.

[0252] In one embodiment, the first data feature is obtained based on control information;

[0253] The control information includes at least one of the following:

[0254] Downlink control information sent from the base station to the terminal;

[0255] Uplink control information sent by the terminal to the base station;

[0256] Radio Resource Control (RRC) signaling messages;

[0257] Media access control element information.

[0258] In some examples, the first data feature may be predefined.

[0259] In one embodiment, the layer indication information includes at least one of the following:

[0260] Best layer indication information;

[0261] Worst-case indicator information;

[0262] Ideally, there should be M1 layers of indicator information;

[0263] The worst M2 layers indicate information.

[0264] Where M1 is a positive integer greater than or equal to 1, and M2 is a positive integer greater than or equal to 1.

[0265] In some examples, M1 and M2 can be preset fixed values, or they can be configured by the base station.

[0266] In some examples, the port indication information includes at least one of the following:

[0267] Best port indication information;

[0268] Worst-case port indication information;

[0269] Ideally, M1 port information should be provided.

[0270] Worst M2 port indication information.

[0271] Where M1 and M2 are positive integers greater than or equal to 1.

[0272] In one embodiment, the modulation method for demodulating the modulation symbol sequence includes at least one of the following:

[0273] π / 2-Binary Phase Shift Keying (BPSK) modulation;

[0274] Quadrature phase shift keying (QPSK) modulation;

[0275] Hexadecimal quadrature amplitude (QAM) modulation;

[0276] 64-bit QAM modulation;

[0277] 256-base QAM modulation;

[0278] 1024-base QAM modulation.

[0279] In some examples, the modulation scheme may include: QPSK, 16QAM, 64QAM.

[0280] In some examples, the modulation scheme may include: QPSK, 16QAM, 64QAM, 256QAM.

[0281] In some examples, the modulation scheme may include: QPSK, 16QAM, 64QAM, 256QAM, 1024QAM.

[0282] In some examples, the modulation scheme may include: QPSK, 16QAM, 64QAM, 256QAM, 1024QAM, 2048QAM.

[0283] In some examples, the modulation scheme may include: π / 2-BPSK, QPSK, 16QAM, 64QAM.

[0284] In some examples, the modulation scheme may include: π / 2-BPSK, QPSK, 16QAM, 64QAM, 256QAM.

[0285] In some examples, the modulation scheme may include: π / 2-BPSK, QPSK, 16QAM, 64QAM, 256QAM, 1024QAM.

[0286] In some examples, the modulation method may be generalized shaping modulation, geometric shaping modulation, or AI-generated modulation.

[0287] The signal processing method of this application is illustrated below through some exemplary schemes. In the following schemes, the transmitting end of the communication node refers to the first communication node, and the receiving end of the communication node refers to the second communication node.

[0288] Solution 1: An example of a signal processing method applied to the transmitting end of a communication node is provided. The transmitting end can be a base station, terminal, relay station, or satellite communication device, or a transmitting communication device in a next-generation fixed access wireless communication system, such as an access point (AP) or terminal. Figure 4 is a flowchart illustrating a signal processing method provided in an embodiment of this application. As shown in Figure 4, the method specifically includes the following steps:

[0289] S301, Add CRC to the transport block.

[0290] In a specific example, the CRC bit sequence is calculated based on the given CRC polynomial and the input transport block sequence, and the resulting CRC bit sequence is appended to the transport block.

[0291] S302, code block segmentation and code block CRC addition.

[0292] In a specific example, the number of code blocks C is determined. If the number of code blocks C is greater than 1, the input data sequence is segmented into code blocks, and CRC is added to the segmented code blocks or code block groups.

[0293] In some examples, a block CRC is added to each segmented block.

[0294] In some examples, the number of code blocks after segmentation is N. The N segmented code blocks are divided into M groups, and a code block group CRC is added to each group. The code block group CRC is generated based on the data of the code block group and a CRC generator polynomial encoding.

[0295] Alternatively, the above S402 has an alternative solution that only involves code block segmentation and does not include adding code block CRC.

[0296] S303, Channel Coding.

[0297] In a specific example, each of the C input code block bit sequences is individually LDPC encoded or Polar encoded to generate C mother codewords of length N.

[0298] It should be clarified that this step involves generating a mother codeword of length N by channel coding the information bit sequence.

[0299] It should be clarified that redundant information can be added to the original data stream, enabling the receiver to detect and correct signal errors caused by the transmission medium, while improving the reliability of data transmission.

[0300] S304, Bit Selection.

[0301] In a specific example, bit selection is performed individually on each of the C channel-coded mother codewords of length N to obtain C bit-selected sequences of length E.

[0302] In a specific example, each channel-coded mother codeword of length N is written separately into a circular buffer of length Ncb. Then, based on the redundant version of this HARQ transmission, Er codeword bits are selected separately from the circular buffer to generate C bit selection output sequences (which can also be understood as the bit selection sequences in the above embodiments). Here, Er is a positive integer greater than 1, Er refers to the length of the bit selection output sequence of the r-th code block, and r is the code block index.

[0303] It should be clarified that the purpose of bit selection is to adapt the length of the output codeword to the code rate requirement by punching (selecting some bits) or repeating.

[0304] S305, code block interleaving.

[0305] In a specific example, the input sequence of each code block is interleaved to obtain an interleaved sequence of C outputs.

[0306] In some examples, code block interleaving includes: selecting a sequence of bits based on a first data feature and then interleaving the resulting code blocks.

[0307] The first data feature includes at least one of the following: layer indication information; port indication information; number of transmission layers; number of transmission layers and a preset threshold for the number of transmission layers; rank indication information and a preset threshold for the rank; number of ports and a preset threshold for the number of ports.

[0308] In some examples, the first data feature includes at least one of the following: rank indication information; port indication information; number of transport layers; number of transport layers and a preset threshold for the number of transport layers; rank indication information and a preset threshold for the rank.

[0309] It needs to be clarified that when codeword sequences are selected based on the first data feature and then interleaved, it means that the first data feature directly affects or determines the core interleaving parameters, such as interleaving depth and interleaving pattern, rather than in an indirect or implicit way.

[0310] In some examples, the bit interleaving information of the code block interleaver is determined based on a first data feature, wherein the first data feature includes at least one of the following: layer indication information, port indication information, number of transport layers, a preset threshold for the number of transport layers, rank indication information, and a preset threshold for the rank.

[0311] The bit interleaving information of a code block interleaver includes at least one of the following: interleaving depth, interleaving pattern, and interleaving index sequence.

[0312] In this scheme, the interleaving index sequence corresponds to the bit positions before interleaving in the order of the interleaving output from front to back. The bit interleaving index length is equal to the length of the bit selection sequence.

[0313] In some examples, bit interleaving information is determined based on a first data feature. This bit interleaving information includes at least one of the following: interleaving depth; bit interleaving index; interleaving pattern; wherein the length of the bit interleaving index is equal to the length of the bit-selected sequence. The interleaved sequence is determined by interleaving the bit-selected sequences using the bit interleaving information to form code blocks.

[0314] In some examples, the preset threshold for the number of transport layers is a positive integer. In one example, the preset threshold for the number of transport layers is 1. In another example, the preset threshold for the number of transport layers is 2.

[0315] In some examples, the first data feature includes layer indication information.

[0316] In some examples, the first data feature includes the number of transport layers.

[0317] In some examples, the first data feature includes layer indication information and the number of transport layers.

[0318] In some examples, the first data feature includes layer indication information, the number of transport layers, and a preset threshold for the number of transport layers.

[0319] In some examples, the first data feature may also include the link direction; wherein the link direction includes the downlink direction or the uplink direction.

[0320] In some examples, the first data feature may also include a basic graph index; wherein the basic graph index is used to indicate one of the multiple basic graph matrices.

[0321] In some examples, the first data feature includes port indication information.

[0322] In some examples, the first data feature includes port indication information and the transport layer number.

[0323] In some examples, the first data feature is obtained based on control information;

[0324] The control information includes at least one of the following:

[0325] Downlink control information (DCI) sent from the base station to the terminal;

[0326] Uplink control information (UCI) sent by the terminal to the base station;

[0327] Radio Resource Control (RRC) signaling messages;

[0328] Media Access Control (MAC) element (CE) information.

[0329] In some examples, the first data feature may be predefined.

[0330] In some examples, the input bit-selected sequence is interleaved using a deterministic code block interleaver, wherein the code block interleaver includes at least one of the following operations: row-in, column-out, row permutation, and column permutation.

[0331] In some examples, the input bit-selected sequence is interleaved using a deterministic code block interleaver, wherein the code block interleave includes at least the following operations: row read-in and column read-out.

[0332] In some examples, the input bit-selected sequence is interleaved using a deterministic code block interleaver, wherein the code block interleave includes at least the following operations: row read-in, row permutation, and column read-out.

[0333] In some examples, the input bit-selected sequence is interleaved using a deterministic code block interleaver, wherein the code block interleaver includes at least the following operations: column read-in and row read-out.

[0334] In some examples, the input bit-selected sequence is interleaved using a deterministic code block interleaver, wherein the code block interleave includes at least the following operations: column read-in, column permutation, and row read-out.

[0335] In some examples, the layer indicates information including at least one of the following:

[0336] Best layer indication information;

[0337] Worst-case indicator information;

[0338] Ideally, there should be M1 layers of indicator information;

[0339] The worst M2 layers indicate information.

[0340] Where M1 and M2 are positive integers greater than or equal to 1.

[0341] In some examples, M1 and M2 can be preset fixed values, or they can be configured by the base station.

[0342] In some examples, layer indication information can be used to map the first few bits of a bit-selected sequence from the start position to the transport layers indicated by the layer indication information in multiple transport layers. For example, mapping the first Lk1 bits of a bit-selected sequence to the transport layers indicated by the layer indication information in multiple transport layers, where Lk1 is a positive integer.

[0343] It should be noted that the size of Lk1 depends primarily on the carrying capacity of this transport layer.

[0344] In some examples, the layer indication information can be used to indicate which bit in the bit-selected sequence, starting from the beginning position, is mapped to the best M1 transport layer indicated by the layer indication information among multiple transport layers. For example, mapping the first Lk2 bits in the bit-selected sequence to the best M1 transport layer indicated by the layer indication information among multiple transport layers, where Lk2 is a positive integer. It should be noted that the size of Lk2 mainly depends on the carrying capacity of these M1 transport layers.

[0345] In some examples, the layer indication information can be used to indicate how to map the bits in the bit-selected sequence up to the last position to the worst M2 transport layer indicated by the layer indication information among multiple transport layers. For example, mapping the last Lk3 bits in the bit-selected sequence to the worst M2 transport layer indicated by the layer indication information among multiple transport layers, where Lk3 is a positive integer.

[0346] It should be noted that the size of Lk3 mainly depends on the carrying capacity of these M2 transport layers.

[0347] It should be noted that the bit that ends at the last position in a sequence and is at the beginning of the sequence is defined as the first bit of the sequence.

[0348] It should be noted that the bit that ends at the last position in a sequence and is at the end of the sequence is defined as the last bit of the sequence.

[0349] In some examples, the port indication information includes at least one of the following:

[0350] Best port indication information;

[0351] Worst-case port indication information;

[0352] Ideally, M1 port information should be provided.

[0353] Worst M2 port indication information.

[0354] Where M1 and M2 are positive integers greater than or equal to 1.

[0355] It is important to clarify that code block interleaving refers to only changing the position index of the input data bits. In other words, only the position of the input data is shifted, without changing the data bits themselves.

[0356] It should be clarified that code block interleaving maps consecutive codeword bits within a code block to discrete positions, improving diversity gain and thus better overcoming channel fading.

[0357] S306, code block cascading.

[0358] In a specific example, C interleaved sequences are concatenated into code blocks in sequence to obtain the concatenated output sequence.

[0359] S307, Scrambling.

[0360] In a specific example, the input bit sequence (i.e., the output sequence after concatenation) is scrambled to obtain a scrambled sequence.

[0361] The scrambling operation involves performing a binary XOR operation (or modulo-2 addition) on the scrambled bit sequence using the generated pseudo-random sequence. Additionally, if the bit to be scrambled is a placeholder bit, the scrambled bit will be either 1 or the original bit.

[0362] S308, Modulation Mapping.

[0363] In a specific example, the input bit sequence (i.e., the scrambled sequence) is modulated to obtain a modulated symbol sequence, which is a codeword stream.

[0364] In some examples, the input bit sequence of length M bits is sequentially grouped into groups of QM bits to obtain multiple bit groups. Each bit group is then mapped to a constellation modulation symbol to obtain a complex modulation symbol sequence of length M symbols, where QM is the modulation order.

[0365] In some examples, the modulation scheme includes one of the following: π / 2-BPSK, QPSK, 16QAM, 64QAM, 256QAM, and 1024QAM. The modulation order indicates the number of bits carried by each constellation modulation symbol, and the corresponding modulation order is 1, 2, 4, 6, 8, or 10.

[0366] In some examples, the modulation scheme may include: QPSK, 16QAM, 64QAM.

[0367] In some examples, the modulation scheme may include: QPSK, 16QAM, 64QAM, 256QAM.

[0368] In some examples, the modulation scheme may include: QPSK, 16QAM, 64QAM, 256QAM, 1024QAM.

[0369] In some examples, the modulation scheme may include: QPSK, 16QAM, 64QAM, 256QAM, 1024QAM, 2048QAM.

[0370] In some examples, the modulation scheme may include: π / 2-BPSK, QPSK, 16QAM, 64QAM.

[0371] In some examples, the modulation scheme may include: π / 2-BPSK, QPSK, 16QAM, 64QAM, 256QAM.

[0372] In some examples, the modulation scheme may include: π / 2-BPSK, QPSK, 16QAM, 64QAM, 256QAM, 1024QAM.

[0373] In some examples, the modulation method may be generalized shaping modulation, geometric shaping modulation, or AI-generated modulation.

[0374] S309, Layer Mapping.

[0375] In a specific example, the modulation symbol sequence of the codeword stream obtained by S408 will be mapped to one or more layers in the transport layer.

[0376] In some examples, the modulation symbols in the input sequence are mapped to the layers in ascending order of layer index, in a round-robin fashion, following the forward-to-back order of the input modulation symbol sequence, with each group consisting of L modulation symbols. Here, L is the number of transmission layers.

[0377] In some examples, if layer indicator information is not used in any of the preceding code block interleaving steps, the modulation symbol sequence of the resulting codeword stream is mapped to one or more layers in the transport layer based on the layer indicator information. In other words, this scheme includes the possibility of combining any of the preceding code block interleaving methods that do not use layer indicator information with this method.

[0378] In some examples, if layer indicator information is not used in any of the preceding code block interleaving steps, the modulation symbol sequence of the resulting codeword stream is mapped to one or more transport layers based on the layer indicator information. This includes mapping the first modulation symbols in the codeword stream's modulation symbol sequence to the transport layer indicated by the layer indicator information, and mapping the remaining modulation symbols in the codeword stream's modulation symbol sequence to other transport layers. In other words, this scheme allows any of the preceding code block interleaving methods that do not use layer indicator information to be used in conjunction with this method. It should be noted that layer indicator information is used either in the bit interleaver or in layer mapping; it only needs to be used in one module. For example, if the layer indicator information is used in layer mapping, the interleaver depends on the number of transport layers but not on the layer indicator information.

[0379] In this embodiment, for an incrementally redundant HARQ process, the first transmission packet typically uses redundancy version 0, and the first retransmission packet typically uses redundancy version 2. The first and retransmission packets generally exhibit the following phenomena: the header of the first transmission packet overlaps with the tail of the retransmission packet, and the tail of the first transmission packet overlaps with the header of the retransmission packet. This overlap refers to repeatedly selecting a portion of codeword bits from the HARQ buffer. By leveraging the different reliability levels of different transmission layers, this invention ensures that the first bits of the bit selection output for different redundancy versions have high reliability and the subsequent bits have low reliability. That is, the header of the first transmission packet has high reliability and the tail has low reliability, and the header of the retransmission packet has high reliability and the tail has low reliability. Therefore, when the tail of the first transmission packet overlaps with the head of the retransmission packet, the low reliability of the tail of the first transmission packet can be well adapted to the high reliability of the head of the retransmission packet. Conversely, when the head of the first transmission packet overlaps with the tail of the retransmission packet, the high reliability of the head of the first transmission packet can be well adapted to the low reliability of the tail of the retransmission packet. This results in the optimal combining gain of the incremental redundancy HARQ, thus ensuring optimal IR-HARQ retransmission performance. Furthermore, this invention offers the additional benefit of ensuring that the system bits of the first transmission packet are preferentially mapped to the best layer indicated by the layer indication information, resulting in even better first transmission performance.

[0380] Optionally, the layer indication information is used only in one of S305 or S309.

[0381] S310, antenna port mapping.

[0382] In a specific example, each layer of modulation symbol sequence is mapped to one or more antenna ports after layer mapping.

[0383] In some examples, when the link direction is uplink, this process is also called MIMO precoding, which is implemented using a precoding matrix W. The precoding matrix is ​​determined by two different methods: codebook-based and non-codebook-based. In the codebook-based method, the matrix is ​​determined by information specified in the DCI and some additional configuration in the RRC message. In the non-codebook-based method, the precoding matrix is ​​determined by the measurement results of the measurement reference signal.

[0384] S311, Resource Mapping.

[0385] In a specific example, the data symbol sequence of each antenna port is mapped to a resource unit.

[0386] In some examples, the resource unit is the resource block.

[0387] In some examples, the resource unit is a time-frequency resource element (RE).

[0388] In some examples, the resource unit is the data corresponding to the OFDM symbol.

[0389] S312, Generate waveform.

[0390] In a specific example, an inverse Fourier transform is performed on the resource unit symbol to generate an OFDM waveform.

[0391] Understandably, the OFDM waveform symbol sequence of the baseband will be converted from digital to analog and then transmitted through intermediate frequency circuits and radio frequency circuits.

[0392] Scheme 2: Based on Scheme 1, a specific example of a signal processing method that simultaneously considers the first data features and modulation order for code block interleaving is given. Since the specific steps are in the same order as in Scheme 1, they will not be elaborated here. In this scheme, the first data features and modulation order are considered simultaneously for code block interleaving, and the interleaving mode is selected according to the conditions.

[0393] In some examples, the first data feature includes layer indication information, the number of transport layers, and a preset threshold for the number of transport layers.

[0394] In some examples, the first data feature includes a preset threshold for the number of transport layers and the number of transport layers.

[0395] In some examples, code block interleaving is performed on the selected sequence of each bit according to the modulation order and the first data feature, including: when the number of transmission layers is greater than a preset threshold of the number of transmission layers, code block interleaving is performed on the selected sequence of the input bits according to the number of transmission layers in the first data feature; when the number of transmission layers is less than or equal to the preset threshold of the number of transmission layers, code block interleaving is performed on the selected sequence of the input bits according to the modulation order.

[0396] In some examples, the sequence after each bit selection is interleaved according to the modulation order and the first data feature, including: when the number of transmission layers is greater than 1, the sequence after the input bit selection is interleaved according to the number of transmission layers in the first data feature; when the number of transmission layers is equal to 1, the sequence after the input bit selection is interleaved according to the modulation order.

[0397] In some examples, code block interleaving is performed on the selected bit sequence based on the modulation order and a first data feature. This includes: when the number of transmission layers is greater than a preset threshold, row-in and column-out code block interleaving is performed on the input selected bit sequence; wherein the number of interleaving rows is obtained based on the number of transmission layers. When the number of transmission layers is less than or equal to a preset threshold, row-in and column-out code block interleaving is performed on the input selected bit sequence; wherein the number of interleaving rows is obtained based on the modulation order.

[0398] In some examples, the selected sequence of each bit is interleaved according to the modulation order and the first data feature, including: when the number of transmission layers is greater than a preset threshold, the selected sequence of each bit is interleaved according to the layer indication information and the number of transmission layers; when the number of transmission layers is less than or equal to a preset threshold, the selected sequence of each bit is interleaved according to the modulation order and the number of transmission layers.

[0399] In some examples, the selected bit sequence is interleaved with code blocks based on the modulation order and the first data feature. This includes: when the number of transmission layers is greater than a preset threshold, row-in and column-out code block interleaving is performed on the input selected bit sequence; wherein the number of interleaver rows is obtained based on the number of transmission layers, and a row permutation operation is performed between row-in and column-out operations based on layer indication information. When the number of transmission layers is less than or equal to a preset threshold, row-in and column-out code block interleaving is performed on the input selected bit sequence; wherein the number of interleaver rows is obtained based on the modulation order, and a row permutation operation is performed between row-in and column-out operations based on layer indication information.

[0400] Scheme 3: Based on Scheme 1, another specific example of a signal processing method that simultaneously considers the first data features and modulation order for code block interleaving is given. Since the specific steps are in the same order as in Scheme 1, they will not be elaborated here. In this scheme, the code block interleaving is performed in a two-step interleaving manner, simultaneously considering the first data features and modulation order.

[0401] In some examples, the sequence after each bit selection is interleaved according to the modulation order and the first data feature, including: using two-step interleaving, firstly performing a first-step interleaving on the input bit selection sequence according to the modulation order, and then performing a second-step interleaving operation on the first-step interleaved sequence according to the first data feature.

[0402] In some examples, the first interleaving step is performed on the input bit selection sequence based on the modulation order, including: the first interleaving step is a row-column interleaving, where the number of rows is the modulation order. Optionally, for the first interleaving step, the row-column interleaver is row-in, column-out.

[0403] In some examples, a second interleaving operation is performed on the sequence after the first interleaving based on a first data characteristic, including: the second interleaving is a row-column interleaving, where the number of rows is the number of transport layers. Optionally, for the second interleaving, the row-column interleaver is row-in and column-out.

[0404] In some examples, a second interleaving operation is performed on the sequence after the first interleaving based on the first data feature. This includes: first, reading the input data row by row, then performing a row permutation operation, and finally reading out the columns. The row permutation operation is performed based on layer indication information.

[0405] Scheme 4: Based on Scheme 1, another specific example of a signal processing method that simultaneously considers the first data features and modulation order for code block interleaving is given. Since the specific steps are in the same order as in Scheme 1, they will not be elaborated here. In this scheme, the code block interleaving is performed by simultaneously considering the first data features and modulation order in a global one-time interleaving manner.

[0406] In some examples, the sequence after selecting each bit based on the modulation order and a first data feature is subjected to code block interleaving, including: block interleaving of the sequence after selecting each bit based on the first data feature and the modulation order. The number of rows in the block interleaving is obtained based on the first data feature; wherein the first data feature includes at least the number of transmission layers.

[0407] In some examples, block interleaving also requires row permutation based on layer indication information.

[0408] In some examples, the input data can be read in row by row first, then row permutation can be performed, and finally column readout can be performed. The row permutation operation is performed based on the layer indication information and the modulation order.

[0409] Solution 5: An example of a signal processing method applied to the receiving end of a communication node is provided. Figure 5 is a flowchart illustrating an example of a signal processing method provided in an embodiment of this application. As shown in Figure 5, the method specifically includes the following steps:

[0410] S401, Waveform Detection.

[0411] In a specific example, detecting the received waveform signal is the reverse process of S312. This step also includes S312, which relates to all technical features and / or possible implementations.

[0412] S402, Physical resource demapping.

[0413] In a specific example, S311 is the inverse process of physical resource mapping. This step also includes S311 involving all technical features and / or possible implementations.

[0414] S403, Antenna port demapping.

[0415] In a specific example, the reverse process of S310 antenna port mapping. This step also includes S310 involving all technical features and / or possible implementations.

[0416] S404, De-mapping.

[0417] In a specific example, the reverse process of layer mapping S309. This step also includes S309 relating to all technical features and / or possible implementations.

[0418] S405, Demodulation and modulation constellation diagram.

[0419] In a specific example, demapping the constellation points on the constellation map is the inverse process of S308 modulation mapping. This step also includes S308 involving all technical features and / or possible implementations.

[0420] S406, Descramble.

[0421] In a specific example, S307 is the inverse process of scrambling. This step also includes S307 relating to all technical features and / or possible implementations.

[0422] S407, code block deconcatenation.

[0423] In a specific example, the input concatenated code block sequence (the output sequence after concatenation) is deconcatenated (segmented) to obtain a soft bit sequence of C code blocks. This is the reverse process of code block concatenation in S306. This step also includes all technical features and / or possible implementations related to S306.

[0424] S408, code block deinterleaving.

[0425] In a specific example, the soft bit sequences of C modules are deinterleaved to obtain C deinterleaved soft output codeword sequences. This is the deinterleaving process of code block interleaving in S305. This step also includes all technical features and / or possible implementations related to S305.

[0426] S409, Deselect Bits.

[0427] In a specific example, the reverse process of S304 bit selection. This step also includes S304 involving all technical features and / or possible implementations.

[0428] S410, channel decoding.

[0429] In a specific example, each code block sequence in the C input mother codeword sequences is individually LDPC decoded or Polar decoded to generate C decoded code blocks of length N. This is the reverse process of channel coding S303. This step also includes step S303, which involves all technical features and / or possible implementations.

[0430] S411, Decoding block segmentation and decoding block CRC.

[0431] In a specific example, a CRC check is performed on the code block based on the given CRC polynomial and the input sequence to determine whether the code block has been correctly received. This step also includes S302, which involves all technical features and / or possible implementations.

[0432] S412, Decode the transport block CRC.

[0433] In a specific example, a CRC check is performed on the transport block based on a given CRC polynomial and the input sequence to determine whether the transport block has been correctly received. This step also includes S301, which relates to all technical features and / or possible implementations.

[0434] The above-described solutions detail examples of signal processing and signal deprocessing methods provided in the embodiments of this application. Signal processing can be understood as a signal processing method applied to the transmitting end, and signal deprocessing can be understood as a signal processing method applied to the receiving end. It is understood that the transmitting end and receiving end, in order to achieve the above functions, include corresponding hardware structures and / or software modules for executing each function. Those skilled in the art should readily recognize that, based on the units and algorithm steps of the examples described in conjunction with the embodiments disclosed herein, this application can be implemented in hardware or a combination of hardware and computer software. Whether a function is executed in hardware or by computer software driving hardware depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0435] Solution 6: A signal processing apparatus for performing signal processing methods at the transmitting end is provided. Figure 6 is a structural example diagram of a signal processing apparatus provided in an embodiment of this application. As shown in Figure 6, the signal processing apparatus 500 includes: a processing unit 510.

[0436] The processing unit 510 can be used to perform the actions described in the embodiments of the signal processing method applied to the transmitting end. The signal processing method includes all previously protected data features.

[0437] Solution 7: A signal deprocessing apparatus for performing signal processing methods at a receiving end is provided. Figure 7 is a structural example diagram of a signal deprocessing apparatus provided in an embodiment of this application. As shown in Figure 7, the signal deprocessing apparatus 600 includes: a processing unit 610.

[0438] The processing unit 610 can be used to perform the actions described in the embodiments of the signal processing method applied to the receiving end. The signal processing method includes all previously protected data features.

[0439] Those skilled in the art will clearly understand that the specific working process and technical effects of the devices and units described above, as well as the execution steps, can be referred to the descriptions in the corresponding method embodiments above. For the sake of brevity, they will not be repeated here.

[0440] The aforementioned signal processing device and signal deprocessing device can be a single chip. The processing unit can be implemented in hardware or software. When implemented in hardware, the processing unit can be a logic circuit, integrated circuit, etc. When implemented in software, the processing unit can be a general-purpose processor that reads software code stored in a storage unit. This storage unit can be integrated into the processor or located outside the processor and exist independently.

[0441] Solution 8: An example of a general wireless transmitting device is provided. Figure 8 is a structural example diagram of a wireless transmitting device provided in an embodiment of this application. As shown in Figure 8, the wireless transmitting device includes: a controller / processor 710 implementing layer 2 / 3 functions; a Tx processor 720 implementing layer 1 functions; a memory 730; a Tx transmitter 740 for converting baseband signals to radio frequency signals and processing radio frequency signals; and an antenna 750, which can be used for transmission by a base station or terminal. It should be noted that the processor is mainly used to process communication protocols and communication data, control the entire terminal device, execute software programs, and process data from the software programs. In addition, the wireless transmitting device may also include input and output devices, such as touch screens, displays, keyboards, etc., mainly used to receive user input data and output data to the user.

[0442] If the wireless transmitting device is a terminal, the processor can read the software program from the storage unit, interpret and execute the instructions of the software program, and process the data in the software program. When data needs to be transmitted wirelessly, the processor performs baseband processing on the data to be transmitted, and then outputs the baseband signal to the radio frequency (RF) circuit. The RF circuit performs RF processing on the baseband signal, and then transmits the RF signal to the outside in the form of electromagnetic waves through the antenna.

[0443] Specifically, this controller / processor 710 implements Layer 3 and Layer 2 functions. In the DL (Deep Link Controller), IP packets from the core network can be provided to a controller / processor. Layer 3 includes the Radio Resource Control (RRC) layer, and Layer 2 includes the Packet Data Convergence Protocol (PDCP) layer, Radio Link Control (RLC) layer, and Media Access Control (MAC) layer, primarily comprising the following four functions:

[0444] First, the controller / processor 710 provides RRC functionality, which is responsible for managing the connection, resource allocation, handover, system information broadcasting, measurement reporting, power consumption control, and security management between user equipment and the radio access network. This ensures efficient connection, signal quality, and network resource optimization, and dynamically adjusts between different states (such as RRC_IDLE, RRC_CONNECTED, and RRC_INACTIVE). It supports connection establishment, reconfiguration and release, handover management, system information broadcasting (such as Master Information Block (MIB) and System Information Block (SIB)), as well as network slice selection and multi-connection management in 5G, ensuring that the network can flexibly respond to the needs of various application scenarios.

[0445] Secondly, the controller / processor 710 also provides PDCP functionality, including header compression and decompression, security assurance (including encryption, decryption, integrity protection and verification), data segmentation and reassembly, and supports the continuity of data transmission during switching, ensuring efficient, secure and seamless uplink and downlink data transmission.

[0446] Third, the controller / processor 710 also provides RLC layer functions, mainly including data segmentation, reassembly, retransmission, and order management between the physical layer and the PDCP layer, ensuring ordered transmission and retransmission of lost data packets. RLC supports three operating modes: Transparent Mode (TM), Unacknowledged Mode (UM), and Acknowledged Mode (AM), each optimized according to transmission reliability requirements. RLC is also responsible for data encapsulation and transmission control, ensuring data stability on the wireless link. In AM mode, RLC provides an Automatic Repeat Request (ARQ) mechanism to guarantee reliable data transmission and handle packet loss. In UM mode, RLC provides more efficient transmission but does not guarantee data reliability. RLC also adapts to different data packet size requirements through segmentation and reassembly functions to achieve efficient data transmission.

[0447] Fourth, the controller / processor 710 also provides MAC layer functionality, acting as a bridge between the RLC layer and the physical layer. It is responsible for mapping logical channels to corresponding transmission channels, ensuring on-demand data transmission. The MAC layer controls data transmission based on network scheduling information, handles HARQ retransmission processes, and manages resources such as transmission time slots, spectrum, and power. It dynamically adjusts the data transmission rate according to different QoS requirements and ensures that different services are prioritized. The MAC layer is also responsible for channel coding and modulation selection, ensuring reliable transmission under different channel conditions. Furthermore, the MAC layer processes different priority traffic on logical channels through priority scheduling, ensuring that high-priority traffic (such as control signaling or urgent data) is transmitted in a timely manner. Through efficient resource scheduling, logical channel priority processing and management, the MAC layer optimizes the utilization of wireless resources, ensuring the reliability, efficiency, and fairness of data transmission.

[0448] The TX processor 720 implements Layer 1 functions related to various signal processing features. Layer 1 includes baseband processing at the physical (PHY) layer, encompassing at least error detection, forward error correction (FEC) coding, interleaving, bit selection, mapping to the physical channel, modulation of the physical channel, and MIMO antenna processing. The TX processor 720 processes the mapping of signal constellation diagrams based on various modulation schemes. The coded and modulated symbols can then be split into parallel streams. Each stream can then be mapped to OFDM subcarriers, multiplexed with a reference signal in the time and / or frequency domains, and then combined using an inverse fast Fourier transform (IFFT) to produce a physical channel carrying a stream of time-domain OFDM symbols. The OFDM streams are spatially pre-coded to generate multiple spatial streams.

[0449] Multiple spatial streams are supplied to different antennas 750 via Tx transmitter 740, mainly involving intermediate frequency (IF) and radio frequency (RF) processing. Each Tx transmitter 740 can modulate an RF carrier with a corresponding spatial stream for transmission.

[0450] The controller / processor 710 may be associated with the memory 730 that stores program code and data.

[0451] If the transmitting device is a terminal, the processor can be used to support the terminal device in performing the actions described in the above-described signal processing method embodiments. The transmitter and transmitting antenna are used to support the terminal device in performing transmission functions such as the transmission method.

[0452] If the transmitting device is a base station, the processor can be used to control the base station equipment to perform the actions described in the above-described signal processing method embodiments, and the transmitter and transmitting antenna are used to support the base station equipment to perform transmission functions such as the transmission method.

[0453] Solution 9: An example of a general-purpose wireless receiving device is provided, which can be used for receiving signals from a terminal or base station. If the receiving device is a terminal UE, when data is transmitted to the terminal device, the radio frequency circuit receives the radio frequency signal through the antenna, converts the radio frequency signal into a baseband signal, and outputs the baseband signal to the processor. The processor converts the baseband signal into data and processes it. Figure 9 is a structural example diagram of a wireless receiving device provided in an embodiment of this application. As shown in Figure 9, the wireless receiving device includes: a controller / processor 810; an Rx processor 820; a memory 830; an Rx receiver 840; and an antenna 850.

[0454] In a wireless receiving device, such as the UE in the following row, each Rx receiver 840 receives signals through its respective antenna 850. Each Rx receiver 840 replies the information modulated onto the RF carrier and provides the information to the Rx processor 820. The Rx processor 820 implements Layer 1 functions related to various signal processing functions. The Rx processor 820 can perform spatial processing on the information to recover any spatial stream sent to the receiving device (such as the UE in the following row). If the destination of multiple spatial streams is the communication receiving device (such as the UE in the following row), they can be combined by the Rx processor 820 into a single OFDM symbol stream. The Rx processor 820 then uses a Fast Fourier Transform (FFT) to convert the OFDM symbol stream from the time domain to the frequency domain. The frequency domain signal consists of a separate OFDM symbol stream for each subcarrier of the OFDM signal. The symbols and reference signals on each subcarrier are recovered and demodulated by determining the most probable signal constellation point. These soft decisions may be based on channel estimation. The soft decisions are then decoded to recover the data and control signals originally transmitted by the transmitting device on the physical channel. The data and control signals are then provided to the controller / processor 810, which implements the functions of the third layer and the second layer.

[0455] The memory 830 can be referred to as a computer-readable medium. In UL, the controller / processor 810 provides demultiplexing, packet reassembly, decryption, header decompression, and control signal processing between the transmission and logical channels to recover IP packets from the core network. The controller / processor 810 is also responsible for error detection using ACK and / or NACK protocols to support HARQ operation.

[0456] Similar to the functions described in DL transmissions via the transmitting device, the controller / processor 810 provides the associated RRC layer functions, PDCP layer functions, RLC layer functions, and MAC layer functions as previously described.

[0457] The controller / processor 810 may be associated with a memory 830 that stores program code and data. The memory 830 may be referred to as a computer-readable medium.

[0458] If the transmitting device is a terminal, the processor can be used to support the terminal device in performing the actions described in the embodiments of the above signal deprocessing method, and the transmitter and transmitting antenna are used to support the terminal device in performing the transmission function such as the transmission method.

[0459] If the transmitting device is a base station, the processor can be used to control the base station equipment to perform the actions described in the embodiments of the above signal deprocessing method, and the transmitter and transmitting antenna are used to support the base station equipment to perform the transmission function such as the transmission method.

[0460] Those skilled in the art will understand that, for ease of illustration, in Figures 8 and 9, memory 730 or 830 may have multiple memories, and Tx processor 720 or Rx processor 820 may have multiple processors. Memory may also be a storage medium or storage device, etc.

[0461] In wireless communication systems, especially mobile communication systems, base stations are responsible for downlink transmission and uplink reception. A base station may include one or more radio frequency (RF) units (e.g., Remote Radio Units (RRUs)) and one or more base band units (BBUs) (also known as data units (DUs)). This approach allows for separation of the baseband and RF components, enabling centralized control of the baseband and allowing the RF components to be located further away from the user, thus significantly improving coverage and reducing power consumption. For example, an RRU typically includes at least one Tx transmitter 740 and a transmit antenna 750, as well as at least one Rx receiver 840 and a receive antenna 850. It should be noted that the transceiver units can be integrated or implemented using the same module. A BBU typically includes a controller / processor 710, a Tx processor 720, a controller / processor 810, and an Rx processor 820. Again, the control or processing of the transceiver can be integrated or implemented using the same module.

[0462] It should be noted that in wireless transmitting and / or wireless receiving devices, the processor can be a general-purpose processor or a dedicated processor, etc. For example, it can be a baseband processor or a central processing unit (CPU). A baseband processor can be used to process communication protocols and communication data, while a CPU can be used to control communication devices (e.g., base stations, terminals, or chips), execute software programs, and process data from the software programs. The communication device may include a transceiver unit for implementing signal input (reception) and output (transmission). For example, the communication device can be a chip, and the transceiver unit can be the chip's input and / or output circuits, or a communication interface. This chip can be used in a terminal, base station, or other communication device. Furthermore, if the communication device is a terminal, base station, or other communication device, the transceiver unit may include a transceiver, an RF chip, a filter, an analog-to-digital converter, an RF switch, etc.

[0463] In this application, the foregoing disclosure provides illustrations and descriptions, but is not intended to be exhaustive or to limit all aspects to the precise form disclosed. Modifications and alterations can be made based on the foregoing disclosure, and can also be derived from practice in these areas.

[0464] In this application, no element, action, or instruction used herein should be construed as critical or necessary unless explicitly described. Furthermore, the articles “a” and “an” used herein are intended to include one or more items and may be used interchangeably with “one or more.” Additionally, the terms “set” and “group” used herein are intended to include one or more elements (e.g., related elements, unrelated elements, combinations of related and unrelated elements, and / or similar elements) and may be used interchangeably with “one or more.” If only one item is intended to be used, the phrase “single,” “only one,” or similar language is used.

[0465] In this application, the term "based on" should not be construed as a reference to a closed set of information, one or more conditions, one or more factors, or similar content. In other words, the phrase "based on A" (where "A" can be information, conditions, factors, etc.) should be construed as "at least based on A," unless specifically interpreted differently.

[0466] In this application, although specific combinations of features are referenced in the claims and / or disclosed in the specification, these combinations are not intended to limit the disclosure of aspects. In fact, many of these features may be combined in ways not specifically referenced in the claims and / or not closed in the specification. Although each dependent claim listed below may directly depend on only one claim, the disclosure of aspects includes a combination of each dependent claim with all other claims in the claim set. The phrase “at least one” in the list of referenced items refers to any combination of these items, including individual members. For example, “comprising at least one of: A, B, or C” is intended to cover A, B, C, A and B, A and C, B and C, A and B and C (and any other order of A, B, and C).

[0467] In this application, the terms "system" and "network" are used interchangeably. The term "and / or" in this document is simply an association to describe the associated objects, indicating that there can be three relationships, such as A and / or B, which can represent three cases: A exists alone, A and B exist simultaneously, and A and B exist independently of B.

[0468] In this application, “when…”, “if” and “if” all indicate that the UE or base station will make corresponding processing under certain objective circumstances, rather than within a limited time. They do not require the UE or base station to make a judgment action during implementation, and do not imply any other restrictions.

[0469] Those skilled in the art will understand that all or some of the steps, systems, and apparatuses disclosed above, and their functional modules / units, can be implemented as software, firmware, hardware, or suitable combinations thereof. In hardware implementations, the division between functional modules / units mentioned above does not necessarily correspond to the division of physical units; for example, a physical component may have multiple functions, or a function or step may be performed collaboratively by several physical components. Some or all components may be implemented as processors, such as software executed by digital signal processors or microprocessors, or as hardware, or as integrated circuits, such as application-specific integrated circuits (ASICs). Such software can be distributed on a computer-readable medium, which may include computer storage media (or non-transitory media) and communication media (or transient media).

[0470] As is known to those skilled in the art, the processor in this embodiment of the application can be an integrated circuit chip with signal processing capabilities. During implementation, each step of the above method embodiments can be completed by hardware integrated logic circuits in the processor or by instructions in software form. The processor can be a general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components. The methods, steps, and logic block diagrams disclosed in the embodiments of this application can be implemented or executed. A general-purpose processor can be a microprocessor, or any conventional processor or something similar. The steps of the methods disclosed in the various embodiments of this application can be directly implemented by a hardware decoding processor, or by a combination of hardware and software modules in the decoding processor. The software modules can reside in random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, registers, or other storage media mature in the art. The storage medium is located in memory; the processor reads information from the memory and, in conjunction with its hardware, completes the steps of the above method.

[0471] As is known to those skilled in the art, the term computer storage medium includes volatile and non-volatile, removable and non-removable media implemented in any method or technique for storing information (such as computer-readable instructions, data structures, program modules, or other data). Non-volatile memory can be read-only memory (ROM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), electrically programmable eraseable programmable read-only memory (EEPROM), or flash memory. Volatile memory can be random access memory (RAM), which acts as an external cache. For example, many forms of RAM are available, such as static random access memory (SRAM), dynamic random access memory (DRAM), synchronous DRAM, SDRAM, double data rate synchronous dynamic random access memory (double data rate SDRAM, DDR SDRAM), enhanced synchronous dynamic random access memory (enhanced SDRAM, ESDRAM), synchronous link dynamic random access memory (synchronous link DRAM, SLDRAM), and direct memory bus RAM (DR RAM). Furthermore, as is known to those skilled in the art, communication media typically contain computer-readable instructions, data structures, program modules, or other data in modulated data signals such as carrier waves or other transmission mechanisms, and may include any information delivery medium.

[0472] In one exemplary embodiment, FIG10 is a schematic diagram of a signal processing device provided in an embodiment of the present application. The signal processing device is applied to a first communication node. As shown in FIG10, the device includes:

[0473] The code block segmentation and CRC addition module 910 is configured to perform code block segmentation and add CRC bit sequences to the input data block to determine at least one code block bit sequence.

[0474] The channel coding module 920 is configured to perform channel coding on each code block bit sequence to determine the mother code codeword corresponding to each code block bit sequence.

[0475] The bit selection module 930 is configured to perform bit selection on each mother codeword and determine the bit selection sequence corresponding to each mother codeword.

[0476] The code block interleaving module 940 is configured to perform code block interleaving on the selected sequence of each bit according to the first data feature, and determine the interleaved sequence.

[0477] The code block concatenation module 950 is configured to concatenate the interleaved sequences in sequence and determine the output sequence after concatenation.

[0478] The scrambling module 960 is configured to scramble the cascaded output sequence and determine the scrambled sequence.

[0479] The modulation module 970 is configured to modulate the scrambled sequence and determine the modulation symbol sequence.

[0480] Layer mapping module 980 is configured to map modulation symbol sequences to the transport layer.

[0481] The first data feature includes at least one of the following: layer indication information; port indication information; number of transmission layers; number of transmission layers and a preset threshold for the number of transmission layers; rank indication information and a preset threshold for the rank; number of ports and a preset threshold for the number of ports.

[0482] The input data block includes: a transport block; or a transport block and a transport block CRC.

[0483] In one embodiment, the selected bit sequence is interleaved with code blocks according to a first data feature to determine the interleaved sequence, including:

[0484] Bit interleaving information is determined based on the first data feature; the bit interleaving information includes at least one of the following: interleaving depth; bit interleaving index; interleaving pattern; wherein the length of the bit interleaving index is equal to the length of the bit-selected sequence;

[0485] The selected bits are interleaved using bit interleaving information to determine the interleaved sequence.

[0486] In one embodiment, the first data feature is obtained based on control information;

[0487] The control information includes at least one of the following:

[0488] Downlink control information (DCI) sent from the base station to the terminal;

[0489] Uplink control information (UCI) sent by the terminal to the base station;

[0490] Radio Resource Control (RRC) signaling messages;

[0491] Media Access Control (MAC) element information.

[0492] In one embodiment, the layer indication information includes at least one of the following:

[0493] Best layer indication information;

[0494] Worst-case indicator information;

[0495] Ideally, there should be M1 layers of indicator information;

[0496] The worst M2 layers indicate information.

[0497] Where M1 and M2 are positive integers greater than or equal to 1.

[0498] In one embodiment, modulating the scrambled sequence to determine the modulation symbol sequence includes:

[0499] The scrambled bit sequence is sequentially grouped into groups of QM bits to determine multiple bit groups;

[0500] Each bit group is sequentially mapped to a constellation modulation symbol to determine the modulation symbol sequence;

[0501] Where QM is the modulation order.

[0502] In one embodiment, the modulation method for modulating the scrambled sequence includes at least one of the following:

[0503] π / 2-Binary Phase Shift Keying (BPSK) modulation;

[0504] Quadrature phase shift keying (QPSK) modulation;

[0505] Hexadecimal quadrature amplitude (QAM) modulation;

[0506] 64-bit QAM modulation;

[0507] 256-base QAM modulation;

[0508] 1024-base QAM modulation.

[0509] In one embodiment, mapping the modulation symbol sequence to the transport layer includes:

[0510] The modulation symbol sequence is divided into groups of L modulation symbols according to the input order from front to back;

[0511] The modulation symbols are mapped to the transport layer in a round-robin fashion, in ascending order of layer index.

[0512] Where L is the number of transport layers.

[0513] In one embodiment, the process of selecting each bit sequence based on a first data feature and then performing code block interleaving to determine the interleaved sequence further includes:

[0514] Based on the first data characteristics and modulation order, the selected bits are interleaved into code blocks to determine the interleaved sequence.

[0515] In one embodiment, the selected sequence of bits is subjected to code block interleaving based on a first data feature and a modulation order, including at least one of the following:

[0516] Based on the modulation order, the number of transmission layers, and a preset threshold for the number of transmission layers, the selected bits are interleaved into code blocks.

[0517] Based on the modulation order, layer indication information, number of transmission layers, and preset threshold for the number of transmission layers, the sequence of selected bits is interleaved into code blocks.

[0518] The first interleaving is performed on the selected sequence of each bit according to the modulation order to determine the sequence after the first interleaving. The second interleaving is performed on the sequence after the first interleaving according to the first data feature.

[0519] The selected bits are then interleaved in blocks according to the first data feature and the modulation order; wherein the number of rows of the block interleaving is determined according to the first data feature.

[0520] In one embodiment, the selected bit sequence is subjected to code block interleaving based on the modulation order, the number of transmission layers, and a preset threshold for the number of transmission layers, including:

[0521] If the number of transmission layers is greater than a preset threshold, the sequence of selected bits is interleaved according to the number of transmission layers.

[0522] When the number of transmission layers is less than or equal to a preset threshold, the sequence of selected bits is interleaved according to the modulation order.

[0523] In one embodiment, the selected bit sequence is subjected to code block interleaving based on the modulation order, layer indication information, number of transmission layers, and a preset threshold for the number of transmission layers, including:

[0524] When the number of transport layers is greater than a preset threshold, the sequence of selected bits is interleaved according to the layer indication information and the number of transport layers.

[0525] When the number of transmission layers is less than or equal to a preset threshold, the sequence of selected bits is interleaved according to the modulation order and the number of transmission layers.

[0526] In one embodiment, the first step of interleaving is row-to-column interleaving based on the modulation order; the second step of interleaving is row-to-column interleaving based on the number of transmission layers.

[0527] In one embodiment, the selected bit sequence is block-interleaved according to a first data feature and a modulation order, including:

[0528] Read the selected bit sequence line by line;

[0529] The selected bits of the sequence are permuted according to the modulation order and layer indication information;

[0530] Read the sequence of bits selected after row permutation from row and column.

[0531] In one exemplary embodiment, FIG11 is a schematic diagram of a signal processing device provided in an embodiment of the present application. The signal processing device is applied to a second communication node. As shown in FIG11, the device includes:

[0532] The de-mapping module 1010 is configured to perform de-mapping on each modulation symbol sequence in the transport layer to determine the modulation symbol sequence.

[0533] The demodulation module 1020 is configured to demodulate the modulation symbol sequence and determine the scrambled sequence.

[0534] The descrambling module 1030 is configured to descramble the scrambled sequence and determine the output sequence after concatenation.

[0535] The code block deconcatenation module 1040 is configured to deconcatenate the concatenated output sequence to determine the interleaved sequence.

[0536] The code block deinterleaving module 1050 is configured to perform code block deinterleaving on the interleaved sequence according to the first data characteristics, and determine at least one bit selection sequence.

[0537] The de-bit selection module 1060 is configured to perform de-bit selection on each bit-selected sequence to determine the mother codeword corresponding to each bit-selected sequence.

[0538] The channel decoding module 1070 is configured to perform channel decoding on each mother codeword to determine the code block bit sequence corresponding to each mother codeword.

[0539] The decoding block segmentation and decoding block CRC module 1080 is configured to perform decoding block segmentation and decoding block cyclic redundancy check bit sequence on the bit sequence of each code block to determine the output data block.

[0540] In one embodiment, deinterleaving the interleaved sequence according to a first data feature to determine at least one bit-selected sequence includes:

[0541] Bit interleaving information is determined based on the first data feature; the bit interleaving information includes at least one of the following: interleaving depth; bit interleaving index; interleaving pattern; wherein the length of the interleaving index is equal to the length of the bit-selected sequence;

[0542] By deinterleaving the interleaved sequence with bit interleaving information, at least one bit-selected sequence is determined.

[0543] In one embodiment, the first data feature is obtained based on control information;

[0544] The control information includes at least one of the following:

[0545] Downlink control information sent from the base station to the terminal;

[0546] Uplink control information sent by the terminal to the base station;

[0547] Radio Resource Control (RRC) signaling messages;

[0548] Media access control element information.

[0549] In some examples, the first data feature may be predefined.

[0550] In one embodiment, the layer indication information includes at least one of the following:

[0551] Best layer indication information;

[0552] Worst-case indicator information;

[0553] Ideally, there should be M1 layers of indicator information;

[0554] The worst M2 layers indicate information.

[0555] Where M1 is a positive integer greater than or equal to 1, and M2 is a positive integer greater than or equal to 1.

[0556] In some examples, M1 and M2 can be preset fixed values, or they can be configured by the base station.

[0557] In some examples, the port indication information includes at least one of the following:

[0558] Best port indication information;

[0559] Worst-case port indication information;

[0560] Ideally, M1 port information should be provided.

[0561] Worst M2 port indication information.

[0562] Where M1 and M2 are positive integers greater than or equal to 1.

[0563] In one embodiment, the modulation method for demodulating the modulation symbol sequence includes at least one of the following:

[0564] π / 2-Binary Phase Shift Keying (BPSK) modulation;

[0565] Quadrature phase shift keying (QPSK) modulation;

[0566] Hexadecimal quadrature amplitude (QAM) modulation;

[0567] 64-bit QAM modulation;

[0568] 256-base QAM modulation;

[0569] 1024-base QAM modulation.

[0570] This application embodiment also provides a communication node. Figure 12 is a structural schematic diagram of a communication node provided in this application embodiment. As shown in Figure 12, the communication node provided in this application embodiment includes a memory 1120, a processor 1110, and a computer program stored in the memory and executable on the processor. When the processor 1110 executes the program, it implements the above-mentioned signal processing method.

[0571] The communication node may also include a memory 1120; the processor 1110 in the communication node may be one or more, with one processor 1110 as an example in FIG12; the memory 1120 is used to store one or more programs; the one or more programs are executed by the one or more processors 1110, causing the one or more processors 1110 to implement the signal processing method as described in the embodiments of this application.

[0572] The communication node also includes: a communication device 1130, an input device 1140, and an output device 1150.

[0573] The processor 1110, memory 1120, communication device 1130, input device 1140 and output device 1150 in the communication node can be connected by a bus or other means. Figure 12 shows an example of connection by bus.

[0574] Input device 1140 can be used to receive input digital or character information, and to generate key signal inputs related to user settings and function control of the communication node. Output device 1150 may include display devices such as a display screen.

[0575] The communication device 1130 may include a receiver and a transmitter. The communication device 1130 is configured to perform information transmission and reception communication under the control of the processor 1110.

[0576] The memory 1120, as a computer-readable storage medium, can be configured to store software programs, computer-executable programs, and modules, such as program instructions / modules corresponding to the signal processing method described in the embodiments of this application (e.g., code block segmentation and CRC addition module 910, channel coding module 920, bit selection module 930, code block interleaving module 940, code block concatenation module 950, scrambling module 960, modulation module 970, layer mapping module 980; or de-layer mapping module 1010, demodulation module 1020, descrambling module 1030, code block deconcatenation module 1040, code block deinterleaving module 1050, debit selection module 1060, channel decoding module 1070, decode block segmentation and decode block CRC module 1080). The memory 1120 may include a program storage area and a data storage area, wherein the program storage area may store the operating system and application programs required for at least one function; the data storage area may store data created according to the use of the communication node, etc. Furthermore, memory 1120 may include high-speed random access memory, and may also include non-volatile memory, such as at least one disk storage device, flash memory device, or other non-volatile solid-state storage device. In some instances, memory 1120 may further include memory remotely located relative to processor 1110, and these remote memories can be connected to communication nodes via a network. Examples of such networks include, but are not limited to, the Internet, intranets, local area networks, mobile communication networks, and combinations thereof.

[0577] This application also provides a storage medium storing a computer program, which, when executed by a processor, implements any of the signal processing methods described in this application.

[0578] Optionally, the signal processing method, applied to a first communication node, includes: segmenting the input data block into code blocks and adding a cyclic redundancy check (CRC) bit sequence to determine at least one code block bit sequence; performing channel coding on each code block bit sequence to determine a parent codeword corresponding to each code block bit sequence; performing bit selection on each parent codeword to determine a bit-selected sequence corresponding to each parent codeword; performing code block interleaving on each bit-selected sequence according to a first data feature to determine an interleaved sequence; concatenating the interleaved sequences into code blocks in sequence to determine a concatenated output sequence; scrambling the concatenated output sequence to determine a scrambled sequence; modulating the scrambled sequence to determine a modulation symbol sequence; and mapping the modulation symbol sequence to a transport layer; wherein the first data feature includes at least one of the following: layer indication information; port indication information; number of transport layers; a preset threshold for the number of transport layers; rank indication information and a preset threshold for the rank; number of ports and a preset threshold for the number of ports; wherein the input data block includes: a transport block; or a transport block and a transport block CRC.

[0579] Optionally, this signal processing method, applied to a second communication node, includes: performing de-mapping on each layer of the modulation symbol sequence in the transmission layer to determine the modulation symbol sequence; demodulating the modulation symbol sequence to determine the scrambled sequence; descrambling the scrambled sequence to determine the concatenated output sequence; deconcatenating the concatenated output sequence to determine the interleaved sequence; deinterleaving the interleaved sequence according to the first data feature to determine at least one bit-selected sequence; and deselecting each bit-selected sequence to determine the sequence after each bit-selected sequence. The corresponding mother codeword; channel decoding is performed on each mother codeword to determine the code block bit sequence corresponding to each mother codeword; decoding block segmentation and decoding block cyclic redundancy check bit sequence are performed on each code block bit sequence to determine the output data block; wherein, the first data feature includes at least one of the following: layer indication information; port indication information; number of transmission layers; number of transmission layers and a preset threshold for the number of transmission layers; rank indication information and a preset threshold for the rank; number of ports and a preset threshold for the ports; wherein, the output data block includes: a transmission block; or a transmission block and a transmission block CRC.

[0580] The computer storage medium in this application embodiment can be any combination of one or more computer-readable media. The computer-readable medium can be a computer-readable signal medium or a computer-readable storage medium. For example, a computer-readable storage medium can be, but is not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination thereof. More specific examples of computer-readable storage media (a non-exhaustive list) include: an electrical connection having one or more wires, a portable computer disk, a hard disk, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM), flash memory, optical fiber, portable CD-ROM, optical storage device, magnetic storage device, or any suitable combination thereof. The computer-readable storage medium can be any tangible medium containing or storing a program that can be used by or in conjunction with an instruction execution system, apparatus, or device.

[0581] Computer-readable signal media may include data signals propagated in baseband or as part of a carrier wave, carrying computer-readable program code. Such propagated data signals may take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination thereof. Computer-readable signal media may also be any computer-readable medium other than computer-readable storage media, which can send, propagate, or transmit programs for use by or in connection with an instruction execution system, apparatus, or device.

[0582] Program code contained on a computer-readable medium may be transmitted using any suitable medium, including but not limited to: wireless, wire, optical fiber, radio frequency (RF), etc., or any suitable combination thereof.

[0583] Computer program code for performing the operations of this application can be written in one or more programming languages ​​or a combination thereof, including object-oriented programming languages ​​such as Java, Smalltalk, and C++, as well as conventional procedural programming languages ​​such as "C" or similar programming languages. The program code can be executed entirely on the user's computer, partially on the user's computer, as a standalone software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving remote computers, the remote computer can be connected to the user's computer via any type of network, including a local area network (LAN) or a wide area network (WAN), or it can be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0584] Optionally, embodiments of the present invention also provide a computer program product, including a computer program that, when executed by a processor, implements the signal processing method provided in any embodiment of the present invention.

[0585] The above description is merely an exemplary embodiment of this application and is not intended to limit the scope of protection of this application.

[0586] Those skilled in the art will understand that the term user terminal encompasses any suitable type of wireless user equipment, such as mobile phones, portable data processing devices, portable web browsers, or vehicle-mounted mobile stations.

[0587] Generally, the various embodiments of this application can be implemented in hardware or dedicated circuitry, software, logic, or any combination thereof. For example, some aspects can be implemented in hardware, while others can be implemented in firmware or software that can be executed by a controller, microprocessor, or other computing device, although this application is not limited thereto.

[0588] Embodiments of this application can be implemented by executing computer program instructions through the data processor of a mobile device, for example, in a processor entity, or through hardware, or through a combination of software and hardware. The computer program instructions can be assembly instructions, Instruction Set Architecture (ISA) instructions, machine instructions, machine-dependent instructions, microcode, firmware instructions, status setting data, or source code or object code written in any combination of one or more programming languages.

[0589] Any block diagram of logical flow in the accompanying drawings of this application may represent program steps, or may represent interconnected logic circuits, modules, and functions, or may represent a combination of program steps and logic circuits, modules, and functions. The computer program may be stored on memory. Memory may be of any type suitable to the local technical environment and may be implemented using any suitable data storage technology, such as, but not limited to, read-only memory (ROM), random access memory (RAM), optical storage devices and systems (Digital Video Disc (DVD) or Compact Disk (CD), etc.). Computer-readable media may include non-transitory storage media. Data processors may be of any type suitable to the local technical environment, such as, but not limited to, general-purpose computers, special-purpose computers, microprocessors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), and processors based on multi-core processor architectures.

[0590] A detailed description of exemplary embodiments of this application has been provided above through exemplary and non-limiting examples. However, various modifications and adjustments to the above embodiments will be apparent to those skilled in the art when considered in conjunction with the accompanying drawings and claims, without departing from the scope of this application. Therefore, the proper scope of this application will be determined by the claims.

Claims

1. A signal processing method applied to a first communication node, comprising: performing code block segmentation and code block cyclic redundancy check (CRC) bit sequence addition on an input data block to determine at least one code block bit sequence; performing channel coding on each of the code block bit sequences to determine a mother code codeword corresponding to each of the code block bit sequences; performing bit selection on each of the mother code codewords to determine a bit-selected sequence corresponding to each of the mother code codewords; performing code block interleaving on each of the bit-selected sequences according to first data characteristics to determine an interleaved sequence; performing code block concatenation on each of the interleaved sequences in sequence to determine a concatenated output sequence; performing scrambling on the concatenated output sequence to determine a scrambled sequence; performing modulation on the scrambled sequence to determine a modulation symbol sequence; and mapping the modulation symbol sequence to a transmission layer; wherein the first data characteristics comprise at least one of the following: layer indication information; port indication information; a number of transmission layers; a number of transmission layers and a preset threshold of the number of transmission layers; rank indication information and a preset threshold of a rank; a number of ports and a preset threshold of a port; wherein the input data block comprises a transport block or a transport block and a transport block CRC; wherein the code block interleaving on each of the bit-selected sequences according to the first data characteristics to determine an interleaved sequence comprises: determining bit interleaving information according to the first data characteristics, wherein the bit interleaving information comprises at least one of the following: interleaving depth; bit interleaving index; interleaving pattern; wherein a bit interleaving index length of the bit interleaving index is equal to a bit-selected sequence length of the bit-selected sequence; and performing code block interleaving on each of the bit-selected sequences through the bit interleaving information to determine an interleaved sequence; wherein the first data characteristics are obtained according to control information; wherein the control information comprises at least one of the following: downlink control information sent by a base station to a terminal; uplink control information sent by a terminal to a base station; radio resource control layer signaling messages; and medium access control element information; wherein the layer indication information comprises at least one of the following: best layer indication information; worst layer indication information; M1 best layer indication information; M2 worst layer indication information; wherein M1 and M2 are positive integers greater than or equal to 1; wherein the modulation on the scrambled sequence to determine a modulation symbol sequence comprises: sequentially grouping the scrambled bit sequence into a plurality of bit groups with QM bits as one group to determine the plurality of bit groups; and sequentially mapping each of the bit groups to a constellation modulation symbol to determine the modulation symbol sequence; wherein QM is a modulation order; wherein the modulation on the scrambled sequence comprises at least one of the following: π / 2-binary phase shift keying (BPSK) modulation; quadrature phase shift keying (QPSK) modulation; 16-quadrature amplitude modulation (QAM) modulation; 64-QAM modulation; 256-QAM modulation; and 1024-QAM modulation; and wherein the mapping of the modulation symbol sequence to a transmission layer comprises: dividing the modulation symbol sequence into groups of L modulation symbols in a front-to-back input sequence. ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ 2. The signal processing method of claim 1, wherein, ​ ​ ​ 3. The signal processing method of claim 1, wherein, ​ ​ ​ ​ ​ ​ 4. The signal processing method of claim 1, wherein, ​ ​ ​ ​ ​ ​ 5. The signal processing method of claim 1, wherein, ​ ​ ​ ​ 6. The signal processing method of claim 1, wherein, ​ ​ ​ ​ ​ ​ ​ 7. The signal processing method of claim 1, wherein, ​ ​ Each group of modulation symbols is mapped to the layers of the transport layer in a cyclic manner, according to the layer index from smallest to largest. Wherein, L is the number of transmission layers.

8. The signal processing method of claim 1, wherein, The step of selecting each bit sequence based on the first data feature and then performing code block interleaving to determine the interleaved sequence includes: Based on the first data characteristics and modulation order, the selected bits are interleaved into code blocks to determine the interleaved sequence.

9. The signal processing method of claim 8, wherein, The step of interleaving the sequence of selected bits based on the first data feature and modulation order includes at least one of the following: Based on the modulation order, the number of transmission layers, and a preset threshold for the number of transmission layers, code block interleaving is performed on the selected bit sequences; Based on the modulation order, the layer indication information, the number of transmission layers, and a preset threshold for the number of transmission layers, the selected bit sequences are interleaved into code blocks. The first interleaving is performed on the selected sequences of each bit according to the modulation order to determine the first interleaved sequence, and the second interleaving is performed on the first interleaved sequence according to the first data feature. The selected bit sequences are block-interleaved according to the first data feature and the modulation order; wherein the number of rows of the block interleaving is determined according to the first data feature.

10. The signal processing method of claim 9, wherein, The step of performing code block interleaving on each bit-selected sequence according to the modulation order, the number of transmission layers, and a preset threshold for the number of transmission layers includes: If the number of transport layers is greater than a preset threshold, the selected sequences of each bit are interleaved according to the number of transport layers. When the number of transmission layers is less than or equal to a preset threshold, the selected sequences of each bit are interleaved according to the modulation order.

11. The signal processing method of claim 9, wherein, The step of performing code block interleaving on each bit-selected sequence according to the modulation order, the layer indication information, the number of transmission layers, and a preset threshold for the number of transmission layers includes: If the number of transport layers is greater than a preset threshold, the selected sequences of each bit are interleaved according to the layer indication information and the number of transport layers; When the number of transmission layers is less than or equal to a preset threshold, the selected sequences of each bit are interleaved according to the modulation order and the number of transmission layers.

12. The signal processing method according to claim 9, wherein, The first step of interleaving is row-column interleaving based on the modulation order; The second step, interleaving, involves row-to-column interleaving based on the number of transport layers.

13. The signal processing method of claim 9, wherein, The step of selecting and interleaving the sequence of bits according to the first data feature and the modulation order includes: Read the selected bit sequence line by line; The selected bit sequence is row-permuted according to the modulation order and the layer indication information; Read the sequence of bits selected after row and column permutations.

14. A signal processing method applied to a second communication node, comprising: De-layer mapping is performed on the modulation symbol sequence of each layer in the transport layer to determine the modulation symbol sequence; The modulation symbol sequence is demodulated to determine the scrambled sequence; The scrambled sequence is descrambled to determine the concatenated output sequence; The concatenated output sequence is deconcatenated to determine the interleaved sequence; Based on the first data feature, the interleaved sequence is deinterleaved into code blocks to determine at least one bit-selected sequence; Deselect the bits of each bit-selected sequence to determine the mother codeword corresponding to each bit-selected sequence; Channel decoding is performed on each of the mother codewords to determine the code block bit sequence corresponding to each of the mother codewords; The bit sequences of each code block are divided into decoding blocks and the cyclic redundancy check bit sequences of the decoding blocks are used to determine the output data blocks; The first data feature includes at least one of the following: layer indication information; port indication information; number of transmission layers; number of transmission layers and a preset threshold for the number of transmission layers; rank indication information and a preset threshold for the rank; number of ports and a preset threshold for the number of ports; The output data block includes: a transport block; or a transport block and a transport block cyclic redundancy check (CRC).

15. The signal processing method of claim 14, wherein, The step of deinterleaving the interleaved sequence according to the first data feature to determine at least one bit-selected sequence includes: Bit interleaving information is determined based on the first data feature; the bit interleaving information includes at least one of the following: interleaving depth; bit interleaving index; interleaving pattern; wherein the bit interleaving index length of the bit interleaving index is equal to the bit selection sequence length of the bit selection sequence; The interleaved sequence is deinterleaved using the bit interleaving information to determine at least one bit-selected sequence.

16. The signal processing method of claim 14, wherein, The first data feature is obtained based on the control information; The control information includes at least one of the following: Downlink control information sent from the base station to the terminal; Uplink control information sent by the terminal to the base station; Radio Resource Control (RRC) signaling messages; Media access control element information.

17. The signal processing method of claim 14, wherein, The layer indication information includes at least one of the following: Best layer indication information; Worst-case level indication information; Ideally, there should be M1 layers of indicator information; Worst case M2 layer indication information; Wherein, M1 is a positive integer greater than or equal to 1, and M2 is a positive integer greater than or equal to 1.

18. A communication node, comprising: The program includes a memory, a processor, a program stored in the memory and executable on the processor, and a data bus for establishing communication between the processor and the memory, wherein the program, when executed by the processor, implements the signal processing method as described in any one of claims 1-17.

19. A storage medium for computer-readable storage, the storage medium storing one or more programs, the one or more programs being executable by one or more processors to implement the signal processing method as described in any one of claims 1-17.

20. A computer program product comprising a computer program, wherein, When the computer program is executed by a processor, it implements the steps of the signal processing method as described in any one of claims 1-17.

Images