Search

The construction of a quasi-cyclic low density parity-check (QC-LDPC) matrix is usually carried out in two steps. In the first step, a prototype matrix is defined according to certain criteria (size, girth, check and variable node degrees, and so on). The second step involves the expansion of the prototype matrix. During this last phase, an integer value is assigned to each non-null position in the prototype matrix corresponding to the right-rotation of the identity matrix. The problem of determining these integer values is complex. The state-of-the-art solutions use either some mathematical constructions to guarantee a given girth of the final QC-LDPC code, or a random search of values until the target girth is satisfied. In this paper, we propose an alternative/complementary method that reduces the search space by defining large equivalence classes of topologically identical matrices through row and column permutations using additive, structural, and multiplicative transformations. Selecting only a single element per equivalence class can reduce the search space by a few orders of magnitude. Then, we use the formalism of constraint programming to list the exhaustive sets of solutions for a given girth and a given expansion factor. An example is presented in all sections of the paper to illustrate the methodology. [ABSTRACT FROM AUTHOR]

In this paper, we consider a simple coding scheme for spatial modulation, where the same set of active transmit antennas is repeatedly used over consecutive multiple transmissions. Based on a Gaussian approximation, an approximate maximum likelihood (ML) detection problem is formulated to detect the indices of active transmit antennas. We show that the solution to the approximate ML detection problem can achieve a full coding gain. Furthermore, we develop a low-complexity iterative algorithm to solve the problem with low complexity based on a well-known machine learning approach, i.e., variational inference. Simulation results show that the proposed algorithm can have a near ML performance. A salient feature of the proposed algorithm is that its complexity is independent of the number of active transmit antennas, whereas an exhaustive search for the ML problem requires a complexity that grows exponentially with the number of active transmit antennas. [ABSTRACT FROM AUTHOR]

Spatially-coupled (SC) codes are a family of graph-based codes that have attracted significant attention, thanks to their capacity approaching performance and low decoding latency. An SC code is constructed by partitioning an underlying block code into a number of components and coupling their copies together. In this paper, we first introduce a general approach for the enumeration of detrimental combinatorial objects in the graph of finite-length SC codes. Our approach is general in the sense that it effectively works for SC codes with various partitioning schemes, column weights, and memories. Next, we present a two-stage framework for the construction of high performance binary SC codes optimized for the additive white Gaussian noise channels; we aim at minimizing the number of detrimental combinatorial objects in the error floor region. In the first stage, we deploy a novel partitioning scheme, called the optimal overlap partitioning, to produce the optimal partitioning corresponding to the smallest number of detrimental objects. In the second stage, we apply a new circulant power optimizer to further reduce the number of detrimental objects in the lifted graph. SC codes constructed by our new framework have up to two orders of magnitude error floor performance improvement and up to 0.6 dB SNR gain compared to prior state-of-the-art SC codes. [ABSTRACT FROM AUTHOR]

Joint pushing and caching is recognized as an efficient remedy to the problem of spectrum scarcity incurred by tremendous mobile data traffic. In this paper, we design the optimal joint pushing and caching policy to maximize bandwidth utilization, which is of fundamental importance to mobile telecom carriers. In particular, we consider a multiuser wireless network with multicast opportunities where each user is equipped with a cache of limited size. First, we formulate the stochastic optimization problem as an infinite horizon average cost Markov decision process. By the structural analysis, we show that how the optimal policy achieves a balance between the current transmission cost and the future average transmission cost. We also show that the optimal average transmission cost decreases with the cache sizes, revealing a tradeoff between storage and bandwidth. Then, due to the fact that obtaining a numerical optimal solution suffers the curse of dimensionality and implementing it requires a centralized controller and global system information, we develop a low-complexity decentralized policy (LDP) by using a linear approximation of the value function and transforming challenging discrete optimization problems into difference of convex (DC) problems, which can be efficiently solved by using DC algorithms. We also obtain an upper bound on the performance gap between the average cost of LDP and the minimum average cost, which can be easily evaluated. Next, we propose an online decentralized algorithm to implement the proposed LDP, when priori knowledge of user demand processes is not available. Finally, using numerical results, we demonstrate the advantage of the proposed solutions over some existing designs. The results in this paper offer useful guidelines for designing practical cache-enabled multiuser wireless networks. [ABSTRACT FROM AUTHOR]

This paper studies the minimum-age scheduling problem in a wireless sensor network where an access point (AP) monitors the state of an object via a set of sensors. The freshness of the sensed state, measured by the age-of-information (AoI), varies at different sensors and is not directly observable to the AP. The AP has to decide which sensor to query/sample in order to get the most updated state information of the object (i.e., the state information with the minimum AoI). In this paper, we formulate the minimum-age scheduling problem as a multi-armed bandit problem with partially observable arms and explore the greedy policy to minimize the expected AoI sampled over an infinite horizon. To analyze the performance of the greedy policy, we 1) put forth a relaxed greedy policy that decouples the sampling processes of the arms, 2) formulate the sampling process of each arm as a partially observable Markov decision process (POMDP), and 3) derive the average sampled AoI under the relaxed greedy policy as a sum of the average AoI sampled from individual arms. Numerical and simulation results validate that the relaxed greedy policy is an excellent approximation to the greedy policy in terms of the expected AoI sampled over an infinite horizon. [ABSTRACT FROM AUTHOR]

Reconfigurable intelligent surface (RIS) has recently received extensive research interest due to its capability to intelligently change the wireless propagation environment. For RIS-aided wireless communications in frequency division duplex (FDD) mode, channel feedback at the user equipment (UE) is essential for the base station (BS) to acquire the downlink channel state information (CSI). In this paper, a dimension reduced channel feedback scheme is proposed to reduce the channel feedback overhead by exploiting the single-structured sparsity of BS-RIS-UE cascaded channel. Since different UEs share the same sparse BS-RIS channel but have their respective RIS-UE channels, there are only limited non-zero column vectors in the BS-RIS-UE cascaded channel matrix, and different UEs share the same indexes of the non-zero columns. Thus, the downlink CSI can be decomposed into user-independent channel information (i.e., the indexes of non-zero columns) and user-specific channel information (i.e., the non-zero column vectors), where the former for all UEs can be fed back by only one UE, while the latter can be fed back with a fairly low overhead by different UEs, respectively. Simulation results show that, compared with the conventional method, the proposed scheme can reduce channel feedback overhead by more than 80% for RIS-aided wireless communications. [ABSTRACT FROM AUTHOR]

