CN109167624A - A kind of receiving antenna optimal path finding method based on A-Star algorithm - Google Patents
A kind of receiving antenna optimal path finding method based on A-Star algorithm Download PDFInfo
- Publication number
- CN109167624A CN109167624A CN201811328935.7A CN201811328935A CN109167624A CN 109167624 A CN109167624 A CN 109167624A CN 201811328935 A CN201811328935 A CN 201811328935A CN 109167624 A CN109167624 A CN 109167624A
- Authority
- CN
- China
- Prior art keywords
- receiving antenna
- indicate
- optimal path
- star algorithm
- method based
- Prior art date
- Legal status (The legal status 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 status listed.)
- Pending
Links
Classifications
-
- 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/08—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the receiving station
-
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L27/00—Modulated-carrier systems
- H04L27/32—Carrier systems characterised by combinations of two or more of the types covered by groups H04L27/02, H04L27/10, H04L27/18 or H04L27/26
- H04L27/34—Amplitude- and phase-modulated carrier systems, e.g. quadrature-amplitude modulated carrier systems
- H04L27/36—Modulator circuits; Transmitter circuits
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/48—Routing tree calculation
Abstract
The invention belongs to 5G field of communication technology, specially a kind of receiving antenna optimal path finding method based on A-Star algorithm, comprising the following steps: the Euclidean distance expectation for calculating receiving antenna index sequence carries out descending arrangement to expectation；Using the receiving antenna index sequence after sequence as search number of plies sequence, search tree is determined；Vector is sent with the branching representation of search tree, the root of search tree is A-Star algorithm start node, carries out tree search to the receiving antenna after sequence, finds the optimal path of receiving antenna.The present invention can effectively be weighed between system performance and computation complexity.
Description
Technical field
The invention belongs to wireless communication field, specially a kind of receiving antenna optimal path based on A-Star algorithm is found
Method.
Background technique
Extensive multiple-input and multiple-output (Massive Multi-input Multi-output, Massive MIMO) system
Simultaneous techniques and a plurality of radio frequency link between complicated antenna are needed, the higher computational complexity of system, energy consumption and hard are caused
Part realizes that difficulty is larger.Spatial modulation (Spatial Modulation, SM) technology is a kind of sequence using activation transmitting antenna
Number and modulation symbol indicate the Novel Delivery scheme of transmitting information jointly, be completely eliminated in space multi-way mimo system and receive letter
Interfering with each other between number, transmission rate with higher.
SM can transmit channel bit as the new technology in mimo system, the technology using transmission antenna serial number, together
When avoid interchannel interference, therefore become one of the hot spot that everybody studies.In spatial modulation system, information bit is divided into two
Part, a part are mapped in selected antenna serial number, and another part is mapped in traditional modulation constellation, therefore can be effective
Be formed by space dimension using transmission antenna serial number come transmission information bit.In addition, spatial modulation system is in the same transmission
In time slot, only allow an antenna activation, other antennas keep silent status, the interchannel interference effectively avoided in this way.
Currently, many researchers are managed the A-Star algorithm in graph theory by the fast algorithm of detecting estimated based on expense
By being introduced into signal detection.But this method computation complexity with higher, therefore, the invention proposes one kind to be based on A-
The receiving antenna detection method of Star algorithm layer sorting, this method can be had between system performance and computation complexity
The tradeoff of effect.
Summary of the invention
Based on problem of the existing technology, the invention proposes a kind of optimal roads of the receiving antenna based on A-Star algorithm
Diameter finding method, comprising the following steps:
S1, the Euclidean distance expectation for calculating receiving antenna index sequence, according to Euclidean distance expectation to reception day
Clue introduces the arrangement of row descending；
S2, the receiving antenna index sequence after sequence to should be used as search number of plies sequence, determine search tree；
S3, vector is sent with the branching representation of search tree, the root of search tree is A-Star algorithm start node, after sequence
Receiving antenna index sequence carry out tree search, find the optimal path of receiving antenna.
Further, the Euclidean distance it is expected ErCalculation are as follows:
Wherein, xvIndicate that the v of received vector x ties up element, al,vIndicate that the v of the l row of channel matrix A ties up element, v
∈{1,2,...,Nv, l ∈ { 1,2 ..., Nu}；S indicates the modulation symbol sent, sMIndicate m-th modulation symbol；M indicates to adjust
Element sum in assemble of symbol processed；NvIndicate receiving antenna number；NuIndicate transmission antenna number.
Further, the step S2 include according to Euclidean distance desired value, from big to small by NvRoot receiving antenna row
Arrange into NvLayer, and in L branch of every layer of composition；NvIndicate that receiving antenna number, L indicate branch's number in tree search.
Further, the step S3 includes respectively indicating L transmission vector with L branch, successively calculates the 1st to
V layers of cumulative cost value determines every layer of the smallest node of heuristic function value, with heuristic function value in the 1 to v layers
The corresponding branch of the smallest node is as optimal path.
Further, the calculation of the cumulative cost value are as follows:
Qu=| xv-av,ls|2+Pv-1
Wherein, QuIndicate the cumulative cost value of u-th of branch, xvIndicate that the v of received vector x ties up element, al,vIndicate letter
The v of the l row of road matrix A ties up element, l ∈ { 1,2 ..., Nu}；NuIndicate transmission antenna number；S indicates the modulation sent symbol
Number；Pv-1Indicate v-1 layers of cumulative cost value.
Further, the calculation method of the heuristic function value are as follows:
K (u)=g (v, u)+h (v, u)
Wherein, g (v, u) indicates Actual path cost of the start node to destination node (v, u), the initial section of h (v, u) expression
Point arrives the destination path cost of destination node (v, u)；u∈{1,2,...,L}.
Further, the calculation formula of destination path cost h (v, u) are as follows:
H (v, u)=| xv+1-Av+1,ls|2
Wherein, xv+1Indicate that the v+1 of received vector x ties up element, Av+1,lIndicate the v+1 dimension of the l row of channel matrix A
Element, l ∈ { 1,2 ..., Nu}；S indicates the modulation symbol sent.
Beneficial effects of the present invention:
A-Star theory of algorithm is introduced into antenna detection by the present invention.A-Star algorithm not only considers a upper path
Cost also considers the estimated cost for not searching for subtree.Meanwhile The present invention reduces hardware access numbers, are very suitable to hardware reality
It is existing.The present invention is first sorted from large to small receiving antenna sequence by metric, then traverses each subtree, and this scheme is small by metric
Node be aligned to rear several layers of, wrong node can be excluded earlier, make selected branch includes optimal path as far as possible.The present invention
The method of proposition is while reducing complexity, moreover it is possible to guarantee the detection performance of A-Star algorithm near-optimization.
Detailed description of the invention
Fig. 1 is the SM system block diagram that the present invention uses；
Fig. 2 is tree search graph of the present invention before being ranked up；
Fig. 3 is the search tree graph after present invention sequence；
Fig. 4 is that the present invention and the prior art are using Nu=Nv=8, the complexity of computation complexity when modulation system is 64QAM
Spend comparison diagram；
Fig. 5 is that the present invention and the prior art are using Nu=Nv=16, computation complexity compares when modulation system is 32QAM
Figure；
Fig. 6 is that error bit ability of the present invention under using different modulating mode compares figure；
Fig. 7 indicates that the present invention is comparing figure using the error bit ability under more activation antennas.
Specific embodiment
In order to make the objectives, technical solutions, and advantages of the present invention clearer, below in conjunction with attached drawing to of the invention real
The technical solution applied in example is clearly and completely described, it is clear that described embodiment is only that present invention a part is implemented
Example, instead of all the embodiments.Based on the embodiments of the present invention, those of ordinary skill in the art are not making creativeness
Every other embodiment obtained, shall fall within the protection scope of the present invention under the premise of labour.
The invention will be further described with specific embodiment with reference to the accompanying drawing:
It is assumed that transmission antenna is NuRoot, receiving antenna NvRoot；Wherein,It is declined by quasi-static frequency-flat
The multiple antennas SM system that channel is communicated can be modeled as shown in Fig. 1, and the basic thought of SM is by information to be sent point
For two parts, a part is for selecting the serial number of activation transmission antenna, and another part is for selecting modulation symbol.M is modulation symbol
Number set in element size of population, activation transmission antenna carry log2 (Nu) a bit information, it is a that modulation symbol carries log2 (M)
Bit information, so transmission antenna can effectively transmit m=log2 (N every timeu)+log2 (M) a bit.luIndicate that activation is sent
The serial number of antenna, luAgree to l, i.e. lu∈{1,2,...,Nu, s indicates the modulation symbol sent, and s ∈ { s1,s2,…,sM}。
In flat slow fading, it is assumed that Nv×NuEach subchannel in the channel matrix A of dimension is mutually indepedent, and obeys
The multiple Gauss distribution that rayleigh distributed and mean value are zero, variance is 1；Assuming that w is the ideal additivity multiple Gauss on every receiving antenna
White noise, it is known that noise power spectral density, symbol energy 1, channel matrix is indicated with A, Nu× 1 dimension sends vectorAre as follows:
Nv× 1 dimension received vector x are as follows:
Formula (3) indicates maximum likelihood algorithm in SM system, xvIndicate that the v of x ties up element, al,vIndicate alV
Tie up element；| | | | indicate norm.
In the A-Star algorithm tree search that the present invention uses, the sequence of accessed node (destination node) (v, u) is by opening
Hairdo function k (u) is determined.Heuristic function k (u) can be divided into start node to target (v, u) node Actual path cost g (v,
U), the objective cost function h (v, u), i.e. k (u)=g (v, u)+h (v, u) of (v, u) and from start node to destination node.It connects
Receive antenna number NvIt indicating, the branch number in tree search is u, u ∈ { 1,2 ..., L }, in tree search graph 2, L=4, i.e. u ∈
{1,2,3,4}；Level number indicates with v, v ∈ { 1,2 ..., Nv}。
A-Star algorithm is applied to NvRoot receiving antenna and NuIn the spatial modulation system of root transmission antenna, convolution (3)
:
Qu=| xv-av,ls|2+Pv-1 (4)
P0=0 (5)
The cumulative path cost of start node (root node) and current node (v, u) is Pv, from formula (5) P0=0 starts, table
Up to formula (4) until P is arrived in accumulationvFinal path cost；Wherein, QuIndicate the cumulative cost value of u-th of branch；Pv-1Indicate v-1
The cumulative cost value of layer.Fig. 2 is 2 dual-mode antennas, using the SM system A-Star algorithm through the invention of QPSK modulation
Set search process figure.Four kinds of transmission vectors use four branching representations in figure, the part Euclidean distance of present node respectively
(abbreviation Euclidean distance) is indicated with the corresponding numerical value of the circle in search tree, and the root of search tree is A-Star algorithm start node.Pv
Equal to start node to (v, u) node Actual path cost g (v, u), h (v, u) is objective cost:
H (v, u)=| xv+1-Av+1,ls|2 (6)
A-Star algorithm combination Fig. 2 that the present invention uses executes following steps, detailed process since search tree first layer
It is as follows:
Step 1 is according to formula (5), P0It is initialized as 0.
Step 2 calculates the cumulative cost value of each test point in first layer according to formula (4), enables P1=g (1, u).
Step 3 can obtain h (1,1)=a, h (1,2)=b, h (1,3)=c, h (Isosorbide-5-Nitrae)=d by Fig. 2；It executes heuristic
Function k (u)=g (v, u)+h (v, u), then current queue k (u) is k (1)=a+i, k (2)=b+j, k (3)=c+k, k (4)=d
+l.Then current queue k (u) is k (1)=a+i, k (2)=b+j, k (3)=c+k, k (4)=d+l.
Step 4 therefrom judges the smallest value at this time, for example, at this time most by comparing k (1), k (2), k (3) and k (4)
Small value is k (2), if the corresponding objective cost value h of k (2) (v, 2) then shows the leaf section for being also less than search tree not equal to 0
Point, so needing to continue searching.
Step has determined first layer minimum node on Step 5, then searches to the next node of the second layer of minimum node
Rope, and update queue k (u)；But smallest point objective cost value at this time is not 0, so also needing to continue searching；If at this time most
The value of dot is 0, this branches into optimal path, terminates search.
Computational complexity of the invention is measured with real multiplications number of calculations in algorithmic procedure.Assuming that SM system uses M
Rank quadrature amplitude modulation mode, transmission antenna and receiving antenna are respectively NuRoot and NvRoot.ML algorithm may emit the sum of vector
It is NuM,Need 6NvSecondary reality multiplies, therefore the computation complexity C=6N of ML algorithmuMNv.A-Star algorithm calculates first layer
The g (1, u) and h (1, u) of node require 6 × Nu× M real multiplications；If the node of all numbers of plies is only in addition to first layer
It needs to consider h (v, u), multiplication number is 6 × Nu×M×(Nv-2)；In addition, because being not that can traverse all nodes, institute
With the 6 × N of complexity actually traversedu×M×(Nv- 2) it, therefore with traditional ML algorithm compares, computational complexity of the invention is more
It is low.Wherein the Euclidean distance of receiving antenna index it is expected ErIt is represented by following formula:
xvIndicate that the v of received vector x ties up element, al,vThe v dimension element of the l row of expression channel matrix A, v ∈ 1,
2,...,Nv, l ∈ { 1,2 ..., Nu}；S indicates the modulation symbol sent, sMIndicate m-th modulation symbol；M indicates modulation symbol
Number set in element sum；NvIndicate receiving antenna number；NuIndicate transmission antenna number.
Scheme proposed by the present invention is that layer sorting preprocessing process, SM system are increased on the basis of A-Star algorithm
Middle formula (7) is under multi-system digital phase modulation or M-ary Quadrature Amplitude modulation case, complexity C=2Nv.When each frame
When having mass data or channel slow fading, formula (7) can ignore computation complexity, therefore the detection algorithm complexity C proposed
≤2Nv+6NuM(Nv-2).Although inventive algorithm is added to layer sorting preprocessing process, NvSearch space reduce
, increased 2N in complexityvWith 6NuM(Nv- 2) it is inappreciable that reduction amount, which is compared, therefore accesses section needed for reducing
Points, complexity reduces compared with A-Star detection algorithm.
In order to further algorithm more proposed by the present invention and maximum likelihood algorithm (Maximum Likelihood,
ML), the computation complexity of TX_SD algorithm, RX_SD algorithm (two kinds of traditional spheroidals decoding detection algorithms) and A-Star algorithm, this
Invention calculates SM system in Nu=Nv=8, when modulation system is 64QAM and in Nu=Nv=16, when modulation system is 32QAM
The complexity of several algorithms of different, result difference are as shown in Figure 4 and Figure 5.
It can be seen that in SM system from Fig. 4 and Fig. 5, ML detection algorithm is all full search in all cases, institute
It is high with the computation complexity of ML algorithm.When modulation system is 64QAM, Nu=NvWhen=8, the computation complexity of inventive algorithm
About the 4% of ML algorithm computation complexity reduces close respectively compared with TX_SD algorithm, RX_SD algorithm and A-Star algorithm
55%, 42%, 20%.Comparison diagram 4 and Fig. 5 simulation result, when discovery receiving antenna quantity increases, algorithm proposed by the present invention is multiple
Miscellaneous degree significantly reduces.
This section emulates algorithm of the invention in the SM system under different parameters, and in simulations, channel model is equal
For rayleigh fading channel, noise is additive white Gaussian noise.The simulation system parameters of Fig. 6 are Nu=Nv=8,4QAM, 16QAM,
64QAM modulation.When using different modulation systems, the detection performance of system is significantly different, performance most preferably 4QAM, performance
That worst is 64QAM.The system parameter 16QAM modulation of Fig. 7 emulation and Nu=Nv=8,16 and 32.Simulation result shows with day
The increase of line number, algorithm proposed by the present invention can obtain the performance of near-optimization, while show the increase with antenna number, be
Performance of uniting is also better.
Simulation result shows the increase with antenna number, and algorithm proposed by the present invention can obtain the performance of near-optimization,
Show the increase with antenna number simultaneously, system performance is also better.
Those of ordinary skill in the art will appreciate that all or part of the steps in the various methods of above-described embodiment is can
It is completed with instructing relevant hardware by program, which can be stored in a computer readable storage medium, storage
Medium may include: ROM, RAM, disk or CD etc..
Embodiment provided above has carried out further detailed description, institute to the object, technical solutions and advantages of the present invention
It should be understood that embodiment provided above is only the preferred embodiment of the present invention, be not intended to limit the invention, it is all
Any modification, equivalent substitution, improvement and etc. made for the present invention, should be included in the present invention within the spirit and principles in the present invention
Protection scope within.
Claims (7)
1. a kind of receiving antenna optimal path finding method based on A-Star algorithm, it is characterised in that the following steps are included:
S1, the Euclidean distance expectation for calculating receiving antenna index sequence, it is expected according to the Euclidean distance to receiving antenna rope
Introduce the arrangement of row descending；
S2, the receiving antenna index sequence after sequence to should be used as search number of plies sequence, determine search tree；
S3, vector is sent with the branching representation of search tree, the root of search tree is A-Star algorithm start node, to connecing after sequence
It receives antenna index sequence and carries out tree search, find the optimal path of receiving antenna.
2. a kind of receiving antenna optimal path finding method based on A-Star algorithm according to claim 1, feature
It is, the Euclidean distance it is expected ErCalculation are as follows:
Wherein, xvIndicate that the v of received vector x ties up element, al,vThe v dimension element of the l row of expression channel matrix A, v ∈ 1,
2,...,Nv, l ∈ { 1,2 ..., Nu}；S indicates the modulation symbol sent, sMIndicate m-th modulation symbol；M indicates modulation symbol
Number set in element sum；NvIndicate receiving antenna number；NuIndicate transmission antenna number.
3. a kind of receiving antenna optimal path finding method based on A-Star algorithm according to claim 1, feature
It is, the step S2 includes from big to small according to Euclidean distance desired value, by corresponding NvRoot receiving antenna is arranged successively
At NvLayer, and in L branch of every layer of composition；To form search tree；Wherein, NvIndicate that receiving antenna number, L indicate in tree search
Branch's number.
4. a kind of receiving antenna optimal path finding method based on A-Star algorithm according to claim 3, feature
It is, the step S3 includes respectively indicating L transmission vector with L branch of search tree, successively calculates the 1st to v layers
Cumulative cost value, determine every layer of the smallest node of heuristic function value；Most with heuristic function value in the 1 to v layers
Small node is formed by optimal path of the branch as v root receiving antenna；v∈{1,2,...,Nv, NvIndicate receiving antenna
Number.
5. a kind of receiving antenna optimal path finding method based on A-Star algorithm according to claim 4, feature
It is, the calculation of the cumulative cost value are as follows:
Qu=| xv-av,ls|2+Pv-1
Wherein, QuIndicate the cumulative cost value of u-th of branch, xvIndicate that the v of received vector x ties up element, al,vIndicate channel square
The v of the l row of battle array A ties up element, l ∈ { 1,2 ..., Nu}；NuIndicate transmission antenna number；S indicates the modulation symbol sent；
Pv-1Indicate v-1 layers of cumulative cost value.
6. a kind of receiving antenna optimal path finding method based on A-Star algorithm according to claim 4, feature
It is, the calculation method of the heuristic function value are as follows:
K (u)=g (v, u)+h (v, u)
Wherein, g (v, u) indicate start node arrive destination node (v, u) Actual path cost, h (v, u) expression start node arrive
The destination path cost of destination node (v, u)；u∈{1,2,...,L}.
7. a kind of receiving antenna optimal path finding method based on A-Star algorithm according to claim 6, feature
It is, the calculation formula of destination path cost h (v, u) are as follows:
H (v, u)=| xv+1-Av+1,ls|2
Wherein, xv+1Indicate that the v+1 of received vector x ties up element, Av+1,lIndicate that the v+1 of the l row of channel matrix A ties up element,
l∈{1,2,...,Nu}；S indicates the modulation symbol sent.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811328935.7A CN109167624A (en) | 2018-11-09 | 2018-11-09 | A kind of receiving antenna optimal path finding method based on A-Star algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811328935.7A CN109167624A (en) | 2018-11-09 | 2018-11-09 | A kind of receiving antenna optimal path finding method based on A-Star algorithm |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109167624A true CN109167624A (en) | 2019-01-08 |
Family
ID=64875950
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811328935.7A Pending CN109167624A (en) | 2018-11-09 | 2018-11-09 | A kind of receiving antenna optimal path finding method based on A-Star algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109167624A (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105553900A (en) * | 2015-12-23 | 2016-05-04 | 哈尔滨工业大学 | Spherical decoding method of spatial modulation signal |
| CN105758410A (en) * | 2015-11-14 | 2016-07-13 | 大连东软信息学院 | Method for quickly planning and mixing paths on basis of A-star algorithms |
| CN106850475A (en) * | 2017-02-13 | 2017-06-13 | 重庆邮电大学 | A kind of low complex degree sequence A* detection algorithms for being applied to spatial modulation |
| US20180309481A1 (en) * | 2017-04-21 | 2018-10-25 | National Taiwan University | Methods of beam-indexed spatial modulation |
-
2018
- 2018-11-09 CN CN201811328935.7A patent/CN109167624A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105758410A (en) * | 2015-11-14 | 2016-07-13 | 大连东软信息学院 | Method for quickly planning and mixing paths on basis of A-star algorithms |
| CN105553900A (en) * | 2015-12-23 | 2016-05-04 | 哈尔滨工业大学 | Spherical decoding method of spatial modulation signal |
| CN106850475A (en) * | 2017-02-13 | 2017-06-13 | 重庆邮电大学 | A kind of low complex degree sequence A* detection algorithms for being applied to spatial modulation |
| US20180309481A1 (en) * | 2017-04-21 | 2018-10-25 | National Taiwan University | Methods of beam-indexed spatial modulation |
Non-Patent Citations (4)
| Title |
|---|
| YUE SUN等: "Heuristic antenna combination selection in generalised spatial modulation", 《2016 INTERNATIONAL WIRELESS COMMUNICATIONS AND MOBILE COMPUTING CONFERENCE (IWCMC)》 * |
| 张德民等: "应用于空间调制的低复杂度A*检测算法", 《电讯技术》 * |
| 张胜: "一种基于状态空间的启发式搜索算法及其实现", 《现代电子技术》 * |
| 王奔等: "空间调制信号的低复杂度球形译码算法", 《哈尔滨工业大学学报》 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109617584A (en) | A kind of mimo system beamforming matrix design method based on deep learning | |
| Zhao et al. | Cognitive radio engine design based on ant colony optimization | |
| CN102007737B (en) | Radius adaptive sphere decoding with probabilistic noise constraint | |
| CN101662342B (en) | Multi-input multi-output signal detection method and device | |
| Shabany et al. | The application of lattice-reduction to the K-best algorithm for near-optimal MIMO detection | |
| CN103532889B (en) | A kind of parallel storehouse MIMO signal detection method of soft output | |
| CN110233653A (en) | Blind multipath recognition methods and system based on the mimo system for weighting integrated clustering algorithm | |
| CN107241167A (en) | A kind of improved method detected based on extensive mimo system BP | |
| CN108833060A (en) | A kind of extensive mimo system detection method based on EP-NSA algorithm | |
| CN107070525A (en) | Parametrization order is decoded | |
| CN102546519B (en) | Method for defining a search sequence for soft-decision sphere decoding algorithm | |
| CN106231665B (en) | Resource allocation methods based on the switching of RRH dynamic mode in number energy integrated network | |
| CN103188703A (en) | Survival constellation point choosing method and QRM-maximum likehood detection (QRM-MLD) signal detection method | |
| CN103581103B (en) | It is applicable to the soft de-mapped method of APSK constellation | |
| CN109981151A (en) | Improved Gauss tree approximation message transmission detection algorithm in extensive mimo system | |
| CN102100043A (en) | Mimo symbol detection using QR factorisation with node grouping and real valued decomposition | |
| CN108809881A (en) | One kind being based on improved EXP3 algorithms adaptive ofdm communication method under water | |
| US20140056391A1 (en) | Orthotope sphere decoding method and apparatus for signal reconstruction in multi-input multi-output antenna system | |
| CN110213194B (en) | Low-complexity space modulation bit mapping method | |
| CN109167624A (en) | A kind of receiving antenna optimal path finding method based on A-Star algorithm | |
| CN103595454B (en) | Utilize the MIMO multiple access wireless communication methods of statistical channel status information | |
| CN109412670A (en) | Low complex degree detection method in GSM-MBM system based on relaxative iteration | |
| Wu et al. | Direct transmit antenna selection for transmit optimized spatial modulation | |
| CN107342802A (en) | Random antenna system of selection, device and extensive mimo system | |
| CN106452625B (en) | Multiple target green cognitive radio system parameter generation method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190108 |
|
| RJ01 | Rejection of invention patent application after publication |