CN106656426A - Communication method with information transmission weight - Google Patents
Communication method with information transmission weight Download PDFInfo
- Publication number
- CN106656426A CN106656426A CN201710054593.3A CN201710054593A CN106656426A CN 106656426 A CN106656426 A CN 106656426A CN 201710054593 A CN201710054593 A CN 201710054593A CN 106656426 A CN106656426 A CN 106656426A
- Authority
- CN
- China
- Prior art keywords
- group
- stream
- domain
- data code
- weight
- 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
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
- H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
- H04L1/0006—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the transmission format
-
- 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
- H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
- H04L1/0023—Systems modifying transmission characteristics according to link quality, e.g. power backoff characterised by the signalling
-
- 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
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0045—Arrangements at the receiver end
- H04L1/0052—Realisations of complexity reduction techniques, e.g. pipelining or use of look-up tables
- H04L1/0053—Realisations of complexity reduction techniques, e.g. pipelining or use of look-up tables specially adapted for power saving
-
- 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
- H04L1/0078—Avoidance of errors by organising the transmitted data in a format specifically designed to deal with errors, e.g. location
- H04L1/0079—Formats for control data
-
- 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
- H04L1/24—Testing correct operation
- H04L1/245—Testing correct operation by using the properties of transmission codes
- H04L1/246—Testing correct operation by using the properties of transmission codes two-level transmission codes, e.g. binary
Abstract
The invention relates to a communication method with information transmission weight. The method comprises the following steps: distributing modulation domains to multiple groups of serial data code streams to be modulated and transmitted according to the weight coefficients; processing the serial data code streams according to the corresponding modulation domains to form a synthesized data stream; and then implementing modulated transmission on the synthesized data stream, and finally receiving and restoring a merged data code stream from a channel through two different methods. According to the communication method disclosed by the invention, the data code stream with higher information weight can occupy a wider modulation domain under limited channel resources, and thus more excellent signal-to-noise ratio can be achieved.
Description
Technical field
The present invention relates to the communications field, particularly a kind of communication means with information transfer weight.
Background technology
In communication applications various information have a different importance, Conventional communication techniques often to the importance of information not
Plus distinguish, and adopt impartial transmission.In the case where channel has noise jamming, transmit because all information are impartial, then it is important
The loss of information will greatly reduce communication quality.
The content of the invention
In view of this, the purpose of the present invention is to propose to a kind of communication means with information transfer weight, existing to overcome
Defect present in technology.
The present invention is realized using below scheme：A kind of communication means with information transfer weight, comprises the following steps：
Step S1：By the serial data bit stream S of n groups transmitting to be modulated1(t),S2(t),...,Sn(t), according to per group string
Row data code flow correspondence and the weighted coefficient distribution modulation domain for weighing data message importance；
Step S2：N groups serial data bit stream is carried out according to corresponding modulating domain to form a generated data stream after numerical value process；
Step S3：The generated data stream is modulated, is concurrently incident upon in channel；
Step S4：Receive from channel and restore the merging data code stream and n group serial data bit streams.
In an embodiment of the present invention, the modulation domain that every group of serial data bit stream is distributed is directly proportional to its weight coefficient,
And weight coefficient is bigger, the modulation domain distributed is bigger.
In an embodiment of the present invention, in step S1, have such as between the modulation domain that the serial data bit stream is distributed
Lower relation：
(1) the modulation domain sum of each group serial data bit stream is no more than total modulation domain M of systemt；
(2) n groups serial data bit stream S1(t),S2(t),...,SnT the carrying out of () by weight coefficient from small to large arranges, full
Sufficient j>I, then serial data bit stream SjThe weight coefficient A of (t)jMore than serial data bit stream SiThe weight coefficient A of (t)i；Minimum
Weight coefficient is A1=1；
(3) jth group serial data bit stream SjThe weight coefficient A of (t)jIt is less than AjAll weight coefficient (Aj-1:A1)
Summation adds surplus kj, kjMore than 1；
(4) jth group serial data bit stream SjT modulation domain that () is occupied is its weight coefficient AjWith minimum weighting coefficient A1
Corresponding modulation domain M1Product.
In an embodiment of the present invention, in step S2, by every group of serial data bit stream instantaneous value and its modulation domain
Numerical value multiplication is carried out, and the results added of multiplication is merged into into the generated data stream.
In an embodiment of the present invention, in step S4, also comprise the steps：
Step S411：Current time receives from channel and restores the reception being made up of n group weight binary data code streams
The numerical value of merging data code stream Cr (t), and remember the weight coefficient of n group data code flows from greatly to little for An>An-1>An-2…>A1；
Step S412：Reception merging data code stream Cr (t) currency is set to into n-th group receiving data code stream Srn
(t) judgement input Cin, and will determine that threshold value is set to：
P=Mn-h×kn×M1；
Wherein, h for be less than more than 01 judgement factor；
Step S413：Judge current CinWhether numerical value is more than P；If it is greater, then by n-th group receiving data code stream Srn(t)
Currency is set to binary value 1, is otherwise binary value 0；
Step S414：Judge whether to complete the reduction of current time n group data code flow numerical value, if it is not, then going to step
S415, otherwise, goes to step step S417；
Step S415：(n+1)th-j group receiving data code stream Sr are setn+1-jT () judgement input is Cin=Cin-Srn-j+2(t)
×Mn-j+2；Will determine that threshold value is set to：
P=Mn+1-j-h×kn+1-j×M1；
Step S416：Judge current CinWhether P is more than；If it is greater, then making the (n+1)th-j organize receiving data code stream Srn+1-j
T () current value is binary value 1, be otherwise binary value 0, and goes to step S414；
Step S417：The numerical value of merging data code stream Cr (t) subsequent time is obtained, and goes to step S412.
In an embodiment of the present invention, in step S4, also comprise the steps：
Step S421：Receive from channel and restore merging data code stream Cr(t), CrT () is by n group weight binary data
Code stream constitute, and the weight coefficient of n group data code flows from greatly to little for An>An-1>An-2…>A1；
Step S422：Calculate jth group receiving data code stream S to be restoredrjRequired for (t) 2n-jIndividual judgement domain；
Step S423：Continuously judge CrT whether the numerical value of () is in judgement domain, if be in judgement domain, by phase
The S for answeringrjT the value of () is 1, be otherwise 0.
In an embodiment of the present invention, in step S422, there is 2n-jIndividual judgement domain, each judgement domain is by adjudicating
Bias PBWith decision range (PL:PH) composition is added, the decision range in each judgement domain is identical, and it is different to adjudicate bias.
In an embodiment of the present invention, lower limit value P of the decision rangeLFor jth group code stream modulation domain MjDeduct h × kj
×M1, h for be less than more than 01 judgement factor, the ceiling value P of the decision rangeHA is not higher than for all weight coefficientsj's
Modulation domain adds h × k after being addedj×M1；
The judgement bias PBIt is more than A for all weight coefficientsjModulation domain in the case where combination coefficient is 1 or 0
Whole linear combinations；
Compared with prior art, the present invention has following beneficial effect：It is proposed by the present invention logical with information transfer weight
Letter mechanism, under limited channel resources, can enable the information weight higher data code flow of weight occupy wider modulation domain, from making it
With more excellent signal to noise ratio.In the higher data code flow of demodulating information weight ratio, the present invention can be realized identical receiving terminal
The more excellent quality of reception；Or in the case where data reception quality is constant, the present invention can be using more low-power consumption or less hard
Part expense is realizing the reduction of important information.
Description of the drawings
Fig. 1 is communication mechanism transmitting terminal schematic diagram in the embodiment of the present invention.
Fig. 2 is the schematic flow sheet of the demodulation method one in the embodiment of the present invention.
Fig. 3 is S in one embodiment of the invention1(t)、S2(t)、S3(t), C (t) and final output y after frequency modulation(PFM)
The waveform of (t).
Fig. 4 carries out parsing and obtains Sr for demodulation method two in one embodiment of the invention to it3(t) waveform.
Fig. 5 carries out parsing and obtains Sr for demodulation method two in one embodiment of the invention to it2(t) waveform.
Fig. 6 carries out parsing and obtains Sr for demodulation method two in one embodiment of the invention to it1(t) waveform.
Specific embodiment
Below in conjunction with the accompanying drawings and embodiment the present invention will be further described.
As shown in figure 1, present embodiments providing a kind of communication means with information transfer weight, following step is specifically included
Suddenly：
Step S1：By the serial data bit stream S of n groups transmitting to be modulated1(t),S2(t),...,Sn(t), according to per group string
Row data code flow correspondence and the weighted coefficient distribution modulation domain for weighing data message importance；In the present embodiment, each group
Data code flow information contained importance, using weight coefficient the importance of scaling information is carried out, and by jth group data code flow Sj
T weight coefficient that () has is designated as Aj；
Step S2：N groups serial data bit stream is carried out according to corresponding modulating domain to form a generated data stream after numerical value process；
Step S3：The generated data stream is modulated, is concurrently incident upon in channel；
Step S4：Receive from channel and restore the merging data code stream and n group serial data bit streams.
Further, in the present embodiment, the modulation domain that every group of serial data bit stream is distributed is with its weight coefficient into just
Than, and weight coefficient is bigger, the modulation domain distributed is bigger.When transmitting is modulated, data code flow SjTune shared by (t)
Domain M processedjWith weight coefficient AjIt is directly proportional.
Further, in the present embodiment, in step S1, have between the modulation domain that serial data bit stream is distributed as follows
Relation：
(1) the modulation domain sum of each group serial data bit stream is no more than total modulation domain M of systemt；
(2) n groups serial data bit stream S1(t),S2(t),...,SnT the carrying out of () by weight coefficient from small to large arranges, full
Sufficient j>I, then serial data bit stream SjThe weight coefficient A of (t)jMore than serial data bit stream SiThe weight coefficient A of (t)i；Minimum
Weight coefficient is A1=1；
(3) jth group serial data bit stream SjThe weight coefficient A of (t)jIt is less than AjAll weight coefficient (Aj-1:A1)
Summation adds surplus kj, kjHave to be larger than 1；
(4) modulation domain that jth group serial data bit stream is occupied is its weight coefficient AjWith A1Corresponding lowest modulation domain
M1Product.
Further, in the present embodiment, in step s 2, every group of serial data bit stream instantaneous value and its modulation domain are entered
Line number value is multiplied, and the results added of multiplication is merged into into the generated data stream.
Further, in the present embodiment, in step s 4, as shown in Figure 2, there is provided a kind of demodulation method, it is including as follows
Step：
Step S411：Current time receives from channel and restores the reception being made up of n group weight binary data code streams
The numerical value of merging data code stream Cr (t), and remember the weight coefficient of n group data code flows from greatly to little for An>An-1>An-2…>A1；
Step S412：Merging data code stream Cr (t) currency will be received and be set to n-th group receiving data code stream SrnT () is sentenced
Certainly it is input into CinAnd will determine that threshold value is set to：
P=Mn-h×kn×M1；
Wherein, h for be less than more than 01 judgement factor；
Step S413：Judge current CinWhether numerical value is more than P；If it is greater, then by n-th group receiving data code stream Srn(t)
Currency is set to binary value 1, is otherwise binary value 0；
Step S414：Judge whether to restore the currency of the n group data code flows, if it is not, step S415 is then gone to, it is no
Then, step step S417 is gone to；
Step S415：(n+1)th-j group receiving data code stream Sr are setn+1-jT the judgement input of () is Cin=Cin-Srn-j+2
(t)×Mn-j+2；Will determine that threshold value is set to：
P=Mn+1-j-h×kn+1-j×M1；
Step S416：Judge current CinWhether numerical value is more than P；If it is greater, then making the (n+1)th-j organize receiving data code stream
Srn+1-jT () current value is binary value 1, be otherwise binary value 0, and goes to step S414；
Step S417：Merging data code stream Cr (t) of subsequent time is obtained, and goes to step S412.
Further, in the present embodiment, in step s 4, there is provided another demodulation method, comprise the steps：
Step S421：Receive from channel and restore reception merging data code stream Cr (t), Cr (t) is by n group weight binary systems
Data code flow constitute, and the weight coefficient of n group data code flows from greatly to little for An>An-1>An-2…>A1；
Step S422：Calculate jth group receiving data code stream S to be restoredrjRequired for (t) 2n-jIndividual judgement domain；At this
In embodiment, for 2n-jIndividual judgement domain, each judgement domain is by adjudicating bias PBWith decision range (PL:PH) composition is added, often
The decision range in individual judgement domain is identical, and it is different to adjudicate bias；It is preferred that decision range lower limit value PLFor jth group code stream tune
Domain M processedjDeduct h × kj×M1, h for be less than more than 01 judgement factor, decision range ceiling value PHFor all weight coefficients not
Higher than AjModulation domain be added after, along with h × kj×M1；Judgement biasing PBIt is more than A for all weight coefficientsjModulation domain,
Combination coefficient is the whole linear combinations in the case of 1 or 0.
Step S423：Continuously judge CrT whether the numerical value of () is in judgement domain, if be in judgement domain, by phase
Answer the S at momentrjT the value of () is 1, be otherwise 0.
In order to allow skilled in the art realises that method proposed by the invention, with reference to provided by the present invention above-mentioned
Illustrate in method and specific embodiment.
Hereinafter the communication means to be provided using invention realizes the process of 3 groups of binary data bit streams, and note has 3 groups
Binary data code stream S1(t)、S2(t)、S3T () needs to carry out frequency modulation(PFM) transmitting, respective weights Relationship of Coefficients is A1=1, A2
=2.5, A3=7.System adopts frequency modulated mode, whole modulation domain width MtFor 80kHz, then the modulation of each group code stream is tried to achieve
Domain is M1=7.62kHz, M2=19.05kHz, M3=53.33kHz.Fig. 3 is S in the present embodiment1(t)、S2(t)、S3(t), merge
Data flow C (t) and after frequency modulation(PFM) final output y (t) waveform.
Y (t) is obtained receiving merging data code stream Cr (t) after noisy channel transmission by reception demodulation, according to this enforcement
Second demodulation method described in example, carries out parsing and obtains Sr to it3(t)、Sr2(t) and Sr1(t), respectively such as the institute of Fig. 4,5,6
Show.Can see, due to 3 groups of code stream weights it is different, under identical noise circumstance, weight highest Sr3T () goes out without error code
It is existing, the Sr of weight second2There is a small amount of error code and the minimum Sr of weight in (t)3T () bit error rate is very high.
The foregoing is only presently preferred embodiments of the present invention, all impartial changes done according to scope of the present invention patent with
Modification, should all belong to the covering scope of the present invention.
Claims (8)
1. a kind of communication means with information transfer weight, it is characterised in that：Comprise the following steps：
Step S1：By the serial data bit stream S of n groups transmitting to be modulated1(t),S2(t),...,Sn(t), according to every group of serial number
According to code stream correspondence and for weighing the weighted coefficient distribution modulation domain of data message importance；
Step S2：N groups serial data bit stream is carried out according to corresponding modulating domain to form a generated data stream after numerical value process；
Step S3：The generated data stream is modulated, is concurrently incident upon in channel；
Step S4：Receive from channel and restore the merging data code stream and n group serial data bit streams.
2. a kind of communication means with information transfer weight according to claim 1, it is characterised in that：Every group of serial number
The modulation domain distributed according to code stream is directly proportional to its weight coefficient, and weight coefficient is bigger, and the modulation domain distributed is bigger.
3. a kind of communication means with information transfer weight according to claim 1 and 2, it is characterised in that：Step S1
In, there is following relation between the modulation domain that the serial data bit stream is distributed：
(1) the modulation domain sum of each group serial data bit stream is no more than total modulation domain M of systemt；
(2) n groups serial data bit stream S1(t),S2(t),...,SnT the carrying out of () by weight coefficient from small to large arranges, meet j>
I, then serial data bit stream SjThe weight coefficient A of (t)jMore than serial data bit stream SiThe weight coefficient A of (t)i；Minimum weight
Coefficient is A1=1；(3) jth group serial data bit stream SjThe weight coefficient A of (t)jIt is less than AjAll weight coefficient (Aj-1:A1)
Summation adds surplus kj, kjMore than 1；
(4) jth group serial data bit stream SjT modulation domain that () is occupied is its weight coefficient AjWith A1Corresponding lowest modulation
Domain M1Product.
4. a kind of communication means with information transfer weight according to claim 1, it is characterised in that：In the step
In S2, every group of serial data bit stream instantaneous value and its modulation domain are carried out into numerical value and is multiplied, and the results added of multiplication is merged into
The generated data stream.
5. a kind of communication means with information transfer weight according to claim 3, it is characterised in that：In the step
In S4, also comprise the steps：
Step S411：Current time receives from channel and restores the reception merging being made up of n group weight binary data code streams
The numerical value of data code flow Cr (t), and remember the weight coefficient of n group data code flows from greatly to little for An>An-1>An-2…>A1；
Step S412：Reception merging data code stream Cr (t) currency is set to into n-th group receiving data code stream SrnT () is sentenced
Certainly it is input into Cin, and will determine that threshold value is set to：
P=Mn-h×kn×M1；
Wherein, h for be less than more than 01 judgement factor；
Step S413：Judge current CinWhether numerical value is more than P；If it is greater, then by n-th group receiving data code stream SrnT () is current
Value is set to binary value 1, is otherwise binary value 0；
Step S414：Judge whether to restore the currency of the n group data code flows, if it is not, step S415 is then gone to, otherwise,
Go to step step S417；
Step S415：(n+1)th-j group receiving data code stream Sr are setn+1-jT () judgement input is Cin=Cin-Srn-j+2(t)×
Mn-j+2；Will determine that threshold value is set to：
P=Mn+1-j-h×kn+1-j×M1；
Step S416：Judge current CinWhether numerical value is more than P；If it is greater, then making the (n+1)th-j organize receiving data code stream Srn+1-j
T () current value is binary value 1, be otherwise binary value 0, and goes to step S414；
Step S417：Obtain merging data code stream CrThe numerical value of (t) subsequent time, and go to step S412.
6. a kind of communication means with information transfer weight according to claim 3, it is characterised in that：In the step
In S4, also comprise the steps：
Step S421：Receive from channel and restore reception merging data code stream Cr (t), Cr (t) is by n group weight binary data
Code stream constitute, and the weight coefficient of n group data code flows from greatly to little for An>An-1>An-2…>A1；
Step S422：Calculate jth group receiving data code stream Sr to be restoredjRequired for (t) 2n-jIndividual judgement domain；
Step S423：Whether the continuous numerical value for judging Cr (t) is in judgement domain, if be in judgement domain, when will be corresponding
The Sr at quarterjT the value of () is 1, be otherwise 0.
7. a kind of communication means with information transfer weight according to claim 6, it is characterised in that：In the step
In S422, there is 2n-jIndividual judgement domain, each judgement domain is by adjudicating bias PBWith decision range (PL:PH) composition is added, each
The decision range in judgement domain is identical, and it is different to adjudicate bias.
8. a kind of communication means with information transfer weight according to claim 7, it is characterised in that：The judgement model
Enclose lower limit value PLFor jth group code stream modulation domain MjDeduct h × kj×M1, h for be less than more than 01 judgement factor, the judgement
Scope ceiling value PHA is not higher than for all weight coefficientsjModulation domain be added after add h × kj×M1；
The judgement biasing PBIt is more than A for all weight coefficientsjModulation domain, the whole in the case where combination coefficient is 1 or 0
Linear combination.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710054593.3A CN106656426B (en) | 2017-01-22 | 2017-01-22 | A kind of communication means with information transmission weight |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710054593.3A CN106656426B (en) | 2017-01-22 | 2017-01-22 | A kind of communication means with information transmission weight |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106656426A true CN106656426A (en) | 2017-05-10 |
| CN106656426B CN106656426B (en) | 2019-09-13 |
Family
ID=58841185
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710054593.3A Active CN106656426B (en) | 2017-01-22 | 2017-01-22 | A kind of communication means with information transmission weight |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106656426B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1326624A (en) * | 1998-09-16 | 2001-12-12 | 科学研究公司 | Systems and methods for asynchronous transfer mode and internet protocol |
| CN1741412A (en) * | 2004-08-27 | 2006-03-01 | 清华大学 | Sub-channel distributing method in radio network |
| CN1832613A (en) * | 2006-04-26 | 2006-09-13 | 电子科技大学 | Parallel frequency spectrum distribution method for preventing interference in cognitive radio system |
| CN104113406A (en) * | 2014-08-01 | 2014-10-22 | 黑龙江科技大学 | User bandwidth requirement based OFDMA (Orthogonal Frequency Division Multiple Access) system downlink resource allocation method under imperfect channel state information |
-
2017
- 2017-01-22 CN CN201710054593.3A patent/CN106656426B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1326624A (en) * | 1998-09-16 | 2001-12-12 | 科学研究公司 | Systems and methods for asynchronous transfer mode and internet protocol |
| CN1741412A (en) * | 2004-08-27 | 2006-03-01 | 清华大学 | Sub-channel distributing method in radio network |
| CN1832613A (en) * | 2006-04-26 | 2006-09-13 | 电子科技大学 | Parallel frequency spectrum distribution method for preventing interference in cognitive radio system |
| CN104113406A (en) * | 2014-08-01 | 2014-10-22 | 黑龙江科技大学 | User bandwidth requirement based OFDMA (Orthogonal Frequency Division Multiple Access) system downlink resource allocation method under imperfect channel state information |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106656426B (en) | 2019-09-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Gao et al. | ComNet: Combination of deep learning and expert knowledge in OFDM receivers | |
| Van Luong et al. | Deep learning-based detector for OFDM-IM | |
| US7983333B2 (en) | Non-linear analog decision feedback equalizer | |
| Narayana | Telecommunications services and economic growth: Evidence from India | |
| CN105993151A (en) | Method and apparatus for low power chip-to-chip communications with constrained ISI ratio | |
| CN106027438B (en) | Anti-aliasing modem for analog-digital hybrid amplitude modulation broadcasting system | |
| CN108540415A (en) | Adaptive layered modulation under high-speed mobile environment and service integration transmission method | |
| US11831474B2 (en) | Methods and circuits for decision-feedback equalization using compensated decision regions | |
| CN101641899B (en) | Simplified equalization for correlated channels in OFDMA | |
| CN112583458B (en) | MIMO end-to-end transmission system based on deep learning and wireless transformation network | |
| Li et al. | Deep learning based end-to-end visible light communication with an in-band channel modeling strategy | |
| CN103238304B (en) | Many-valued amplitude modulation device, many-valued amplitude demodulation device and use their transmission system and many-valued amplitude modulation method and many-valued amplitude demodulation method | |
| KR950002302A (en) | Transmission system with advanced equalizer | |
| JP2021536078A (en) | Methods for decryption, computer program products, and devices | |
| CN101821951A (en) | Systems and methods for synchronous, retimed analog to digital conversion | |
| US6434190B1 (en) | Generalized precoder for the upstream voiceband modem channel | |
| US20070147544A1 (en) | FSK signal modulator for producing a binary FSK signal | |
| CN106656426A (en) | Communication method with information transmission weight | |
| Li et al. | Deep-learning-based multi-user framework for end-to-end fiber-MMW communications | |
| CN106533592A (en) | Multi-service data communication method and communication system for underwater acoustic network | |
| CN101958862B (en) | Self-adaptive decision feedback equalizer based on superposing structure | |
| CN1193424A (en) | Adaptive gain controller | |
| Bandjur et al. | Performance analysis of SSC diversity receiver over correlated Ricean fading channels in presence of co-channel interference | |
| TW445733B (en) | System and method for spectrally shaping transmitted data signals | |
| CN106254286A (en) | The adaptive blind equalization method of high-speed parallel process and device |
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 |