In this paper, we propose a precoded faster-than-Nyquist (FTN) signaling technique for time-domain single-carrier index-modulated symbol transmission. More precisely, eigenvalue decomposition (EVD) precoding is adopted for the FTN transmission of data bits modulated by single-carrier time-domain index modulation (IM). While the FTN scheme increases the spectral efficiency and data rate by increasing the density of transmit symbols, the time-domain IM works towards the same objective while maintaining symbol sparsity. We analytically derive the constrained capacity of the proposed system. Our simulation results show that the proposed scheme has better bit error ratio (BER) performance than the conventional FTN-IM scheme, particularly for the scenario of a higher packing ratio. With the proposed scheme, a 2.5 dB performance gain is observed at the BER of 10−4, where the packing ratio is 0.7 and the roll-off factor is 0.5 in the channel-uncoded scenario. We further analyze our scheme’s performance by characterizing its minimum Euclidean distance and inter-symbol interference. Furthermore, we present a three-stage serially concatenated iterative detection architecture for the proposed EVD-FTN-IM signaling scheme. It is demonstrated in our simulations that a near-capacity BER performance is achievable in the proposed turbo-coded FTN-IM scheme. [ABSTRACT FROM AUTHOR]

To realize high energy-efficient, high spectrum-efficient, and high-throughput data transmission, a multi-carrier differential chaos shift keying communication system with hybrid index modulation, referred to as HIM-MC-DCSK system, is proposed in this paper. In the HIM-MC-DCSK system, we intelligently integrate the carrier-number-index technique and carrier-index technique into the MC-DCSK modulation in order to significantly boost the transmission efficiency in wireless communication systems. Especially, we use a pair of orthogonal signals to represent the active and inactive subcarriers in the HIM-MC-DCSK system so as to exploit all the subcarriers to transmit information bits. In addition, the theoretical bit-error-rate (BER) expressions of the HIM-MC-DCSK system are derived over additive white Gaussian noise (AWGN) and multipath Rayleigh fading channels. Also, the data rate, spectrum efficiency, energy efficiency, and complexity of the proposed system are carefully analyzed. Monte-Carlo simulations not only verify the accuracy of the theoretical analysis but also illustrate the superiority of the proposed system. [ABSTRACT FROM AUTHOR]

In coded caching, a single server is connected to a set of users through a shared bottleneck link, which is assumed to be error free. During non-peak hours, all the users fill their local cache with portions of the files available. During the delivery phase, each user requests a file and the server delivers coded transmissions to meet the demands. In this paper, the links between the server and the users are assumed to be error prone. Prefetching errors are also considered. A new delivery scheme is required to meet the demands of each user even after receiving a finite number of transmissions in error in the presence of erroneous portions of files in the cache. The minimum average rate and minimum peak rate for this problem are characterized. Closed form expressions for average and peak rates for a particular caching scheme, namely, symmetric batch prefetching are established when there are no prefetching errors. An optimal linear error correcting delivery scheme is proposed for coded caching problems with symmetric batch prefetching in the absence of prefetching errors. In addition to this, lower bounds are established for the optimal rate required when there are prefetching errors in symmetric batch prefetching. [ABSTRACT FROM AUTHOR]

Coded caching can significantly reduce the communication bandwidth requirement for satisfying users’ demands by utilizing the multicasting gain among multiple users. Most existing works assume that the users follow the prescriptions for content placement made by the system. However, users may prefer to decide what files to cache. To address this issue, we consider a network consisting of a file server connected through a shared link to $\boldsymbol {K}$ users, each equipped with a cache which has been already filled arbitrarily. Given an arbitrary content placement, the goal is to find a delivery strategy for the server that minimizes the load of the shared link. In this paper, we focus on a specific class of coded multicasting delivery schemes known as the “clique cover delivery scheme.” We first formulate the optimal clique cover delivery problem as a combinatorial optimization problem. Using a connection with the weighted set cover problem, we propose an approximation algorithm and show that it provides an approximation ratio of $(\textbf {1} + \log \boldsymbol {K})$ , while the approximation ratio for the existing coded delivery schemes is linear in $\boldsymbol {K}$. Numerical simulations show that our proposed algorithm provides a considerable bandwidth reduction over the existing coded delivery schemes for almost all content placement schemes. [ABSTRACT FROM AUTHOR]

This paper studies lossy transmission of a memoryless bivariate Gaussian source over a bandwidth-mismatched memoryless Gaussian broadcast channel with two receivers, where each receiver is interested in reconstructing only one source component. For both bandwidth expansion and compression regimes, novel hybrid digital/analog (HDA) coding schemes are proposed. With appropriate choice of parameters, our schemes are shown to specialize to separate source–channel coding studied by Gao and Tuncel, and is, therefore, superior to it in both bandwidth regimes. Our scheme for bandwidth expansion also outperforms the HDA coding scheme of Behroozi et al. On the other hand, if a proposed conjecture (supported by numerical observations) is indeed true, the same superiority follows for the bandwidth compression regime as well. Finally, when the bandwidth expansion/compression ratio approaches 1, both of our schemes become optimal as their performance approaches that of the bandwidth-matched scheme of Tian et al. [ABSTRACT FROM PUBLISHER]

The integration of mobile edge computing (MEC) into an ultra-dense network (UDN) can provide ubiquitous task offloading services to computation-demanding users leveraging densely deployed micro base stations. The conventional multi-user task offloading strategies are performed centrally, where a central node makes global task offloading decisions on server selection and resource allocation. In practice, the deployment becomes prohibitively complex with the increasing number of users as it involves high communication overhead and complex global optimization operations. In this paper, we develop a novel decentralized task offloading strategy in UDN, enabling users to independently make local task offloading decisions. We formulate the associated optimization problem to minimize the long-term average task delay among all users. On this basis, we develop a novel calibrated contextual bandit learning (CCBL) algorithm, where users can learn the computational delay functions of micro base stations and predict the task offloading decisions of other users in a decentralized manner. The convergence of the proposed CCBL algorithm is verified via the approachability theory. Moreover, we transfer the target of calibrated learning from all micro base stations to a single user and propose a user-oriented CCBL algorithm to further decrease the computational complexity and increase the convergence rate. Simulation results illustrate that our proposed algorithm outperforms the existing decentralized algorithms and approaches the centralized one. [ABSTRACT FROM AUTHOR]

