CN107359925A - A kind of virtual full duplex relaying transmission method - Google Patents
A kind of virtual full duplex relaying transmission method Download PDFInfo
- Publication number
- CN107359925A CN107359925A CN201710388728.XA CN201710388728A CN107359925A CN 107359925 A CN107359925 A CN 107359925A CN 201710388728 A CN201710388728 A CN 201710388728A CN 107359925 A CN107359925 A CN 107359925A
- Authority
- CN
- China
- Prior art keywords
- relaying
- signal
- information source
- source terminal
- represent
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/14—Relay systems
- H04B7/15—Active relay systems
- H04B7/155—Ground-based stations
- H04B7/15528—Control of operation parameters of a relay station to exploit the physical medium
- H04B7/15542—Selecting at relay station its transmit and receive resources
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L5/00—Arrangements affording multiple use of the transmission path
- H04L5/14—Two-way operation using the same type of signal, i.e. duplex
Landscapes
- Engineering & Computer Science (AREA)
- Signal Processing (AREA)
- Computer Networks & Wireless Communication (AREA)
- Bidirectional Digital Transmission (AREA)
- Radio Relay Systems (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention relates to a kind of virtual full duplex relaying transmission method, in odd numbered slots 2t 1, K information source terminal S1,S2,S3...SKSend a signal to relaying R1, now relay R2The signal that then previous time slot 2t 2 is received is transmitted to K destination end D after decoding and recompiling1,D2,...DK, in even timeslots 2t, K information source terminal S1,S2,S3...SKSend a signal to relaying R2, relay R1The signal that then previous time slot 2t 1 is received is transmitted to K destination end D after decoding and recompiling1,D2,...DK, relay R1With relaying R2Signal reception and transmission, K information source terminal S are carried out in turn1,S2,S3...SKAll the time signal is sent, and K destination end D1,D2,...DKThe efficiency of transmission as full duplex relaying method then is realized in reception signal all the time, and methods described uses two common half-duplex relay alternating receiving and transmitting signals, so avoids full duplex self-interference phenomenon.
Description
Technical field
The present invention relates to wireless communication technology field, more particularly, to a kind of virtual full duplex relaying transmission method.
Background technology
In wireless communication system, when transmitting terminal and receiving terminal it is distant when, transmitting terminal needs to consume larger power
To maintain proper communication, the forwarding that carries out signal by introducing link terminal among transmitting terminal and receiving terminal so can be
Terminal power consumption is reduced to a certain extent, and this technology is referred to as wireless relaying technique.As shown in figure 1, give an allusion quotation
The individual information source terminal S of the wireless relay system of type, wherein K (K >=1)1,S2,S3...SKSignal is sent out under link terminal R auxiliary
It is sent to corresponding K destination end D1,D2,D3...DK, each information source terminal and destination end respectively dispose single antenna in Fig. 1, in
After more antennas of terminal disposition.
For above-mentioned wireless relay communication system, generally use half-duplex relay transmission means, i.e., using 2 time slots come complete
Transmitted into primary information, as shown in figure 1, in odd numbered slots, all information source terminals send a signal to link terminal R；In even number
Signal is transmitted to destination end by gap, link terminal R after certain processing.Because which needs 2 time slots to complete
Primary information transmits, therefore less efficient.For improve efficiency of transmission, propose full duplex relaying transmission technology in recent years, i.e., in
It is full-duplex terminal after terminal R, the reception and transmission of signal can be carried out simultaneously.This full duplex relaying transmission is as shown in Figure 2.
Wherein information source terminal sends a signal to relaying R always, and relaying R uses full-duplex mode, receives the signal from information source terminal
The signal that previous time slot receives is sent to destination end after certain processing simultaneously, and destination end then receives always
From the forward signal of link terminal, this full duplex relaying transmission effectively increases transmission effect compared with conventional half duplex relays
Rate, but full duplex relaying terminal there is also certain drawback, i.e., in the presence of serious self-interference phenomenon, and currently available technology is all adopted
With analog or digital interference cancellation techniques, the technology is extremely complex, and causes higher hardware cost and implementation complexity.
The content of the invention
The technical problems to be solved by the invention, which are to provide one kind, can ensure effectiveness, and link terminal is not
There can be the virtual full duplex relaying transmission method of self-interference phenomenon.
The technical solution adopted in the present invention is a kind of virtual full duplex relaying transmission method, to pass through signal transmission system
To complete, the signal transmission system includes K information source terminal S1,S2,S3...SK, relaying R1, relaying R2And the K stay of two nights is whole
Hold D1,D2,D3...DK, the relaying R1With relaying R2M root antennas are disposed, the transmit power of each information source terminal is PS, relay R1
With relaying R2Transmit power be respectively PR1And PR2, the transmission method transmitted using 2 time slots to complete signal, and setting is strange
Number time slots are 2t-1, wherein even timeslots 2t, t=1,2,3...n, methods described comprises the following steps：
(1), in odd numbered slots 2t-1, K information source terminal S1,S2,S3...SKSend a signal to relaying R1, now relay R2
The signal that then previous time slot 2t-2 is received is transmitted to K destination end D after decoding and recompiling1,D2,...DK；
(2), in even timeslots 2t, K information source terminal S1,S2,S3...SKSend a signal to relaying R2, relay R1Then by before
The signal that one time slot 2t-1 is received is transmitted to K destination end D after decoding and recompiling1,D2,...DK；
(3), return to step (1) continues the transmission and reception of signal, until all signal end of transmissions.
In step (1), an information source terminal S is setkThe signal for needing to send is sk(2t-1), k=1,2,3...K, then
The transmission signal of K information source terminal is with vector representation：S (2t-1)=[s1(2t-1),...sK(2t-1)]T。
In step (1), R is relayed2Signal reception is carried out in previous time slot (2t-2) and detects K obtained information source terminal
Signal can be expressed as：, then can be with after decoding and recompiling
Obtain out-trunk R2Being sent to the signal of K destination end can be expressed as：Wherein α2Table
Show relaying R2Power control ratio, i.e.,Mark computing is asked in wherein tr () expressions,In expression
After R2To the channel coefficient matrix of K destination end, its size is K × M, subscript ()HRepresent conjugate transposition.
In step (1), R is relayed1When receiving the signal from K information source terminal, relaying R now1It can receive and
From K information source terminal and relaying R2The superposed signal of formation, then the superposed signal can be expressed as：Wherein HSR1Represent from K information source terminal to
Relay R1Channel coefficient matrix, its size is M × K, GR2R1Represent relaying R2To relaying R1Channel coefficient matrix its size be
M × M, zR1(2t-1) represents relaying R1White Gaussian noise.
In step (1), k-th of destination end DkReceive from relaying R2Signal can be expressed as：WhereinRepresent from relaying R2To k-th of terminal DkChannel vector,
Its size is 1 × M, zD,k(2t-1) represents k information source terminal DkWhite Gaussian noise, k=1,2,3...K.
In step (2), information source terminal S is setkThe signal for needing to send is s (2t), k=1,2,3...K, then believes for K
The transmission signal of source terminal can be expressed as with vector：S (2t)=[s1(2t),....sK(2t)]T。
In step (2), R is relayed1Signal reception is carried out in previous time slot (2t-1) and detects K obtained information source terminal
Signal can be expressed as：, then can be with after decoding and recompiling
Obtain out-trunk R1Being sent to the signal of K destination end can be expressed as：α1Represent relaying R1
Power control ratio, can be expressed asMark computing is asked in wherein tr () expressions,In expression
After R1To the channel coefficient matrix of K destination end, its size is K × M, subscript ()HRepresent conjugate transposition.
In step (2), R is relayed2When receiving the signal from K information source terminal, relaying R now2It can receive and
From K information source terminal and relaying R1The superposed signal of formation, then the superposed signal can be expressed as：Wherein HSR2Represent from K information source terminal to relaying R2Letter
Road coefficient matrix, its size are M × K, GR1R2Represent relaying R1To relaying R2Channel coefficient matrix, its size is M × M, zR2
(2t) represents relaying R2White Gaussian noise.
In step (2), k-th of destination end DkReceive from relaying R1Signal can be expressed as：WhereinRepresent from relaying R1To k-th of information source terminal DkChannel vector, its
Size is 1 × M, zD,k(2t) represents k information source terminal DkWhite Gaussian noise.
The beneficial effects of the invention are as follows：From the above as can be seen that relaying R1With relaying R2In turn carry out signal receive and
Send, K information source terminal S1,S2,S3...SKAll the time signal is sent, and K destination end D1,D2,...DKThen receiving all the time
Signal, the efficiency of transmission as full duplex relaying method is realized, and methods described uses two common half-duplexs
Relaying alternating receiving and transmitting signal, so avoids full duplex self-interference phenomenon, and the full duplex self-interference without design specialized eliminates
Circuit, so as to reduce the hardware complexity of communication system, maintain the rate capability as full duplex.
Brief description of the drawings
Fig. 1 is the conventional half duplex relay transmission technology schematic diagram based on two time slots in background technology；
Fig. 2 is full duplex relaying transmission technology schematic diagram in background technology；
Fig. 3 is a kind of schematic diagram of virtual full duplex relaying transmission method of the present invention；
Fig. 4 is the performance comparision that a kind of virtual full duplex relaying transmission method proposed by the invention is made comparisons with other method
Figure；
Embodiment
Referring to the drawings and embodiment is combined to further describe invention, to make those skilled in the art's reference
Specification word can be implemented according to this, and the scope of the present invention is not limited to the embodiment.
A kind of virtual full duplex relaying transmission method of present invention design, is completed by signal transmission system, such as Fig. 3 institutes
Show, the signal transmission system includes K information source terminal S1,S2,S3...SK, relaying R1, relaying R2And K destination end D1,
D2,D3...DK, the transmission method transmitted using 2 time slots to complete signal, sets odd numbered slots as 2t-1, even timeslots
For 2t, wherein t=1,2,3...n, methods described comprises the following steps：
(1), in odd numbered slots 2t-1, K information source terminal S1,S2,S3...SKSend a signal to relaying R1, now relay R2
The signal that then the previous time slot 2t-2 of current time slots is received is transmitted to K destination end after decoding and recompiling
D1,D2,...DK；
(2), in even timeslots 2t, K information source terminal S1,S2,S3...SKSend a signal to relaying R2, relay R1Then ought
The signal that the previous time slot 2t-1 of preceding time slot is received is transmitted to K destination end D after decoding and recompiling1,D2,
...DK；
(3), return to step (1) continues the transmission and reception of signal, until all signal end of transmissions.
The relaying R1With relaying R2M root antennas are disposed, the transmit power of each information source terminal is PS, relay R1With relaying R2
Transmit power be respectively PR1And PR2, in step (1), set an information source terminal SkThe signal for needing to send is sk(2t-1), k
=1,2,3...K, then the transmission signal of K information source terminal be with vector representation：S (2t-1)=[s1(2t-1),...sK(2t-
1)]T。
In step (1), R is relayed2Signal reception is carried out in previous time slot (2t-2) and detects K obtained information source terminal
Signal can be expressed as：, then can be with after decoding and recompiling
Obtain out-trunk R2Being sent to the signal of K destination end can be expressed as：Wherein α2Table
Show relaying R2Power control ratio, i.e.,Mark computing is asked in wherein tr () expressions,In expression
After R2To the channel coefficient matrix of K destination end, its size is K × M, subscript ()HRepresent conjugate transposition.
In step (1), R is relayed1When receiving the signal from K information source terminal, relaying R now1It can receive and
From K information source terminal and relaying R2The superposed signal of formation, then the superposed signal can be expressed as：Wherein HSR1Represent from K information source terminal to
Relay R1Channel coefficient matrix, its size is M × K, GR2R1Represent relaying R2To relaying R1Channel coefficient matrix its size be
M × M, zR1(2t-1) represents relaying R1White Gaussian noise.
In step (1), k-th of destination end DkReceive from relaying R2Signal can be expressed as：WhereinRepresent from relaying R2To k-th of terminal DkChannel vector,
Its size is 1 × M, zD,k(2t-1) represents k information source terminal DkWhite Gaussian noise, k=1,2,3...K.
In step (2), information source terminal S is setkThe signal for needing to send is sk(2t), k=1,2,3...K, then believe for K
The transmission signal of source terminal can be expressed as with vector：S (2t)=[s1(2t),....sK(2t)]T。
In step (2), R is relayed1Signal reception is carried out in previous time slot (2t-1) and detects K obtained information source terminal
Signal can be expressed as：, then can be with after decoding and recompiling
Obtain out-trunk R1Being sent to the signal of K destination end can be expressed as：α1Represent relaying R1
Power control ratio, can be expressed asMark computing is asked in wherein tr () expressions,In expression
After R1To the channel coefficient matrix of K destination end, its size is K × M, subscript ()HRepresent conjugate transposition.
In step (2), R is relayed2When receiving the signal from K information source terminal, relaying R now2It can receive and
From K information source terminal and relaying R1The superposed signal of formation, then the superposed signal can be expressed as：Wherein HSR2Represent from K information source terminal to relaying R2Letter
Road coefficient matrix, its size are M × K, GR1R2Represent relaying R1To relaying R2Channel coefficient matrix, its size is M × M, zR2
(2t) represents relaying R2White Gaussian noise.
In step (2), k-th of destination end DkReceive from relaying R1Signal can be expressed as：WhereinRepresent from relaying R1To k-th of information source terminal DkChannel vector, its
Size is 1 × M, zD,k(2t) represents k information source terminal DkWhite Gaussian noise.
As shown in figure 4, using 10 information source terminals and 10 destination ends, in figure in virtual full duplex proposed by the present invention
The rate capability as full duplex relaying is achieved after method, better than conventional half duplex trunking method.
Claims (9)
1. a kind of virtual full duplex relaying transmission method, is completed, it is whole that the communication system includes K information source by communication system
Hold S1,S2,S3...SK, relaying R1, relaying R2And K destination end D1,D2,D3...DK, the relaying R1With relaying R2Equal portion
M root antennas are affixed one's name to, the transmit power of each information source terminal is PS, relay R1With relaying R2Transmit power be respectively PR1And PR2, the biography
Transmission method completes a signal transmission using 2 time slots, sets odd numbered slots as 2t-1, even timeslots 2t, wherein t=1,
2,3...n, methods described comprises the following steps：
(1), in odd numbered slots 2t-1, K information source terminal S1,S2,S3...SKSend a signal to relaying R1, now relay R2Then will
The signal that previous time slot 2t-2 is received is transmitted to K destination end D after decoding and recompiling1,D2,...DK；
(2), in even timeslots 2t, K information source terminal S1,S2,S3...SKSend a signal to relaying R2, relay R1When then will be previous
The signal that gap 2t-1 is received is transmitted to K destination end D after decoding and recompiling1,D2,...DK；
(3), return to step (1) continues the transmission and reception of signal, until all signal end of transmissions.
A kind of 2. virtual full duplex relaying transmission method according to claim 1, it is characterised in that：In step (1), if
A fixed information source terminal SkThe signal for needing to send is sk(2t-1), k=1,2,3...K, then the transmission signal of K information source terminal
It is with vector representation：S (2t-1)=[s1(2t-1),...sK(2t-1)]T。
A kind of 3. virtual full duplex relaying transmission method according to claim 1 or claim 2, it is characterised in that：
In step (1), R is relayed2Carrying out the signal of K information source terminal that signal reception and detecting obtains in previous time slot (2t-2) can be with
It is expressed as：After decoding and recompiling, then out-trunk R can be obtained2
Being sent to the signal of K destination end can be expressed as：Wherein α2Represent relaying R2's
Power control ratio, i.e.,Mark computing is asked in wherein tr () expressions,Represent relaying R2To K
The channel coefficient matrix of destination end, its size are K × M, subscript ()HRepresent conjugate transposition.
A kind of 4. virtual full duplex relaying transmission method according to claim 3, it is characterised in that：In step (1), in
After R1When receiving the signal from K information source terminal, relaying R now1It can receive from K information source terminal and relaying R2
The superposed signal of formation, then the superposed signal can be expressed as：
Wherein HSR1Represent whole from K information source
Hold relaying R1Channel coefficient matrix, its size is M × K, GR2R1Represent relaying R2To relaying R1Channel coefficient matrix its is big
Small is M × M, zR1(2t-1) represents relaying R1White Gaussian noise.
A kind of 5. virtual full duplex relaying transmission method according to claim 4, it is characterised in that：In step (1), the
K destination end DkReceive from relaying R2Signal be：WhereinRepresent from relaying R2To k-th of terminal DkChannel vector, its size is 1 × M, zD,k(2t-1) represents k information source terminal
DkWhite Gaussian noise, k=1,2,3...K.
A kind of 6. virtual full duplex relaying transmission method according to claim 1, it is characterised in that：In step (2), if
Determine information source terminal SkThe signal for needing to send is sk(2t), k=1,2,3...K, then the transmission signal of K information source terminal can use
Vector is expressed as：S (2t)=[s1(2t),....sK(2t)]T。
A kind of 7. virtual full duplex relaying transmission method according to claim 6, it is characterised in that：In step (2), in
After R1It can be expressed as in the signal that previous time slot (2t-1) carries out signal reception and detects K obtained information source terminal：After decoding and recompiling, then out-trunk R can be obtained1It is sent to K
The signal of destination end can be expressed as：α1Represent relaying R1Power control ratio, can
To be expressed asMark computing is asked in wherein tr () expressions,Represent relaying R1To K destination end
Channel coefficient matrix, its size is K × M, subscript ()HRepresent conjugate transposition.
A kind of 8. virtual full duplex relaying transmission method according to claim 6 or claim 7, it is characterised in that：
In step (2), R is relayed2When receiving the signal from K information source terminal, relaying R now2It can receive from K information source
Terminal and relaying R1The superposed signal of formation, then the superposed signal can be expressed as：
Wherein HSR2Represent from K information source terminal to relaying R2
Channel coefficient matrix, its size is M × K, GR1R2Represent relaying R1To relaying R2Channel coefficient matrix, its size is M × M,
zR2(2t) represents relaying R2White Gaussian noise.
A kind of 9. virtual full duplex relaying transmission method according to claim 8, it is characterised in that：In step (2), the
K destination end DkReceive from relaying R1Signal can be expressed as：WhereinRepresent from relaying R1To k-th of information source terminal DkChannel vector, its size is 1 × M, zD,k(2t) represents that k information source is whole
Hold DkWhite Gaussian noise.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710388728.XA CN107359925A (en) | 2017-05-27 | 2017-05-27 | A kind of virtual full duplex relaying transmission method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710388728.XA CN107359925A (en) | 2017-05-27 | 2017-05-27 | A kind of virtual full duplex relaying transmission method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107359925A true CN107359925A (en) | 2017-11-17 |
Family
ID=60272132
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710388728.XA Pending CN107359925A (en) | 2017-05-27 | 2017-05-27 | A kind of virtual full duplex relaying transmission method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107359925A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108200627A (en) * | 2017-12-27 | 2018-06-22 | 浙江万里学院 | A kind of virtual full duplex relaying transmission method of wireless energy supply |
| CN108777610A (en) * | 2018-05-22 | 2018-11-09 | 西安交通大学 | It is transmitted encrypted secure virtual full duplex relaying method based on channel state information |
| CN109561453A (en) * | 2018-11-19 | 2019-04-02 | 浙江万里学院 | A kind of multi-user Cooperation non-orthogonal multiple access transmission method |
| TWI852889B (en) | 2023-03-02 | 2024-08-11 | 聯發科技股份有限公司 | Method and apparatus of full-duplex operation with aid of frequency-translation repeaters |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1744458A (en) * | 2004-08-31 | 2006-03-08 | 株式会社Ntt都科摩 | Communication system and method using a relay node |
| CN101399799A (en) * | 2007-09-25 | 2009-04-01 | 中兴通讯股份有限公司 | Data relaying method for OFDM system and relaying station |
| KR20110019183A (en) * | 2009-08-19 | 2011-02-25 | 연세대학교 산학협력단 | Half-duplex relay system, cooperative communication method in the same, method of processing a signal in a receiver of the same |
| CN102665226A (en) * | 2012-04-09 | 2012-09-12 | 上海交通大学 | DF (decoded-and-forward) protocol based full duplex relay method of similar repeater |
| KR20140074432A (en) * | 2012-12-07 | 2014-06-18 | 서강대학교산학협력단 | A system and method for interfernece cancellation between relays in multi-hop realy broadband wireless access communication system |
| WO2016023368A1 (en) * | 2014-08-14 | 2016-02-18 | 华为技术有限公司 | Wireless full-duplex communication system |
| WO2016116906A1 (en) * | 2015-01-23 | 2016-07-28 | Telefonaktiebolaget Lm Ericsson (Publ) | Adaptive relay schemes and virtual full-duplex relay operation |
| CN105897319A (en) * | 2016-05-27 | 2016-08-24 | 浙江理工大学 | Signal source and relay joint pre-coding method for MIMO full-duplex relay system |
| CN106301520A (en) * | 2016-07-27 | 2017-01-04 | 华中科技大学 | A kind of communication means based on the many relay systems of full duplex |
| CN106455034A (en) * | 2016-10-21 | 2017-02-22 | 浙江万里学院 | Simultaneous information and energy transmission method for cellular relay system |
-
2017
- 2017-05-27 CN CN201710388728.XA patent/CN107359925A/en active Pending
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1744458A (en) * | 2004-08-31 | 2006-03-08 | 株式会社Ntt都科摩 | Communication system and method using a relay node |
| CN101399799A (en) * | 2007-09-25 | 2009-04-01 | 中兴通讯股份有限公司 | Data relaying method for OFDM system and relaying station |
| KR20110019183A (en) * | 2009-08-19 | 2011-02-25 | 연세대학교 산학협력단 | Half-duplex relay system, cooperative communication method in the same, method of processing a signal in a receiver of the same |
| CN102665226A (en) * | 2012-04-09 | 2012-09-12 | 上海交通大学 | DF (decoded-and-forward) protocol based full duplex relay method of similar repeater |
| KR20140074432A (en) * | 2012-12-07 | 2014-06-18 | 서강대학교산학협력단 | A system and method for interfernece cancellation between relays in multi-hop realy broadband wireless access communication system |
| WO2016023368A1 (en) * | 2014-08-14 | 2016-02-18 | 华为技术有限公司 | Wireless full-duplex communication system |
| WO2016116906A1 (en) * | 2015-01-23 | 2016-07-28 | Telefonaktiebolaget Lm Ericsson (Publ) | Adaptive relay schemes and virtual full-duplex relay operation |
| CN105897319A (en) * | 2016-05-27 | 2016-08-24 | 浙江理工大学 | Signal source and relay joint pre-coding method for MIMO full-duplex relay system |
| CN106301520A (en) * | 2016-07-27 | 2017-01-04 | 华中科技大学 | A kind of communication means based on the many relay systems of full duplex |
| CN106455034A (en) * | 2016-10-21 | 2017-02-22 | 浙江万里学院 | Simultaneous information and energy transmission method for cellular relay system |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108200627A (en) * | 2017-12-27 | 2018-06-22 | 浙江万里学院 | A kind of virtual full duplex relaying transmission method of wireless energy supply |
| CN108200627B (en) * | 2017-12-27 | 2021-07-20 | 浙江万里学院 | Wireless energy supply virtual full-duplex relay transmission method |
| CN108777610A (en) * | 2018-05-22 | 2018-11-09 | 西安交通大学 | It is transmitted encrypted secure virtual full duplex relaying method based on channel state information |
| CN109561453A (en) * | 2018-11-19 | 2019-04-02 | 浙江万里学院 | A kind of multi-user Cooperation non-orthogonal multiple access transmission method |
| TWI852889B (en) | 2023-03-02 | 2024-08-11 | 聯發科技股份有限公司 | Method and apparatus of full-duplex operation with aid of frequency-translation repeaters |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107359925A (en) | A kind of virtual full duplex relaying transmission method | |
| CN105818961A (en) | Multi-antenna and fuselage integrated unmanned aerial vehicle | |
| US11785659B2 (en) | Method for applying MSD and apparatus thereof | |
| CN102832971A (en) | Synergetic networking system based on power line communication and communication method | |
| CN105827384A (en) | Broadband wireless integrated data transmission method and system for unmanned aerial vehicle | |
| CN103580815B (en) | A kind of asynchronous full rate collaboration communication method under water | |
| CN108494466B (en) | Full-duplex relay transmission method and system based on loop interference reconstruction cancellation | |
| CN101924605A (en) | Double-hop cooperative transporting method based on physical-layer network coding | |
| CN109039571B (en) | Transmission method and device for time division duplex system signal | |
| CN105335315A (en) | Multi-serial data remote transmission device and method | |
| CN110267347A (en) | A kind of information transmission structure and its information transferring method | |
| US9294183B2 (en) | Distributed wireless transmission and reception system, and expanded wireless network | |
| CN102832972B (en) | Power line communication system and method | |
| CN104066141B (en) | A kind of collaborative communication method and system based on full space-time network code | |
| CN107359924A (en) | A kind of full duplex relaying transmission method for cellular relay system | |
| CN101719780B (en) | Multi-service multiplexing dual-antenna diversity method and system | |
| US12082119B2 (en) | Communication device and method for performing measurement through multiple antenna panels | |
| CN111404585A (en) | Energy cache transmission protocol based on instantaneous channel state information estimation | |
| CN112083442A (en) | BPL (Business Process language) long wave data modulation design method based on additional modulation pulse | |
| CN107769903A (en) | A kind of method and apparatus in radio communication | |
| CN109561453A (en) | A kind of multi-user Cooperation non-orthogonal multiple access transmission method | |
| CN105515620A (en) | Multi-user cooperative space modulation method | |
| CN101800715A (en) | Unitary pre-coding method and device, decoding method and device and unitary pre-coding/pre-decoding system | |
| CN104270228A (en) | Adaptive cooperative transmission method in MIMO-CCRN (Multiple Input Multiple Output-Cooperative Cognitive Radio Network) | |
| CN106301630B (en) | A kind of anti-interference frequency spectrum access method based on beam forming |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20171117 |