No abstract is provided for this article.
Polar codes have received growing attention in the past decade and have been selected as the coding scheme for the control channel in the fifth generation (5G) wireless communication systems. However, the conventional polar codes have only been constructed by binary (2x2) kernel which poses block length limitation to powers of 2. To attain more flexible block lengths, multi-kernel polar codes are proposed. In this paper, a combinational architecture for multi-kernel polar codes with high throughput is proposed based on successive cancellation decoding algorithm. The proposed scheme can decode pure-binary, pure-ternary (3x3), and binary-ternary mixed polar codes. The decoder's architecture is rate-flexible meaning that a new code rate can be assigned to the decoder at every clock cycle. The proposed architecture is validated by FPGA implementation and the results reveal that a code of size N=81 gains the coded throughput of 1664.5 Mbps. A novel Python-based polar compiler is also proposed to automatically generate the HDL modules for target decoders. A designer can input the target block length and kernel ordering of a polar code, and get the required VHDL files automatically. Based on our simulations, the majority of the required HDL files can be generated in less than 0.4 seconds.
Many performance evaluations for IEEE 802.11 distributed coordination function (DCF) have been formerly reported in the literature; most studies are based on saturation analysis, and a few models under a finite load condition adopt an M/G/l queuing system. However, using M/G/l queuing only considers the first moment of frame service time to derive the probability of transmission queue being vacant. In this paper, we model the DCF using Parallel Space-Time Markov Chain (PSTMC), in which frame arrivals are tracked by monitoring the transmission queue during transitions between successive states of the space-time Markov chain. The proposed framework provides the possibility of modeling the contention phase, backoff and post-backoff procedures, and the transmission queue status. The proposed framework is validated by the simulation results.
We consider the problem of multicasting from a single source to multiple destinations over the erasure channel. We are interested in energy efficient communication. Our performance metric is the number of bits sent per joule of energy spent until a finite amount of packets is delivered from the source to all the destinations. We compare the performance of Random Linear Network Coding (RLNC) and Automatic Repeat reQuest (ARQ) with respect to the above performance metric. Our numerical results illustrate that RLNC is more energy efficient than ARQ when the unreliability of links is high.
No abstract is provided for this article.
Multicarrier code division multiple access (MC-CDMA) has emerged as a promising air interface candidate for future wireless communication systems. With the help of the characteristic function of correlated Nakagami-m variables, the performance of an interleaved MC-CDMA with a maximal-ratio combining (MRC) receiver and frequency selective Nakagami-m fading channels is studied. Computer simulations demonstrate the accuracy of the analysis. Based on the analytical results, with an exhaustive search of different subcarrier interleaving schemes, the optimal subcarrier interleaver which provides the minimum bit error rate (BER) can be achieved. Compared to a random interleaver, the optimal subcarrier interleaver offers considerable performance improvement.
We propose a novel scheme that allows MIMO system to modulate a set of permutation matrices to send more information bits, extending our initial work on the topic. This system is called Permutation Matrix Modulation (PMM). The basic idea is to employ a permutation matrix as a precoder and treat it as a modulated symbol. We continue the evolution of index modulation in MIMO by adopting all-antenna activation and obtaining a set of unique symbols from altering the positions of the antenna transmit power. We provide the analysis of the achievable rate of PMM under Gaussian Mixture Model (GMM) distribution \revv{and finite cardinality input (FCI). Numerical results are evaluated by comparing PMM with the other existing systems.} We also present a way to attain the optimal achievable rate of PMM by solving a maximization problem via interior-point method. A low complexity detection scheme based on zero-forcing (ZF) is proposed, and maximum likelihood (ML) detection is discussed. We demonstrate the trade-off between simulation of the symbol error rate (SER) and the computational complexity where ZF performs worse in the SER simulation but requires much less computational complexity than ML.
In a wireless network, the problem of self-interference arises when a node transmits and receives simultaneously in the same frequency band. So far only two extreme approaches to circumvent this problem were thoroughly investigated in the literature. The first one prevents any node to transmit and receive simultaneously which may lead to a too conservative design. The second one assumes perfect self-interference cancelation which can be too optimistic since it ignores all possible technological limitations. To fill this gap, we provide a method based on complementary geometric programming for evaluating the gains achievable at the network layer when the network nodes employ self-interference cancelation techniques with different degrees of accuracy. The gains are evaluated in terms of average sum rate and average network congestion by using a network utility maximization framework. The method provides insights into the behavior of different network topologies when self-interference cancellation is employed in nodes. In addition, it can be used to assess the required degrees of accuracy of the self-interference in order to achieve substantial benefits. Thus, from a network design perspective, the proposed method is very beneficial. Numerical results suggest that the benefits from self-interference cancelation are more pronounced in tandem wireless network setups in which the network nodes are located in a linear grid.