This paper studies the problem of joint edge cache placement and content delivery in cache-enabled small cell networks in the presence of spatio-temporal content dynamics unknown a priori. The small base stations (SBSs) satisfy users’ content requests either directly from their local caches, or by retrieving from other SBSs’ caches or from the content server. In contrast to previous approaches that assume a static content library at the server, this paper considers a more realistic non-stationary content library, where new contents may emerge over time at different locations. To keep track of spatio-temporal content dynamics, we propose that the new contents cached at users can be exploited by the SBSs to timely update their flexible cache memories in addition to their routine off-peak main cache updates from the content server. To take into account the variations in traffic demands as well as the limited caching space at the SBSs, a user-assisted caching strategy is proposed based on reinforcement learning principles to progressively optimize the caching policy with the target of maximizing the weighted network utility in the long run. Simulation results verify the superior performance of the proposed caching strategy against various benchmark designs. [ABSTRACT FROM AUTHOR]

In this paper, time-invariant spatially coupled low-density parity-check convolutional codes (SC-LDPC-CCs) are considered, and the connections existing between their low-weight codewords and cycles in their Tanner graphs are studied. Using the polynomial representation of these codes, we show that parity-check matrices having columns with weight ≥2 can be analyzed considering a certain number of parity-check sub-matrices having regular columns with weight 2. These sub-matrices are associated to cycles in the code Tanner graph and define as many codes we denote as component codes. Based on this observation, we find that codewords of the main code can be expressed as combinations of codewords of the component codes. The design of codes free of codewords up to a certain weight is also addressed. We show that low-weight codewords in the main code can be avoided by removing some types of cycles in its Tanner graph. Our design approach is applied to some well-known ensembles of SC-LDPC-CCs to prove its effectiveness. [ABSTRACT FROM AUTHOR]

Analytical modeling of Age of Information (AoI) and Peak AoI (PAoI) has recently drawn a lot of attention in the context of quantitative assessment of information freshness in status update systems. In this paper, we study a probabilistically preemptive bufferless M/PH/1/1 queue fed with information update packets from $N$ separate information sources for which a new information packet arrival from source- $m$ is allowed to preempt a packet from source- $n$ in service, with a probability depending on $n$ and $m$. To make the model even more general than the existing ones, we assume a distinct phase-type (PH-type) service time distribution, a distinct packet error and retransmission probability, for each of the information sources. Using sample path arguments and the theory of Markov Fluid Queues (MFQ), the exact distributions of the AoI and PAoI are numerically obtained for each of the sources. Numerical examples are provided to demonstrate the impact of various system parameters on AoI performance. In the context of a two-source system, we present a methodology on how to optimally choose the preemption probabilities and packet generation rates so as to minimize certain AoI-oriented cost functions. [ABSTRACT FROM AUTHOR]

This paper examines the impact of system parameters such as access point density and bandwidth partitioning on the performance of randomly deployed, interference-limited, dense wireless networks. While much progress has been achieved in analyzing randomly deployed networks via tools from stochastic geometry, most existing works either assume a very large user density compared to that of access points, which does not hold in a dense network, and/or consider only the user signal-to-interference-ratio as the system figure of merit, which provides only partial insight on user rate as the effect of multiple access is ignored. In this paper, the user rate distribution is obtained analytically, taking into account the effects of multiple access as well as the SIR outage. It is shown that user rate outage probability is dependent on the number of bandwidth partitions (subchannels) and the way they are utilized by the multiple access scheme. The optimal number of partitions is lower bounded for the case of large access point density. In addition, an upper bound of the minimum access point density required to provide an asymptotically small rate outage probability is provided in closed form. [ABSTRACT FROM AUTHOR]

Cellular systems of the fourth generation (4G) have been optimized to provide high data rates and reliable coverage to mobile users. Cellular systems of the next generation will face more diverse application requirements: the demand for higher data rates exceeds 4G capabilities; battery-driven communication sensors need ultra-low power consumption; and control applications require very short response times. We envision a unified physical layer waveform, referred to as generalized frequency division multiplexing (GFDM), to address these requirements. In this paper, we analyze the main characteristics of the proposed waveform and highlight relevant features. After introducing the principles of GFDM, this paper contributes to the following areas: 1) the means for engineering the waveform's spectral properties; 2) analytical analysis of symbol error performance over different channel models; 3) concepts for MIMO-GFDM to achieve diversity; 4) preamble-based synchronization that preserves the excellent spectral properties of the waveform; 5) bit error rate performance for channel coded GFDM transmission using iterative receivers; 6) relevant application scenarios and suitable GFDM parameterizations; and 7) GFDM proof-of-concept and implementation aspects of the prototype using hardware platforms available today. In summary, the flexible nature of GFDM makes this waveform a suitable candidate for future 5G networks. [ABSTRACT FROM AUTHOR]

Recently, it was shown that the dithered relative prime interleavers and quadratic permutation polynomial (QPP) interleavers can be expressed in terms of almost regular permutation (ARP) interleavers. In this paper, the conditions for a QPP interleaver to be equivalent to an ARP interleaver are extended for cubic permutation polynomial (CPP) interleavers. It is shown that the CPP interleavers are always equivalent to an ARP interleaver with disorder degree greater than one and smaller than the interleaver length, when the prime factorization of the interleaver length contains at least one prime number to a power higher than one and it fulfills the conditions for which there are true CPPs for the considered length. When the prime factorization of the interleaver length contains only prime numbers to the power of one, with at least two prime numbers pi , fulfilling the conditions pi>3 and 3 \nmid (pi-1) , values of disorder degree smaller than the interleaver length are possible under some conditions on the coefficients of the second and third degree terms of the CPP. [ABSTRACT FROM PUBLISHER]

Compressive random access (CRA) is a random access scheme that has been considered for massive machine-type communication (MTC) with non-orthogonal spreading sequences, where the notion of compressive sensing (CS) is used for low-complexity detectors by exploiting the sparse device activity. In this paper, we study the application of power-domain non-orthogonal multiple access (NOMA) to CRA in order to improve the performance of CRA (or increase the number of devices to be supported). We consider Gaussian spreading sequences and derive design criteria through a large-system analysis to determine the power levels for power-domain NOMA. From simulation results, we can confirm that the number of incorrectly detected device activity can be reduced by applying NOMA to CRA. [ABSTRACT FROM AUTHOR]

