CN1913415A - Multi-use method of multi-user signal - Google Patents

Multi-use method of multi-user signal Download PDF

Info

Publication number
CN1913415A
CN1913415A CN 200510091243 CN200510091243A CN1913415A CN 1913415 A CN1913415 A CN 1913415A CN 200510091243 CN200510091243 CN 200510091243 CN 200510091243 A CN200510091243 A CN 200510091243A CN 1913415 A CN1913415 A CN 1913415A
Authority
CN
China
Prior art keywords
planisphere
bunch
minimum eustachian
bit
eustachian distance
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.)
Granted
Application number
CN 200510091243
Other languages
Chinese (zh)
Other versions
CN100578999C (en
Inventor
王艺
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to CN200510091243A priority Critical patent/CN100578999C/en
Publication of CN1913415A publication Critical patent/CN1913415A/en
Application granted granted Critical
Publication of CN100578999C publication Critical patent/CN100578999C/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Abstract

This invention discloses a multiplexing method for multiple user signals, in which, the transmission end takes out KH bits from bit streams of high S/N ratio users and KL bits from those in low S/N users in terms of preset bit values KH and KL, then combines them into bit words and gets the shortest Euclidean distance among clusters and the smallest Euclidean distance among dots in a constellation map at the same time to get the data symbols corresponding to the current bit words to be output.

Description

A kind of multiplexing method of multiple user signals
Technical field
The present invention relates to the descending multiplex technique of radio honeycomb communication, refer to the multiplexing method of multiple user signals in a kind of radio honeycomb communication especially.
Background technology
The down link of radio honeycomb communication system comes down to the broadcast channel model of point-to-multipoint.A plurality of users' signal is at transmitting terminal, and as base station multiplexing back emission, multiplex mode generally adopts the orthogonal multiplex method, and is multiplexing as the time-frequency in OFDM (OFDM) modulating system.In time-frequency was multiplexing, the signal of different user took different running time-frequency resources, and therefore the signal at the receiving terminal different user can not produce the phase mutual interference.Yet, the channel that signal arrives different user often has different features, and the user away from the base station is also referred to as remote subscriber, the signal that generally receives than near-end user receive more weak, thereby cause lower received signal to noise ratio (SNR) and lower spectrum efficiency.
When occurring a large amount of remote subscribers in the system or remote subscriber need use a large amount of running time-frequency resource on a small quantity, will cause the spectrum efficiency of whole base station system to descend greatly.In addition, when the running time-frequency resource of base station system has in limited time, orthogonal multiplex can cause maximum supported number of users, and promptly user capacity is limited, also promptly has hard capacity problem.
In order to address the above problem, number of patent application is 03137566.9, denomination of invention is in the patent application of " cut apart the multiplexing method that combines nonopiate cutting apart with the time-division ", a kind of nonopiate multiplexing method of introducing the multi-user of going up in constellation mapping (Mapping) has been proposed, Fig. 1 be in the described patent application multi-user based on the constellation mapping principle schematic of stacking method, independently carry out constellation mapping respectively from user 1 bit stream with from user 2 bit stream, and, on same running time-frequency resource, superpose according to separately power respectively through after amplifying.
But, in the method that above-mentioned relevant patent proposes, do not retrain because user power and constellation mapping method imposed a condition, in real application systems, some problems can occur, such as power there not being strict restriction can cause each user inconsistent in the output signal performance of receiving terminal; Each user independently carries out constellation mapping, can not carry out global optimization to the data symbol of output, like this, even under identical transmitting power condition, can not utilize the signal performance of power reforming receiving terminal fully.
Summary of the invention
In view of this, main purpose of the present invention is to provide a kind of multiplexing method of multiple user signals, and each user's receptivity is consistent.
For achieving the above object, technical scheme of the present invention specifically is achieved in that
A kind of multiplexing method of multiple user signals, transmitting terminal is carried out following processing to the bit stream of two different signal to noise ratio users in the bit stream that receives:
A. according to default number of bits value K LAnd K H, from low signal-to-noise ratio user's bit stream and high s/n ratio user's bit stream, take out K respectively LIndividual bit and K HIndividual bit, and with the K that takes out LIndividual bit and K HIndividual bit combination generates a constellation point among the bit words constellation figure; Obtain simultaneously in the planisphere bunch between minimum Eustachian distance and the point between minimum Eustachian distance;
B. according in the described planisphere bunch between minimum Eustachian distance between minimum Eustachian distance and point, export after obtaining the data symbol of current bit words correspondence.
Described in the steps A with the K that takes out LIndividual bit and K HThe method that individual bit combination generates a bit words is: first bit to the K that takes out from described low signal-to-noise ratio user's bit stream LIndividual bit-order is arranged in the preceding K of described bit words LThe position, first bit to the K that from high s/n ratio user's bit stream, takes out HIndividual bit-order is arranged in the back K of described bit words HThe position.
Described planisphere is the planisphere that meets the following conditions:
2 KLBunch and every bunch comprise 2 KHIndividual constellation point, certain constellation point in the bit that from low signal-to-noise ratio user's bit stream, takes out corresponding bunch number, corresponding bunch of the bit that from high s/n ratio user's bit stream, takes out;
Between bunch minimum Eustachian distance square and the point between minimum Eustachian distance square ratio, equal low signal-to-noise ratio user's the signal to noise ratio and the inverse of the ratio of high s/n ratio user's signal to noise ratio; Perhaps, between bunch minimum Eustachian distance square and the point between minimum Eustachian distance square ratio, equal low signal-to-noise ratio user's the signal to noise ratio and the value of the inverse and the default degree of approximation adjusted value added/subtracted gained of the ratio of high s/n ratio user's signal to noise ratio;
The value of each bit words is corresponding one by one with each constellation point.
Between obtaining described in the steps A in the planisphere bunch between minimum Eustachian distance and some the method for minimum Eustachian distance be: according to described number of bits value K HAnd K L, known two users the noise given transmitting power P of transmitting terminal when, obtain in the planisphere bunch between minimum Eustachian distance between minimum Eustachian distance and point.
Described obtain in the planisphere bunch between between minimum Eustachian distance and some the method for minimum Eustachian distance be:
A1. according to described number of bits value K HAnd K L, select corresponding constellation mapping table;
A2., the average power that all constellation point in the described planisphere are set equals described given transmitting power P, and according to minimum Eustachian distance between described bunch square and point between minimum Eustachian distance square ratio, equal low signal-to-noise ratio user's the signal to noise ratio and the inverse of the ratio of high s/n ratio user's signal to noise ratio, calculate in the planisphere bunch between Euclidean distance between minimum Eustachian distance and point; Perhaps, according to bunch between minimum Eustachian distance square and the point between minimum Eustachian distance square ratio, equal low signal-to-noise ratio user's the signal to noise ratio and the value of the inverse and the default degree of approximation adjusted value added/subtracted gained of the ratio of high s/n ratio user's signal to noise ratio, calculate in the planisphere bunch between Euclidean distance between minimum Eustachian distance and point.
Select the method for corresponding constellation mapping table to be described in the steps A 1: according to the number of bits value K that is pre-stored in transmitting terminal HAnd K LWith the one-to-one relationship of constellation mapping table, select corresponding constellation mapping table.
The method of calculating the average power of constellation point in the planisphere described in the steps A 2 is:
A21. from described constellation mapping table, take out the data symbol of each constellation point;
A22. respectively the data symbol of each constellation point is taken absolute value back square, will square after each income value addition, calculate the merchant of income value and constellation point sum after the addition at last.
Between obtaining described in the steps A in the planisphere bunch between minimum Eustachian distance and some the method for minimum Eustachian distance be: minimum Eustachian distance is a normalized value between default described point; According to minimum Eustachian distance between the point in two users' signal to noise ratio and the default planisphere, obtain in the planisphere bunch between minimum Eustachian distance.
Described obtain in the planisphere bunch between the method for minimum Eustachian distance be: the merchant who calculates described high s/n ratio user's signal to noise ratio and low signal-to-noise ratio user's signal to noise ratio, gained merchant minimum Eustachian distance square long-pending again and between the point in the described default planisphere calculated the square root of income value at last.
This method also comprises: default degree of approximation adjusted value;
Described obtain in the planisphere bunch between the method for minimum Eustachian distance be: the merchant who calculates described high s/n ratio user's signal to noise ratio and low signal-to-noise ratio user's signal to noise ratio, minimum Eustachian distance square long-pending again and between the point in the described default planisphere after gained merchant and the default degree of approximation adjusted value added/subtracted calculated the square root of income value at last.
The method of obtaining the data symbol of current bit words correspondence described in the step B is:
B1. the bit words that generates according to steps A, inquiry is used for storing the bit words of planisphere and the constellation mapping table that prestores of the corresponding relation of data symbol computing formula, obtains the data symbol computing formula of correspondence;
B2. according in the planisphere of described acquisition bunch between the data symbol computing formula of Euclidean distance and acquisition between point in the Euclidean distance, default planisphere, calculate the data symbol of described current bit words correspondence.
Described data symbol computing formula comprises real part computing formula and imaginary part computing formula;
Described data symbol computing formula according in the described planisphere of difference bunch between between minimum Eustachian distance and some minimum Eustachian distance draw, and be preset in transmitting terminal.
The method of obtaining the data symbol of current bit words correspondence described in the step B is:
According to described bit words, inquiry is used for storing the bit words of planisphere and the constellation correspondence table of presetting of the corresponding relation of data symbol, obtains the data symbol of current bit words correspondence.
This method further comprises: in the default planisphere bunch between minimum Eustachian distance;
Data symbol in the described constellation correspondence table according in the described planisphere of difference bunch between between minimum Eustachian distance and some minimum Eustachian distance draw, and be preset in transmitting terminal.
Described planisphere further meets the following conditions:
Between different bunches, between all adjacent constellation point bunch between Euclidean distance equate and be bunch between minimum Eustachian distance; In cluster, the Euclidean distance between all adjacent constellation point equates and is minimum Eustachian distance between point;
Described constellation point adopts Gray code Gray to encode.
As seen from the above technical solution, the present invention is to two users that signal to noise ratio is different, and transmitting terminal is according to default number of bits value K HAnd K L, from high s/n ratio user's bit stream, take out K respectively HIndividual bit takes out K from low signal-to-noise ratio user's bit stream LIndividual bit; Afterwards, transmitting terminal is with the K that takes out HIndividual bit and K LIndividual bit combination generates a bit words, and compound mode can be first bit to the K that takes out from low signal-to-noise ratio user's bit stream LIndividual bit-order is arranged in the preceding K of this bit words LThe position, first bit to the K that from high s/n ratio user's bit stream, takes out HIndividual bit-order is arranged in the back K of this bit words HPosition, i.e. c L, 0C L, KL-1c H, 0C H, KN-1, wherein, c L, nAnd c H, mRepresent n bit and m bit of from low signal-to-noise ratio user and high s/n ratio user's bit stream, taking out respectively; Transmitting terminal is according to number of bits value K simultaneously HAnd K L, known two users the noise given transmitting power P of transmitting terminal when, obtain in the planisphere bunch between minimum Eustachian distance and the point between minimum Eustachian distance, perhaps transmitting terminal is according to minimum Eustachian distance between the point in two known users signal to noise ratio and the default planisphere, obtain in the planisphere bunch between minimum Eustachian distance; At last, transmitting terminal according in the planisphere that obtains bunch between minimum Eustachian distance between minimum Eustachian distance and point, inquiry transmitting terminal being used for of prestoring stored the constellation mapping table of the corresponding relation of planisphere bit words and data symbol computing formula, perhaps be used for storing the constellation correspondence table of the corresponding relation of planisphere bit words and data symbol, obtain to export behind the data symbol of current bit words correspondence.The method of multi-user association constellation mapping of the present invention has guaranteed the consistency of each user in the output signal performance of receiving terminal, under the condition of given transmitting power, makes receiving terminal obtain more performance even higher spectrum efficiency simultaneously.
Described planisphere is divided into 2 KLBunch, every bunch comprises 2 KHIndividual constellation point, certain constellation point in low signal-to-noise ratio user's the bit corresponding bunch number, corresponding bunch of high s/n ratio user's bit.Divide cluster and two levels of point with all constellation point, help receiving terminal and control demodulation performance by the constellation point of control different levels.
In the described planisphere bunch between between least square Euclidean distance and some the ratio of least square Euclidean distance equal the inverse of the ratio of respective user signal to noise ratio, promptly equal low signal-to-noise ratio user's the signal to noise ratio and the inverse of the ratio of high s/n ratio user's signal to noise ratio, guaranteed that each user is behind the data symbol of receiving terminal demodulation from transmitting terminal output, each user's error sign ratio approximately equal, thus make each user's receptivity keep unanimity.In addition, if satisfy between different bunches, between all adjacent constellation point bunch between Euclidean distance equate, promptly be d Min, LIn cluster, the Euclidean distance between all adjacent constellation point equates, is d Min, H, the average power minimum of the data symbol of bit words correspondence has further guaranteed under the condition of given transmitting power so, receiving terminal is obtained more performance even higher spectrum efficiency.
Simultaneously, in the planisphere of the present invention, the unique corresponding constellation point of each possibility value of bit words, a kind of value of the also unique corresponding bit word of each constellation point has guaranteed that receiving terminal can correctly carry out demodulation to the data symbol from transmitting terminal.
In addition, the constellation point in the described planisphere is encoded according to Gray code (Gray), that is: with in the cluster, Euclidean distance is that two adjacent pairing bit words of constellation point of minimum Eustachian distance between point only have a bit difference; Between different bunches, Euclidean distance for bunch between two pairing bit words of constellation point of minimum Eustachian distance also have only a bit difference.Like this, taking place under the situation that the symbol erroneous judgement determines, constellation point of the present invention adopts the processing of Gray code coding, has guaranteed that errored bit counts minimum.
Description of drawings
Fig. 1 is the constellation mapping principle schematic of prior art multi-user based on stacking method;
Fig. 2 is the multiplexing principle schematic of multiple user signals of the present invention;
Fig. 3 is the flow chart of the multiplexing method of multiple user signals of the present invention;
Fig. 4 a is the preferable planisphere one of the present invention;
Fig. 4 b is the preferable planisphere two of the present invention;
Fig. 4 c is the preferable planisphere three of the present invention;
Fig. 4 d is the preferable planisphere four of the present invention;
Fig. 4 e is the preferable planisphere five of the present invention;
Fig. 4 f is the preferable planisphere six of the present invention.
Embodiment
Core concept of the present invention is: to two users that signal to noise ratio is different, transmitting terminal is according to default number of bits value K HAnd K L, from high s/n ratio user's bit stream, take out K respectively HIndividual bit takes out K from low signal-to-noise ratio user's bit stream LIndividual bit; Afterwards, transmitting terminal is with the K that takes out LIndividual bit and K HIndividual bit combination generates a bit words; Obtain simultaneously in the planisphere bunch between minimum Eustachian distance and the point between minimum Eustachian distance; At last, transmitting terminal according in the planisphere that obtains bunch between minimum Eustachian distance between point in minimum Eustachian distance and the default planisphere, obtain to export behind the data symbol of current bit words correspondence.
For making purpose of the present invention, technical scheme and advantage clearer, below with reference to the accompanying drawing preferred embodiment that develops simultaneously, the present invention is described in more detail.
Fig. 2 is the multiplexing principle schematic of multiple user signals of the present invention, as can be seen from Figure 2, transmitting terminal generates bit words according to the bit stream from different signal to noise ratio users, and the bit words that generates united after constellation mapping handles the data symbol of output bit words correspondence.In conjunction with Fig. 3, Fig. 3 is the flow chart of the multiplexing method of multiple user signals of the present invention, hypothesis here, and different and signal to noise ratio user 1 of user 1 and user's 2 signal to noise ratio is higher than user 2 signal to noise ratio, claims that user 1 is the high s/n ratio user, and signal to noise ratio is SNR HClaim that user 2 is the low signal-to-noise ratio user, signal to noise ratio is SNR L, and transmitting terminal has been known SNR HAnd SNR LThe while transmitting terminal has been provided with the number of bits of taking out from high s/n ratio user's bit stream be K HIndividual, the number of bits of taking out from low signal-to-noise ratio user's bit stream is K LIndividual, K HAnd K LValue and user's the required satisfied error rate of noise receiving terminal demodulation when etc. relevant; After transmitting terminal received two different signal to noise ratio users' bit stream, the method for multi-user association constellation mapping of the present invention specifically described as follows:
Step 300: transmitting terminal is according to the number of bits preset value, always takes out K in user 1 bit stream and the bit stream from user 2 respectively HIndividual bit and K LIndividual bit, and two groups of bits, i.e. K that will take out HIndividual bit and K LIndividual bit combination generates a bit words.
When two groups of bit combinations generate a bit words, compound mode is a lot, as long as transmitting terminal and receiving terminal are unified and low signal-to-noise ratio user's bit corresponding bunch number, certain constellation point in corresponding bunch of high s/n ratio user's the bit get final product, and wherein a kind of compound mode of act describes here: first bit to the K that takes out from low signal-to-noise ratio user's bit stream LIndividual bit-order is arranged in the preceding K of this bit words LThe position, first bit to the K that from high s/n ratio user's bit stream, takes out HIndividual bit-order is arranged in the back K of this bit words HPosition, i.e. c L, 0C L, KL-1c H, 0C H, KN-1, wherein, c L, nAnd c H, mRepresent n bit and m bit of from low signal-to-noise ratio user and high s/n ratio user's bit stream, taking out respectively.The distribution situation of the bit words that transmitting terminal generates can adopt planisphere to represent visually, and promptly the label of constellation point correspondence is a bit words, and the corresponding data symbol in the position of each constellation point in planisphere.
Planisphere of the present invention is divided into 2 KLBunch, every bunch comprises 2 KHIndividual constellation point, certain constellation point in low signal-to-noise ratio user's the bit corresponding bunch number, corresponding bunch of high s/n ratio user's bit.Divide cluster and two levels of point with all constellation point, help receiving terminal and control demodulation performance by the bit of control different levels.
In order to guarantee that receiving terminal can correctly carry out demodulation to the data symbol from transmitting terminal, in the planisphere of the present invention, the necessary unique corresponding constellation point of each possibility value of bit words, a kind of value of the also unique corresponding bit word of each constellation point, promptly the value of bit words is corresponding one by one with constellation point.
Constellation point can adopt natural code, Gray code (Gray) etc. to encode, but, if adopt Gray code to encode, that is: with in the cluster, Euclidean distance only has a bit difference for two adjacent pairing bit words of constellation point of minimum Eustachian distance between point; Between different bunches, Euclidean distance for bunch between two pairing bit words of constellation point of minimum Eustachian distance also have only a bit difference, like this, taking place under the symbol erroneous judgement situation certainly, constellation point of the present invention adopts the processing of Gray code coding, guaranteed that errored bit counts minimum, guaranteed further that under the condition of given transmitting power receiving terminal is obtained more performance even higher spectrum efficiency.
In addition, consider practicality, get K usually L=1 or 2, and K L+ K H≤ 4.
Step 301: transmitting terminal obtain in the planisphere bunch between minimum Eustachian distance between point in minimum Eustachian distance and the planisphere.
Usually, minimum Eustachian distance is generally used d between the point Min, HExpression, minimum Eustachian distance is generally used d between bunch Min, LExpression.
According to prior art, based on the down link of OFDM, transmitted power is P, and two different signal to noise ratio users' received signal to noise ratio is respectively so:
SNR H = P | h H | 2 N H - - - ( 1 )
SNR L = P | h L | 2 N L - - - ( 2 )
In formula (1) and (2), h HBe high s/n ratio user's channel impulse response, h LChannel impulse response for the low signal-to-noise ratio user; N HBe the additive noise power in the channel of high s/n ratio user place, N LBe the additive noise power in the channel of low signal-to-noise ratio user place.Here, the signal to noise ratio just mentioned in the literary composition of received signal to noise ratio.
If receiving terminal adopts the data symbol information of maximum-likelihood criterion demodulation from receiving terminal output, the error sign ratio P after the high s/n ratio user demodulation so S, HWith the error sign ratio P after the low signal-to-noise ratio user demodulation S, LApproximate representation is shown in formula (3) and the formula (4) respectively:
P s , H ≈ M H Q ( d min , H 2 | h H | 2 N H ) - - - ( 3 )
P s , L ≈ M L Q ( d min , L 2 | h L | 2 N L ) - - - ( 4 )
In formula (3) and (4), M H, M LBe two constants, d Min, L 2And d Min, H 2Represent respectively in the planisphere bunch between least square Euclidean distance between point in least square Euclidean distance and the planisphere.
Among the present invention, suppose d min , L 2 d min , H 2 = SNR H SNR L - - - ( 5 )
So,, be not difficult to draw two users' error sign ratio approximately equal, in the light of actual conditions, can ignore M here according to above formula (1)~(4) HAnd M LInfluence.
Based on above analysis, according to formula (5), at transmitting terminal, between adopt satisfying bunch between least square Euclidean distance and some the ratio of least square Euclidean distance equal the inverse of the ratio of respective user signal to noise ratio, promptly equal low signal-to-noise ratio user's the signal to noise ratio and the planisphere of the inverse of the ratio of high s/n ratio user's signal to noise ratio, user 1 and user 2 have been guaranteed behind the data symbol of receiving terminal demodulation, P from transmitting terminal output S, HWith P S, LApproximately equal, thus the consistency of each user's receptivity guaranteed.
From last surface analysis as can be seen, since user's error sign ratio mainly by bunch between minimum Eustachian distance decision between minimum Eustachian distance and point, therefore under the condition that guarantees certain error sign ratio, if between different bunches, between all adjacent constellation point bunch between Euclidean distance equate, promptly be d Min, LIn cluster, the Euclidean distance between all adjacent constellation point equates, is d Min, H, the average power minimum of the data symbol of bit words correspondence so.If with in the cluster/different bunches between adjacent constellation point distance greater than minimum Eustachian distance between point/bunch between minimum Eustachian distance, so can be the point of correspondence/bunch move to the initial point direction, make Euclidean distance be reduced to minimum range, so both reduced power, guaranteed that also minimum Eustachian distance is constant simultaneously, that is to say, the performance that has guaranteed demodulation is constant, like this, has further guaranteed, under the condition of given transmitting power, can make receiving terminal obtain more performance even higher spectrum efficiency.
Need to prove,, can further improve P by adjustment to formula (5) according to actual conditions S, HWith P S, LThe degree of approximation such as setting degree of approximation adjusted value Δ, and is adjusted into formula (5):
d min , L 2 d min , H 2 = SNR H SNR L ± Δ - - - ( 5 ′ )
The span of Δ is generally in the formula (5 '): 0<Δ<1, and such as Δ=0.5 etc.In this step, d Min, H, SNR HAnd SNR LBe known,, draw d easily according to formula (5) or formula (5 ') Min, L, promptly d min , L = d min , H 2 × SNR H SNR L - - - ( 6 )
Or d min , L = d min , H 2 × ( SNR H SNR L ± Δ ) - - - ( 6 ′ )
In this step, suppose default d Min, LBe normalized value, promptly equal 1, then, can calculate d according to formula (5) or (5 ') and known user's signal to noise ratio Min, H
In addition, receiving terminal can also be according to the given transmitting power P of transmitting terminal, known user's signal to noise ratio and default number of bits value K HAnd K L, obtain in the planisphere bunch between minimum Eustachian distance and the point between minimum Eustachian distance, be implemented as follows:
As mentioned above, according to K HAnd K LCan determine the planisphere type that adopts, also just determine the constellation mapping table that adopts, at transmitting terminal K HAnd K LWith the constellation mapping table be corresponding stored one by one; In addition, the average power of all constellation point is in the planisphere: the data symbol of each constellation point is taken absolute value back square, will square after each income value addition, calculate the merchant of income value and constellation point sum after the addition at last, shown in formula (7) the equation left side, and the average power of all constellation point equals given transmitting power P in the planisphere, that is:
1 M Σ i = 0 M - 1 | s i | 2 = P - - - ( 7 )
Wherein, M = 2 K H + K L , Be used for representing the sum of planisphere constellation point; s iThe real part of constellation point and imaginary part, i.e. s iThe value of the value of=real part+i imaginary part, the computing formula of real part and imaginary part can be found out from the described constellation mapping table that prestores.
Like this, combinatorial formula (5) and formula (7), or combinatorial formula (5 ') and formula (7), can calculate in the planisphere bunch between minimum Eustachian distance and the point between minimum Eustachian distance.
For example: suppose K H=1, K L=1, SNR H=4, SNR L=1, P=1, so according to number of bits value KH and KL, the constellation mapping table of determining the planisphere correspondence is constellation mapping table 1 and the formula (7) in the step 302, is not difficult to draw average power and equals 1 4 ( d min , L 2 + d min , H 2 ) , If this power equals given transmitting power 1, just have
1 4 ( d min , L 2 + d min , H 2 ) = 1
Simultaneously, have according to formula (5):
d min , L 2 d min , H 2 = SNR H SNR L = 4
According to two unknown number d of above-mentioned two solution of equations Min, LAnd d Min, H, then calculate and can get:
d min , H = 2 / 5 , d min , L = 4 / 5
Need to prove that step 300 and step 301 can be regardless of execution sequence.
Step 302: transmitting terminal according in the planisphere that obtains bunch between minimum Eustachian distance between minimum Eustachian distance and point, obtain the data symbol of bit words correspondence after, with the data symbol output that obtains.
In order to obtain the data symbol of bit words correspondence, the invention provides two kinds of methods:
Method one: the default constellation mapping table of inquiry.
The constellation mapping table is used for storing the corresponding relation of planisphere bit words and data symbol computing formula, and wherein the data symbol computing formula comprises real part computing formula and two parts of imaginary part computing formula.Planisphere draws and is preset in transmitting terminal to the constellation mapping table according to the present invention, the constellation mapping table that different planispheres is corresponding different.
Fig. 4 a is the preferable planisphere one of the present invention, and among Fig. 4 a, the composition of bit words is: c L, 0c H, 0, i.e. K HBe 1, K LBe 1, planisphere one is divided into 2 KLBunch, promptly 2 bunches; Every bunch comprises 2 KH, i.e. 2 constellation point.As seen, bit words adopts Gray code to encode from Fig. 4 a, and wherein cluster comprises bit words 10 and bit words 11, and another bunch comprises bit words 00 and bit words 01; Euclidean distance shown in 11 of bit words 01 and the bit words is d Min, L, the Euclidean distance shown in 10 of bit words 11 and the bit words is d Min, H, according to the planisphere one shown in Fig. 4 a, draw the constellation mapping table of this planisphere correspondence easily, as shown in table 1:
Bit words The real part of constellation point The imaginary part of constellation point
00 d min,L/2 -d min,H/2
01 d mim,L/2 d min,H/2
10 -d min,L/2 -d min,H/2
11 -d min,L/2 d min,H/2
Table 1
With planisphere shown in Fig. 4 a is example, supposes that the bit words that generates in the step 300 is 01, and in this step, by inquiring about default table 1, the data symbol computing formula that can obtain bit words 01 correspondence is respectively: real part equals d Min, L/ 2, imaginary part equals d Min, H/ 2; Then according to the d that obtains in the step 301 Min, LAnd d Min, H, can calculate the data symbol of bit words 01 correspondence.
Fig. 4 b is the preferable planisphere two of the present invention, and among Fig. 4 b, the composition of bit words is: c L, 0c H, 0c H, 1, i.e. K HBe 2, K LBe 1, planisphere two is divided into 2 KLBunch, promptly 2 bunches; Every bunch comprises 2 KH, i.e. 4 constellation point.As seen, bit words adopts Gray code to encode from Fig. 4 b, and wherein cluster comprises bit words 110, bit words 111, and bit words 101 and bit words 100, another bunch comprises bit words 010, bit words 011, bit words 001 and bit words 000; Euclidean distance shown in 101 of bit words 001 and the bit words is d Min, L, the Euclidean distance shown in 111 of bit words 101 and the bit words is d Min, H, according to the planisphere two shown in Fig. 4 b, draw the constellation mapping table of this planisphere correspondence easily, as shown in table 2:
Bit words The real part of constellation point The imaginary part of constellation point
000 d min,L/2 3d min,H/2
001 d min,L/2 d min,H/2
010 d min,L/2 -3d min,H/2
011 d min,L/2 -d min,H/2
100 -d min,L/2 3d min,H/2
101 -d min,L/2 d min,H/2
110 -d min,L/2 -3d min,H/2
111 -d min,L/2 -d min,H/2
Table 2
With planisphere shown in Fig. 4 b is example, supposes that the bit words that generates in the step 300 is 010, and in this step, by inquiring about default table 2, the computing formula that can obtain the data symbol of bit words 010 correspondence is respectively: real part equals d Min, L/ 2, imaginary part equals-3d Min, H/ 2; Then according to the d that obtains in the step 301 Min, LAnd d Min, H, can calculate the data symbol of bit words 010 correspondence.
Fig. 4 c is the preferable planisphere three of the present invention, and among Fig. 4 c, the composition of bit words is: c L, 0c H, 0c H, 1c H, 2, i.e. K HBe 3, K LBe 1, planisphere three is divided into 2 KLBunch, promptly 2 bunches; Every bunch comprises 2 KH, i.e. 8 constellation point.From Fig. 4 c as seen, bit words adopts Gray code to encode, wherein cluster comprises bit words 1110,1010,1111,1011,1101,1001,1100 and bit words 1000, and another bunch comprises bit words 0010,0110,0011,0111,0001,0101,0000 and bit words 0100; Euclidean distance shown in 1000 of bit words 0000 and the bit words is d Min, L, the Euclidean distance shown in 1001 of bit words 1000 and the bit words is d Min, H, according to the planisphere three shown in Fig. 4 c, draw the constellation mapping table of this planisphere correspondence easily, as shown in table 3:
Bit words The real part of constellation point The imaginary part of constellation point
0000 d min,L/2 3d min,H/2
0001 d min,L/2 d min,H/2
0010 d min,L/2 -3d min,H/2
0011 d min,L/2 -d min,H/2
0100 d min,L/2+d min,H 3d min,H/2
0101 d min,L/2+d min,H d min,H/2
0110 d min,L/2+d min,H -3d min,H/2
0111 d min,L/2+d min,H -d min,H/2
1000 -d min,L/2 3d min,H/2
1001 -d min,L/2 d min,H/2
1010 -d min,L/2 -d min,H/2
1011 -d min,L/2 -d min,H/2
1100 -d min,L/2-d min,H 3d min,H/2
1101 -d min,L/2-d min,H d min,H/2
1110 -d min,L/2-d min,H -d min,H/2
1111 -d min,L/2-d min,H -d min,H/2
Table 3
With planisphere shown in Fig. 4 c is example, supposes that the bit words that generates in the step 300 is 0101, and in this step, by inquiring about default table 3, the computing formula that can obtain the data symbol of bit words 0101 correspondence is respectively: real part equals d Min, L/ 2+d Min, H, imaginary part equals d Min, H/ 2; Then according to the d that obtains in the step 301 Min, LAnd d Min, H, can calculate the data symbol of bit words 0101 correspondence.
Fig. 4 d is the preferable planisphere four of the present invention, and among Fig. 4 d, the composition of bit words is: c L, 0c L, 1c H, 0, i.e. K HBe 1, K LBe 2, planisphere four is divided into 2 KLBunch, promptly 4 bunches; Every bunch comprises 2 KH, i.e. 2 constellation point.From Fig. 4 d as seen, bit words adopts Gray code to encode, and wherein cluster comprises that bit words 000 and bit words comprise bit words 100 and bit words 101 for 001, the second bunch, the 3rd bunch comprises bit words 111 and bit words 110, and last cluster comprises bit words 010 and bit words 011; Euclidean distance shown in 000 of bit words 100 and the bit words is d Min, L, the Euclidean distance shown in 101 of bit words 100 and the bit words is d Min, H, and the line of 101 of bit words 100 and bit words and transverse axis are in angle of 45 degrees, according to the planisphere four shown in Fig. 4 d, draw the constellation mapping table of this planisphere correspondence easily, as shown in table 4:
Bit words The real part of constellation point The imaginary part of constellation point
000 d min,L/2 d min,L/2+d min,H/
001 d min,L/2+d min,H/ d min,L/2
010 d min,L/2 -d min,L/2-d min,H/
011 d min,L/2+d min,H/ -d min,L/2
100 -d min,L/2 d min,L/2+d min,H/
101 -d min,L/2-d min,H/ d min,L/2
110 -d min,L/2 -d min,L/2-d min,H/
111 -d min,L/2-d min,H/ -d min,L/2
Table 4
With planisphere shown in Fig. 4 d is example, supposes that the bit words that generates in the step 300 is 101, and in this step, by inquiring about default table 4, the computing formula that can obtain the data symbol of bit words 101 correspondences is respectively: real part equals-d Min, L/ 2-d Min, H/ , imaginary part equals d Min, L/ 2; Then according to the d that obtains in the step 301 Min, LAnd d Min, H, can calculate the data symbol of bit words 101 correspondences.
Fig. 4 e is the preferable planisphere five of the present invention, and among Fig. 4 e, the composition of bit words is: c L, 0c L, 1c H, 0c H, 1, i.e. K HBe 2, K LBe 2, planisphere five is divided into 2 KLBunch, promptly 4 bunches; Every bunch comprises 2 KH, i.e. 4 constellation point.From Fig. 4 e as seen, bit words adopts Gray code to encode, wherein cluster comprises bit words 0000,0010,0011 and bit words 0001, second bunch comprises bit words 1010,1000,1001 and bit words 1011, the 3rd bunch comprises bit words 1101,1111,1100 and bit words 1110, and last cluster comprises bit words 0111,0101,0110 and bit words 0100; Euclidean distance shown in 0011 of bit words 1011 and the bit words is d Min, L, the Euclidean distance shown in 0000 of bit words 0010 and the bit words is d Min, H, according to the planisphere five shown in Fig. 4 e, draw the constellation mapping table of this planisphere correspondence easily, as shown in table 5:
Bit words The real part of constellation point The imaginary part of constellation point
0000 d min,L/2+d min,H d min,L/2+d min,H
0001 d min,L/2+d min,H d min,L/2
0010 d min,L/2 d min,L/2+d min,H
0011 d min,L/2 d min,L/2
0100 d min,L/2+d min,H -d min,L/2-d min,H
0101 d min,L/2+d min,H -d min,L/2
0110 d min,L/2 -d min,L/2-d min,H
0111 -d min,L/2 -d min,L/2
1000 -d min,L/2-d min,H d min,L/2+d min,H
1001 -d min,L/2-d min,H d min,L/2
1010 -d min,L/2 d min,L/2+d min,H
1011 -d min,L/2 d min,L/2
1100 -d min,L/2-d min,H -d min,L/2-d min,H
1101 -d min,L/2-d min,H -d min,L/2
1110 -d min,L/2 -d min,L/2-d min,H
1111 -d min,L/2 -d min,L/2
Table 5
With planisphere shown in Fig. 4 e is example, supposes that the bit words that generates in the step 300 is 1110, and in this step, by inquiring about default table 5, the computing formula that can obtain the data symbol of bit words 1110 correspondences is respectively: real part equals-d Min, L/ 2, imaginary part equals-d Min, L/ 2-d Min, HThen according to the d that obtains in the step 301 Min, LAnd d Min, H, can calculate the data symbol of bit words 1110 correspondences.
Be example only below, the specific implementation method of step 302 of the present invention has been described,, enumerate no longer one by one here for other planisphere that meets requirement of the present invention with five preferable planispheres that meet requirement of the present invention.All can adopt the inventive method to obtain the data symbol of transmitting terminal bit words correspondence so long as meet the planisphere of planisphere requirement of the present invention, reaching the receptivity that the present invention guaranteed each user simultaneously is consistent, simultaneously under the condition of given transmitting power, make receiving terminal obtain the purpose of more performance even higher spectrum efficiency.
Method two: the default constellation correspondence table of inquiry.
The constellation correspondence table is used for storing the corresponding relation of planisphere bit words and data symbol, and wherein data symbol comprises the value of real part and two parts of value of imaginary part.Constellation correspondence table constellation mapping table according to the present invention calculates and is preset in transmitting terminal, and the parameter in certain planisphere of the present invention is as d Min, HAnd d Min, LDeng the corresponding different constellation correspondence table of different values, that is to say that certain opens constellation mapping table described in the method one, according to d Min, HAnd d Min, LDifferent value, corresponding different constellation correspondence table.
Like this, in step 302, only need the d that obtains according in the bit words that generates in the step 300, the step 301 Min, LAnd d Min, H,, can directly draw the data symbol of bit words correspondence by the default constellation correspondence table of inquiry transmitting terminal.
Generally can adopt the processing of method two, store the constellation correspondence table of several parameters commonly used of several planisphere correspondences at transmitting terminal in advance, can save loaded down with trivial details computational process like this according to actual conditions.
Method from above multi-user association constellation mapping of the present invention, as can be seen, according to pairing constellation mapping table of the planisphere that satisfies requirement of the present invention or constellation correspondence table, the data symbol that after transmitting terminal is united constellation mapping to multi-user's combined bit word, obtains, when having guaranteed this data symbol of receiving terminal demodulation, each user's error sign ratio approximately equal, thus the consistency of receptivity guaranteed; In addition, under the condition of given transmitting power, can make receiving terminal obtain more performance even higher spectrum efficiency.
Need to prove, more than be that example is described in detail the inventive method only with two users' associating constellation mapping, method of the present invention also is applicable to three or three above users' associating constellation mapping.
The preferable planisphere six of the present invention that Fig. 4 f is is example with three users, the signal to noise ratio of supposing user 1 is SNR 1, user 2 signal to noise ratio is SNR 2, user 3 signal to noise ratio is SNR 3, and SNR 1<SNR 2<SNR 3, then:
d min , 1 2 d min , 2 2 = SNR 2 SNR 1 , d min , 2 2 d min , 3 2 = SNR 3 SNR 2
Among Fig. 4 f, the composition of bit words is: c 1c 2c 3, i.e. K 1Be 1, K 2Be 1, K 3Be 1, as seen, bit words adopts Gray code to encode among Fig. 4 f, and planisphere six is divided into 2 KLBig bunch, promptly 2 big bunches; First bunch of bit words is 000,001,010,011, and second largest bunch comprises bit words 100,101,110,111; Each big bunch comprises two 2 K2Tuftlet, i.e. 2 each tuftlet, first bunch first tuftlet is 000,001, first bunch second tuftlet is 010,011; Second largest bunch first tuftlet is 100,101, and second largest bunch second tuftlet is 110,111.Tuftlet number in user 1 the bit identification big bunch number, one big bunch of user 2 bit identification, user 3 then identifies certain point under the tuftlet in one big bunch.。From the Euclidean distance shown in 110 of bit words 010 and the bit words is d Min, 1, the Euclidean distance shown in 010 of bit words 011 and the bit words is d Min, 3, the Euclidean distance shown in 001 of bit words 011 and the bit words is d Min, 2, according to the planisphere six shown in Fig. 4 e, draw the constellation mapping table of this planisphere correspondence easily, as shown in table 6:
Bit words The real part of constellation point The imaginary part of constellation point
000 d min,2/2 d min,3/2
001 d min,2/2 d min,3/2+d min,1
010 -d min,2/2 d min,3/2
011 -d min,2/2 d min,3/2+d min,1
100 d min,2/2 -d min,3/2
101 d min,2/2 -d min,3/2-d min,1
110 -d min,2/2 -d min,3/2
111 -d min,2/2 -d min,3/2-d min,1
Table 6
The above is preferred embodiment of the present invention only, is not to be used to limit protection scope of the present invention.

Claims (15)

1. the multiplexing method of a multiple user signals is characterized in that, transmitting terminal is carried out following processing to the bit stream of two different signal to noise ratio users in the bit stream that receives:
A. according to default number of bits value K LAnd K H, from low signal-to-noise ratio user's bit stream and high s/n ratio user's bit stream, take out K respectively LIndividual bit and K HIndividual bit, and with the K that takes out LIndividual bit and K HIndividual bit combination generates a constellation point among the bit words constellation figure; Obtain simultaneously in the planisphere bunch between minimum Eustachian distance and the point between minimum Eustachian distance;
B. according in the described planisphere bunch between minimum Eustachian distance between minimum Eustachian distance and point, export after obtaining the data symbol of current bit words correspondence.
2. method according to claim 1 is characterized in that, described in the steps A with the K that takes out LIndividual bit and K HThe method that individual bit combination generates a bit words is: first bit to the K that takes out from described low signal-to-noise ratio user's bit stream LIndividual bit-order is arranged in the preceding K of described bit words LThe position, first bit to the K that from high s/n ratio user's bit stream, takes out HIndividual bit-order is arranged in the back K of described bit words HThe position.
3. method according to claim 1.It is characterized in that described planisphere is the planisphere that meets the following conditions:
2 KLBunch and every bunch comprise 2 KHIndividual constellation point, certain constellation point in the bit that from low signal-to-noise ratio user's bit stream, takes out corresponding bunch number, corresponding bunch of the bit that from high s/n ratio user's bit stream, takes out;
Between bunch minimum Eustachian distance square and the point between minimum Eustachian distance square ratio, equal low signal-to-noise ratio user's the signal to noise ratio and the inverse of the ratio of high s/n ratio user's signal to noise ratio; Perhaps, between bunch minimum Eustachian distance square and the point between minimum Eustachian distance square ratio, equal low signal-to-noise ratio user's the signal to noise ratio and the value of the inverse and the default degree of approximation adjusted value added/subtracted gained of the ratio of high s/n ratio user's signal to noise ratio;
The value of each bit words is corresponding one by one with each constellation point.
4. method according to claim 3 is characterized in that, between obtaining described in the steps A in the planisphere bunch between minimum Eustachian distance and some the method for minimum Eustachian distance be: according to described number of bits value K HAnd K L, known two users the noise given transmitting power P of transmitting terminal when, obtain in the planisphere bunch between minimum Eustachian distance between minimum Eustachian distance and point.
5. method according to claim 4 is characterized in that, described obtain in the planisphere bunch between between minimum Eustachian distance and some the method for minimum Eustachian distance be:
A1. according to described number of bits value K HAnd K L, select corresponding constellation mapping table;
A2., the average power that all constellation point in the described planisphere are set equals described given transmitting power P, and according to minimum Eustachian distance between described bunch square and point between minimum Eustachian distance square ratio, equal low signal-to-noise ratio user's the signal to noise ratio and the inverse of the ratio of high s/n ratio user's signal to noise ratio, calculate in the planisphere bunch between Euclidean distance between minimum Eustachian distance and point; Perhaps, according to bunch between minimum Eustachian distance square and the point between minimum Eustachian distance square ratio, equal low signal-to-noise ratio user's the signal to noise ratio and the value of the inverse and the default degree of approximation adjusted value added/subtracted gained of the ratio of high s/n ratio user's signal to noise ratio, calculate in the planisphere bunch between Euclidean distance between minimum Eustachian distance and point.
6. method according to claim 5 is characterized in that, selects the method for corresponding constellation mapping table to be described in the steps A 1: according to the number of bits value K that is pre-stored in transmitting terminal HAnd K LWith the one-to-one relationship of constellation mapping table, select corresponding constellation mapping table.
7. method according to claim 5 is characterized in that, the method for calculating the average power of constellation point in the planisphere described in the steps A 2 is:
A21. from described constellation mapping table, take out the data symbol of each constellation point;
A22. respectively the data symbol of each constellation point is taken absolute value back square, will square after each income value addition, calculate the merchant of income value and constellation point sum after the addition at last.
8. method according to claim 3 is characterized in that, between obtaining described in the steps A in the planisphere bunch between minimum Eustachian distance and some the method for minimum Eustachian distance be: minimum Eustachian distance is a normalized value between default described point; According to minimum Eustachian distance between the point in two users' signal to noise ratio and the default planisphere, obtain in the planisphere bunch between minimum Eustachian distance.
9. method according to claim 8, it is characterized in that, described obtain in the planisphere bunch between the method for minimum Eustachian distance be: the merchant who calculates described high s/n ratio user's signal to noise ratio and low signal-to-noise ratio user's signal to noise ratio, gained merchant minimum Eustachian distance square long-pending again and between the point in the described default planisphere calculated the square root of income value at last.
10. method according to claim 8 is characterized in that, this method also comprises: default degree of approximation adjusted value;
Described obtain in the planisphere bunch between the method for minimum Eustachian distance be: the merchant who calculates described high s/n ratio user's signal to noise ratio and low signal-to-noise ratio user's signal to noise ratio, minimum Eustachian distance square long-pending again and between the point in the described default planisphere after gained merchant and the default degree of approximation adjusted value added/subtracted calculated the square root of income value at last.
11. method according to claim 3 is characterized in that, the method for obtaining the data symbol of current bit words correspondence described in the step B is:
B1. the bit words that generates according to steps A, inquiry is used for storing the bit words of planisphere and the constellation mapping table that prestores of the corresponding relation of data symbol computing formula, obtains the data symbol computing formula of correspondence;
B2. according in the planisphere of described acquisition bunch between the data symbol computing formula of Euclidean distance and acquisition between point in the Euclidean distance, default planisphere, calculate the data symbol of described current bit words correspondence.
12. method according to claim 11 is characterized in that: described data symbol computing formula comprises real part computing formula and imaginary part computing formula;
Described data symbol computing formula according in the described planisphere of difference bunch between between minimum Eustachian distance and some minimum Eustachian distance draw, and be preset in transmitting terminal.
13. method according to claim 3 is characterized in that, the method for obtaining the data symbol of current bit words correspondence described in the step B is:
According to described bit words, inquiry is used for storing the bit words of planisphere and the constellation correspondence table of presetting of the corresponding relation of data symbol, obtains the data symbol of current bit words correspondence.
14. method according to claim 13 is characterized in that: this method further comprises: in the default planisphere bunch between minimum Eustachian distance;
Data symbol in the described constellation correspondence table according in the described planisphere of difference bunch between between minimum Eustachian distance and some minimum Eustachian distance draw, and be preset in transmitting terminal.
15. method according to claim 3 is characterized in that, described planisphere further meets the following conditions:
Between different bunches, between all adjacent constellation point bunch between Euclidean distance equate and be bunch between minimum Eustachian distance; In cluster, the Euclidean distance between all adjacent constellation point equates and is minimum Eustachian distance between point;
Described constellation point adopts Gray code Gray to encode.
CN200510091243A 2005-08-12 2005-08-12 multiplexing method for multi-user signal Expired - Fee Related CN100578999C (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN200510091243A CN100578999C (en) 2005-08-12 2005-08-12 multiplexing method for multi-user signal

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN200510091243A CN100578999C (en) 2005-08-12 2005-08-12 multiplexing method for multi-user signal

Publications (2)

Publication Number Publication Date
CN1913415A true CN1913415A (en) 2007-02-14
CN100578999C CN100578999C (en) 2010-01-06

Family

ID=37722205

Family Applications (1)

Application Number Title Priority Date Filing Date
CN200510091243A Expired - Fee Related CN100578999C (en) 2005-08-12 2005-08-12 multiplexing method for multi-user signal

Country Status (1)

Country Link
CN (1) CN100578999C (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101896919A (en) * 2007-12-11 2010-11-24 Nxp股份有限公司 A method of allocating digital data coming from transponders and a reader thereto
CN107944316A (en) * 2017-10-16 2018-04-20 西北大学 Multi-tag signal parallel coding/decoding method and system in a kind of backscattering agreement
CN113242112A (en) * 2021-05-12 2021-08-10 天津大学 Constellation diagram optimization method of 6-QAM and LDPC code combination scheme
US20230184926A1 (en) * 2021-12-15 2023-06-15 GM Global Technology Operations LLC Radar anti-spoofing system for identifying ghost objects created by reciprocity-based sensor spoofing

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101896919A (en) * 2007-12-11 2010-11-24 Nxp股份有限公司 A method of allocating digital data coming from transponders and a reader thereto
CN101896919B (en) * 2007-12-11 2013-05-22 Nxp股份有限公司 A method of allocating digital data coming from transponders and a reader thereto
US9013277B2 (en) 2007-12-11 2015-04-21 Nxp B.V. Method of allocating digital data coming from transponders and a reader thereto
CN107944316A (en) * 2017-10-16 2018-04-20 西北大学 Multi-tag signal parallel coding/decoding method and system in a kind of backscattering agreement
CN107944316B (en) * 2017-10-16 2019-08-02 西北大学 Multi-tag signal parallel coding/decoding method and system in a kind of backscattering agreement
CN113242112A (en) * 2021-05-12 2021-08-10 天津大学 Constellation diagram optimization method of 6-QAM and LDPC code combination scheme
CN113242112B (en) * 2021-05-12 2022-04-08 天津大学 Constellation diagram optimization method of 6-QAM and LDPC code combination scheme
US20230184926A1 (en) * 2021-12-15 2023-06-15 GM Global Technology Operations LLC Radar anti-spoofing system for identifying ghost objects created by reciprocity-based sensor spoofing

Also Published As

Publication number Publication date
CN100578999C (en) 2010-01-06

Similar Documents

Publication Publication Date Title
CN1272916C (en) Transmitting power control method for radio communication system
CN1284317C (en) OFDM transmitting and receiving apparatus
CN1893335A (en) Method for supporting multi-stage modulation by controlling high-speed down-converter grouped access system
CN1930804A (en) Method and apparatus for constructing map ie using reduced cid in broadband ofdma systems
CN1894876A (en) Multiplexing and transmission of multiple data streams in a wireless multi-carrier communication system
CN1832388A (en) Method and system for transmitting information in communication system
CN1951079A (en) Iterative channel and interference estimation and decoding
CN1893342A (en) Multi-carrier-wave IISDPA business trans mission channel code processing method and coding apparatus
CN1780278A (en) Self adaptable modification and encode method and apparatus in sub-carrier communication system
CN1650563A (en) Communication terminal device and base station device
CN101064865A (en) Method and apparatus for resource scheduling of cellular mobile communication system
CN101064927A (en) Device and method for indicating channel resources distribution in wireless communication system
CN1882191A (en) Information notification method, mobile communication system, base station and mobile station
EP2139141A3 (en) Method and apparatus for designing modulation and coding set of communication system
CN101047840A (en) Channel interleaving method and system in hand TV system
CN101076139A (en) Method for indicating telecommunication system resources and system, transmitter and receiver
CN101043484A (en) Non-equal multi-user high order modulation approach
CN1684455A (en) System and method for spreading on fading channels
CN1921363A (en) Method and system for creating time-frequency two-dimensional pilot pattern
CN1525674A (en) Multi transmission/reception orthogonal frequency division multiplexing system and method
CN1674482A (en) Method and apparatus for detecting normalized iterative soft interference cancelling signal
CN101064955A (en) Device and method for allocating channel resource
CN1717884A (en) Multi-carrier transmission device, multi-carrier reception device, and multi-carrier radio communication method
CN1913415A (en) Multi-use method of multi-user signal
CN101064562A (en) Device and method for reducing bit expense of resource distribution information in control signaling

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
C17 Cessation of patent right
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20100106

Termination date: 20130812