WO2014090121A1 - Procédé et appareil de détection de signaux - Google Patents

Procédé et appareil de détection de signaux Download PDF

Info

Publication number
WO2014090121A1
WO2014090121A1 PCT/CN2013/088818 CN2013088818W WO2014090121A1 WO 2014090121 A1 WO2014090121 A1 WO 2014090121A1 CN 2013088818 W CN2013088818 W CN 2013088818W WO 2014090121 A1 WO2014090121 A1 WO 2014090121A1
Authority
WO
WIPO (PCT)
Prior art keywords
layer
symbol
equivalent
vector
signal
Prior art date
Application number
PCT/CN2013/088818
Other languages
English (en)
Chinese (zh)
Inventor
吴凯
Original Assignee
电信科学技术研究院
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 电信科学技术研究院 filed Critical 电信科学技术研究院
Publication of WO2014090121A1 publication Critical patent/WO2014090121A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00—Baseband systems
    • H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/03—Shaping networks in transmitter or receiver, e.g. adaptive shaping networks
    • H04L25/03891—Spatial equalizers
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/0413—MIMO systems

Definitions

  • the present invention relates to wireless communication technologies, and in particular, to a signal detection method and apparatus.
  • a signal detection method is a QR maximum-like (QRD-M) detection algorithm that retains M branches based on QR decomposition, and the detection algorithm is a kind of processing.
  • Maximum likelihood detection algorithm which uses a tree search method to select, for each layer of channel space, a plurality of constellation symbols that are most likely to transmit signals to the transmitting end of the layer in the tree search process, and The combination of the constellation symbols most likely to be the signal vector transmitted by the transmitting end is selected.
  • the combination of the constellation symbols is a vector, which is called a branch in the detection algorithm, and the combination of the constellation symbols is used as the detection result of the output.
  • MIMO Multiple Input Multiple Output
  • r is the received signal vector of W R xl
  • H is the channel matrix of N R xN
  • X represents the transmitted signal vector of ⁇ xl
  • n represents the noise vector of W R xl.
  • the QRD-M algorithm is usually implemented by tree search.
  • the tree search can be summarized as follows: Since the search of the signal transmitted by the channel space is not affected by other channel space, the search is performed from the layer, and the layer is searched. Calculating branch metrics of all constellation points in the layer of the tree structure, and the branch metric is specifically a symbol for calculating the influence of each constellation point and the symbol received by the channel space of the layer to remove the equivalent channel gain of the channel space of the layer The Euclidean distance is squared.
  • the search for other layers is based on the reserved branch of the previously searched symbol. The traversal of all constellation points is used to calculate the cumulative branch metric, and the M branches with the smallest cumulative score metric are retained in all constellation points. The reserved branch of the next layer of search.
  • QR decomposition is the triangular matrix decomposition on the unitary matrix, which is to decompose the matrix into a normalized orthogonal matrix, ie, the matrix Q and The triangle matrix R, so called the QR decomposition method.
  • a QR decomposition output Q matrix and an R matrix are performed on the channel matrix H.
  • the Q matrix is a unitary matrix
  • the R matrix is an upper triangular equivalent channel gain matrix, as shown in the following equation.
  • the initialization ⁇ ' ⁇ is an all-zero matrix of N L xM, and bm is a vector of 1 xM.
  • Step 2 As shown in Figure 1, proceed from layer 2 to layer 1. Search layer by layer to detect the signal vector sent by the sender.
  • the M metrics are the smallest among the Q branch metrics. Save bm and store the corresponding constellation point in the first line of ⁇ ' ⁇ .
  • Each layer keeps the smallest M BM corresponding branches in M ⁇ Q branches, stores the corresponding accumulated branch metrics into bm, and writes the corresponding searched layer reserved branches and constellation points reserved by the current layer to X' ⁇ .
  • the bm output after all symbol searches are completed is the branch metric corresponding to the remaining M smallest branches, and the reserved branch ⁇ 1 ⁇ contains the M branches corresponding to bm.
  • Step 3 In the uncoded system, the receiver converts the vector corresponding to the BM minimum to the bit output as the detection result. However, in a coded system, it is necessary to generate a log likelihood ratio (also called soft bit) of each bit input to the decoder. The process of generating a log-likelihood ratio is to use the difference between the minimum cumulative branch metric of the bit in the reserved branch and the minimum cumulative branch metric of the bit in the reserved branch as the output of the soft bit. As shown in the following formula:
  • the first layer represents a branch reserved "branch of the collection 3 ⁇ 4 bits ⁇ , x""indicates the first branch retention layer" 3 ⁇ 4 bits set to 1 of the branch, ", ⁇ ⁇ 1, ⁇ , ⁇ ⁇ , 3 ⁇ 4e ⁇ l,---,log 2 o indicates the layer of transmission
  • the number, 1 0 ⁇ 2 0 represents the modulation order.
  • the QRD-M detection algorithm has two shortcomings: First, in order to ensure the performance of the detection algorithm, the preset M is relatively large, and under each reserved branch, the branch metric under all constellation point hypotheses needs to be calculated. Resulting in a large number of branch metrics in the tree search; Second, in order to select the smallest M branch metrics and corresponding branch reservations, after each layer completes the calculation of the score metrics, it needs to be multiple The branch metrics are sorted. If the modulation order is high and M is large, the number of branch metrics is large, so the delay of sorting is relatively large.
  • M 16 is taken as an example.
  • the QRD-M algorithm needs to calculate 64 branch metrics, and needs 64 sorts and 16 sorts.
  • the QRD-M algorithm needs to calculate 64x16 branch metrics.
  • the QRD-M algorithm requires a 64x16-select 16 sort. The calculation and sorting of these branch metrics requires a lot of computing resources and brings a large processing delay.
  • the existing maximum likelihood detection algorithm has higher complexity and occupies more resources.
  • Embodiments of the present invention provide a signal detection method and apparatus to reduce the complexity of signal detection.
  • a signal detection method includes:
  • the receiving end determines an equivalent receiving vector according to a signal sequence received through the N-layer spatial multiplexing transmission system and a unitary matrix obtained by channel matrix QR decomposition;
  • the receiving end determines, in the symbol corresponding to the channel space of the Nth layer, the equivalent channel of the corresponding layer in the equivalent receiving vector to remove the channel space of the layer according to the upper triangular equivalent channel gain matrix obtained by the channel matrix QR decomposition.
  • the symbol obtained after the influence of the gain is the closest to the set number of symbols, and each symbol determined is taken as a signal vector;
  • the receiving end determines the equivalent receiving vector for each of the most recently determined signal vectors, the upper triangular equivalent channel gain matrix
  • the element of the layer removes the decision symbol of the interference of the signal vector and the equivalent channel gain of the channel space of the layer, and determines the set number of each decision symbol in the symbol corresponding to the channel space of the layer.
  • the closest candidate symbol, and based on all the candidate symbols, the signal vector of the candidate symbol and the upper triangular equivalent channel gain matrix, are determined to be composed of elements corresponding to the Nth layer to the current layer in the equivalent receiving vector.
  • the signal vector removes the influence of the equivalent channel gain of the corresponding channel space, and the signal vector obtained by the signal vector is the closest to the set number of signal vectors;
  • the signal detection result is determined based on the signal vector determined in the layer 1 channel space.
  • a signal detecting device includes:
  • a first determining unit configured to determine an equivalent receiving vector according to a signal sequence received through the N-layer spatial multiplexing transmission system and a unitary matrix obtained by QR matrix QR decomposition;
  • a second determining unit configured to: in a symbol corresponding to the channel space of the Nth layer, an upper triangular equivalent channel gain matrix obtained by channel matrix QR decomposition, determining to remove the layer channel from an element corresponding to the corresponding receiving vector Space After the influence of the equivalent channel gain, the symbols obtained are the closest to the set number of symbols, and each symbol determined is taken as a signal vector;
  • a third determining unit configured to: for each channel space in the Nth layer channel space to the layer 1 channel space, the receiving end pairs the last determined each signal vector, and the triangular equivalent channel gain on the signal vector
  • the matrix determines a decision symbol in the equivalent receiving vector that removes the influence of the signal vector on the interference of the signal vector and the equivalent channel gain of the channel space of the layer, and corresponds to each decision symbol in the channel space of the layer.
  • the symbol is determined to be the closest candidate symbol to be selected, and all the candidate symbols are selected, the signal vector of the candidate symbol and the upper triangular equivalent channel gain matrix are determined, and the corresponding correspondence vector is determined.
  • the signal vector composed of the symbols of the Nth layer to the current layer removes the influence of the equivalent channel gain of the corresponding channel space, and the signal vector obtained by the signal vector is the closest to the set number of signal vectors;
  • a fourth determining unit configured to determine a signal detection result according to the signal vector determined in the layer 1 channel space.
  • the embodiment of the invention provides a signal detection method and device. When detecting a signal received by an N-layer spatial multiplexing transmission system, when detecting the N-1 layer to the first layer, the channel is first determined.
  • the spatially received symbol removes the decision symbol of the interference of the most recently determined signal vector and the equivalent channel gain of the layer channel space, and further determines the candidate symbols closest to the decision symbols, and then determines according to these Among the signal vectors determined by the candidate symbols, which are the closest to the signal vector obtained by removing the equivalent channel gain of the corresponding channel space in the signal space received by the current channel space, the reserved signal vector of the layer can be determined, Only the candidate symbols determined according to the decision symbols need to be filtered, and it is not necessary to filter all possible symbols of the layer, which reduces the complexity of signal detection.
  • FIG. 1 is a schematic diagram of a QRD-M algorithm tree search provided by the prior art
  • FIG. 2 is a flowchart of a signal detection method according to an embodiment of the present invention.
  • FIG. 3 is a flowchart of a method for detecting an Nth layer signal according to an embodiment of the present invention
  • FIG. 4 is a schematic diagram of a constellation area division according to an embodiment of the present invention.
  • FIG. 5 is a flowchart of a method for determining a reserved signal vector according to an embodiment of the present invention
  • FIG. 6 is a second flowchart of a signal detection method according to an embodiment of the present invention.
  • FIG. 7 is a schematic diagram of a signal detecting apparatus according to an embodiment of the present invention.
  • the embodiment of the invention provides a signal detection method and device.
  • the channel is first determined.
  • the spatially received symbol removes the decision symbol of the interference of the most recently determined signal vector and the equivalent channel gain of the layer channel space, and further determines the candidate symbols closest to the decision symbols, and then determines according to these Among the signal vectors determined by the candidate symbols, which are the closest to the signal vector obtained by removing the equivalent channel gain of the corresponding channel space in the signal space received by the current channel space, the reserved signal vector of the layer can be determined, , only need to judge The candidate symbols determined by the decision symbol are filtered, and it is not necessary to filter all possible symbols of the layer, which reduces the complexity of signal detection.
  • an embodiment of the present invention provides a signal detection method, including:
  • the receiving end determines an equivalent receiving vector according to a signal sequence received by the N-layer spatial multiplexing transmission system and a unitary matrix obtained by channel matrix QR decomposition;
  • the receiving end determines, in the symbol corresponding to the channel space of the Nth layer, the element corresponding to the corresponding layer in the equivalent receiving vector, according to the upper triangular equivalent channel gain matrix obtained by the channel matrix QR decomposition.
  • the symbol obtained by the effect of the channel gain is the closest to the symbol of the set number, and each of the determined symbols is used as a signal vector;
  • the receiving end determines the equivalent receiving vector for each of the most recently determined signal vectors and the upper triangular equivalent channel gain matrix.
  • the decision symbol corresponding to the element of the layer is removed from the interference of the signal vector and the equivalent channel gain of the channel space of the layer, and each decision symbol is determined and set in the symbol corresponding to the channel space of the layer.
  • the number of the candidate symbols closest to the number, and according to all the candidate symbols, determining the signal vector of the candidate symbol and the upper triangular equivalent channel gain matrix, determining the corresponding Nth layer to the current layer in the equivalent receiving vector The signal vector composed of elements removes the influence of the equivalent channel gain of the corresponding channel space, and the signal vector obtained by the signal vector is the closest to the set number of signal vectors;
  • the receiving end determines each symbol vector received in the channel space of the layer to remove the signal vector.
  • the decision symbol after the influence of the interference and the equivalent channel gain of the channel space of the layer, and the candidate symbol close to the decision symbol determine the signal vector of the current layer, which reduces the complexity of signal detection.
  • the channel matrix is QR decomposed and decomposed into a unitary matrix and an upper triangular equivalent channel gain.
  • a matrix R where N is the number of layers in the channel space and the received signal
  • the number of signal vectors determined by each layer of the channel space may be set to be the same.
  • those skilled in the art may set other feasible methods according to actual conditions.
  • the number of signal vectors determined by the channel space of each layer is the same as an example.
  • the degree of similarity between the two signals can be determined by the square of the Euclidean distance between the two signals, The smaller the square of the Euclidean distance between the signals, the greater the degree of similarity between the two signals. Therefore, the effect of the equivalent received vector in S102 on the equivalent channel gain of the layer's channel space is removed in S102.
  • the symbols with the closest number of symbols obtained can be:
  • each of the decision symbols is determined in the symbol corresponding to the channel space of the layer, and the set number of the candidate symbols closest to the same is determined, which may be:
  • the signal vector in S103 determines a signal with the closest set of signal vectors obtained by removing the influence of the equivalent channel gain of the corresponding channel space by the signal vector composed of the symbols of the Nth layer to the current layer of the equivalent received vector.
  • Vector can be:
  • the obtained signal vector and the equivalent Euclidean distance squared of the signal vector composed of the elements corresponding to the Nth layer to the current layer in the equivalent receiving vector are the smallest, and the cumulative Euclidean distance square is specifically between each corresponding symbol of the two signal vectors. The sum of the squared Euclidean distances.
  • the elements of the Nth row and the Nth column of the upper triangular equivalent channel gain matrix obtained by QR decomposition are not zero.
  • the other elements in the Nth row are all zero, and the signals transmitted in the N-1th to the 1st channel are subject to the interference of the signals transmitted by other signals, and the corresponding N-1th layer in the upper triangular equivalent channel gain matrix.
  • the number of elements that are not zero in each row of the layer 1 channel space is greater than 1. Therefore, the method for detecting the symbols of the channel space of the Nth layer and the method for detecting the symbols of other channel spaces in the embodiment of the present invention Different, and need to start detection from the Nth layer channel space.
  • the square of the Euclidean distance obtained is d.
  • Lq ⁇ y NN x q ⁇
  • ⁇ is the Nth row element in the equivalent received vector
  • r w ⁇ is the element of the Nth row and the Nth column in the upper triangular equivalent channel gain matrix
  • X is the symbol, specifically, As shown in FIG.
  • the receiving end is in the symbol corresponding to the Nth channel space, and the upper triangular equivalent channel gain matrix obtained by channel matrix decomposition is used to determine the element removal of the corresponding layer in the equivalent vector of the signal vector.
  • the symbols of the most similarly set symbols obtained after the influence of the equivalent channel gain of the layer channel space specifically include:
  • the receiving end determines, according to each symbol in the symbol corresponding to the layer channel space, the Euclidean symbol obtained by the symbol and the equivalent receiving vector after the symbol of the layer removes the equivalent channel gain of the layer channel space. Distance square
  • the signal corresponding to the signal received by the receiving end is determined according to the signal received by the receiving end and the equivalent channel gain, and is determined from the signal that may be sent by the transmitting end.
  • the number of signal vectors r is the element of the i-th row and the j-th column in the upper triangular equivalent channel gain matrix, and is the element of the i-th row and the i-th column in the upper triangular equivalent channel gain matrix, and X m is the mth
  • the symbol of the jth row in the channel sequence is the element of the i-th row in the signal vector equivalent reception vector.
  • the interference caused by the transmission of the layer signal according to the element corresponding to the layer in the equivalent reception vector and the most recently determined signal vector, and the equivalent channel of the current layer can be obtained.
  • Gain to determine the decision symbol, specifically, the decision symbol is ⁇ -
  • a predetermined number of candidate symbols are determined for each decision symbol. Since the Euclidean distance of the candidate symbol and the decision symbol is small, the degree of similarity is high, and the signal sent by the transmitting end is also close to each other. Therefore, the signal vector of the current layer can be determined according to the candidate symbol and the most recently determined signal vector, and the complexity of signal detection is reduced.
  • An embodiment of the present invention provides a method for determining a candidate symbol, which specifically includes:
  • mapping the region to a symbol corresponding to the channel space of the layer For each decision symbol, determining a region to which the decision symbol belongs on the constellation diagram, and mapping the region to a symbol corresponding to the channel space of the layer, and determining that the symbol corresponding to the region is a candidate symbol, the region and the layer
  • the mapping relationship of the symbols corresponding to the channel space is specifically: determining a constellation point of the symbol corresponding to the channel space of the layer, and determining a corresponding area of the constellation point for the set number of constellation points whose plane distance is closest to each group And determining a mapping relationship between a symbol corresponding to each set of constellation points and a corresponding region of the set of constellation points, where a sum of plane distances of any constellation points in the corresponding region and the set of constellation points is smaller than that of other group constellation points The sum of the plane distances.
  • the detection in the 16QAM modulation mode is taken as an example, as shown in FIG. 4, the plane distance between each group is two.
  • the nearest four constellation points determine the corresponding regions of the set of constellation points, and the mapping relationship between the corresponding symbols of each set of constellation points and the corresponding regions of the set of constellation points is as shown in Table 1.
  • Stored in Table 1 is the number of the constellation points in Figure 4.
  • the candidate symbol When the candidate symbol is determined, if the decision symbol is located in area 1, the candidate symbols are 13, 14, 15, and 16. If the decision symbol is located in area 3, the candidate symbols are 9, 10, 11, and 12. The complexity of the detection.
  • the signal to be selected and the signal vector of the candidate symbol and the upper triangular equivalent channel gain matrix are determined to determine the signal vector to be reserved in the channel space of the layer.
  • the cumulative Euclidean distance square of the signal vector is added to obtain the cumulative Euclidean distance square of the candidate signal vector. The smaller the cumulative Euclidean distance square is, the corresponding Nth layer to the current layer in the candidate signal vector and the equivalent receiving vector.
  • all the candidate symbols are selected in S103, the signal vector of the candidate symbol and the upper triangular equivalent channel gain matrix are determined, and the corresponding Nth layer to the current layer in the equivalent receiving vector is determined.
  • the signal vector composed of the elements removes the influence of the equivalent channel gain of the corresponding channel space, and the signal vector obtained by the signal vector has the closest set number of signal vectors, including:
  • S501 Determine, for each candidate symbol, a candidate signal vector that is formed by the candidate symbol and a signal vector that determines the candidate symbol.
  • S502 Determine a symbol of a signal that should be selected in the signal vector after the candidate signal vector passes through the Nth channel space to the current channel space.
  • the i-th channel space is the current channel space
  • ⁇ , ⁇ , and M is the channel space of the previous layer.
  • the number of signal vectors, ae ⁇ 1, ⁇ , ⁇ , A is the number of candidate symbols determined according to each decision symbol set by the current layer channel space
  • X m To determine the signal vector of the candidate symbol, which is the element of the ith row in the equivalent received vector, r is the element of the i-th row and the j-th column in the equivalent channel matrix, which is the i-th in the upper triangular equivalent channel gain matrix.
  • BM(( - ⁇ )xA + a) bm(m) + d im _ 1)xa+a , where bm( ) is at the i+
  • BM(( -l)x + is the cumulative (-l)x + "accumulated channel vector of the i-th channel space" Square of distance;
  • the receiving end converts the set number of signal vectors determined by the first layer of channel space into bit outputs, that is, the detection result.
  • step S104 can be implemented by soft bit value calculation.
  • those skilled in the art can use other feasible methods to set the detection result, which is not described here.
  • the signal detection method provided by the embodiment of the present invention can be implemented in the form of a tree search.
  • the square of the Euclidean distance determined when detecting the Nth layer is the branch metric value in the tree search.
  • the cumulative Euclidean distance square determined by the N-1th to the first layer is the cumulative branch metric, and the Euclidean distance squared increment is the cumulative branch metric increment.
  • the embodiment of the invention provides a specific method for signal detection, including:
  • the mapping relationship between the area and the symbol determines the A symbols in the set that are the smallest squared with the Euclidean distance of the decision, and are the A candidate symbols of the symbols sent by the transmitting end at the layer;
  • the element of the i-th row in the quantity, r is the element of the i-th row and the j-th column in the upper triangular equivalent channel gain matrix, and riJ is the element of the i-th row and the i-th column in the upper triangular equivalent channel gain matrix, which is in the output matrix
  • the element of the mth column of the i-th row, me ⁇ l,---, ⁇ , m The a-th candidate to be selected according to the mth decision amount in the i-th channel, ae ⁇ 1, ⁇ , ⁇ ;
  • M*A cumulative branch metrics BM((m - ⁇ ) ⁇ + ⁇ ) bm(m) + d m _ l)xA+a , where, bm ( ) is the cumulative branch metric of the mth branch determined on the i+1th channel, BM((m - 1) ⁇ + ⁇ ) is the (-1)X + in the i-th channel space The cumulative Euclidean distance squared of the candidate channel vectors;
  • S610 Determine M minimum cumulative branch metric values, and determine corresponding branches, and use the corresponding branch as a reserved branch to be stored in the output matrix, and store the cumulative branch metric corresponding to the reserved branch into bm;
  • an embodiment of the present invention provides a signal detecting apparatus, including:
  • a first determining unit 701 configured to determine an equivalent receiving vector according to a signal sequence received by the N-layer spatial multiplexing transmission system and a unitary matrix obtained by channel matrix QR decomposition;
  • the second determining unit 702 is configured to: in the symbol corresponding to the Nth channel space, the upper triangular equivalent channel gain matrix obtained by the channel matrix QR decomposition, and determine the element corresponding to the corresponding layer in the equivalent receiving vector to remove the layer
  • the symbol obtained by the equivalent channel gain of the channel space is the closest to the symbol, and the determined symbol is used as a signal vector;
  • the third determining unit 703 is configured to determine, for each of the most recently determined signal vectors, the upper triangular equivalent channel gain matrix, etc., for each of the Nth layer channel space to the layer 1 channel space.
  • the element corresponding to the layer removes the influence symbol of the signal vector and the equivalent channel gain of the channel space of the layer, and each decision symbol is in the symbol corresponding to the channel space of the layer.
  • the signal vector composed of the elements of the current layer removes the influence of the equivalent channel gain of the corresponding channel space, and the signal vector obtained by the signal vector is the closest to the set number of signal vectors;
  • the fourth determining unit 704 is configured to determine a signal detection result according to the signal vector determined in the layer 1 channel space.
  • the receiving end determines the symbol received by the layer channel space for each signal vector that is determined last time, and removes the interference of the signal vector.
  • the decision symbol after the influence of the equivalent channel gain of the layer channel space, and the candidate symbol close to the decision symbol determines the signal vector of the current layer, which reduces the complexity of signal detection.
  • the first determining unit 701 After receiving the signal sequence on the receiving end, the signal sequence needs to be processed to implement the layered detection in the embodiment of the present invention. Therefore, the first determining unit 701 first needs to perform QR decomposition on the channel matrix, and decompose it into a matrix and on the matrix. Triangular equivalent channel gain matrix R: where N is the number of layers in the channel space and will be received
  • the number of signal vectors determined by each layer of the channel space may be set to be the same.
  • those skilled in the art may set other feasible methods according to actual conditions.
  • the number of signal vectors determined by the channel space of each layer is the same as an example.
  • the degree of closeness between the two signals can be determined by the square of the Euclidean distance between the two signals.
  • the smaller the square of the Euclidean distance between the two signals, the greater the degree of similarity between the two signals. Therefore, the symbol of the set number that is closest to the symbol obtained by the equivalent received vector after the symbol of the layer is removed from the equivalent channel gain of the layer channel space may be:
  • the set number of the candidate symbol closest to the set is determined in the symbol corresponding to the channel space of the layer, which may be:
  • the obtained signal vector and the equivalent Euclidean distance squared of the signal vector composed of the elements corresponding to the Nth layer to the current layer in the equivalent receiving vector are the smallest, and the cumulative Euclidean distance square is specifically between each corresponding symbol of the two signal vectors. The sum of the squared Euclidean distances.
  • the elements of the Nth row and the Nth column of the upper triangular equivalent channel gain matrix obtained by QR decomposition are not zero. , No. N
  • the other elements of the row are all zero, and the signals transmitted by the N-th layer to the layer 1 channel space are interfered by the signals transmitted by other signals, and the corresponding N-th layer to the first in the upper triangular equivalent channel gain matrix
  • the square of the Euclidean distance obtained is d.
  • the signal corresponding to the signal received by the receiving end is determined according to the signal received by the receiving end and the equivalent channel gain, and is determined from the signal that may be sent by the transmitting end.
  • the number of signal vectors is the element of the i-th row and the j-th column in the upper triangular equivalent channel gain matrix, and is the element of the i-th row and the i-th column in the upper triangular equivalent channel gain matrix, which is the m-th channel sequence.
  • the symbol of the jth line is the element of the i-th row in the signal vector equivalent reception vector.
  • the interference caused by the transmission of the layer signal according to the element corresponding to the layer in the equivalent reception vector and the most recently determined signal vector, and the equivalent channel of the current layer can be obtained.
  • Gain to be true Determine the decision symbol, specifically, determine the decision symbol as ⁇ , after determining the decision symbol, for each
  • the decision symbol determines the set number of candidate symbols, because the Euclidean distance of the candidate symbol and the decision symbol is small, the degree of similarity is high, and the signal sent by the transmitting end is also close, so that the candidate symbol can be selected.
  • the signal vector of the current layer is determined with the last determined signal vector to reduce the complexity of signal detection.
  • An embodiment of the present invention provides a method for determining a candidate symbol, which specifically includes:
  • mapping the region corresponding to the symbol corresponding to the channel space of the layer determines that the symbol corresponding to the region is a candidate symbol, the region and the channel of the layer
  • the mapping relationship between the symbols corresponding to the space is specifically: determining a constellation point of the symbol corresponding to the channel space of the layer, and determining a corresponding region of the constellation point for the constellation point of the set number of the closest distance between the two groups And determining a mapping relationship between a symbol corresponding to each group of constellation points and a corresponding region of the group of constellation points, where a sum of plane distances of any constellation points in the corresponding region and the group of constellation points is smaller than a plane of the other group of constellation points The sum of the distance.
  • the detection in the 16QAM modulation mode is taken as an example, as shown in FIG. 4, the plane distance between each group is two.
  • the nearest four constellation points determine the corresponding regions of the set of constellation points, and the mapping relationship between the corresponding symbols of each set of constellation points and the corresponding regions of the set of constellation points is as shown in Table 2.
  • Stored in Table 2 is the number of the constellation points in Figure 4.
  • the candidate symbol is 13 14 15 16, and if the decision symbol is located in the area 3, the candidate symbol is the complexity of the detection of 9 10 11 12 .
  • the signal to be selected and the signal vector of the candidate symbol and the upper triangular equivalent channel gain matrix are determined to determine the signal vector to be reserved in the channel space of the layer.
  • each candidate is selected.
  • a sign of the Euclidean distance squared increment of the candidate signal vector formed by the signal vector of the candidate symbol, and adding the squared increment of the Euclidean distance to the square of the cumulative Euclidean distance of the signal vector determining the candidate symbol the cumulative Euclidean distance squared of the candidate signal vector is obtained, and the smaller the cumulative Euclidean distance square is, the closer the candidate signal vector is to the signal vector corresponding to the element corresponding to the Nth layer to the current layer in the equivalent receiving vector.
  • the third determining unit 703 is configured to occupy all the candidate symbols, determine the signal vector of the candidate symbol, and the upper triangular equivalent channel gain matrix, and determine the elements corresponding to the corresponding Nth layer to the current layer in the equivalent receiving vector.
  • the signal vector of the composition removes the influence of the equivalent channel gain of the corresponding channel space, and the signal vector obtained by the signal vector is the closest to the set number of signal vectors, which is specifically used for:
  • the number of the channel space for this layer, m The number of the channel space for this layer, m , .
  • ⁇ l,., M ⁇ M is the number of signal vectors determined by the previous layer of channel space
  • A is the number of candidate symbols determined according to each decision symbol set by the current layer channel space, and is a signal vector for determining the candidate symbol, which is an element of the i-th row in the equivalent receiving vector
  • r is an element of the i-th row and the j-th column in the upper triangular equivalent channel gain matrix, and is an element of the i-th row and the i-th column in the upper triangular equivalent channel gain matrix;
  • BM (( - l) , where bm( ) is the cumulative Euclidean distance squared of the mth signal vector determined in the i+1th channel space, and BM((m - 1) ⁇ + «) is the first in the layer 1 channel space ( - 1) X + "the cumulative Euclidean distance squared of the candidate channel vectors;
  • the signal vector with the smallest cumulative Euclidean distance square of the set number is determined from the candidate signal vector, and the cumulative Euclidean distance square corresponding to the vector is stored in bm.
  • the receiving end converts the set number of signal vectors determined by the first layer of channel space into bit outputs, that is, the detection result.
  • the fourth determining unit 704 is configured to calculate a set number of signal vectors determined by the first layer channel space and convert the bits into soft bit values of the bits, and determine the detection result according to the soft bit values. The technicians in the field can use other feasible methods to set the test results, which are no longer described here.
  • the signal detection method provided by the embodiment of the present invention can be implemented in the form of a tree search.
  • the square of the Euclidean distance determined when detecting the Nth layer is the branch metric value in the tree search.
  • the cumulative Euclidean distance square determined by the N-1th to the first layer is the cumulative branch metric, and the Euclidean distance squared increment is the cumulative branch metric increment.
  • Embodiments of the present invention provide a specific method for signal detection, including Includes:
  • Matrix R ? " 2 ; 2 , where N is the number of layers of channel space;
  • the mapping relationship between the area and the symbol determines the A symbols in the set that are the smallest squared with the Euclidean distance of the decision, and are the A candidate symbols of the symbols sent by the transmitting end at the layer;
  • the selected symbol and the reserved branch corresponding to each candidate symbol determine M* A branch metric increments ⁇ 3 ⁇ 4-., ⁇ 2 , where, the number of layers of the layer channel space, etc.
  • r is the element of the i-th row and the j-th column of the upper triangular equivalent channel gain matrix
  • riJ is the element of the i-th row and the i-th column of the upper triangular equivalent channel gain matrix, which is an output
  • M*A cumulative branch metrics BM((m - ⁇ ) ⁇ + ⁇ ) bm(m) + d m _ l)xA+a , where bm ( ) is the cumulative branch metric of the mth branch determined on the i+1th channel, BM(( + «) is the ( - 1) X + "selected channel vector in the layer 1 channel space Cumulative Euclidean distance squared;
  • Embodiments of the present invention provide a signal detecting method and apparatus.
  • the layer is first determined.
  • the symbol received by the channel space removes the decision symbol of the interference of the most recently determined signal vector and the equivalent channel gain of the channel space of the layer, and further determines the candidate symbol closest to the decision symbols, and then determines the basis Which of the signal vectors determined by the candidate symbols are closest to the signal vector obtained by removing the equivalent channel gain of the corresponding channel space from the signal vector received by the current channel space, and the reserved signal vector of the layer can be determined. Therefore, only the candidate symbols determined according to the decision symbols need to be filtered, and it is not necessary to filter all possible symbols of the layer, which reduces the complexity of signal detection.
  • embodiments of the present invention can be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment, or a combination of software and hardware. Moreover, the present invention can be embodied in the form of a computer program product embodied on one or more computer-usable storage interfaces (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer usable program code.
  • computer-usable storage interfaces including but not limited to disk storage, CD-ROM, optical storage, etc.
  • the computer program instructions can also be stored in a computer readable memory that can direct a computer or other programmable data processing device to operate in a particular manner, such that the instructions stored in the computer readable memory produce an article of manufacture comprising the instruction device.
  • the apparatus implements the functions specified in one or more blocks of a flow or a flow and/or block diagram of the flowchart.
  • These computer program instructions can also be loaded onto a computer or other programmable data processing device such that a series of operational steps are performed on a computer or other programmable device to produce computer-implemented processing for execution on a computer or other programmable device.
  • the instructions provide steps for implementing the functions specified in one or more of the flow or in a block or blocks of a flow diagram.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Power Engineering (AREA)
  • Digital Transmission Methods That Use Modulated Carrier Waves (AREA)

Abstract

Des modes de réalisation de la présente invention, qui se rapportent au domaine des communications sans fil, concernent un procédé et un appareil permettant de détecter un signal. Dans un processus de détection d'un signal reçu par un système de transmission par multiplexage d'espaces à N couches, lors d'une détection d'une (N-1)e couche à une première couche, des signaux d'estimation sont d'abord déterminés après que des interférences des derniers vecteurs de signaux déterminés ont été supprimées des symboles reçus par l'espace de canaux et après que des effets du gain de canal équivalent de l'espace de canaux ont été supprimés, et ensuite des symboles à sélectionner les plus similaires aux symboles d'estimation sont déterminés. Ensuite, des vecteurs de signaux les plus similaires aux vecteurs de signaux, obtenus par le fait que des effets de gain de canal équivalent de l'espace de canaux correspondant ont été supprimés des vecteurs de signaux reçus par un espace de canaux courant, sont déterminés à partir des vecteurs de signaux déterminés selon les symboles à sélectionner, et des vecteurs de signaux réservés sur la couche sont déterminés. Par conséquent, il suffit seulement de filtrer les symboles à sélectionner déterminés selon les symboles d'estimation et il n'est pas nécessaire de filtrer tous les symboles sur la couche, ce qui réduit la complexité de la détection de signaux.
PCT/CN2013/088818 2012-12-10 2013-12-06 Procédé et appareil de détection de signaux WO2014090121A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201210529634.7A CN103873203B (zh) 2012-12-10 2012-12-10 一种信号检测的方法及装置
CN201210529634.7 2012-12-10

Publications (1)

Publication Number Publication Date
WO2014090121A1 true WO2014090121A1 (fr) 2014-06-19

Family

ID=50911359

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2013/088818 WO2014090121A1 (fr) 2012-12-10 2013-12-06 Procédé et appareil de détection de signaux

Country Status (2)

Country Link
CN (1) CN103873203B (fr)
WO (1) WO2014090121A1 (fr)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107027132B (zh) * 2016-02-01 2019-05-21 电信科学技术研究院 一种信号检测方法及装置
CN108075995B (zh) * 2016-11-10 2020-07-28 电信科学技术研究院 一种调制方式检测方法和装置

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101022325A (zh) * 2007-03-23 2007-08-22 东南大学 多输入多输出天线系统空分复用的最大似然简化检测方法
CN101043293A (zh) * 2006-03-20 2007-09-26 松下电器产业株式会社 生存节点选择和符号译码方法
US20100316151A1 (en) * 2008-02-05 2010-12-16 Kazuhiko Fukawa Receiving apparatus, receiving method and communication system

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101188478A (zh) * 2006-11-17 2008-05-28 中兴通讯股份有限公司 分层空时码系统的信号检测方法
EP2267925B1 (fr) * 2008-04-04 2017-05-03 Ntt Docomo, Inc. Système de communications mobiles, dispositif de réception, et procédé
US8588316B2 (en) * 2008-12-24 2013-11-19 Samsung Electronics Co., Ltd. QR decomposition detection device and method supporting interference whitening
CN101662342B (zh) * 2009-09-25 2012-08-29 意法·爱立信半导体（北京）有限公司 一种多输入多输出信号检测方法和装置
CN102263579B (zh) * 2011-08-01 2013-11-27 电信科学技术研究院 判断无线通信用户设备是否配对和进行配对的方法及设备

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101043293A (zh) * 2006-03-20 2007-09-26 松下电器产业株式会社 生存节点选择和符号译码方法
CN101022325A (zh) * 2007-03-23 2007-08-22 东南大学 多输入多输出天线系统空分复用的最大似然简化检测方法
US20100316151A1 (en) * 2008-02-05 2010-12-16 Kazuhiko Fukawa Receiving apparatus, receiving method and communication system

Also Published As

Publication number Publication date
CN103873203A (zh) 2014-06-18
CN103873203B (zh) 2017-05-24

Similar Documents

Publication Publication Date Title
JP4429945B2 (ja) Ｍｉｍｏ多重通信装置および信号分離方法
EP2520055B1 (fr) Traitement de branche d'arbre de recherche dans un décodeur de sphère
JP2004282757A (ja) 無線通信用球面復号器
WO2013182167A1 (fr) Procédé et dispositif de détection de décodage sphérique
JP5630234B2 (ja) 信号処理方法及び受信機
EP3304836B1 (fr) Traitement parallèle de décodeurs sphériques et autres approches de recherche de vecteur à l'aide d'une recherche d'arbre
WO2014090121A1 (fr) Procédé et appareil de détection de signaux
CN103973602A (zh) 信号检测方法和装置
WO2008047735B1 (fr) Dispositif de communication sans fil
TWI650984B (zh) 一種調製方式檢測方法和裝置
CN104901910A (zh) 一种mimo系统的检测方法及装置
WO2014032578A1 (fr) Procédé et dispositif pour déterminer des données de bit logique
CN103873118B (zh) 一种码本选择方法及装置
US10320523B2 (en) Method for detecting sent sequence, receiver, and receiving device
US20160034255A1 (en) Arithmetic Devices, Montgomery Parameter Calculation Method and Modular Multiplication Method Thereof
EP2856660B1 (fr) Appareil et procédé pour un traitement du signal dans un système de communication sans fil
CN114175050A (zh) 信号解映射
WO2017133408A1 (fr) Procédé et dispositif de détection de signal
KR100842817B1 (ko) Ｍｄｓａ를 이용한 저 연산량 ｍｉｍｏ 수신방식
KR102094736B1 (ko) 회전 직교 진폭 변조 기반의 통신 시스템에서 소프트 디매핑 방법 및 장치
EP3008869A1 (fr) Technique de démodulation
WO2015172674A1 (fr) Procédé et dispositif de détection de signaux
JP6120595B2 (ja) Ｍｉｍｏ受信装置及びプログラム
Peng et al. DSP based OFDM receiver for time-varying underwater acoustic channels
CN115022132A (zh) 信号接收译码方法和装置

Legal Events

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

Ref document number: 13863539

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 13863539

Country of ref document: EP

Kind code of ref document: A1