Ji et al. (IEEE Transactions on Information Theory, 62(2): 849–869, 2016) first studied coded caching in device-to-device (D2D) networks, and proposed a D2D coded caching scheme, which is referred to as the JCM scheme. In practice, we prefer to design a scheme with its two important targets, i.e., the rate (the maximal total amount of transmission) and packet number ${F}$ , as small as possible. In this paper, we first propose a simple array called D2D placement delivery array (DPDA) to characterize the placement phase and the delivery phase in D2D networks. Consequently, some D2D coded caching schemes can be realized by an appropriate DPDA. Second, a lower bound on the rate of a DPDA is derived. And, we show that the JCM scheme achieves our lower bound. However, it is well known that its packet number ${F}$ increases exponentially with the number of users ${K}$. So, we propose two classes of new schemes by constructing DPDAs. One reduces the packet number exponentially with K compared with the JCM scheme while keeping the rate near to our lower bound. The other further reduces ${F}$ to increasing sub-exponentially with ${K}$. [ABSTRACT FROM AUTHOR]

The index coding with side-information problem introduced by Birk and Kol has been generalized to the case, where the transmissions are subjected to errors by Dau et al.. Lower and upper bounds on the optimal number of transmissions required to correct a specified number $\delta $ of errors were established. In another generalization of index coding problem, namely, generalized index coding (GIC) problem introduced by Dai et al., linear combination of the messages can be demanded and held as side information by the receivers. Error correction for GIC problems was studied and the bounds for optimal number of transmissions required for $\delta $ -error correcting generalized index codes were established by Byrne and Calderini. In this paper, for a particular class of GIC problems construction of optimal scalar linear index codes are discussed. For this class of GIC problems, the optimal linear $\delta $ -error correcting index codes are also constructed. As special cases, optimal linear error correcting codes are obtained for two classes of original index coding problems, namely, single-prior index coding problems and single unicast index coding problems with symmetric neighboring consecutive side information. [ABSTRACT FROM AUTHOR]

In this paper, we present an efficient method to construct a good rate-compatible punctured polar (RCPP) code for incremental redundancy hybrid automatic repeat request schemes. One of the major challenges on the construction of a RCPP code is to optimize a common information set which is good for all the (punctured) polar codes in the family. Unfortunately, there is no efficient way to solve the above problem. In the proposed construction, a common information set is simply optimized for the highest-rate code in the family and then it is updated to yield an effective information set for each other code, by keeping the condition that information bits are unchanged during retransmissions. This is enabled by presenting a novelhierarchical(orreciprocal) puncturing andinformation-copytechnique. Specifically, some information bits are copied to frozen-bit channels whose locations are carefully determined according to rate-compatible puncturing patterns. This yields an information-dependent frozen vector in the encoding part. Also, in the decoding part, the effective information sets are obtained by properly combining the common information set and the information-dependent frozen vector. More importantly, the impact of unknown frozen bits are avoided due to the special structure of the proposed hierarchical (or reciprocal) puncturing. Simulation results verify that the proposed RCPP code can yield a significant performance gain (about 2 dB) over a benchmark RCPP code where both codes use the same rate-compatible puncturing patterns but the latter uses the conventional all-zero frozen vector. Therefore, the proposed method would be crucial to construct a good RCPP code efficiently. [ABSTRACT FROM AUTHOR]

The index coding problem includes a server, a group of clients, and a set of data chunks. While each client wants a subset of the data chunks and already has another subset as its side information, the server transmits some (uncoded or coded) chunks to the clients over a noiseless broadcast channel. The objective of the problem is to satisfy the demands of all clients with the minimum number of transmissions. This paper investigates the index coding setting from a game-theoretical perspective. We consider selfish clients, where each selfish client has private side information and a private valuation of each data chunk it wants. In this context, our objectives are following: 1) to motivate each selfish client to reveal the correct side information and true valuation of each data chunk it wants; 2) to maximize the social welfare, i.e., the total valuation of the data chunks recovered by the clients minus the total cost incurred by the transmissions from the server. Our main contribution is to jointly develop coding and incentive schemes for achieving the first objective perfectly and achieving the second objective optimally or approximately with guaranteed approximation ratios (potentially within some restricted sets of coding matrices). [ABSTRACT FROM AUTHOR]

With the full development of intelligent mobile communications, wireless mixed reality (MR) provides a more visually immersive experience and stronger interaction with environments than virtual reality (VR) and augmented reality (AR). However, the asymmetric characteristic of wireless MR traffic creates a huge challenge to current mobile networks. Dynamic time division duplex (D-TDD) is considered as a promising technology to improve wireless MR users’ quality of experience (QoE) due to its potentials and advantages in delivering asymmetric traffic. Therefore, in this paper, we propose a QoE-driven distributed multidimensional resource allocation (MRA) supplemented by inter-cell interference (ICI) mitigation scheme for wireless MR in multi-cell D-TDD systems. First, to improve QoE of MR users, we formulate the joint optimization of subframe configuration, channel assignment and computation offloading as a mixed-integer nonlinear programming problem. A novel fully-decentralized multi-agent deep Q-network (DQN) algorithm is developed to solve the problem. Then, to mitigate ICI, a water filling based power control algorithm is investigated to minimize the total power of each small base station and its associated MR users. Simulation results demonstrate that our proposed scheme improves QoE of MR users in a realizable way as compared to existing schemes. [ABSTRACT FROM AUTHOR]

The successive cancellation (SC) process in which symbols are decoded sequentially by processing some intermediate information is an essential component of various decoding algorithms used for polar codes and their variants. In some decoding schemes, we may need to redo this process from some specific symbol or from the first symbol. This operation is called rewinding. Rewinding the SC process seems trivial if we have access to all intermediate log-likelihood ratios (LLRs) and partial sums. However, as the block length increases, retaining all of the intermediate information becomes inefficient and impractical. Rewinding the SC process in a memory-efficient way is a problem that we address in this paper. As we store a fraction of all the intermediate information in the memory-efficient scheme, we may not be able to rewind the SC process to the target symbol index. The reason is that some of the stored intermediate information needed to decode the target symbol may have been overwritten. To recompute the lost information, we may need to rewind the process further. Before proposing the formal scheme for the rewinding process, we explore the known properties of the SC process based on the binary representation of the bit indices. Then, we introduce a new operator used for grouping the bit indices. This special grouping helps us in finding the closest bit index to the target index for rewinding. We also analytically prove that this approach gives access to the untouched intermediate information stored in the memory which is essential in resuming the SC process. Finally, we adapt the proposed approach to multiple rewinds and apply it to SC-flip decoding and shifted-pruning-based list decoding. The numerical evaluation of the proposed solution shows a significant reduction of ≥50% in the complexity of the additional decoding attempts at medium and high SNR regimes for SC-flip decoding and less for shifted-pruning based list decoding. [ABSTRACT FROM AUTHOR]

