CN106656406B - Signal detecting method and device in a kind of access of non-orthogonal multiple - Google Patents
Signal detecting method and device in a kind of access of non-orthogonal multiple Download PDFInfo
- Publication number
- CN106656406B CN106656406B CN201510717769.XA CN201510717769A CN106656406B CN 106656406 B CN106656406 B CN 106656406B CN 201510717769 A CN201510717769 A CN 201510717769A CN 106656406 B CN106656406 B CN 106656406B
- Authority
- CN
- China
- Prior art keywords
- node
- user
- message
- channel
- user node
- 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.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
Abstract
The invention discloses signal detecting method and devices in a kind of access of non-orthogonal multiple, to reduce the complexity of signal detection in non-orthogonal multiple access.This method are as follows: determine that Signal to Interference plus Noise Ratio is greater than the user node of threshold value, determining user node is formed into first set, one or more all user nodes of channel node will be multiplexed and form second set；Determine that each channel node sends the message of each user node in first set to by preceding L iterative process, wherein L is greater than 1 and is less than N, and N is positive integer；It determines that each channel node sends the message of each user node in first set to according to preceding L iterative process, determines that each channel node sends the message of each of described second set user node to by the L+1 times to iv-th iteration process；It sends the message of each of described second set user node to according to each channel node, detects each corresponding data-signal of user node.
Description
Technical field
The present invention relates to signal detecting methods in non-orthogonal multiple technical field more particularly to a kind of access of non-orthogonal multiple
And device.
Background technique
With the fast development of wireless communication, number of users and portfolio are in explosive growth, this system to wireless network
Capacity is constantly put forward higher requirements.Industry research prediction, annual mobile data services flow are increased with double speed, are arrived
The year two thousand twenty whole world will have about 50,000,000,000 terminals to access mobile radio network.Volatile user increases so that multiple access technique
Central issue as network upgrade.Multiple access technique determines the basic capacity of network, and to system complexity and portion
Administration's cost has and greatly influences.
Traditional mobile communication (1G-4G) uses orthogonal multiple access technique, and such as frequency division multiple access, time division multiple acess, code divides more
Location, orthogonal frequency division multiplexing multiple access.From the perspective of multi-user information theory, traditional orthogonal manner can only achieve multi-user's appearance
The interior boundary for measuring boundary, causes wireless resource utility efficiency relatively low.
Pattern divides non-orthogonal multiple access (Pattern Division Multiple Access, PDMA) referred to as figure point
Multiple access is a kind of non-orthogonal multiple access technology, is based on multi-user comm global optimization, by transmitting terminal and receiving end
The technology of Combined Treatment.In transmitting terminal, user is distinguished based on the non-orthogonal feature pattern of multiple signal domains；In receiving end, base
In the feature structure of user's pattern, (SIC, Successive interference is deleted using serial interference
Cancellation) mode realizes Multiuser Detection, to accomplish multi-user in the further of existing time-frequency wireless resource
Multiplexing can only achieve the interior boundary of multi-user's capacity circle to solve to exist in the prior art orthogonal manner, cause radio resource sharp
With the relatively low problem of rate.
The key of PDMA technology is the configurations of transmitting terminal and the serial interference deletion algorithm of receiving end.For sending
The configurations at end can distinguish multi-user by coding mode, be that different user obtains reasonable inconsistent diversity
Degree guarantees that the realization of multiuser multiplexing is simple and efficient.Receiving end generallys use belief propagation detection (Belief
Propagation, BP) or iterative decoding of the same clan detection (Iterative Detection and Decoding, IDD) into
Row detection, to obtain more preferable performance.
Below by taking PDMA is using unit multiplexed 6 users of 3 running time-frequency resources as an example, receiving end is explained in detail using BP/IDD
Carry out the process of multiple subscriber signal detections.
The PDMA pattern matrix that system uses is shown in formula (1):
It is as shown in Figure 1 multiple user signals factor graph, the detection process of receiving end is mainly user's section on factor graph
Message and update message are constantly mutually transmitted between point and channel node, i.e., the use of the detection process of BP or IDD algorithm are one
Iterative detection process, the message processing procedure of user node is as shown in Fig. 2, channel during an iteration during an iteration
The message processing procedure of node is as shown in Figure 3.
It is defined as follows: { ui, i=1 ..., 6, represent the set of user node；{chj, j=1 ..., 3, represent time-frequency money
The set of source unit, running time-frequency resource unit are also referred to as channel node；duDegree for the degree of user node, user node refers to
The running time-frequency resource unit number that the user node uses；dcDegree for the degree of channel node, channel node refers to while using
The user node number of the channel node；ΓiIt indicates and user node uiThe set of connected all channel nodes；ΦjIt indicates and believes
Road node chjThe set of connected all user nodes；AMFor the signal set for the M contrast that each user node is sent, the collection
It amounts to including 2MA constellation point.
It is soft metric (soft values) that message is defined in BP or IDD algorithm, indicates connection user node and channel
Reliability in each edge of node is generally defined using log-likelihood ratio (likelihood Rate, LLR).It indicates
The user node u in the l times iterationiSend channel node ch tojMessage；Indicate the channel node in the l times iteration
chjSend user node u toiMessage；yjIndicate the reception signal of receiving end, xiIndicate user node uiModulated signal,
hjIndicate channel node chjChannel response, njTo obeyMultiple Gauss variable.
It receives signal modeling and is represented by formula (2):
In the l times iteration, in detection and channel node chjConnected user node uiData-signal when, with the channel
Node chjConnected remaining user node uk(k∈Φj, k ≠ i) send signal xkReferred to as interference signal.Therefore channel section
Point chjInput messageInclude all interference signal xk(k∈Φj, k ≠ i) the sum of prior information, due to interference signal
xk(k∈Φj, k ≠ i) prior information can pass through (l-1) secondary iterationIt calculates, further analysis can obtainWithRelationship be expressed as formula (3):
In the l times iteration, channel node chjIt needs according in addition to target user's node uiExcept user node it is defeated
Enter messageTarget user's node u need to be passed to by calculatingiMessageWherein,
Contain signal x after modulatingiIn m-th of bit bi,mLog-likelihood ratio (LLR) value, be denoted as formula (4):
According to maximum posteriori criterion (MAP), the b based on BP algorithmi,mLog-likelihood ratioCalculating
As shown in formula (5):
Wherein, p (yj|hj,xi,xk) indicating channel condition transitional provavility density, it is assumed that interchannel noise n is to obey multiple Gauss
The noise vector of distribution, it is available wherein, " ∝ " expression is " just
Than in "；
Formula (6) can be obtained using Max-Log-MAP approximate algorithm to formula (5):
In formula (6),It indicates and channel node chjCorresponding user's section
Point set ΦjThe d for includingcThe column vector of whole modulation symbols composition of a user node, xi=s indicates user node uiTune
Symbol processed chooses s, xi=s0Indicate user node uiModulation symbol choose s0, the corresponding modulation symbol of any bit sequence of s expression
Number, s0Indicate the corresponding modulation symbol of full 0 bit sequence,Indicate dcThe signal set of a M contrast
Union, σ2Indicate noise njPerformance number.
In conclusion the general processing step of BP algorithm is as follows:
Step1: initializationGiven maximum iteration maxiter N, into Step2；
Step2: judging whether the number of iterations l is greater than maximum number of iterations N, if it is not greater, enabling l=l+1, enters
Otherwise Step3 enters Step5；
Step3: it is calculated using formula (3)Into Step4；
Step4: it is calculated using formula (5) or formula (6)Into Step2；
Step5: formula is utilizedCalculate user node uiPosterior probability, and be sent to hard decision
Device or soft decoder.
According to formula (6) as can be seen that due to AMIt altogether include 2MA constellation point,Candidate constellation figure vector value
Number isWhen therefore, using BP algorithm, the complexity of channel node output message is calculated with order of modulation M and channel
Node degree dcIncrease exponentially increase, i.e.,When increase channel node is spent, which will become non-
Chang Gao.
Summary of the invention
The embodiment of the present invention provides signal detecting method and device in a kind of access of non-orthogonal multiple, nonopiate to reduce
The complexity of signal detection in multiple access access.
Specific technical solution provided in an embodiment of the present invention is as follows:
In a first aspect, providing signal detecting method in a kind of access of non-orthogonal multiple, comprising:
Determine the Signal to Interference plus Noise Ratio for being multiplexed each user node of one or more channel nodes；
The Signal to Interference plus Noise Ratio of each user node is compared with threshold value respectively, determines that the Signal to Interference plus Noise Ratio is greater than institute
Determining user node is formed first set, will be multiplexed one or more of channel node institutes by the user node for stating threshold value
Second set is formed by the user node；
According to each of each channel node and the first set user node, repeatedly by first L times
Determine that each channel node sends the message of each of described first set user node to for process, wherein L
Greater than 1 and it is less than N, N is positive integer；
According to each of each channel node and the second set user node, and according to L times first
Iterative process determines that each channel node sends the message of each of described first set user node to, passes through
Determine that each channel node sends each of described second set user to iv-th iteration process the L+1 times
The message of node；
It sends the message of each of described second set user node to according to each channel node, detects
Each corresponding data-signal of the user node.
Preferably, an iteration process in the preceding L iterative process are as follows:
If it is determined that current iteration number is not more than L, passed according to each of the last iterative process acquisition channel node
The message for giving each of described first set user node determines the first set that current iteration process obtains
Each of the user node be respectively transmitted to the message of each channel node；
Respectively for each of the first set user node, saved the user node as target user
Point, according to each of in addition to target user's node the user node be transferred to disappearing for each channel node respectively
Breath determines that each of the current iteration process acquisition channel node sends the message of target user's node to；
Current iteration number is updated using preset step-length.
Preferably, each iterative process in the preceding L iterative process includes:
For the user node for including in the second set and not including in the first set, each institute is determined
Stating channel node and sending the message of the user node to is initial value.
Preferably, an iteration process during the L+1 times to iv-th iteration are as follows:
If it is determined that current iteration number is not less than L+1 and is not more than N, it is according to each of last iterative process acquisition
Channel node sends the message of each of described second set user node to, determines the institute that current iteration process obtains
Each of second set user node is stated to be respectively transmitted to the message of each channel node；
Respectively for each of the second set user node, saved the user node as target user
Point, according to each of in addition to target user's node the user node be transferred to disappearing for each channel node respectively
Breath determines that each of the current iteration process acquisition channel node sends the message of target user's node to；
Current iteration number is updated using preset step-length.
Preferably, the L is preset integer, the N is preset positive integer, and the L and the N are respectively according to system
Performance and computation complexity determine.
Second aspect provides signal supervisory instrument in a kind of access of non-orthogonal multiple, comprising:
First processing module, for determining the Signal to Interference plus Noise Ratio for being multiplexed each user node of one or more channel nodes；
Second processing module is determined for being respectively compared the Signal to Interference plus Noise Ratio of each user node with threshold value
The Signal to Interference plus Noise Ratio is greater than the user node of the threshold value, and determining user node is formed first set, will be multiplexed described one
A or multiple all user nodes of channel node form second set；
Third processing module, for according to each of each channel node and the first set user
Node determines that each channel node sends each of described first set user to by preceding L iterative process
The message of node, wherein L is greater than 1 and is less than N, and N is positive integer；
Fourth processing module, for being saved according to each of each channel node and the second set user
Point, and determine that each channel node sends each of described first set use to according to preceding L iterative process
The message of family node determines that each channel node sends the second set to by the L+1 times to iv-th iteration process
Each of the user node message；
5th processing module, for sending each of described second set use to according to each channel node
The message of family node detects each corresponding data-signal of user node.
Preferably, the third processing module is specifically used for:
An iteration process in the preceding L iterative process are as follows:
If it is determined that current iteration number is not more than L, passed according to each of the last iterative process acquisition channel node
The message for giving each of described first set user node determines the first set that current iteration process obtains
Each of the user node be respectively transmitted to the message of each channel node；
Respectively for each of the first set user node, saved the user node as target user
Point, according to each of in addition to target user's node the user node be transferred to disappearing for each channel node respectively
Breath determines that each of the current iteration process acquisition channel node sends the message of target user's node to；
Current iteration number is updated using preset step-length.
Preferably, the third processing module is specifically used for:
In each iterative process in the preceding L iterative process, for including in the second set and described
The user node not included in one set, the message for determining that each channel node sends the user node to is first
Initial value.
Preferably, the fourth processing module is specifically used for:
An iteration process during the L+1 times to iv-th iteration are as follows:
If it is determined that current iteration number is not less than L+1 and is not more than N, it is according to each of last iterative process acquisition
Channel node sends the message of each of described second set user node to, determines the institute that current iteration process obtains
Each of second set user node is stated to be respectively transmitted to the message of each channel node；
Respectively for each of the second set user node, saved the user node as target user
Point, according to each of in addition to target user's node the user node be transferred to disappearing for each channel node respectively
Breath determines that each of the current iteration process acquisition channel node sends the message of target user's node to；
Current iteration number is updated using preset step-length.
Preferably, the L is preset integer, the N is preset positive integer, and the L and the N are respectively according to system
Performance and computation complexity determine.
The third aspect provides a kind of equipment, including including processor and memory, wherein preserves in memory pre-
If program, processor read memory in program, according to the program execute following procedure:
Determine the Signal to Interference plus Noise Ratio for being multiplexed each user node of one or more channel nodes；
The Signal to Interference plus Noise Ratio of each user node is compared with threshold value respectively, determines that the Signal to Interference plus Noise Ratio is greater than institute
Determining user node is formed first set, will be multiplexed one or more of channel node institutes by the user node for stating threshold value
Second set is formed by the user node；
According to each of each channel node and the first set user node, repeatedly by first L times
Determine that each channel node sends the message of each of described first set user node to for process, wherein L
Greater than 1 and it is less than N, N is positive integer；
According to each of each channel node and the second set user node, and according to L times first
Iterative process determines that each channel node sends the message of each of described first set user node to, passes through
Determine that each channel node sends each of described second set user to iv-th iteration process the L+1 times
The message of node；
It sends the message of each of described second set user node to according to each channel node, detects
Each corresponding data-signal of the user node.
Preferably, an iteration process of the processor in the preceding L iterative process are as follows:
If it is determined that current iteration number is not more than L, passed according to each of the last iterative process acquisition channel node
The message for giving each of described first set user node determines the first set that current iteration process obtains
Each of the user node be respectively transmitted to the message of each channel node；
Respectively for each of the first set user node, saved the user node as target user
Point, according to each of in addition to target user's node the user node be transferred to disappearing for each channel node respectively
Breath determines that each of the current iteration process acquisition channel node sends the message of target user's node to；
Current iteration number is updated using preset step-length.
Preferably, processor is in each iterative process in the preceding L iterative process, in the second set
The user node for including and not including in the first set determines that each channel node sends user's section to
The message of point is initial value.
Preferably, an iteration process of processor during the L+1 times to iv-th iteration are as follows:
If it is determined that current iteration number is not less than L+1 and is not more than N, it is according to each of last iterative process acquisition
Channel node sends the message of each of described second set user node to, determines the institute that current iteration process obtains
Each of second set user node is stated to be respectively transmitted to the message of each channel node；
Respectively for each of the second set user node, saved the user node as target user
Point, according to each of in addition to target user's node the user node be transferred to disappearing for each channel node respectively
Breath determines that each of the current iteration process acquisition channel node sends the message of target user's node to；
Current iteration number is updated using preset step-length.
Preferably, the L is preset integer, the N is preset positive integer, and the L and the N are respectively according to system
Performance and computation complexity determine.
Based on the above-mentioned technical proposal, in the embodiment of the present invention, according to the Signal to Interference plus Noise Ratio of each user node from multipling channel
Select the user node of high Signal to Interference plus Noise Ratio as first set in multiple user nodes of node, in preceding L iterative process only
Processing is iterated to the user node in first set, i.e., determines that each channel node is sent to by preceding L iterative process
The message of each user node in first set, to reduce the complexity of signal detection in non-orthogonal multiple access.
Detailed description of the invention
Fig. 1 is multiple user signals factor graph；
Fig. 2 is the message processing procedure schematic diagram of user node during an iteration；
Fig. 3 is the message processing procedure schematic diagram of channel node during an iteration；
Fig. 4 is the method flow schematic diagram of signal detection in non-orthogonal multiple access in the embodiment of the present invention；
Fig. 5 is the factor graph distinguished in the embodiment of the present invention by Signal to Interference plus Noise Ratio；
Fig. 6 is another factor graph distinguished by Signal to Interference plus Noise Ratio in the embodiment of the present invention；
Fig. 7 be the embodiment of the present invention in non-orthogonal multiple access in signal supervisory instrument structural schematic diagram；
Fig. 8 is device structure schematic diagram in the embodiment of the present invention.
Specific embodiment
To make the objectives, technical solutions, and advantages of the present invention clearer, below in conjunction with attached drawing to the present invention make into
It is described in detail to one step, it is clear that described embodiments are only a part of the embodiments of the present invention, rather than whole implementation
Example.Based on the embodiments of the present invention, obtained by those of ordinary skill in the art without making creative efforts
All other embodiment, shall fall within the protection scope of the present invention.
It is found by analysis, in existing non-orthogonal multiple access in multi signal detection algorithm, such as BP algorithm or IDD are calculated
Method calculates the complexity of channel node output message with order of modulation M and channel node degree dcIncrease exponentially increase
Long reason essentially consists in: to all interference signal xk(k∈Φj, k ≠ i) possibility combination traversed.
Based on this, the method that the present invention reduces the complexity of signal detection in non-orthogonal multiple access is main are as follows: only to portion
L iterative process is iterated detection to all user nodes, passes through after L iterative process before dividing user node to carry out
Iterative process selectively is participated in using user node, reaches the complexity for reducing signal detection, and keep systematicness as far as possible
The purpose of energy.
In following embodiment, message is soft metric, indicates to connect in each edge of user node and channel node
Reliability.
The method of signal detection can be applied to uplink signal in the access of non-orthogonal multiple provided by the embodiment of the present invention
In detection, also it can be applied in downlink signal detection.
In the embodiment of the present invention, as shown in figure 4, the method detailed process of signal detection is as follows in non-orthogonal multiple access:
Step 401: determining the Signal to Interference plus Noise Ratio for being multiplexed each user node of one or more channel nodes.
Specifically, the orthogonal pilot signals of each user, determination are multiplexed one or more channel nodes based on the received
The Signal to Interference plus Noise Ratio of each user node.Such as: channel estimation is carried out for the pilot signal of certain user node, and according to channel
Estimated value calculates channel estimation power, and calculates interference noise power according to interference noise, then calculates the letter of pilot signal
The ratio of power and interference noise power is estimated in road, obtains the Signal to Interference plus Noise Ratio of the user node.
Step 402: the Signal to Interference plus Noise Ratio of each user node being compared with threshold value respectively, determines that Signal to Interference plus Noise Ratio is greater than and is somebody's turn to do
Determining user node is formed first set by the user node of threshold value, and it is useful will to be multiplexed the one or more channel node institute
Family node forms second set.
Wherein, Signal to Interference plus Noise Ratio is Signal to Interference plus Noise Ratio (Signal to Interference plus Noise
Ratio, SINR), refer to the ratio of the intensity of the useful signal received and the intensity of the interference signal received, interference signal
Including noise and interference.
In implementation, which is preset value, specifically can be and is determined by simulation calculation, is also possible to empirical value.
Step 403: according to each user node in each channel node and first set, passing through preceding L iteration mistake
Journey determines that each channel node sends the message of each user node in first set to, and wherein L is greater than 1 and is less than N, and N is
Positive integer.
Preferably, L is preset integer, N is preset positive integer, and L and N are respectively according to system performance and computation complexity
It determines.Wherein, L value is bigger, and computation complexity reduction is bigger, and the determination principle of L is in the case where not influencing system performance
The larger value is chosen as far as possible.
Preferably, an iteration process in preceding L iterative process are as follows:
If it is determined that current iteration number is not more than L, sent to according to each channel node that last iterative process obtains
The message of each user node in first set determines each user node in the first set of current iteration process acquisition
It is respectively transmitted to the message of each channel node；
Carry out following procedure for each user node in first set respectively: the user node is saved as target user
Point, according to each of in addition to target user's node the user node be transferred to the message of each channel node respectively, really
The each channel node for determining the acquisition of current iteration process sends the message of target user's node to, that is, determines current iteration process
The each channel node obtained sends the message of the user node to；
Current iteration number is updated using preset step-length.
The iterative process is repeated until current iteration number is greater than L.
Wherein, preset step-length is traditionally arranged to be 1, is also not excluded for setting preset step-length to the feelings of other numerical value in implementation
Condition.
Preferably, each iterative process in preceding L iterative process, for include in second set and in first set not
The user node for including, the message for determining that each channel node sends the user node to is initial value.That is the L times iterative process
Later, for the user node for including in second set and not including in first set, each channel node passes to the user
The message of node is the initial value before the 1st iterative process executes.
Step 404: according to each user node in each channel node and second set, and according to preceding L iteration
Process determines that each channel node sends the message of each user node in first set to, is changed by the L+1 times to n-th
Determine that each channel node sends the message of each user node in second set to for process.
Specifically, an iteration process during the L+1 times to iv-th iteration are as follows:
If it is determined that current iteration number is not less than L+1 and is not more than N, each channel obtained according to last iterative process
Node sends the message of each user node in second set to, determines every in the second set of current iteration process acquisition
A user node is respectively transmitted to the message of each channel node；
Following procedure is executed for each user node in second set respectively: using the user node as target user
Node is transferred to the message of each channel node according to each user node in addition to target user's node respectively, determines
Each channel node that current iteration process obtains sends the message of target user's node to；
Current iteration number is updated using preset step-length.
The iterative process is repeated until current iteration number is greater than N.
Wherein, preset step-length is traditionally arranged to be 1, is also not excluded for setting preset step-length to the feelings of other numerical value in implementation
Condition.
Step 405: sending the message of each user node in second set to according to each channel node, detection is each
The corresponding data-signal of user node.
Preferably, passing to the user according to each channel node for any one user node in second set
The message of node calculates the posterior probability of the user node, and the posterior probability of the user node is sent to hard decision device or soft translated
Code device obtains the corresponding data-signal of the user node.
The detailed process of signal detection provided in an embodiment of the present invention can be described as following process:
Step 1, receiver initializationAndWhereinIt indicates in the 0th iteration
User node uiSend channel node ch tojMessage,Indicate the channel node ch in the 0th iterationjSend user to
Node uiMessage, obtain preset maximum number of iterations N and preset the number of iterations early period L, wherein L < N, and will currently change
Generation number l is initialized as zero.
Step 2, receiver calculate the Signal to Interference plus Noise Ratio of each user node according to signal is received, according to Signal to Interference plus Noise Ratio by each use
Family node division is high Signal to Interference plus Noise Ratio user set and low Signal to Interference plus Noise Ratio user set, wherein in high Signal to Interference plus Noise Ratio user set
The Signal to Interference plus Noise Ratio for the user node for including is greater than preset threshold, is expressed as i ∈ { SINRH}；It is wrapped in low Signal to Interference plus Noise Ratio user set
The Signal to Interference plus Noise Ratio of the user node contained is not more than the preset threshold, is expressed as i ∈ { SINRL}。
Step 3, receiver judge whether current iteration number l is greater than the number of iterations L early period and enables l=l+ if being not more than
1, step 4 is executed, otherwise, executes step 6；
Step 4 is utilized respectively each user node when formula (7) calculate the l times iteration and passes to each channel node
Message executes step 5, wherein user node uiSend channel node ch tojMessageIt indicates are as follows:
Wherein,Indicate channel node ch when the l-1 times iterationnSend user node u toiMessage, n table
Show the index of channel node, the value of n is n ∈ Γi, n ≠ j, ΓiIt indicates and user node uiConnected all channel nodes
Set.
Step 5 is gathered using high Signal to Interference plus Noise Ratio user and carries out the l times iterative detection, is counted according to formula (8) or formula (9)
It calculatesThat is channel node ch when the l times iterationjSend user node u toiMessage, turn go execute step 3, specifically
Formula (8) indicates are as follows:
Wherein,Indicate the channel node ch in the l times iterationjPass to user node uiAbout xiIn
M-th of bit bi,mLLR ratio, xiIndicate user node uiModulated signal, AMIt is sent for each user node
The signal set of M contrast, yjIndicate that receiver passes through channel node chjReception signal, xkIndicate user node ukAfter modulation
Signal, the value range of k is k ∈ Φj, k ≠ i, ΦjIt indicates and channel node chjThe set of connected all user nodes, p
(yj|hj,xi,xk) indicating channel condition transitional provavility density, it is assumed that interchannel noise n is the noise vector for obeying multiple Gauss distribution,
It is availableWherein, " ∝ " expression " being proportional to "；X when first time iterationiAnd xkRespectively send planisphere AMIn any one
Point.
Specifically, formula (9) indicates are as follows:
Wherein,Indicate the channel node ch in the l times iterationjPass to user node uiAbout xiIn
M-th of bit bi,mLLR ratio, xiIndicate user node uiModulated signal,It indicates and channel node chjCorresponding user node set ΦjThe d for includingcIt is a
The column vector of whole modulation symbols composition of user node, xi=s0Indicate user node uiModulation symbol choose s0, s expression
The corresponding modulation symbol of any bit sequence, s0Indicate the corresponding modulation symbol of full 0 bit sequence, dcFor the degree of channel node,
The degree of channel node refers to while using the user node number of the channel node, hjIndicate channel node chjChannel response,
xkIndicate user node ukModulated signal, the value range of k are k ∈ Φj, k ≠ i, ΦjIt indicates and channel node chjIt is connected
All user nodes set,Indicate dcThe union of the signal set of a M contrast, σ2Table
Show noise njPerformance number.
Step 6, judges whether current iteration number l is greater than maximum number of iterations N, if it is not greater, enabling l=l+1, holds
Row step 7, otherwise executes step 9；
Step 7, each user node passes to the message of each channel node when formula (7) calculates the l times iteration, holds
Row step 8；
Step 8 carries out the l times iterative detection using all user nodes of multiplexing time-frequency resource, that is, utilizes formula (10)
Or formula (11) calculatesThat is channel node ch when the l times iterationjSend user node u toiMessage, turn go to execute step
Rapid six.Specifically, formula (10) indicates are as follows:
Wherein, the channel node ch in the l times iteration is indicatedjPass to user node uiAbout xiIn
M-th of bit bi,mLLR ratio, xiIndicate user node uiModulated signal, AMIt is sent for each user node
The signal set of M contrast, yjIndicate that receiver passes through channel node chjReception signal, xkIndicate user node ukAfter modulation
Signal, the value range of k is k ∈ Φj, k ≠ i, ΦjIt indicates and channel node chjThe set of connected all user nodes, p
(yj|hj,xi,xk) indicating channel condition transitional provavility density, it is assumed that interchannel noise n is the noise vector for obeying multiple Gauss distribution,
It is available wherein, " ∝ " expression " being proportional to "；
Specifically, formula (11) indicates are as follows:
Wherein,Indicate the channel node ch in the l times iterationjPass to user node uiAbout xiIn
M-th of bit bi,mLLR ratio, xiIndicate user node uiModulated signal,It indicates and channel node chjCorresponding user node set ΦjThe d for includingcIt is a
The column vector of whole modulation symbols composition of user node, xi=s0Indicate user node uiModulation symbol choose s0, s expression
The corresponding modulation symbol of any bit sequence, s0Indicate the corresponding modulation symbol of full 0 bit sequence, dcFor the degree of channel node,
The degree of channel node refers to while using the user node number of the channel node, hjIndicate channel node chjChannel response,
xkIndicate user node ukModulated signal, the value range of k are k ∈ Φj, k ≠ i, ΦjIt indicates and channel node chjIt is connected
All user nodes set,Indicate dcThe union of the signal set of a M contrast, σ2Expression is made an uproar
Sound njPerformance number.
Step 9 calculates user node u using formula (12)iModulated signal xiPosterior probability, and it is the posteriority is general
Rate send the user node u that the hard decision device or soft decoder output are obtained to hard decision device or soft decoderiData letter
Number.Specifically, formula (12) indicates are as follows:
Wherein, ΓiIt indicates and user node uiThe set of connected all channel nodes,It indicates in iv-th iteration
When channel node chjSend user node u toiMessage.
In current iteration number l≤L, only certain customers' node updates disappear it can be seen from step 3 to step 5
Breath, the detection algorithm after optimization only need the log-likelihood ratio of the data of calculating section user node, and it is multiple to greatly reduce calculating
Miscellaneous degree changes to the data of the user node in high Signal to Interference plus Noise Ratio user set at first L times in current iteration number L < l≤N
For under the auxiliary of result, the data-signal of all user nodes can be quickly detected.
Signal detecting method provided in an embodiment of the present invention can be used for the base station receiver of uplink and the terminal of downlink connects
Receipts machine.Particularly with the terminal receiver of downlink, due to there are power distribution, reaching some user section between multi-user's node
The signal of multiple user nodes of point gap easy to form on Signal to Interference plus Noise Ratio, then terminal can be only with itself and strong jamming use
Family node carries out the iterative detection of early period, in the case where not influencing system performance, can be substantially reduced the complexity of terminal detection
Degree.
Below by PDMA using for unit multiplexed 6 user nodes of 3 running time-frequency resources, in following specific embodiments with
Family node be terminal for, the detection process of signal detecting method provided in an embodiment of the present invention is described in detail.
First specific embodiment:
For uplink process, base station receives the signal of all terminals of multiplexing time-frequency resource, according to each terminal
The Signal to Interference plus Noise Ratio of signal classifies to all terminals, obtains high Signal to Interference plus Noise Ratio terminal set, is expressed as { u1,u2,u3, and
Low Signal to Interference plus Noise Ratio terminal set, is expressed as { u4,u5,u6, it is as shown in Figure 5 to obtain the factor graph distinguished by Signal to Interference plus Noise Ratio.
Maximum number of iterations N=5 is selected, early period, the number of iterations L=2 only updated then during preceding L iterative detection
The message of terminal in high Signal to Interference plus Noise Ratio terminal set keeps the message of the terminal in low Signal to Interference plus Noise Ratio terminal set constant.It is right
In terminal uiMessage according to formula (13) update, formula (13) indicate are as follows:
Wherein,Indicate the channel node ch in the l times iterationjPass to terminal uiAbout terminal ui's
Signal xiIn m-th of bit bi,mLLR ratio, xiIndicate terminal uiModulated signal, AMIt is sent for each terminal
The signal set of M contrast, yjIndicate that base station passes through channel node chjReception signal, xkIndicate terminal ukModulated letter
Number, the value range of k is k ∈ Φj, k ≠ i, ΦjIt indicates and channel node chjThe set of connected all terminals, p (yj|hj,
xi,xk) indicating channel condition transitional provavility density, it is assumed that interchannel noise n is the noise vector for obeying multiple Gauss distribution, can be obtained
It arrivesWherein, " ∝ " expression " being proportional to "；Wherein, i ∈ { SINRH}={ 1,2,3 } it indicates to belong to high Signal to Interference plus Noise Ratio termination set
The index of the terminal of conjunction, i ∈ { SINRL}={ 4,5,6 } indicate the index for belonging to the terminal of low Signal to Interference plus Noise Ratio set.
After L iterative detection, all terminals are indicated according to formula (14) update message, formula (14) are as follows:
The physical significance of each parameter can be found in the description of formula (13) in formula (14), and details are not described herein again.
Second specific embodiment:
For downlink transmission process, it is illustrated by taking the signal receive process of terminal 1 as an example.
Terminal 1 receives the signal of all terminals of multiplexing time-frequency resource, according to the Signal to Interference plus Noise Ratio pair of the signal of each terminal
All terminals are classified, and are obtained high Signal to Interference plus Noise Ratio terminal set, are expressed as { u1,u2And low Signal to Interference plus Noise Ratio terminal set,
It is expressed as { u3,u4,u5,u6, it is as shown in Figure 6 to obtain the factor graph distinguished by Signal to Interference plus Noise Ratio.
Maximum number of iterations N=5 is selected, early period, the number of iterations L=2 only updated then during preceding L iterative detection
The message of terminal in high Signal to Interference plus Noise Ratio terminal set keeps the message of the terminal in low Signal to Interference plus Noise Ratio terminal set constant.It is right
In terminal uiMessage according to formula (15) update, formula (15) indicate are as follows:
Wherein,Indicate the channel node ch in the l times iterationjPass to terminal uiAbout xiIn m
A bit bi,mLLR ratio, xiIndicate terminal uiModulated signal,It indicates and channel node chjCorresponding terminal set ΦjThe d for includingcA terminal
Whole modulation symbols composition column vector, xi=s0Indicate terminal uiModulation symbol choose s0, any bit sequence of s expression
Corresponding modulation symbol, s0Indicate the corresponding modulation symbol of full 0 bit sequence, dcFor the degree of channel node, the degree of channel node
Number refers to while using the number of terminals of the channel node, hjIndicate channel node chjChannel response, xkIndicate terminal ukModulation
Signal afterwards, the value range of k are k ∈ Φj, k ≠ i, ΦjIndicate the set for all user nodes being connected with terminal j,Indicate dcThe union of the signal set of a M contrast, σ2Indicate noise njPerformance number.Wherein, i ∈
{SINRH}={ 1,2 } indicate the index for belonging to the terminal of high Signal to Interference plus Noise Ratio terminal set, i ∈ { SINRL}={ 3,4,5,6 } it indicates
Belong to the index of the terminal of low Signal to Interference plus Noise Ratio set.
After L iterative detection, all terminals are indicated according to formula (16) update message, formula (16) are as follows:
The physical significance of each parameter can be found in the description of formula (15) in formula (16), and details are not described herein again.
Based on the same inventive concept, signal detection dress in a kind of access of non-orthogonal multiple is additionally provided in the embodiment of the present invention
It sets, the specific implementation of the device can be found in the description of embodiment of the method part, and overlaps will not be repeated, as shown in fig. 7, the dress
It sets and specifically includes that
First processing module 701 is made an uproar for determining that the letter for being multiplexed each user node of one or more channel nodes is dry
Than；
Second processing module 702, for being respectively compared the Signal to Interference plus Noise Ratio of each user node with threshold value, really
The fixed Signal to Interference plus Noise Ratio is greater than the user node of the threshold value, and determining user node is formed first set, will be described in multiplexing
One or more all user nodes of channel node form second set；
Third processing module 703, for according to described in each of each channel node and described first set
It is described to determine that each channel node sends each of described first set to by preceding L iterative process for user node
The message of user node, wherein L is greater than 1 and is less than N, and N is positive integer；
Fourth processing module 704, for according to each of each channel node and the second set use
Family node, and determine that each channel node sends each institute in the first set to according to preceding L iterative process
The message for stating user node determines that each channel node sends described second to by the L+1 times to iv-th iteration process
The message of each of set user node；
5th processing module 705, for sending each institute in the second set to according to each channel node
The message of user node is stated, each corresponding data-signal of user node is detected.
Preferably, the third processing module 703 is specifically used for:
An iteration process in the preceding L iterative process are as follows:
If it is determined that current iteration number is not more than L, passed according to each of the last iterative process acquisition channel node
The message for giving each of described first set user node determines the first set that current iteration process obtains
Each of the user node be respectively transmitted to the message of each channel node；
Respectively for each of the first set user node, saved the user node as target user
Point, according to each of in addition to target user's node the user node be transferred to disappearing for each channel node respectively
Breath determines that each of the current iteration process acquisition channel node sends the message of target user's node to；
Current iteration number is updated using preset step-length.
Third processing module 703 repeats the iterative process until current iteration number is greater than L.
Preferably, the third processing module 703 is specifically used for:
In each iterative process in the preceding L iterative process, for including in the second set and described
The user node not included in one set, the message for determining that each channel node sends the user node to is first
Initial value.
Preferably, the fourth processing module 704 is specifically used for:
An iteration process during the L+1 times to iv-th iteration are as follows:
If it is determined that current iteration number is not less than L+1 and is not more than N, it is according to each of last iterative process acquisition
Channel node sends the message of each of described second set user node to, determines the institute that current iteration process obtains
Each of second set user node is stated to be respectively transmitted to the message of each channel node；
Respectively for each of the second set user node, saved the user node as target user
Point, according to each of in addition to target user's node the user node be transferred to disappearing for each channel node respectively
Breath determines that each of the current iteration process acquisition channel node sends the message of target user's node to；
Current iteration number is updated using preset step-length.
Fourth processing module 704 repeats the iterative process until current iteration number is greater than N.
Preferably, the L is preset integer, the N is preset positive integer, and the L and the N are respectively according to system
Performance and computation complexity determine.
Based on the same inventive concept, a kind of equipment, the implementation side of can be found in of the equipment are additionally provided in the embodiment of the present invention
The description of method embodiment part, overlaps will not be repeated, as shown in figure 8, the equipment mainly includes processor 801 and memory
802, wherein preset program is preserved in memory 802, processor 801 reads the program in memory 802, according to the journey
Sequence executes following procedure:
Determine the Signal to Interference plus Noise Ratio for being multiplexed each user node of one or more channel nodes；
The Signal to Interference plus Noise Ratio of each user node is compared with threshold value respectively, determines that the Signal to Interference plus Noise Ratio is greater than institute
Determining user node is formed first set, will be multiplexed one or more of channel node institutes by the user node for stating threshold value
Second set is formed by the user node；
According to each of each channel node and the first set user node, repeatedly by first L times
Determine that each channel node sends the message of each of described first set user node to for process, wherein L
Greater than 1 and it is less than N, N is positive integer；
According to each of each channel node and the second set user node, and according to L times first
Iterative process determines that each channel node sends the message of each of described first set user node to, passes through
Determine that each channel node sends each of described second set user to iv-th iteration process the L+1 times
The message of node；
It sends the message of each of described second set user node to according to each channel node, detects
Each corresponding data-signal of the user node.
Preferably, an iteration process of the processor 801 in the preceding L iterative process are as follows:
If it is determined that current iteration number is not more than L, passed according to each of the last iterative process acquisition channel node
The message for giving each of described first set user node determines the first set that current iteration process obtains
Each of the user node be respectively transmitted to the message of each channel node；
Respectively for each of the first set user node, saved the user node as target user
Point, according to each of in addition to target user's node the user node be transferred to disappearing for each channel node respectively
Breath determines that each of the current iteration process acquisition channel node sends the message of target user's node to；
Current iteration number is updated using preset step-length.
Preferably, processor 801 in each iterative process in the preceding L iterative process, collects for described second
The user node for including in conjunction and not including in the first set determines that each channel node sends the use to
The message of family node is initial value.
Preferably, an iteration process of the processor 801 during the L+1 times to iv-th iteration are as follows:
If it is determined that current iteration number is not less than L+1 and is not more than N, it is according to each of last iterative process acquisition
Channel node sends the message of each of described second set user node to, determines the institute that current iteration process obtains
Each of second set user node is stated to be respectively transmitted to the message of each channel node；
Respectively for each of the second set user node, saved the user node as target user
Point, according to each of in addition to target user's node the user node be transferred to disappearing for each channel node respectively
Breath determines that each of the current iteration process acquisition channel node sends the message of target user's node to；
Current iteration number is updated using preset step-length.
Preferably, the L is preset integer, the N is preset positive integer, and the L and the N are respectively according to system
Performance and computation complexity determine.
Wherein, processor is connected with memory by bus, and bus architecture may include the bus of any number of interconnection
And bridge, the various circuits of the memory specifically represented by the one or more processors and memory of processor representative are linked at one
It rises.Bus architecture can also link various other circuits of such as peripheral equipment, voltage-stablizer and management circuit or the like
Together, these are all it is known in the art, and therefore, it will not be further described herein.Bus interface offer connects
Mouthful.Processor is responsible for managing bus architecture and common processing, and memory can store processor and be used when executing operation
Data.
In implementation, which can be base station, be also possible to terminal.
Based on the above-mentioned technical proposal, in the embodiment of the present invention, according to the Signal to Interference plus Noise Ratio of each user node from multipling channel
Select the user node of high Signal to Interference plus Noise Ratio as first set in multiple user nodes of node, in preceding L iterative process only
Processing is iterated to the user node in first set, i.e., determines that each channel node is sent to by preceding L iterative process
The message of each user node in first set, to reduce the complexity of signal detection in non-orthogonal multiple access.Phase
Compared with existing detection algorithm, the iteration renewal process of the user node of low Signal to Interference plus Noise Ratio is eliminated in preceding L iterative process,
It does not influence to greatly reduce computation complexity in the case where system performance, it is right at first L times in current iteration number L < l≤N
Under the auxiliary of the data iteration result of user node in high Signal to Interference plus Noise Ratio user set, all user's sections can be quickly detected
The data-signal of point.
It should be understood by those skilled in the art that, the embodiment of the present invention can provide as method, system or computer program
Product.Therefore, complete hardware embodiment, complete software embodiment or reality combining software and hardware aspects can be used in the present invention
Apply the form of example.Moreover, it wherein includes the computer of computer usable program code that the present invention, which can be used in one or more,
The shape for the computer program product implemented in usable storage medium (including but not limited to magnetic disk storage and optical memory etc.)
Formula.
The present invention be referring to according to the method for the embodiment of the present invention, the process of equipment (system) and computer program product
Figure and/or block diagram describe.It should be understood that every one stream in flowchart and/or the block diagram can be realized by computer program instructions
The combination of process and/or box in journey and/or box and flowchart and/or the block diagram.It can provide these computer programs
Instruct the processor of general purpose computer, special purpose computer, Embedded Processor or other programmable data processing devices to produce
A raw machine, so that being generated by the instruction that computer or the processor of other programmable data processing devices execute for real
The device for the function of being specified in present one or more flows of the flowchart and/or one or more blocks of the block diagram.
These computer program instructions, which may also be stored in, is able to guide computer or other programmable data processing devices with spy
Determine in the computer-readable memory that mode works, so that it includes referring to that instruction stored in the computer readable memory, which generates,
Enable the manufacture of device, the command device realize in one box of one or more flows of the flowchart and/or block diagram or
The function of being specified in multiple boxes.
These computer program instructions also can be loaded onto a computer or other programmable data processing device, so that counting
Series of operation steps are executed on calculation machine or other programmable devices to generate computer implemented processing, thus in computer or
The instruction executed on other programmable devices is provided for realizing in one or more flows of the flowchart and/or block diagram one
The step of function of being specified in a box or multiple boxes.
Obviously, various changes and modifications can be made to the invention without departing from essence of the invention by those skilled in the art
Mind and range.In this way, if these modifications and changes of the present invention belongs to the range of the claims in the present invention and its equivalent technologies
Within, then the present invention is also intended to include these modifications and variations.
Claims (10)
1. signal detecting method in a kind of non-orthogonal multiple access characterized by comprising
Determine the Signal to Interference plus Noise Ratio for being multiplexed each user node of one or more channel nodes；
The Signal to Interference plus Noise Ratio of each user node is compared with threshold value respectively, determines that the Signal to Interference plus Noise Ratio is greater than the threshold
Determining user node is formed first set, will be multiplexed all institutes of one or more of channel nodes by the user node of value
State user node composition second set；
According to each of each channel node and the first set user node, pass through preceding L iteration mistake
Journey determines that each channel node sends the message of each of described first set user node to, and wherein L is greater than 1
And it is less than N, N is positive integer；
According to each of each channel node and the second set user node, and according to preceding L iteration
Process determines that each channel node sends the message of each of described first set user node to, passes through L+
Determine that each channel node sends each of described second set user node to iv-th iteration process 1 time
Message；
Send the message of each of described second set user node to according to each channel node, detection is each
The corresponding data-signal of user node.
2. the method as described in claim 1, which is characterized in that an iteration process in the preceding L iterative process are as follows:
If it is determined that current iteration number is greater than 1 and is not more than L, according to each of the last iterative process acquisition channel node
The message for sending each of described first set user node to determines first collection that current iteration process obtains
Each of conjunction user node is respectively transmitted to the message of each channel node；
Respectively for each of the first set user node, using the user node as target user's node,
According to each of in addition to target user's node the user node be transferred to the message of each channel node respectively,
Determine that each of the current iteration process acquisition channel node sends the message of target user's node to；
Current iteration number is updated using preset step-length.
3. method according to claim 2, which is characterized in that each iterative process in the preceding L iterative process includes:
For the user node for including in the second set and not including in the first set, each letter is determined
The message that road node sends the user node to is initial value.
4. method as claimed in claim 3, which is characterized in that an iteration process during the L+1 times to iv-th iteration
Are as follows:
If it is determined that current iteration number is not less than L+1 and is not more than N, according to each of the last iterative process acquisition channel
Node sends the message of each of described second set user node to, determines current iteration process obtains described the
Each of the two set user node is respectively transmitted to the message of each channel node；
Respectively for each of the second set user node, using the user node as target user's node,
According to each of in addition to target user's node the user node be transferred to the message of each channel node respectively,
Determine that each of the current iteration process acquisition channel node sends the message of target user's node to；
Current iteration number is updated using preset step-length.
5. method according to any of claims 1-4, which is characterized in that the L is preset integer, and the N is default
Positive integer, the L and the N are determined according to system performance and computation complexity respectively.
6. signal supervisory instrument in a kind of non-orthogonal multiple access characterized by comprising
First processing module, for determining the Signal to Interference plus Noise Ratio for being multiplexed each user node of one or more channel nodes；
Second processing module, for being respectively compared the Signal to Interference plus Noise Ratio of each user node with threshold value, described in determination
Signal to Interference plus Noise Ratio is greater than the user node of the threshold value, and determining user node is formed first set, will be multiplexed it is one or
Multiple all user nodes of channel node form second set；
Third processing module, for being saved according to each of each channel node and the first set user
Point determines that each channel node sends each of described first set user to and saves by preceding L iterative process
The message of point, wherein L is greater than 1 and is less than N, and N is positive integer；
Fourth processing module, for according to each of each channel node and the second set user node,
And determine that each channel node sends each of described first set user to and saves according to preceding L iterative process
The message of point, determines that each channel node is sent in the second set by the L+1 times to iv-th iteration process
The message of each user node；
5th processing module is saved for sending each of described second set user to according to each channel node
The message of point detects each corresponding data-signal of user node.
7. device as claimed in claim 6, which is characterized in that the third processing module is specifically used for:
An iteration process in the preceding L iterative process are as follows:
If it is determined that current iteration number is greater than 1 and is not more than L, according to each of the last iterative process acquisition channel node
The message for sending each of described first set user node to determines first collection that current iteration process obtains
Each of conjunction user node is respectively transmitted to the message of each channel node；
Respectively for each of the first set user node, using the user node as target user's node,
According to each of in addition to target user's node the user node be transferred to the message of each channel node respectively,
Determine that each of the current iteration process acquisition channel node sends the message of target user's node to；
Current iteration number is updated using preset step-length.
8. device as claimed in claim 7, which is characterized in that the third processing module is specifically used for:
In each iterative process in the preceding L iterative process, for include in the second set and it is described first collection
The user node not included in conjunction, the message for determining that each channel node sends the user node to is initial
Value.
9. device as claimed in claim 8, which is characterized in that the fourth processing module is specifically used for:
An iteration process during the L+1 times to iv-th iteration are as follows:
If it is determined that current iteration number is not less than L+1 and is not more than N, according to each of the last iterative process acquisition channel
Node sends the message of each of described second set user node to, determines current iteration process obtains described the
Each of the two set user node is respectively transmitted to the message of each channel node；
Respectively for each of the second set user node, using the user node as target user's node,
According to each of in addition to target user's node the user node be transferred to the message of each channel node respectively,
Determine that each of the current iteration process acquisition channel node sends the message of target user's node to；
Current iteration number is updated using preset step-length.
10. device as claim in any one of claims 6-9, which is characterized in that the L is preset integer, and the N is default
Positive integer, the L and the N are determined according to system performance and computation complexity respectively.
Priority Applications (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510717769.XA CN106656406B (en) | 2015-10-29 | 2015-10-29 | Signal detecting method and device in a kind of access of non-orthogonal multiple |
| PCT/CN2016/103030 WO2017071540A1 (en) | 2015-10-29 | 2016-10-24 | Signal detection method and device in non-orthogonal multiple access |
| TW105134742A TWI629880B (en) | 2015-10-29 | 2016-10-27 | Non-orthogonal multiple access signal detection method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510717769.XA CN106656406B (en) | 2015-10-29 | 2015-10-29 | Signal detecting method and device in a kind of access of non-orthogonal multiple |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106656406A CN106656406A (en) | 2017-05-10 |
| CN106656406B true CN106656406B (en) | 2019-07-19 |
Family
ID=58631299
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510717769.XA Active CN106656406B (en) | 2015-10-29 | 2015-10-29 | Signal detecting method and device in a kind of access of non-orthogonal multiple |
Country Status (3)
| Country | Link |
|---|---|
| CN (1) | CN106656406B (en) |
| TW (1) | TWI629880B (en) |
| WO (1) | WO2017071540A1 (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP7447260B2 (en) | 2019-11-22 | 2024-03-11 | コンチネンタル テーヴェス アクチエンゲゼルシャフト ウント コンパニー オッフェネ ハンデルス ゲゼルシャフト | Method for wireless X2X access and receiver for large-scale multidimensional wireless systems |
| US20240063858A1 (en) | 2020-12-16 | 2024-02-22 | Continental Automotive Technologies GmbH | Transceiver method between receiver (Rx) and transmitter (Tx) in an overloaded communication channel |
| CN114828155B (en) * | 2022-03-16 | 2023-08-29 | 北京航空航天大学 | Greedy iteration multi-user access method, electronic equipment and storage medium |
| CN115037339B (en) * | 2022-06-06 | 2024-01-23 | 网络通信与安全紫金山实验室 | Signal detection method and terminal equipment |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2134017B1 (en) * | 2008-05-09 | 2015-04-01 | Vodafone Holding GmbH | Method and system for data communication |
| CN101997639B (en) * | 2009-08-10 | 2014-10-22 | 中兴通讯股份有限公司 | Iterative receiver method of low density parity check-multi-input/output communication system |
| CN102055484B (en) * | 2010-12-21 | 2013-08-28 | 东南大学 | LDPC (low density parity code) layering BP (belief propagation) decoding algorithm based on least-mean-square-error criterion and decoder structure |
| CN104640220B (en) * | 2015-03-12 | 2018-08-21 | 重庆邮电大学 | A kind of frequency and power distribution method based on NOMA systems |
| CN104836602B (en) * | 2015-03-31 | 2017-12-05 | 重庆大学 | A kind of distributed extensive MIMO NOMA high-speed rail mobile communication systems |
-
2015
- 2015-10-29 CN CN201510717769.XA patent/CN106656406B/en active Active
-
2016
- 2016-10-24 WO PCT/CN2016/103030 patent/WO2017071540A1/en active Application Filing
- 2016-10-27 TW TW105134742A patent/TWI629880B/en active
Also Published As
| Publication number | Publication date |
|---|---|
| TWI629880B (en) | 2018-07-11 |
| CN106656406A (en) | 2017-05-10 |
| TW201715859A (en) | 2017-05-01 |
| WO2017071540A1 (en) | 2017-05-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Mu et al. | A fixed low complexity message pass algorithm detector for up-link SCMA system | |
| CN112804695B (en) | Reconfigurable intelligent surface-assisted wireless communication method and device | |
| CN106656406B (en) | Signal detecting method and device in a kind of access of non-orthogonal multiple | |
| Vetter et al. | Fixed complexity LLL algorithm | |
| CN109547034B (en) | Decoding method and device, decoder | |
| CN108141314A (en) | For determining the method and apparatus of the feature of error-correcting code system | |
| EP3490323B1 (en) | Method and apparatus for selecting user signature vector | |
| CN106856461A (en) | A kind of interference estimation method and equipment | |
| TW201635736A (en) | Signal detection method and device | |
| CN105940625A (en) | Base station device, wireless communication system, and communication method | |
| Yan et al. | Channel noise optimization of polar codes decoding based on a convolutional neural network | |
| TWI650984B (en) | Modulation method detection method and device | |
| CN113852443A (en) | Low-complexity multi-user detection method in SCMA (sparse code multiple Access) system | |
| KR20190057143A (en) | Decoding method, apparatus and modulation demodulation method and system based on superposition multiplex | |
| CN105471778B (en) | A kind of signal detecting method and device | |
| CN103117757B (en) | A kind of signal acceptance method and terminal | |
| KR102375186B1 (en) | Apparatus and method for performing channel decoding operation in communication system | |
| CN106656419B (en) | A kind of performance compensation method of the Max-Log type MPA detection algorithm of SCMA system | |
| KR20170125527A (en) | Symbol detection method in generalized spatial modulation multiple input multiple output system and receiver using thereof | |
| CN107027132B (en) | A kind of signal detecting method and device | |
| KR20200085596A (en) | Method for transceiving signal using polar code and device thereof | |
| CN103595508A (en) | Method for performing fixed-point processing on received symbol and soft demapping method | |
| CN117560048B (en) | Multiple access transmission method and device based on reconfigurable intelligent surface | |
| CN102882815B (en) | Multi-input and multi-output data detection method and multi-input and multi-output data detection device | |
| CN107453850B (en) | Detection method of physical uplink control channel |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CP01 | Change in the name or title of a patent holder |
Address after: 100191 No. 40, Haidian District, Beijing, Xueyuan Road Patentee after: CHINA ACADEMY OF TELECOMMUNICATIONS TECHNOLOGY Address before: 100191 No. 40, Haidian District, Beijing, Xueyuan Road Patentee before: CHINA ACADEMY OF TELECOMMUNICATIONS TECHNOLOGY |
|
| CP01 | Change in the name or title of a patent holder | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20210528 Address after: 100085 1st floor, building 1, yard 5, Shangdi East Road, Haidian District, Beijing Patentee after: DATANG MOBILE COMMUNICATIONS EQUIPMENT Co.,Ltd. Address before: 100191 No. 40, Haidian District, Beijing, Xueyuan Road Patentee before: CHINA ACADEMY OF TELECOMMUNICATIONS TECHNOLOGY |
|
| TR01 | Transfer of patent right |