Full-Duplex Relay-Assisted Orthogonal Frequency-Division Multiplexing With Index Modulation

Zhao, Jinxian; Dang, Shuping; Wang, Zhongli

doi:10.1109/jsyst.2018.2871272

Cited by 21 publications

(18 citation statements)

References 52 publications

(53 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The result stated in the proposition follows readily. 4 APPENDIX G PROOF OF PROPOSITION 6 In the following we denote a li = g l ρ li , for all l. From (29), together with (6) and (7), we have…”

Section: Proof Of Propositionmentioning

confidence: 94%

“…Note that, because the lengths of the bit sequences encoded as SAPs and modulated signals are variable, the measurement of bit errors would be difficult to assess in a standardized manner. Therefore, to maintain brevity and clarity, we choose to evaluate the block-error rate (BLER) instead of bit-error rate for the [27]- [29]. Here, a block is a group of N subcarriers.…”

Section: B Block Error Ratementioning

confidence: 99%

See 1 more Smart Citation

Binary-Tree Encoding for Uniform Binary Sources in Index Modulation Systems

Coon

Badiu

Liu

et al. 2019

IEEE J. Sel. Top. Signal Process.

Self Cite

View full text Add to dashboard Cite

The problem of designing bit-to-pattern mappings and power allocation schemes for orthogonal frequency-division multiplexing (OFDM) systems that employ subcarrier index modulation (IM) is considered. We assume the binary source conveys a stream of independent, uniformly distributed bits to the pattern mapper, which introduces a constraint on the pattern transmission probability distribution that can be quantified using a binary tree formalism. Under this constraint, we undertake the task of maximizing the achievable rate subject to the availability of channel knowledge at the transmitter. The optimization variables are the pattern probability distribution (i.e., the bit-to-pattern mapping) and the transmit powers allocated to active subcarriers. To solve the problem, we first consider the relaxed problem where pattern probabilities are allowed to take any values in the interval [0, 1] subject to a sum probability constraint. We develop (approximately) optimal solutions to the relaxed problem by using new bounds and asymptotic results, and then use a novel heuristic algorithm to project the relaxed solution onto a point in the feasible set of the constrained problem. Numerical analysis shows that this approach is capable of achieving the maximum mutual information for the relaxed problem in low and high-SNR regimes and offers noticeable benefits in terms of achievable rate relative to a conventional OFDM-IM benchmark.

show abstract

Section: Proof Of Propositionmentioning

confidence: 94%

Section: B Block Error Ratementioning

confidence: 99%

Binary-Tree Encoding for Uniform Binary Sources in Index Modulation Systems

Coon

Badiu

Liu

et al. 2019

IEEE J. Sel. Top. Signal Process.

Self Cite

View full text Add to dashboard Cite

show abstract

“…The analytical errors existing in the low SNR region are mainly caused by the union bound (c.f. (17)), while the analytical errors existing in the high SNR region are mainly due to the exponential approximation of the 14 The number of all possible architectures of full binary trees for the case with S leaves is the Catalan number C(S), which increases exponentially when S increases and makes analysis difficult. However, as the tree architectures with symmetry can be regarded to be equivalent for error performance analysis, we can exclude them for simplicity, but without loss of generality.…”

Section: A Verification Of Error Performance Analysismentioning

confidence: 99%

Enhanced Huffman Coded OFDM with \\Index Modulation

Dang¹,

Guo²,

Coon³

et al. 2020

Preprint

Self Cite

View full text Add to dashboard Cite

In this paper, we propose an enhanced Huffman coded orthogonal frequency-division multiplexing with index modulation (EHC-OFDM-IM) scheme. The proposed scheme is capable of utilizing all legitimate subcarrier activation patterns (SAPs) and adapting the bijective mapping relation between SAPs and leaves on a given Huffman tree according to channel state information (CSI). As a result, a dynamic codebook update mechanism is obtained, which can provide more reliable transmissions. We take the average block error rate (BLER) as the performance evaluation metric and approximate it in closed form when the transmit power allocated to each subcarrier is independent of channel states. Also, we propose two CSI-based power allocation schemes with different requirements for computational complexity to further improve the error performance. Subsequently, we carry out numerical simulations to corroborate the error performance analysis and the proposed dynamic power allocation schemes. By studying the numerical results, we find that the depth of the Huffman tree has a significant impact on the error performance when the SAP-to-leaf mapping relation is optimized based on CSI. Meanwhile, through numerical results, we also discuss the trade-off between error performance and data transmission rate and investigate the impacts of imperfect CSI on the error performance of EHC-OFDM-IM.Index Terms-Orthogonal frequency-division multiplexing with index modulation (OFDM-IM), Huffman coding, dynamic codebook design, power allocation, channel state information (CSI).

show abstract

“…Following these two works, relay assisted OFDM-IM is further enhanced by subcarrier permutation, power allocation, and various relay selection in [20]- [23], respectively. Besides, multi-hop and full-duplex relay assisted OFDM-IM systems are investigated in [24] and [25].…”

Section: A Related Work Of Relay Assisted Ofdm-immentioning

confidence: 99%

OFDM-IM Based Dual-Hop System Using Fixed-Gain Amplify-and-Forward Relay With Pre-Processing Capability

Dang

Wen

et al. 2019

IEEE Trans. Wireless Commun.

Self Cite

View full text Add to dashboard Cite

Orthogonal frequency-division multiplexing with index modulation (OFDM-IM) has recently attracted much researchers' attention due to its superior spectrum efficiency and reliability compared to the traditional OFDM. Cooperative decode-and-forward (DF) relaying has been incorporated with OFDM-IM, which provides a higher energy efficiency and better network coverage. However, it might not be feasible in realistic applications owing to the high system complexity and transmission delay rendered by complex decoding and channel estimation procedures. Therefore, in this paper, we propose a fixed-gain (FG) amplify-and-forward (AF) relay assisted OFDM-IM system, which does not need to perform complex decoding and channel estimation at the relay, but only requires a preprocessing capability at the relay, e.g., cyclic prefix (CP) removal and re-insertion. Therefore, the system complexity can be reduced and the forwarding delay as well as power consumption caused by processing at the relay also decline. We analyze the average outage probability, block error rate (BLER), and achievable rate of the proposed system and verify all analysis by numerical results. The proposed FG AF relay assisted OFDM-IM provides a simple solution to the implementation of OFDM-IM in new network paradigms, where nodes are simple, power-limited and/or complexity-limited. Index Terms-Orthogonal frequency-division multiplexing with index modulation (OFDM-IM), fixed-gain (FG) amplifyand-forward (AF) relaying, performance analysis, multi-carrier systems, the Internet of Things (IoT). I. INTRODUCTION

show abstract

Full-Duplex Relay-Assisted Orthogonal Frequency-Division Multiplexing With Index Modulation

Cited by 21 publications

References 52 publications

Binary-Tree Encoding for Uniform Binary Sources in Index Modulation Systems

Binary-Tree Encoding for Uniform Binary Sources in Index Modulation Systems

Enhanced Huffman Coded OFDM with \\Index Modulation

OFDM-IM Based Dual-Hop System Using Fixed-Gain Amplify-and-Forward Relay With Pre-Processing Capability

Contact Info

Product

Resources

About