This paper studies cached-aided multicast transmissions in fronthaul fog radio access networks (F-RANs). While index coding and cached-aided non-orthogonal multiple access (NOMA) are techniques commonly used for utilizing cache contents to save transmit energy, there is a lack of general framework to integrate them. This work proposes index-coded NOMA and dynamic coded-NOMA to investigate energy performance of the integration of index coding and NOMA under whole-file and subfile caching, respectively. Besides, dynamic cache space allocation is applied to both caching schemes, which allocates cache sizes to the fog access points (F-APs) according to their large-scale channel conditions. For index-coded NOMA, the general grouping problem is proved to be NP-hard and optimal solutions for some special cases are given. Furthermore, efficient heuristic grouping algorithms are proposed. For dynamic coded-NOMA, we obtain the closed-form minimum transmit energy. The numerical results validate the good performance of our proposed algorithms. Index-coded NOMA and dynamic coded-NOMA have comparable performance and both of them save much energy than the existing schemes. When there are 12 F-APs under small-cache scenarios, index-coded NOMA saves energy by 70.3% compared to traditional NOMA. [ABSTRACT FROM AUTHOR]

This paper considers a cell-free massive multiple-input multiple-output network (cfm-MIMO) with a massive number of access points (APs) distributed across an area to deliver information to multiple users. Based on only local channel state information, conjugate beamforming is used under both proper and improper Gaussian signalings. To accomplish the mission of cfm-MIMO in providing fair service to all users, the problem of power allocation to maximize the geometric mean (GM) of users’ rates (GM-rate) is considered. A new scalable algorithm, which iterates linear-complex closed-form expressions and thus is practical regardless of the scale of the network, is developed for its solution. The problem of quality-of-service (QoS) aware network energy-efficiency is also addressed via maximizing the ratio of the GM-rate and the total power consumption, which is also addressed by iterating linear-complex closed-form expressions. Intensive simulations are provided to demonstrate the ability of the GM-rate based optimization to achieve multiple targets such as a uniform QoS, a good sum rate, and a fair power allocation to the APs. [ABSTRACT FROM AUTHOR]

In this paper, a parallel concatenated structure is proposed to improve the performance of polar codes in finite length in which multiblocks systematic polar codes (SPC) and recursive systematic convolutional codes (RSC) are combined. We first design a weighted iterative decoding algorithm for the proposed structure such that better bit error rate performance can be obtained. Then, a deliberated interleaver is optimized for the new scheme. Thereafter, we introduce a strategy to estimate the minimum distance of the concatenation codeword, where an asymptotic performance and convergence behavior analysis are elaborated. Finally, the error performance of the proposed scheme is evaluated via simulations. The results show that our scheme almost outperforms all the existed concatenation ones using polar codes, making the codes more practical. [ABSTRACT FROM AUTHOR]

It has recently been pointed out that placement delivery arrays (PDAs) are equivalent to strong edge colorings of bipartite graphs. In this paper we consider various methods of combining two or more strong edge colorings of bipartite graphs to obtain new ones, and therefore new PDAs. Combining PDAs in certain ways also gives a framework for obtaining PDAs with more robust and flexible parameters. We investigate how the parameters of certain strong edge colorings change after being combined with others and, after comparing the parameters of the resulting PDAs with those of the initial ones, find that subpacketization levels thusly can often be improved. [ABSTRACT FROM AUTHOR]

Millimeter wave (mmwave) communications have attracted increasing attention thanks to the abundant spectrum resource. The short wave-length of mmwave signals facilitates exploiting large antenna arrays to achieve large array gains and combat the large path-loss. However, the use of large antenna arrays along with narrow beams leads to a large overhead in beam training for obtaining channel state information, especially in dynamic environments. To reduce the overhead of beam training, in this paper we formulate the problem of beam alignment and tracking (BA/T) as a stochastic bandit problem. In particular, to sense the change of the environments, the actions are designed based on the offset of successive beam indexes (i.e., beam index difference), which measures the rate of change of the envir-onments. Then, we propose two efficient BA/T algorithms based on the stochastic bandit learning. To reveal useful insights, the performance of effective achievable rate is further analyzed for the proposed BA/T algorithms. The analytical results show that the algorithms can sense the change of the environments and adjust beam training strategies intelligently. In addition, they do not require any priori knowledge of dynamic channel modeling, and thus are applicable to a variety of complicated scenarios. Simulation results demonstrate the effectiveness and superiority of the proposed algorithms. [ABSTRACT FROM AUTHOR]

In conventional multiple description coding (MDC), two descriptions of a source are generated and sent over ON/OFF channels. In this paper, we are interested in exploiting the redundancy built in MDC to additionally confer robustness against other channel errors. In particular, we consider a multiple description lattice vector quantizer (MDLVQ) whose output (a pair of side lattice points) is mapped to a pair of binary indexes and each index is sent over a binary channel. One channel is noiseless, while the other is noisy. Thus, at the decoder, one description is received error-free, while the other may carry bit errors. Then the decoder uses the error-free description as side information to improve the reconstruction. The effectiveness of the decoder in alleviating the impact of bit errors depends on the mapping $\gamma $ of side lattice points to binary indexes. We propose the design of a structured bit-error resilient mapping $\gamma $. For this, the set of side lattice points is first partitioned using Voronoi regions of an appropriate coarse lattice. Next a good linear channel code is selected, each Voronoi region is assigned a coset of this channel code, and the side lattice points within each Voronoi region are mapped to binary sequences in the corresponding coset. In addition, we argue that the performance of $\gamma $ is improved by assigning cosets close in Hamming distance to neighboring Voronoi regions, and propose a technique to achieve this goal. We derive a lower bound on the error correction performance of the proposed mapping $\gamma $ in terms of the performance of the channel code $C$ used in its construction. Interestingly, we prove that, as the rate of the MDLVQ grows to infinity, the mapping $\gamma $ becomes as good as the code $C$ in correcting bit errors. Simulation results show the significant superiority of the proposed index mapping versus random mappings. [ABSTRACT FROM AUTHOR]

In this paper, we give lower bounds on the size of $(a,b)$ elementary trapping sets (ETSs) of variable-regular LDPC codes with any girth, $g$ , and irregular ones with girth 8, where $a$ is the size and $b$ is the number of degree-one check nodes. Our proposed lower bounds are analytical, applicable to all values of $g$ and $b$ , based on graph theories and tighter than the existing ones in the literature. Our results mostly depend on the girth. We also propose results, which are independent of the girth and rely on the variables $a$ , $b$ , $\gamma $ , and the column weight value. We obtain the tightest lower bounds on the size of ETSs of variable-regular LDPC codes with girth eight. These results provide us with a chance to present a method to achieve the minimum size of ETSs of irregular LDPC codes with girth, especially those whose column weight values are a subset of {2, 3, 4, 5, 6} and fulfill the inequality $(b/a)<1$. Moreover, we present a range of numerical results about $(a,b)$ ETSs with girths 8 and 10 to compare the tightness between our proposed lower bounds and the existing bounds in the literature. [ABSTRACT FROM AUTHOR]

