Sphere decoding detection method and apparatus
By grouping and rearranging the channel estimation matrix, first detecting the target user group and then detecting the interfering user group, the problem of unreasonable spherical decoding detection sequence in the multi-user MIMO environment is solved, and the detection performance and efficiency are improved. It is suitable for 5G NR and WIFI7 system.
Patent Information
- Application Number
- PCT/CN2024/080182
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- Priority Date
- 2023-05-24
- Filing Date
- 2024-03-05
- Publication Date
- 2024-11-28
AI Technical Summary
In a multi-user MIMO environment, the unreasonable detection order of each layer of spherical decoding detection leads to poor detection performance, affecting the performance of 5G NR and WIFI7 systems.
By grouping and rearranging the channel estimation matrix of the received signal, the interfering user group and the target user group are obtained, and the target user group is detected first, and then the interfering user group is detected. This method is implemented using the sorting module and the detection module.
Improves the performance of spherical decoding detection, ensures detection efficiency and accuracy under multi-user MIMO conditions, reduces complexity, and is suitable for 5G NR and WIFI7 systems.
Smart Images

Figure CN2024080182_28112024_PF_FP_ABST
Abstract
Description
Sphere decoding detection method and device
[0001] CROSS-REFERENCE TO RELATED APPLICATIONS
[0002] This disclosure is based on Chinese patent application CN202310595845.9, filed on May 24, 2023, entitled “Spherical Decoding Detection Method and Device,” and claims the priority of the patent application, all of which are incorporated herein by reference. Technical Field
[0003] The present disclosure relates to the field of communications, and in particular to a sphere decoding detection method and device. Background Art
[0004] Multiple Input Multiple Output (MIMO) technology is a key technology for achieving high spectral efficiency and improving system capacity in wireless communication systems. It is widely used in 5G NR and Wi-Fi 7 systems. While MIMO improves spectral efficiency in single-user scenarios, multi-user MIMO enables multiple parallel data streams to be sent to different users (User Equipment, UE) using the same time-frequency resources, or for different users to send data to the gNB using the same time-frequency resources. The greater distance between users in multi-user MIMO than between antennas in single-user MIMO makes it easier to transmit multiple data streams in parallel, further improving spectral efficiency. Accordingly, MIMO detection technology at the receiving end has become a key technology that determines the performance of 5G NR and Wi-Fi 7.
[0005] In MIMO detection technology, sphere decoding (SD) detection can approach the optimal performance, namely the maximum likelihood performance (ML), while the complexity is much lower than ML, so it is often used by MIMO receivers. SD includes two parts: orthogonal triangular decomposition (QR Decomposition) and search detection. The order in the QR decomposition determines the search detection order of each layer in MIMO. Under multi-user MIMO and when each MIMO detection layer is configured with a different modulation and coding scheme (MCS), how to reasonably sort the detection of each layer in SD so that the detection can achieve better performance is a problem that needs to be solved in the present disclosure.
[0006] Summary of the Invention
[0007] The embodiments of the present disclosure provide a sphere decoding detection method and apparatus to at least solve the problem in the related art that an unreasonable detection order of each layer in sphere decoding detection leads to poor detection performance.
[0008] According to one embodiment of the present disclosure, a sphere decoding detection method is provided, including: grouping and rearranging a channel estimation matrix of a received signal to obtain an interfering user group and a target user group; first detecting the target user group, and then detecting the interfering user group.
[0009] According to another embodiment of the present disclosure, a sphere decoding detection device is provided, including: a sorting module, configured to group and rearrange the channel estimation matrix of the received signal to obtain an interfering user group and a target user group; and a detection module, configured to first detect the target user group and then perform the detection on the interfering user group.
[0010] According to another embodiment of the present disclosure, a computer-readable storage medium is provided, in which a computer program is stored. The computer program is configured to execute the steps of any one of the above method embodiments when running.
[0011] According to another embodiment of the present disclosure, an electronic device is provided, including a memory and a processor, wherein the memory stores a computer program, and the processor is configured to run the computer program to perform the steps in any one of the above method embodiments. BRIEF DESCRIPTION OF THE DRAWINGS
[0012] FIG1 is a hardware structure block diagram of a computer terminal for a sphere decoding detection method according to an embodiment of the present disclosure;
[0013] FIG2 is a flow chart of a sphere decoding detection method according to an embodiment of the present disclosure;
[0014] FIG3 is a structural block diagram of a sphere decoding detection device according to an embodiment of the present disclosure;
[0015] FIG4 is a structural block diagram of a sphere decoding detection device according to an embodiment of the present disclosure;
[0016] FIG5 is a structural block diagram of a sphere decoding detection device according to an embodiment of the present disclosure;
[0017] FIG6 is a structural block diagram of a sphere decoding detection device according to an embodiment of the present disclosure;
[0018] FIG7 is a schematic diagram of a QR decomposition process according to an embodiment of the present disclosure;
[0019] FIG8 is a schematic diagram showing a comparison of different QR decomposition performances of multi-user MIMO according to an embodiment of the present disclosure. DETAILED DESCRIPTION
[0020] Hereinafter, the embodiments of the present disclosure will be described in detail with reference to the accompanying drawings and in combination with the embodiments.
[0021] It should be noted that the terms "first", "second", etc. in the description and claims of the embodiments of the present disclosure and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence.
[0022] The method embodiments provided in the embodiments of the present application can be executed in a mobile terminal, a computer terminal or a similar computing device. Taking running on a mobile terminal as an example, FIG1 is a hardware structure block diagram of a computer terminal of a spherical decoding detection method according to an embodiment of the present disclosure. As shown in FIG1 , the computer terminal may include one or more (only one is shown in FIG1 ) processors 102 (the processor 102 may include but is not limited to a processing device such as a microprocessor MCU or a programmable logic device FPGA) and a memory 104 for storing data, wherein the above-mentioned computer terminal may also include a transmission device 106 and an input and output device 108 for communication functions. It can be understood by those skilled in the art that the structure shown in FIG1 is only for illustration and does not limit the structure of the above-mentioned computer terminal. For example, the computer terminal may also include more or fewer components than those shown in FIG1 , or have a configuration different from that shown in FIG1 .
[0023] Memory 104 can be used to store computer programs, such as software programs and modules for application software, such as the computer program corresponding to the sphere decoding detection method in the embodiments of the present disclosure. Processor 102 executes the computer programs stored in memory 104 to perform various functional applications and data processing, thereby implementing the aforementioned methods. Memory 104 may include high-speed random access memory (RAM) and may also include non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some examples, memory 104 may further include memory remotely located from processor 102, which can be connected to the mobile terminal via a network. Examples of such networks include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.
[0024] The transmission device 106 is used to receive or transmit data via a network. Examples of such networks may include wireless networks provided by a computer terminal's communications provider. In one embodiment, the transmission device 106 includes a network interface controller (NIC), which can be connected to other network devices via a base station to enable communication with the Internet. In another embodiment, the transmission device 106 may be a radio frequency (RF) module, which is used to communicate with the Internet wirelessly.
[0025] In this embodiment, a sphere decoding detection method running on the above-mentioned computer terminal is provided. FIG2 is a flow chart of the sphere decoding detection method according to an embodiment of the present disclosure. As shown in FIG2 , the flow chart includes the following steps:
[0026] Step S202, grouping and rearranging the channel estimation matrix of the received signal to obtain an interference user group and a target user group;
[0027] In an exemplary embodiment, grouping and rearranging the channel estimation matrix includes grouping and arranging columns of the channel estimation matrix in the order of target users first and then interference users.
[0028] In an exemplary embodiment, before grouping and rearranging the channel estimation matrix of the received signal, it also includes: judging the number of users, and when the number of users is 1, performing QR decomposition on the target user; when the number of users is greater than 1, performing QR decomposition on the target user group.
[0029] In an exemplary embodiment, before step S204, the method further includes: first performing sorted orthogonal triangular QR decomposition on the interfering user group, and then performing sorted QR decomposition on the target user group. The sorted orthogonal triangular QR decomposition on the interfering user group includes: performing sorted QR decomposition on the columns of the interfering user group corresponding to the SNR in ascending order based on the SNR of the interfering user group.
[0030] The method performs sorted QR decomposition on a target user group, including: determining the number of modulation and coding strategies (MCSs) of the target user group; when the number of MCSs is 1, performing a first decomposition, wherein the first decomposition is to perform sorted QR decomposition on a column of the target user group corresponding to the second smallest SNR, and repeating the first decomposition on the remaining columns until the sorted QR decomposition is completed for all columns; and when the number of MCSs is greater than 1, performing a second decomposition, wherein the second decomposition is to perform QR decomposition on a column of the target user group corresponding to the second smallest SNR and not the highest MCS, and repeating the second decomposition on the remaining columns until the QR decomposition is completed for all columns.
[0031] Step S204: first detect the target user group, and then detect the interfering user group.
[0032] In an exemplary embodiment, before step S204, the method further includes: pre-processing the received signal after QR decomposition.
[0033] In an exemplary embodiment, the target user group is detected, including: when the number of MCSs is 1, first searching and detecting the layer of the target user group corresponding to the smallest SNR, and then searching and detecting the remaining layers in descending order of SNR; when the number of MCSs is greater than 1, first searching and detecting the layer of the target user group corresponding to the highest MCS and the smallest SNR, and then searching and detecting the remaining layers in descending order of SNR.
[0034] Detecting the interfering user group includes searching and detecting the layers of the target user group in descending order of SNR.
[0035] Through the above steps, a sphere decoding detection method is provided. By grouping and rearranging the channel estimation matrix of the received signal, an interfering user group and a target user group are obtained. The target user group is detected first, followed by the interfering user group. This method solves the problem of poor detection performance caused by the unreasonable detection order of each layer in sphere decoding detection in related technologies, thereby improving the detection performance of sphere decoding detection.
[0036] The execution entity of the above steps may be a base station, a terminal, etc., but is not limited thereto.
[0037] Through the description of the above implementation methods, those skilled in the art can clearly understand that the method according to the above embodiment can be implemented by means of software plus the necessary general hardware platform, and of course it can also be implemented by hardware, but in many cases the former is a better implementation method. Based on this understanding, the technical solution of the embodiment of the present disclosure is essentially or the part that contributes to the relevant technology can be embodied in the form of a software product, which is stored in a storage medium (such as ROM / RAM, disk, CD-ROM), including a number of instructions for enabling a terminal device (which can be a mobile phone, computer, server, or network device, etc.) to execute the method described in the embodiment of the present disclosure.
[0038] This embodiment also provides a sphere decoding detection device for implementing the above-mentioned embodiments and preferred implementations. Details already described will not be repeated. As used below, the term "module" may refer to a combination of software and / or hardware that implements a predetermined function. Although the devices described in the following embodiments are preferably implemented using software, implementation using hardware, or a combination of software and hardware, is also possible and contemplated.
[0039] FIG3 is a block diagram of a sphere decoding detection apparatus according to an embodiment of the present disclosure. As shown in FIG3 , the detection apparatus 30 includes: a sorting module 310 configured to group and rearrange the channel estimation matrix of the received signal to obtain an interfering user group and a target user group; and a detection module 320 configured to first detect the target user group and then detect the interfering user group.
[0040] FIG4 is a block diagram of a sphere decoding detection apparatus according to an embodiment of the present disclosure. As shown in FIG4 , the detection apparatus 40 includes, in addition to all the modules shown in FIG3 , a decomposition module 410 configured to first perform sorted orthogonal triangular QR decomposition on the interfering user group and then perform sorted QR decomposition on the target user group.
[0041] FIG5 is a block diagram of a spherical decoding detection apparatus according to an embodiment of the present disclosure. As shown in FIG5 , in addition to all the modules shown in FIG4 , the detection apparatus 50 further includes: a determination module 510 configured to determine the number of users. When the number of users is 1, QR decomposition is performed on the target user; when the number of users is greater than 1, QR decomposition is performed on the target user group.
[0042] FIG6 is a structural block diagram of a sphere decoding detection device according to an embodiment of the present disclosure. As shown in FIG6 , the detection device 60 further includes a processing module 610 configured to pre-process the received signal after QR decomposition.
[0043] It should be noted that the above modules can be implemented through software or hardware. For the latter, it can be implemented in the following ways, but not limited to: the above modules are all located in the same processor; or the above modules are located in different processors in any combination.
[0044] An embodiment of the present disclosure further provides a computer-readable storage medium, in which a computer program is stored. The computer program is configured to execute the steps of any one of the above method embodiments when running.
[0045] In an exemplary embodiment, the computer-readable storage medium may include, but is not limited to, various media that can store computer programs, such as a USB flash drive, a read-only memory (ROM), a random access memory (RAM), a mobile hard disk, a magnetic disk, or an optical disk.
[0046] An embodiment of the present disclosure further provides an electronic device, including a memory and a processor, wherein the memory stores a computer program, and the processor is configured to run the computer program to execute the steps in any one of the above method embodiments.
[0047] In an exemplary embodiment, the electronic device may further include a transmission device and an input / output device, wherein the transmission device is connected to the processor, and the input / output device is connected to the processor.
[0048] Obviously, those skilled in the art should understand that the modules or steps of the above-mentioned embodiments of the present disclosure can be implemented using a general-purpose computing device, they can be concentrated on a single computing device, or distributed on a network composed of multiple computing devices, they can be implemented using program codes executable by the computing device, so that they can be stored in a storage device and executed by the computing device, and in some cases, the steps shown or described can be performed in a different order than herein, or they can be made into individual integrated circuit modules, or multiple modules or steps can be made into a single integrated circuit module for implementation. Thus, the embodiments of the present disclosure are not limited to any specific combination of hardware and software.
[0049] In order to enable those skilled in the art to better understand the technical solutions of the embodiments of the present disclosure, the following is an elaboration with reference to scenario embodiments.
[0050] Scenario Example 1
[0051] Assume that the multi-user MIMO system M T transmit data streams and M R ≥M T The encoded bit stream is mapped onto the constellation diagram and forms M T Transmitted symbols Where ο is the set of constellation points. R =4,M T =4 as an example, the UE received signal is expressed as: Y = HS + N0 (1)
[0052] Among them, Y represents the received signal, represents the channel estimation matrix, where h ij The row number i=0,...,3 and the column number j=0,...,3 correspond to the channel estimation value between the receiving antenna i and the transmitting antenna j. This symbol represents three parallel transmissions of data symbols for target user UE0 (this also applies to situations with multiple target users, such as assigning three layers of data to two or three target UEs without grouping within the target user) and one transmission of data symbols for interfering user UE1. Superscripts 0 and 1 correspond to UE0 and UE1, respectively, and subscripts 0, 1, and 2 correspond to the sequence numbers of each channel, also known as the sequence numbers of each data layer. N0 represents noise. When the power of the interfering user is significantly higher than that of the target user, interference cancellation (such as interference rejection combining (IRC) or interference cancellation (IC)) is typically performed before MIMO detection of the target user. When the power of the interfering user is lower than or equal to that of the target user, joint MIMO detection of the target and interfering users using SD yields better performance.
[0053] When performing multi-user joint detection in SD, first perform sorted QR decomposition on H in formula (1):
[0054] Among them, the column vector q in the Q matrix of QR decomposition j ,j=0,...,3, represents the transmitting antenna number, the element R in the R matrix ij ,i=0,...,3,j=0,...,3 correspond to receiving antenna i and transmitting antenna j.
[0055] After sorting QR decomposition, preprocess the received signal: Z=Q H Y=Q H QRS+Q H N0=RS+N'0 (3)
[0056] Among them, Z represents the received signal after preprocessing, Q H represents the conjugate transpose of the Q matrix, N'0 = Q H N0
[0057] For the convenience of explanation, it is written in matrix form as follows:
[0058] Among them, z i ,i=0,...,3, represents the receiving antenna number.
[0059] Compared with formula (1), the order of the elements of S in formula (4) is the position obtained after the exchange of the assumed sorted QR decomposition. Maximum likelihood detection is to search and detect all possible data symbols (corresponding to each point on the constellation diagram) of each element of S in formula (4) to achieve optimal performance. The output after search and detection is the LLR value. Assume that the LLR soft value of the k-th bit output of the i-th symbol can be expressed as:
[0060] where x i,k Indicates the value of the k-th bit position of the i-th symbol on the constellation diagram corresponding to each element in S, D ML =min‖Z-RS ML ‖ 2 Indicates the minimum Euclidean distance of the ML path (‖.‖ 2 represents the square of the modulus), D MLC =min‖Z-RS MLC ‖ 2 The complement of the ML path represents the minimum Euclidean distance of the MLC path. The complement represents the minimum Euclidean distance of the MLC path. The complement represents the minimum Euclidean distance of the MLC path. i,k The path set after the corresponding path. Z represents the received signal after preprocessing in formula (3), RS ML Where R is the R matrix in formula (2), S ML represents S selected under the ML path in formula (1).
[0061] The Euclidean distance is expressed as:
[0062] The computational complexity of traversal search detection is very large, making it difficult to implement in practice. The SD search detection part simplifies the traversal search process into searching only some constellation points corresponding to each element of S according to a certain optimization method. In formula (6), the detection is performed in the order from the last row to the first row of the R matrix. The first detection is the calculation of in Take all possible points on the constellation diagram for calculation, select a relatively small part of the value to be retained, and its corresponding Substituting into the second test is to calculate Then select a relatively small part of the value to be retained, and its corresponding Substitute this into the third test, and so on until the complete D is calculated. Finally, the minimum value among the multiple retained Ds is selected as the minimum Euclidean distance of the ML path. Similarly, the remaining paths outside the ML path are searched and tested for SD of the MLC path.
[0063] The above briefly introduces the search and detection portion of SD. Given that in the embodiments of the present disclosure, specific sorting criteria are used in the search and detection, where the specific sorting criteria refer to the sorting sequence numbers used in the search and detection, the order in which the decomposition is performed in the QR decomposition is opposite to the order of the search and detection, that is, the QR decomposition first obtains the last detection sequence number of the search and detection, and finally obtains the first detection sequence number of the search and detection. In the embodiments of the present disclosure, the sorting criteria of the SD search and detection can be clarified on the premise that the sorting criteria of the QR decomposition are clarified. After that, those skilled in the art can perform search and detection according to the above-mentioned search and detection steps and the technical means of search and detection in related technologies.
[0064] It should be clear that, in actual implementation, a common approach that can be adopted is to only consider the SNR size factor for sorting, without considering MCS and multi-user factors.
[0065] For the sorted QR decomposition of SD, the sorting criteria proposed in the embodiment of the present disclosure are embodied in the loop steps in the following table:
[0066] Table 1 QR decomposition steps with sorting
[0067] In formula (4), SD detection starts from the last row of the R matrix (corresponding to R 33 ) to the first row (corresponding to R 00 ~R 03 ), and the order of QR decomposition is from the left to right columns of the Q matrix in step 1, and the order of the corresponding R matrix starts from the first row (corresponding to R 00 ~R 03 ), meaning the order of QR decomposition is opposite to the order of SD detection. The R matrix, determined after the sorted QR decomposition, determines the detection order of each layer in the SD search. The implementation of the criteria in step 2.2 is as follows.
[0068] First, define the columns corresponding to the target user UE0 and the columns corresponding to the interference user UE1 in the Q matrix as user group 0 (corresponding to columns q0 q1 q2) and user group 1 (corresponding to column q3), respectively. QR decomposition starts from group 1 and executes step 2.3. The columns q3 and q0 are swapped and marked as the k0 column of the Q matrix. Then, the first cycle of steps 2.4 to 2.5 is started to obtain the first row of the R matrix (corresponding to R 00 ~R 03 ), the q0 q1 q2 columns are also updated (for example, where j=i=0,…,3, if first i=0, j=0,1,2,3; if then i=1, j=1,2,3, it is a 2-loop nesting).
[0069] Then, QR decomposition is performed on columns q0, q1, and q2 based on the MCS and SNR. (If the code rate is the same for all users, the MCS is only reflected in the modulation method. Because the noise corresponding to each column can be normalized, the SNR from large to small is reflected in the energy of each column from large to small in step 2.1.) Each column in each user group may correspond to a different MCS. The QR decomposition result should ensure that the column with the minimum SNR in each column with the highest MCS corresponds to the first SD detection row. After the first detection row is selected, the remaining columns can continue to be detected in the order of highest MCS first, and the layers with the same MCS can be detected in the order of highest SNR from large to small according to SD detection. Alternatively, the MCS can be ignored and the SD detection can be directly ordered from large to small SNR. The two sorting methods have similar performance, and the latter is selected to simplify the calculation.
[0070] Assume that q0 q1 corresponds to MCS0, q2 corresponds to MCS1, and MCS0 is less than MCS1. Sort the three energy columns obtained in step 2.1 and select the one with the next lowest energy. If q1 is the one with the next lowest energy, execute step 2.3 to swap q1 and q0 (marked as column k1 of the Q matrix) and swap the corresponding rows of R. Perform the second loop of steps 2.4-2.5 to obtain the second row of the R matrix, and update the remaining columns q0 q1. Because MCS0 is less than MCS1, the last two columns are not sorted and the remaining loops are executed.
[0071] Assume that q0 q1 corresponds to MCS0, and q2 corresponds to MCS1, with MCS0 greater than MCS1. If there is only one column with low MCS (i.e., only column q2 corresponds to MCS1), proceed directly to step 2.3 to swap q2 and q0 (marked as column k1 of the Q matrix) and swap the corresponding rows of R. Perform the second loop from steps 2.4 to 2.5 to obtain the second row of the R matrix, and update the remaining columns q0 q1. Continue the third loop, sorting the energies of the two columns obtained in step 2.1 and selecting the one with the next lowest energy. If q1 is the column with the next lowest energy, proceed to step 2.3 to swap q0 q1 and the corresponding rows of R. Perform steps 2.4 to 2.5 to obtain the third row of the R matrix.
[0072] FIG7 is a schematic diagram of a QR decomposition process according to an embodiment of the present disclosure, as shown in FIG7 , including:
[0073] 1. Determine whether it is multi-user or single-user. If the received data of all layers is allocated to the target user, the likelihood ratio (LLR) of the data output of all layers needs to be measured. This indicates single-user, and step 4 is performed. If the received data of only some layers is allocated to the target user, only the LLR of the data output of some layers needs to be measured. This indicates multi-user.
[0074] 2. Rearrange the columns of the channel matrix according to the target user and interference user groups so that the QR decomposition is performed on the interference user group first and then on the target user group;
[0075] 3. Rearrange the interfering user groups in ascending order of SNR, so that the QR decomposition is performed first on the columns with smaller SNRs and then on the columns with larger SNRs;
[0076] 4. Within the target user group, if a single MCS is used, proceed directly to step 6. If multiple MCSs are used, first select the column with the next lowest SNR and determine the MCS level. If this column has the highest MCS, continue selecting the column with the next lowest SNR from the remaining columns. If it does not have the highest MCS, proceed to step 5.
[0077] 5. Select the column with the second smallest SNR and swap it with the first column in the target user group that has not undergone QR decomposition, so that the column with the smallest SNR and the highest MCS in this QR decomposition (steps 2.3 to 2.5) will not be the column with the smallest SNR and the highest MCS. Continue to perform step 4 on the remaining columns until all columns other than the one with the highest MCS have undergone QR decomposition.
[0078] 6. Among the columns corresponding to the highest MCS, select the column with the second smallest SNR and swap it with the first column of these columns, so that the column with the smallest SNR is not performed in this QR decomposition (steps 2.3 to 2.5); continue to perform step 5 on the remaining columns until the non-minimum SNR case is QR decomposition first, and the column with the smallest SNR is QR decomposition last.
[0079] In the above embodiment, the specific sorting criteria are for the sorting sequence numbers used in search detection. However, the order of decomposition in the QR decomposition is opposite to the search detection order. That is, the first QR decomposition result is the last detection sequence number of the search detection, and the last result is the first detection sequence number of the search detection. In actual implementation, a common approach is to consider only the SNR size factor for sorting, without considering MCS and multi-user factors.
[0080] Both 5G NR and Wi-Fi 7 can use SD for MIMO detection. To more clearly demonstrate the effect of the technical solution of the embodiment of the present disclosure, the 5G NR system receiver simulation is taken as an example. The simulation conditions refer to the 3GPP standard. The main simulation parameters are shown in Table 2:
[0081] Table 2 5G NR simulation parameter list
[0082] FIG8 is a schematic diagram comparing the performance of different QR decompositions for multi-user MIMO according to an embodiment of the present disclosure. As shown in FIG8 , under different power ratios of UE0 and UE1, simulation results for unsorted QR decomposition, traditional QR decomposition (ordered only by SNR from large to small), and sorted QR decomposition according to the embodiment of the present disclosure are shown. From the performance curves in the figure, it can be seen that the QR decomposition sorting according to the embodiment of the present disclosure achieves greater gains. Although the sorting according to the embodiment of the present disclosure is relatively complex because it takes three factors into consideration, the computational complexity of the sorting operation is very small compared to the entire QR decomposition. That is, the embodiment of the present disclosure can achieve better performance while maintaining acceptable processing complexity, making it a method that can be implemented in practice.
[0083] In summary, the sphere decoding detection method and apparatus provided by the embodiments of the present disclosure solve the problem of how to reasonably sort the order of the layers for SD detection in MIMO receivers for 5G NR and WIFI7, achieving the best possible performance while maintaining acceptable processing complexity. SD considers three factors when sorting the detection layers: whether the UE is the target or interfering UE, the MCS level, and the SNR level. In multi-user MIMO SD detection, the target user's layer is detected first, followed by the interfering user's layer. The columns of interfering users are ranked in descending order of SNR corresponding to SD detection. In target user detection, if there are multiple MCSs, when the number of target users is 1, the layer with the highest MCS and the lowest SNR is detected first. When the number of target users is greater than 1, when implementing joint detection of multiple users, the layer with the highest MCS and the lowest SNR is selected first from all target users for detection. The remaining columns are directly ranked in descending order of SNR corresponding to SD detection. In the detection of the target user, if there is only one MCS, the corresponding layer with the smallest SNR is detected first, and the remaining columns are detected in the order of SD detection from large to small SNR.
[0084] The above description is merely a preferred embodiment of the present disclosure and is not intended to limit the present disclosure. Those skilled in the art will appreciate that various modifications and variations of the present disclosure are possible. Any modifications, equivalent substitutions, or improvements made within the principles of the present disclosure should be included within the scope of protection of the present disclosure.
Claims
1. A sphere decoding detection method, comprising: The channel estimation matrix of the received signal is grouped and rearranged to obtain an interference user group and a target user group; The target user group is detected first, and then the interfering user group is detected.
2. The method according to claim 1, wherein: The channel estimation matrix is grouped and rearranged, comprising: The columns of the channel estimation matrix are grouped and arranged in the order of target users first and then interference users.
3. The method according to claim 1, wherein: Before detecting the target user group first and then detecting the interfering user group, the method further includes: First, the interfering user group is subjected to a sorted orthogonal triangular QR decomposition, and then the target user group is subjected to the sorted QR decomposition.
4. The method according to claim 3, wherein: The performing sorted orthogonal triangular QR decomposition on the interfering user group includes: According to the signal-to-noise ratio SNR of the interfering user group, the sorted QR decomposition is performed on the columns of the interfering user group corresponding to the SNR in order from small to large.
5. The method according to claim 3, wherein: The performing the sorted QR decomposition on the target user group includes: Determine the number of modulation coding strategies (MCS) of the target user group; When the number of the MCS is 1, a first decomposition is performed, wherein the first decomposition is to perform the sorted QR decomposition on the column of the target user group corresponding to the second smallest SNR, and repeatedly perform the first decomposition on the remaining columns until the sorted QR decomposition is completed for all columns; When the number of MCSs is greater than 1, a second decomposition is performed, wherein the second decomposition is: performing the QR decomposition on the column of the target user group corresponding to the second smallest SNR and the non-highest MCS, and repeating the second decomposition on the remaining columns until the QR decomposition is completed for all columns.
6. The method according to claim 1, wherein: Before the channel estimation matrix of the received signal is grouped and rearranged, the method further includes: The number of users is determined, and when the number of users is 1, QR decomposition is performed on the target user; when the number of users is greater than 1, the QR decomposition is performed on the target user group.
7. The method according to claim 1, wherein: Before detecting the target user group first and then detecting the interfering user group, the method further includes: The received signal after the QR decomposition is preprocessed.
8. The method according to claim 1, wherein: The detecting of the target user group includes: When the number of MCS is 1, the layer of the target user group corresponding to the minimum SNR is searched and detected first. Then, the search and detection is performed on the remaining layers in the order of the SNR from large to small; When the number of the MCS is greater than 1, the search and detection is first performed on the layer of the target user group corresponding to the highest MCS and the smallest SNR, and then the search and detection is performed on the remaining layers in descending order of the SNR.
9. The method according to claim 1, wherein: The detecting of the interfering user group includes: The layers of the target user group are searched and detected in descending order of SNR.
10. A sphere decoding detection device, comprising: A sorting module is configured to group and rearrange the channel estimation matrix of the received signal to obtain an interference user group and a target user group; The detection module is configured to first detect the target user group and then detect the interfering user group.
11. The device according to claim 11, wherein: Also includes: The decomposition module is configured to first perform the sorted orthogonal triangular QR decomposition on the interfering user group, and then perform the sorted QR decomposition on the target user group.
12. The device according to claim 11, wherein Also includes: The judgment module is configured to judge the number of users, and when the number of users is 1, perform the QR decomposition of the target user; when the number of users is greater than 1, perform the QR decomposition of the target user group.
13. The device according to claim 11, wherein: Also includes: The processing module is configured to pre-process the received signal after the QR decomposition is completed.
14. A computer-readable storage medium having a computer program stored therein, wherein: When the computer program is executed by a processor, the method described in any one of claims 1 to 9 is implemented.
15. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the method according to any one of claims 1 to 9 when executing the computer program.
Citation Information
Patent Citations
Multi-user detection method and multi-user detection device of multi-input and multi-output SC-FDMA (Single Carrier-Frequency Division Multiple Access) system
CN104486046A
Lattice reduction assisted low-complexity greedy spherical decoding detection method
CN109818891A
Simulation method and system for channel estimation and iterative detection of large-scale MIMO system
CN113517941A
Multi-user multiple-input multiple-output detection method and device, electronic equipment and medium
CN115481521A
Receiving device and methods thereof
WO2018082775A1
