Performance Analysis of NOMA Multicast Systems Based on Rateless Codes with Delay Constraints

To achieve an efficient and reliable data transmission in time-varying conditions, a novel non-orthogonal multiple access (NOMA) transmission scheme based on rateless codes (NOMA-RC) is proposed in the multicast system in this paper. Using rateless codes at the packet level, the system can generate enough encoded data packets according to users’ requirements to cope with adverse environments. The performance of the NOMA-RC multicast system with delay constraints is analyzed over Rayleigh fading channels. The closed-form expressions for the frame error ratio and the average transmission time are derived for two cases which are a broadcast communication scenario (Scenario 1) and a relay communication scenario (Scenario 2). Under the condition that the quality of service for the edge user is satisfied, an optimization model of power allocation is established to maximize the sum rate. Simulation results show that Scenario 2 can provide better block error ratio performance and exhibit less transmission time than Scenario 1. When compared with orthogonal multiple access (OMA) with rateless codes system, the proposed system can save on the transmission time and improve the system throughput

On the Energy Efficiency of LT Codes in Proactive Wireless Sensor Networks

This paper presents an in-depth analysis on the energy efficiency of Luby Transform (LT) codes with Frequency Shift Keying (FSK) modulation in a Wireless Sensor Network (WSN) over Rayleigh fading channels with pathloss. We describe a proactive system model according to a flexible duty-cycling mechanism utilized in practical sensor apparatus. The present analysis is based on realistic parameters including the effect of channel bandwidth used in the IEEE 802.15.4 standard, active mode duration and computation energy. A comprehensive analysis, supported by some simulation studies on the probability mass function of the LT code rate and coding gain, shows that among uncoded FSK and various classical channel coding schemes, the optimized LT coded FSK is the most energy-efficient scheme for distance d greater than the pre-determined threshold level d_T , where the optimization is performed over coding and modulation parameters. In addition, although the optimized uncoded FSK outperforms coded schemes for d < d_T , the energy gap between LT coded and uncoded FSK is negligible for d < d_T compared to the other coded schemes. These results come from the flexibility of the LT code to adjust its rate to suit instantaneous channel conditions, and suggest that LT codes are beneficial in practical low-power WSNs with dynamic position sensor nodes.Comment: accepted for publication in IEEE Transactions on Signal Processin

Cooperative Communication with Systematic Raptor Codes in 3GPP

In this thesis, considering a one-relay cooperative system, we propose a new cooperative transmission scheme which implements the systematic Raptor code standardized in 3GPP. Within the framework of this scheme, we compare the bandwidth efficiency perfomance of different relaying protocols. To improve the performance of this cooperative system, we use Reed-Solomon(RS) code as inner code which is concatenated with the systematic Raptor code. We first study the scenario when Channel State Information(CSI) is available at the receiver but not available at the transmitter. In this case, only fixed-rate RS code can be implemented. Then we study the scenario when CSI is available at both the transmitter and receiver, and develop an adaptive scheme applied to our model. Last, a straight forward channel estimation method is studied to make the estimation of CSI available at the transmitter. The performance of all the proposed models and protocols are obtained with Monte Carlo simulation

Improving the Bandwidth Efficiency of Multiple Access Channels using Network Coding and Successive Decoding

In this thesis, different approaches for improving the bandwidth efficiency of Multiple Access Channels (MAC) have been proposed. Such improvements can be achieved with methods that use network coding, or with methods that implement successive decoding. Both of these two methods have been discussed here. Under the first method, two novel schemes for using network coding in cooperative networks have been proposed. In the first scheme, network coding generates some redundancy in addition to the redundancy that is generated by the channel code. These redundancies are used in an iterative decoding system at the destination. In the second scheme, the output of the channel encoder in each source node is shortened and transmitted. The relay, by use of the network code, sends a compressed version of the parts missing from the original transmission. This facilitates the decoding procedure at the destination. Simulation based optimizations have been developed. The results indicate that in the case of sources with non-identical power levels, both scenarios outperform the non-relay case. The second method, involves a scheme to increase the channel capacity of an existing channel. This increase is made possible by the introduction of a new Raptor coded interfering channel to an existing channel. Through successive decoding at the destination, the data of both main and interfering sources is decoded. We will demonstrate that when some power difference exists, there is a tradeoff between achieved rate and power efficiency. We will also find the optimum power allocation scenario for this tradeoff. Ultimately we propose a power adaptation scheme that allocates the optimal power to the interfering channel based on an estimation of the main channel's condition. Finally, we generalize our work to allow the possibility of decoding either the secondary source data or the main source data first. We will investigate the performance and delay for each decoding scheme. Since the channels are non-orthogonal, it is possible that for some power allocation scenarios, constellation points get erased. To address this problem we use constellation rotation. The constellation map of the secondary source is rotated to increase the average distance between the points in the constellation (resulting from the superposition of the main and interfering sources constellation.) We will also determine the optimum constellation rotation angle for the interfering source analytically and confirm it with simulations

Near-capacity fixed-rate and rateless channel code constructions

