SIMPLIFYING COMPUTATION OF DIVERSITY-MULTIPLEXING TRADE-OFF OF FULL-DUPLEX DIAMOND RELAY CHANNELS

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

JAFARIAN FARSHID; PARVARESH FARZAD

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: COMPUTATIONAL INTELLIGENCE IN ELECTRICAL ENGINEERING (INTELLIGENT SYSTEMS IN ELECTRICAL ENGINEERING) Year:2018 | Volume:8 | Issue:4 Page(s): 63-70

Download Full-Text

Persian Verion

View:

523

Download:

Cites:

Information Journal Paper

Title

SIMPLIFYING COMPUTATION OF DIVERSITY-MULTIPLEXING TRADE-OFF OF FULL-DUPLEX DIAMOND RELAY CHANNELS

Author(s)

JAFARIAN FARSHID | PARVARESH FARZAD | Issue Writer Certificate

Keywords

DIVERSITY-MULTIPLEXING TRADE-OFFQ1

DIAMOND NETWORKSQ1

FADING CHANNELSQ1

FULL-DUPLEX RELAYSQ1

SUBMODULAR FUNCTION MINIMIZATIONQ1

Abstract

For the most relay networks with FADING CHANNELS, it is practicable to devise communication schemes that are optimal in terms of diversity multiplexing trade-off (DMT). Characterizing the DMT of a general n-relay is an ongoing challenging problem. In this paper, we show that to compute DMT of a diamond relay channel one has to solve an optimization problem. Direct computation of DMT of a diamond network with n relays requires solving 2n optimization problems (an optimization for each cut in the network). Solving that many optimization problems in networks with many relays is not practical. We demonstrate that for any n -relay full-duplex diamond channel, if all the exponential orders of the average signal to ratios of links in the network are greater than the multiplexing gain, then computing DMT of such network is equivalent to minimizing a sub modular function and can be carried out in polynomial time.

Cites

No record.

References

No record.

Cite

APA: Copy

JAFARIAN, FARSHID, & PARVARESH, FARZAD. (2018). SIMPLIFYING COMPUTATION OF DIVERSITY-MULTIPLEXING TRADE-OFF OF FULL-DUPLEX DIAMOND RELAY CHANNELS. COMPUTATIONAL INTELLIGENCE IN ELECTRICAL ENGINEERING (INTELLIGENT SYSTEMS IN ELECTRICAL ENGINEERING), 8(4 ), 63-70. SID. https://sid.ir/paper/203089/en

Vancouver: Copy

JAFARIAN FARSHID, PARVARESH FARZAD. SIMPLIFYING COMPUTATION OF DIVERSITY-MULTIPLEXING TRADE-OFF OF FULL-DUPLEX DIAMOND RELAY CHANNELS. COMPUTATIONAL INTELLIGENCE IN ELECTRICAL ENGINEERING (INTELLIGENT SYSTEMS IN ELECTRICAL ENGINEERING)[Internet]. 2018;8(4 ):63-70. Available from: https://sid.ir/paper/203089/en

IEEE: Copy

FARSHID JAFARIAN, and FARZAD PARVARESH, “SIMPLIFYING COMPUTATION OF DIVERSITY-MULTIPLEXING TRADE-OFF OF FULL-DUPLEX DIAMOND RELAY CHANNELS,” COMPUTATIONAL INTELLIGENCE IN ELECTRICAL ENGINEERING (INTELLIGENT SYSTEMS IN ELECTRICAL ENGINEERING), vol. 8, no. 4 , pp. 63–70, 2018, [Online]. Available: https://sid.ir/paper/203089/en

Related Journal Papers