Method for parallel detection of multiaerial system based on breadth-first search

Abstract

The invention discloses a method for parallel detection of a multiaerial system based on a breadth-first search. The method is characterized in that a processing system is connected with a preprocessing module through input, the output end of the preprocessing module is connected with the input end of a tree-searching module, the output end of the tree-searching module is connected with the input end of an output module, and the output end of the output module is system output; new conversion from a complex-number detection model to a real-number detection model is introduced, the particular characteristics of an upper triangular matrix obtained through orthogonal upper triangular decomposition conducted on a lower real-number channel matrix in the real-time detection model is used, and the method that two layers are calculated at the same time is used for accelerating operation, so that the parallel degree of an algorithm is improved; the subtree multiplex method is used for reducing operand, the instruction cycles are reduced, the operation speed of the algorithm is increased, and the throughput rate of coding is increased. Compared with an existing list Kbest detection method, the method can guarantee that the performance is not decreased, and the needed execution cycles are averagely reduced by 35% in the multiaerial system detection process.

Description

technical field [0001] The invention belongs to the technical field of parallel detection methods in digital communication, and in particular relates to a parallel detection method based on breadth-first search in a multi-antenna system. Background technique [0002] The fourth-generation mobile communication system characterized by multi-antenna system (MIMO) increases the data rate of the system, and at the same time, with the increase of the number of antennas and the increase of modulation order, the complexity of the detection algorithm also increases exponentially. . The breadth-first sphere decoding algorithm (Breadth-First Sphere Decoding) draws on the search tree model in the classic sphere decoding algorithm, and at the same time searches forward layer by layer in a unidirectional manner, and removes the Partial branches are widely used because of their simple structure and suitable for hardware implementation. [0003] "IEEE Journal on Selected Areas in Communic...

AI Technical Summary

Problems solved by technology

[0004] However, in the search tree of the list optimal (Kbest) algorithm, due to the backward and forward dependence between layers, that is, the calculation of the latter layer depends on the results of the previous layer, otherwise the cost value of this layer cannot be calculated, so the algorithm is in Layers are strictly serial

Images