Fixed-rate and rateless channel code constructions are designed for satisfying conflicting design tradeoffs, leading to codes that benefit from practical implementations, whilst offering a good bit error ratio (BER) and block error ratio (BLER) performance. More explicitly, two novel low-density parity-check code (LDPC) constructions are proposed; the first construction constitutes a family of quasi-cyclic protograph LDPC codes, which has a Vandermonde-like parity-check matrix (PCM). The second construction constitutes a specific class of protograph LDPC codes, which are termed as multilevel structured (MLS) LDPC codes. These codes possess a PCM construction that allows the coexistence of both pseudo-randomness as well as a structure requiring a reduced memory. More importantly, it is also demonstrated that these benefits accrue without any compromise in the attainable BER/BLER performance. We also present the novel concept of separating multiple users by means of user-specific channel codes, which is referred to as channel code division multiple access (CCDMA), and provide an example based on MLS LDPC codes. In particular, we circumvent the difficulty of having potentially high memory requirements, while ensuring that each user’s bits in the CCDMA system are equally protected. With regards to rateless channel coding, we propose a novel family of codes, which we refer to as reconfigurable rateless codes, that are capable of not only varying their code-rate but also to adaptively modify their encoding/decoding strategy according to the near-instantaneous channel conditions. We demonstrate that the proposed reconfigurable rateless codes are capable of shaping their own degree distribution according to the nearinstantaneous requirements imposed by the channel, but without any explicit channel knowledge at the transmitter. Additionally, a generalised transmit preprocessing aided closed-loop downlink multiple-input multiple-output (MIMO) system is presented, in which both the channel coding components as well as the linear transmit precoder exploit the knowledge of the channel state information (CSI). More explicitly, we embed a rateless code in a MIMO transmit preprocessing scheme, in order to attain near-capacity performance across a wide range of channel signal-to-ratios (SNRs), rather than only at a specific SNR. The performance of our scheme is further enhanced with the aid of a technique, referred to as pilot symbol assisted rateless (PSAR) coding, whereby a predetermined fraction of pilot bits is appropriately interspersed with the original information bits at the channel coding stage, instead of multiplexing pilots at the modulation stage, as in classic pilot symbol assisted modulation (PSAM). We subsequently demonstrate that the PSAR code-aided transmit preprocessing scheme succeeds in gleaning more information from the inserted pilots than the classic PSAM technique, because the pilot bits are not only useful for sounding the channel at the receiver but also beneficial for significantly reducing the computational complexity of the rateless channel decoder

JOINT NETWORK-CHANNEL CODING WITH C-MRC BASED DEMODULATE AND FORWARD PROTOCOL IN TWO-WAY RELAY CHANNELS

Sayısal aktarma tabanlı işbirlikli telsiz ağlarının sistem karmaşıklığını ve enerji sarfiyatını azaltmak için yapılan araştırma faaliyetleri rölenin aldığı işaretlerde kod çözme yerine kipleme çözme yaptığı kipleme çöz ve ilet tasarımını ortaya çıkarmıştır. Öte yandan işbirlikli en yüksek oranlı birleştirme (İEYOB), iletim verimini düşüren çevrimsel artıklık denetimi (ÇAD) kodlardan faydalanmaksızın sayısal aktarmada hata yayılımı ile mücadele etmede kullanılan yüksek performanslı düşük karmaşıklıklı önemli bir başka tekniktir. Bu çalışmada iki kullanıcının bir röle aracılığı ile veri alışverişi yaptığı iki yönlü röle kanalları için İEYOB tabanlı kipleme çöz ve ilet protokolünü önerilmektedir. İletim süresi, birinci ve ikinci fazların kullanıcıların kodlamasız veya konvolüsyonel kodlamalı verilerinin iletimine tahsis edildiği zamanda üç faza ayrılmıştır. Röle, demodülasyondan sonra bit düzeyinde XOR‟lanmış paketi üçüncü fazda kullanıcılara iletmektedir. Rayleigh sönümlemeli kanallardaki sayısal sonuçlar önerilen yaklaşımın tam çeşitleme seviyesi sağladığını göstermektedir. Research activities to reduce the system complexity and energy consumption of digital relaying based cooperative wireless networks have yielded the demodulate-forward scheme where the relay performs demodulation, instead of decoding, on the received signals. On the other hand, cooperative maximal ratio combining (C-MRC) is another high-performance low-complexity technique used to combat error propagation in digital relaying without exploiting CRC codes which decreases the transmission efficiency. In this study, we propose a C-MRC based demodulate and forward protocol for two-way relay channels where two users exchange information via a relay. The transmission is divided into three phases in time where the first and second phases are allocated to the transmissions of uncoded or convolutionally encoded data of the users. After demodulation, the relay broadcasts the bit-wise XOR-ed packet to the users in the third phase. The numerical results for Rayleigh fading show that the proposed approach provides full diversity gain

Millimetre wave frequency band as a candidate spectrum for 5G network architecture : a survey

In order to meet the huge growth in global mobile data traffic in 2020 and beyond, the development of the 5th Generation (5G) system is required as the current 4G system is expected to fall short of the provision needed for such growth. 5G is anticipated to use a higher carrier frequency in the millimetre wave (mm-wave) band, within the 20 to 90 GHz, due to the availability of a vast amount of unexploited bandwidth. It is a revolutionary step to use these bands because of their different propagation characteristics, severe atmospheric attenuation, and hardware constraints. In this paper, we carry out a survey of 5G research contributions and proposed design architectures based on mm-wave communications. We present and discuss the use of mm-wave as indoor and outdoor mobile access, as a wireless backhaul solution, and as a key enabler for higher order sectorisation. Wireless standards such as IEE802.11ad, which are operating in mm-wave band have been presented. These standards have been designed for short range, ultra high data throughput systems in the 60 GHz band. Furthermore, this survey provides new insights regarding relevant and open issues in adopting mm-wave for 5G networks. This includes increased handoff rate and interference in Ultra-Dense Network (UDN), waveform consideration with higher spectral efficiency, and supporting spatial multiplexing in mm-wave line of sight. This survey also introduces a distributed base station architecture in mm-wave as an approach to address increased handoff rate in UDN, and to provide an alternative way for network densification in a time and cost effective manner