A source coding problem in which a central source has to satisfy the demands of several receivers, with each receiver having some subset of the messages (side-information) held by the source is considered. The source has knowledge of only the cardinality of the side-information at each receiver. The encoding scheme used by the source to transmit at a higher throughput is referred to as an informed source code. A technique to obtain informed source codes by using $\ell $ -th Near Maximum Distance Separable (Near-MDS) Codes is presented. The advantage of using $\ell $ -th Near-MDS codes is the reduction in field size required. For certain informed source coding problems, the code obtained from $\ell $ -th Near-MDS codes is shown to be of the minimum length under certain field size restrictions. The same technique can be used for a given index coding problem to obtain index codes. The index codes obtained through this technique are optimal for, but not limited to, special cases of index coding problems discussed in the paper. Finding an optimal solution to a general index coding problem is NP hard and this technique helps in finding binary suboptimal solutions. Using the Gilbert-Varshamov bound, an upper bound on the lengths of optimal binary informed source codes is obtained. [ABSTRACT FROM PUBLISHER]

In this paper, we propose a new multi-edge metric-constrained quasi-cyclic progressive edge-growth algorithm (MM-QC-PEGA), which is suitable for constructing both single- and multi-weighted (binary) QC low-density parity-check (LDPC) codes with arbitrary lengths, rates, circulant sizes, and variable node (VN)-degree distributions. The MM-QC-PEGA is able to detect all cyclic-edge-set-minimum-virtual cycles (CMVCs), as it accurately computes the metric value of each CMVC with an a posteriori test. In addition, we propose a new greatest-common-divisor (GCD)-approximation for time efficiently approximating the metric value of a CMVC without a posteriori tests, and propose a new GCD-approximated MM-QC-PEGA (G-MM-QC-PEGA) by using the GCD-approximation to replace the a posteriori test involved in the MM-QC-PEGA. As a result, the G-MM-QC-PEGA is faster than the MM-QC-PEGA, and the CMVCs undetectable to the G-MM-QC-PEGA under multi- and single-weighted QC-LDPC code graphs have minimum lengths of eight and ten, respectively. Moreover, we propose a new masking technique that is efficient in masking the parity-check matrix consisting of an array of arbitrary circulants of the same size. Compared with the several existing works, our proposed algorithms could perform better or comparably in terms of avoiding generating small cycles and error performances. Our proposed algorithms somewhat perfect the works of QC-LDPC code construction. [ABSTRACT FROM PUBLISHER]

In this paper, we study a compressive random access scheme that allows the active device identification with unique sparse identification sequences in machine-type communications to support a number of devices. Since the performance of active device identification can be easily degraded by the background noise as well as distortion by frequency-selective fading channels due to the sparsity of identification sequences, we propose a channel coding approach for sparse identification sequences and derive a low-complexity method for maximum likelihood decoding. Based on the proposed channel coding approach, we can significantly improve the performance of active device identification. We also consider a low-complexity detection method to detect signals transmitted with sparse identification sequences and derive a closed-form expression for the bit error rate. [ABSTRACT FROM PUBLISHER]

Adaptive modulation is widely employed to improve spectral efficiency. To date, square signal constellations have been used with adaptive modulation. In this paper, triangular constellations are considered for this purpose. Triangle quadrature amplitude modulation (TQAM) for both power-of-two and non-power-of-two modulation orders is examined. A technique for TQAM mapping is presented which is better than existing approaches. A new type of TQAM called semi-regular TQAM (S-TQAM) is introduced. Bit error rate expressions for TQAM are derived, and the detection complexity of S-TQAM is compared with that of regular TQAM (R-TQAM) and irregular TQAM (I-TQAM). The performance of S-TQAM over additive white Gaussian noise and Rayleigh fading channels is compared with that of R-TQAM and I-TQAM. [ABSTRACT FROM PUBLISHER]

In this paper, a cross-layer design for communication and control layers for wireless feedback control systems is considered, and an optimized receiver design for state feedback is proposed. The proposed receiver is designed on the basis of a maximum à posteriori probability decision and utilizes the control layer’s information, namely, the estimated state information of a Kalman filter-based state observer, as the à priori information of the transmitted state feedback. In addition, the proposed receiver provides the error covariance information of the received state feedback for the control layer. The recursive structure of the receiver and state observer is simple and suitable for the feedback control loop. The improvement in the channel error probability is supported by the control accuracy and vice versa. Numerical results show that the proposed receiver can effectively reduce the number of channel errors in the received state feedback and improve the control performance. [ABSTRACT FROM PUBLISHER]

The differential chaos shift keying with code index modulation (CIM-DCSK) using Walsh codes can increase the data rate, but error rate performance degrades over practical multipath channel with high delay spread. To tackle this drawback, this paper proposes a parallel CIM-DCSK (PT-CIM-DCSK), where the first time slot is used to transmit the chaotic reference sequence, and the second slot is used to transmit the multiple sequences carrying data bits. In particular, multiple $q$ chaotic sequences are added for data transmission in parallel, and each sequence is modulated by CIM-DCSK with $m_{c}$ bits. By exploiting the quasi-orthogonal characteristics of permuted chaotic signals, the interference between $q$ sequences can be remarkably suppressed. In this way, given the data rate, PT-CIM-DCSK can achieve a larger length of Walsh segment than the CIM-DCSK, since its parallel transmission compensates the rate. In addition, the error performance of the proposed scheme over the multipath Rayleigh fading channel is theoretically analyzed. The theoretical and consistent simulation results demonstrate that the PT-CIM-DCSK can obtain significant performance gains over the conventional CIM-DCSK, and the gain can be up to 5 dB in multipath fading channel with high delay. This is because the larger Walsh segment of PT-CIM-DCSK provides the enhanced robustness against multipath effect. The performance superiority of the proposed scheme is further verified in practical ultra-wideband (UWB) wireless industrial scenarios, which suggests promising for low-cost and low-complexity wireless communication applications. [ABSTRACT FROM AUTHOR]

A joint energy and correlation detection aided orthogonal frequency division multiplexing differential chaos shift keying (JECD-OFDM-DCSK) system is presented in this paper, where the reference and information-bearing signals of JECD-OFDM-DCSK are superimposed in the same time slot so that the phase offset between the reference and information-bearing signals is addressed. In JECD-OFDM-DCSK, only some subcarriers are activated and additional information bits are transmitted by the indices of these activated subcarriers, thereby improving the data rate while reducing the energy consumption. The energy efficiency, peak to average power ratio (PAPR) performance and system complexity of JECD-OFDM-DCSK are analyzed and then compared to other systems. The comparison results show JECD-OFDM-DCSK can obtain higher energy efficiency and better PAPR performance compared to its competitors at the cost of higher system complexity. Furthermore, the bit error rate (BER) expressions of JECD-OFDM-DCSK are derived in additive white Gaussian noise (AWGN) and multipath fading channels. Simulation results show that the BER performance of JECD-OFDM-DCSK outperforms that of other OFDM-based DCSK systems. Finally, JECD-OFDM-DCSK performs much better than other systems over the underwater acoustic (UWA) channel, which validates the robustness of JECD-OFDM-DCSK. [ABSTRACT FROM AUTHOR]

Pliable index coding (PICOD) has recently been regarded as a promising solution that exploits the coding advantage to improve communication efficiency of content-type systems (e.g., recommendation system), where clients are pliable and are interested in receiving any new message that they do not have. PICOD aims to find an effective coding strategy that satisfies the demands of all clients with the minimum number of transmissions. However, most of the previous works mainly provided theoretical understanding on PICOD in special instances based on greedy algorithms. In contrast, in this paper, we present a flexible sparse and low-rank matrix modeling approach to minimize the number of transmissions for the general PICOD problems. This is achieved by establishing generalized pliable alignment conditions to guarantee the requirements of all clients. As the resulting non-convex problem is highly intractable, we further develop an alternating pursuit framework to detect the rank of the matrix to be recovered by using the rank-increasing strategy. To address the feasibility-detection issues in the existing methods, we propose an alternating projection algorithm, which admits closed-form expressions and avoids excessive sparsity inducing. Moreover, we establish the global convergence of the alternating projection algorithm with random initial points. Simulation results demonstrate that the proposed alternating pursuit algorithm significantly reduces the number of transmissions compared to the state-of-the-art methods. [ABSTRACT FROM AUTHOR]

This paper presents generalized channel coding theorems for a time-slotted distributed communication system where a transmitter-receiver pair is communicating in parallel with other transmitters. Assume that the channel code of each transmitter is chosen arbitrarily in each time slot. The coding choice of a transmitter is denoted by a code index parameter, which is known neither to other transmitters nor to the receiver. Fundamental performance limitation of the system is characterized using an achievable region defined in the space of the code index vectors. As the codeword length is taken to infinity, for all code index vectors inside the region, the receiver will decode the message reliably, while for all code index vectors outside the region, the receiver will report a collision reliably. A generalized system error performance measure is defined as the weighted sum of probabilities of different types of communication error events. Assume that the receiver chooses an “operation region” and intends to decode the message if the code index vector is inside the operation region. Achievable bounds on the tradeoff between the operation region and the generalized error performance measure are obtained under the assumption of a finite codeword length. [ABSTRACT FROM PUBLISHER]

A novel modulation scheme for an indoor optical wireless communication (OWC) system referred to as generalized time slot index modulation (GTIM) is proposed for single-carrier frequency domain equalization (SC-FDE) systems. This scheme is further referred to as SC-GTIM. In SC-GTIM, information bits are flexibly encoded onto both the amplitudes and positions of pulses. A set partitioning algorithm is proposed to construct a codebook for the SC-GTIM system. In this paper, SC-GTIM will be compared with the conventional pulse amplitude modulation-based SC-FDE (SC-PAM) and time slot index modulation-based SC-FDE (SC-TIM). By considering a multipath optical wireless channel and the limited dynamic range of a light emitting diode (LED), a considerable bit error ratio (BER) gain can be achieved by SC-GTIM. It is concluded that SC-GTIM is a promising technique for low to medium spectral efficiency transmission and uplink schemes. [ABSTRACT FROM AUTHOR]

In this paper, linear index codes with multiple senders are studied, where every receiver receives encoded messages from all senders. A new fitting matrix for the multiple senders is proposed and it is proved that the minimum rank of the proposed fitting matrices is the optimal codelength of linear index codes for the multiple senders. In addition, a new type of a side information graph related with the optimal codelength is proposed and whether given side information is critical or not is studied. Furthermore, linear index codes for the cellular network scenario are studied, where each receiver can receive a subset of sub-codewords. Since some receivers cannot receive the entire codeword in the cellular network scenario, the encoding method based on the fitting matrix has to be modified. In the cellular network scenario, we propose another fitting matrix and prove that an optimal generator matrix can be found based on these fitting matrices. In addition, some properties on the optimal codelength of linear index codes for the cellular network case are studied. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the fundamentals of puncturing and shortening for polar codes, based on binary domination. For punctured and shortened polar codes, we prove that the partial order by binary domination completely determines both incapable bit patterns (by puncturing) and fixed bit patterns (by shortening). In particular, we give a necessary and sufficient condition for an encoder output bit to be fixed by additionally shortening a single encoder input bit, as well as a necessary and sufficient condition for an encoder input bit to be made incapable by additionally puncturing a single encoder output bit. We also identify all the puncturing bit patterns yielding a given incapable bit pattern. These results provide a guidance to design a practical rate-matching scheme for polar codes. As an example, we present a rate-matching scheme based on our analytical observations. Numerical results show that it performs well over a wide range of code lengths and rates, compared with conventional rate-matching schemes. [ABSTRACT FROM AUTHOR]

Next-generation cellular systems are anticipated to support 100 times higher data rates (ultra-high rate) compared with the fourth generation (4G) of cellular systems. It is, therefore, necessary to develop novel spectrally efficient uplink/downlink techniques. Multiple techniques have been proposed, including the so-called non-orthogonal multiple access (NOMA) technique. However, the spectral efficiency gains achieved by NOMA over OMA techniques have been shown to be modest. Recently, we proposed a spectrally efficient technique for the downlink channel, which involves exploiting similarities among users’ short bit blocks, where we showed that spectral efficiency gains of up to three times that of OMA schemes can be achieved. However, the technique cannot be extended to the uplink scenario because users are not aware of each other’s bit block. To this end, we propose in this paper a spectrally efficient scheme for the uplink channel, where we exploit the similarity between the short bit blocks of the uplink and downlink sequences corresponding to one user. The downlink bit sequences are those received by a user from the base station (BS). It is assumed that the BS keeps track of the bit sequences transmitted on the downlink channel to different users. The uplink and downlink bit sequences, which are assumed to be uncorrelated, are divided into bit blocks of short lengths, and then, the similarity between those blocks is extracted. Once each user determines its similarity index (i.e., the number of similar bit blocks) between its own bit sequence and its respective downlink bit sequence, this information is communicated with the BS, which will, in turn, select the user with the largest similarity index to transmit during that resource block. The same process repeats every resource block where the user with the maximum similarity index is always selected. We propose a simple overhead exchange algorithm that facilitates the exchange of the information on the similarity indexes between the users and the BS, where we assume that this exchange of information is done through a control channel. The performance of the proposed scheme and the overhead exchange algorithm is investigated analytically and by Monte Carlo simulations. Among the parameters that we incorporate into the analysis are the user density, the length of bit blocks used to check the similarity index, and the channel correlation. We show that spectral efficiency gains of approximately two times that of OMA schemes can be achieved. [ABSTRACT FROM AUTHOR]

There is a recent surge of research interest in the study of performance-enhancing techniques for orthogonal frequency division multiplexing (OFDM)-based relay systems. Among those, subcarrier mapping has been verified to be an effective one for boosting the system capacity and improving the error performance. However, it has to be performed at the relay, which subsequently conveys the subcarrier permutation information to the destination. The existing signaling scheme occupies a portion of subcarriers to this end, leading to a loss of spectral efficiency. In this paper, we propose a novel signaling scheme to eliminate this overhead by transferring the subcarrier permutation to the mode permutation that can be implicitly conveyed without consuming additional spectrum resources. We adopt phase rotation for mode design considering both non-adaptive and adaptive modulation, and illustrate the proposed scheme by taking the dual-hop OFDM relaying with semi-blind amplify-and-forward protocol as an example. An asymptotically tight upper bound on the bit error rate (BER) of the proposed scheme is derived in closed-form over Rayleigh fading channels. BER simulation results validate the analysis and show that the proposed scheme asymptotically approaches the ideal case that assumes perfect knowledge of subcarrier permutation information at the destination and significantly outperforms the existing scheme in the asymptotic signal-to-noise ratio region at the same spectral efficiency. [ABSTRACT FROM AUTHOR]

In this paper, a dual-mode differential chaos shift keying with index modulation (DM-DCSK-IM) is proposed. In the proposed system, the bit stream is partitioned into two subblocks, where the first subblock is the mapped bits used to select the active time slot, which presents the time slot’s constellation mode, and the second subblcok is the modulated bits, which are further divided into two groups and modulated by a pair of distinguishable modem-mode constellations, respectively. Unlike the recently proposed pulse-position-modulation differential chaos shift keying (PPM-DCSK), since both the active and inactive time slots are applied to convey the information bits, the data rate of the proposed system can be promoted significantly. In order to detect the active time slots and recover the mapped bits as well as modulated bits correctly, we propose an effective detection algorithm for the proposed system. Furthermore, the theoretical bit error rate (BER) expressions are derived over additive white Gaussian noise (AWGN) and multipath Rayleigh fading channels, and the simulation results validate the accuracy of our derivations. Finally, the BER performance of the proposed system is compared with the other non-coherent chaotic communication systems, and the results indicate that the proposed system can offer competitive and satisfactory BER performance. [ABSTRACT FROM AUTHOR]

In this paper, a novel scheme dubbed space-time block coded rectangular differential spatial modulation (STBC-RDSM) is proposed for multiple-input and multiple-out (MIMO) systems, which combines space-time block coding (STBC) and rectangular differential spatial modulation (RDSM) to reap their respective benefits while avoiding the drawbacks of conventional differential spatial modulation (DSM) systems. More specifically, in the proposed STBC-RDSM scheme, information bits are conveyed via the rectangular differentially encoded antenna index matrices, as well as the STBC blocks. Furthermore, a low-complexity detection scheme is proposed. Our simulation results demonstrate that STBC-RDSM outperforms its conventional DSM counterparts in various spectral efficiencies. Finally, a closed-form union bound on the bit error rate (BER) is derived and validated by our simulation results. [ABSTRACT FROM AUTHOR]

This paper presents density evolution (DE) techniques based on reciprocal channel approximation (RCA) for general bit-interleaved coded modulation (BICM) systems. The original RCA-based DE (RCA-DE) technique is implemented under the assumption of binary-input additive white Gaussian noise channels (BI-AWGNCs). In BICM systems, however, $M$ -ary modulation schemes are generally used, and they can be regarded as to be a parallel transmission of $\log _{2} M$ bits. Thus, $\log _{2} M$ separate bit-level channels, which are not Gaussian equivalent, need to be considered. In order to extend the conventional RCA-DE technique to BICM systems, we first establish a model of protograph BICM ensembles. Two methods are developed based on the bit error rate (BER) and the BICM capacity in order to find a corresponding BI-AWGNC that models each of the bit-level channels. Using these methods, we implement the protograph RCA-DE technique for BICM systems and show that it achieves an accurate estimation. As a practical application of the proposed RCA-DE method, we design bit interleavers in order to achieve better BICM performance in the 3GPP New Radio (NR) LDPC coding system. Numerical results show that performance gain of up to 0.3 dB is consistently achieved over a wide range of parameter values. [ABSTRACT FROM AUTHOR]

Visible light communications (VLC) is a promising and uncharted new technology for the next generation of wireless communication systems. This paper proposes a novel generalized light emitting diode (LED) index modulation method for multiple-input-multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM)-based VLC systems. The proposed scheme avoids the typical spectrum efficiency losses incurred by time- and frequency-domain shaping in OFDM signals. This is achieved by exploiting spatial multiplexing along with LED index modulation. Accordingly, real and imaginary components of the complex time-domain OFDM signals are separated first, then resulting bipolar signals are transmitted over a VLC channel by encoding sign information in LED indexes. As a benchmark, we demonstrate the performance analysis of our proposed system for both analytical and physical channel models. Furthermore, two novel receiver designs are proposed. Each one is suitable for frequency-flat or selective channel scenarios. It has been shown via extensive computer simulations that the proposed scheme achieves considerably better bit error ratio versus signal-to-noise-ratio performance than the existing VLC-MIMO-OFDM systems that use the same number of transmit and receive units [LEDs and photo diodes (PDs)]. Compared with the single-input single-output (SISO) DC biased optical (DCO)-OFDM system, both spectral efficiency and DC bias can be doubled and removed respectively simply by exploiting a MIMO configuration. [ABSTRACT FROM PUBLISHER]