Iterative IDMA Receivers with Random and Tree Based Interleavers

In recent days, on the horizon of wireless world, newly proposed multiple access scheme known as Interleave-Division Multiple-Access (IDMA) has made its remarkable impact. Researchers all over world, are making hard marks to establish the scheme to establish its claim as potential candidate for 4th generation wireless communication systems. This paper is concerned with the performance enhancement of iterative IDMA systems under coded & uncoded environment. The performance of an interleave division multiple access (IDMA) system can be improved by the optimized power allocation techniques. Based on the optimized power allocation technique we compare the performance of coded & uncoded IDMA system with random interleaver & tree based interleaver. During the simulation, it has been observed that tree based interleaver demonstrate the similar bit error rate (BER) performance to that of random interleaver however on other fronts including bandwidth and memory requirement at transmitter and receiver ends, it outperforms the random interleavers. Keywords: Tree Based Interleaver, Random Interleaver, IDMA, linear programming, power allocation, BER

Performance Evaluation of Maximal Ratio Receiver Combining Diversity with Prime Interleaver for Iterative IDMA Receiver

The antenna diversity mechanism is established as the well known mechanism for reduction of probability of occurrence of communication failures (outages) caused by fades. In receiver diversity, multiple antennas are employed at the receiver side in case of transmitter diversity, multiple antennas are the integral part of transmitter section.. In this paper, Maximal Ratio Receiver Combining (MRRC) diversity technique is evaluated to mitigate the effect of fading in IDMA scheme employing random interleaver and prime interleaver with single transmit two receiving antennas in low rate coded environment. For the performance evaluation, channel is assumed to be Rayleigh multipath channel with BPSK modulation. Simulation results demonstrate the significant improvement in BER performance of IDMA with maximal ratio receiver combining (MRRC) diversity along with prime interleaver and random interleaver and it has also been observed that BER performance of prime interleaver is similar to that of random interleaver with reduced bandwidth and memory requirement at transmitter and receiver side. Keywords: Multipath Fading, MRRC diversity, Multi user detection, Interleave-Division Multiple Access (IDMA) Scheme, Random Interleaver, Prime Interleave

Application of Diversity Techniques for Multi User IDMA Communication System

In wireless communication, fading problem is mitigated with help of diversity techniques. This paper presents Maximal Ratio Combining (MRC) diversity approach to uproot the fading problem in interleave-division multiple-access (IDMA) scheme. The approach explains receiver diversity as well as transmits diversity analysis as 1:2 and 2:1 antenna system in fading environment, no. of antennas can be increased to improve diversity order. Random interleaver as well tree based interleaver has been taken for study. Significant improvements in performance of IDMA communication is observed with application of diversity techniques. Keywords: Random Interleaver, Tree Based Interleaver, MRC diversity, IDM

Superposition Mapping & Related Coding Techniques

Since Shannon's landmark paper in 1948, it has been known that the capacity of a Gaussian channel can be achieved if and only if the channel outputs are Gaussian. In the low signal-to-noise ratio (SNR) regime, conventional mapping schemes suffice for approaching the Shannon limit, while in the high SNR regime, these mapping schemes, which produce uniformly distributed symbols, are insufficient to achieve the capacity. To solve this problem, researchers commonly resort to the technique of signal shaping that mends the symbol distribution, which is originally uniform, into a Gaussian-like one. Superposition mapping (SM) refers to a class of mapping techniques which use linear superposition to load binary digits onto finite-alphabet symbols that are suitable for waveform transmission. Different from conventional mapping schemes, the output symbols of a superposition mapper can easily be made Gaussian-like, which effectively eliminates the necessity of active signal shaping. For this reason, superposition mapping is of great interest for theoretical research as well as for practical implementations. It is an attractive alternative to signal shaping for approaching the channel capacity in the high SNR regime. This thesis aims to provide a deep insight into the principles of superposition mapping and to derive guidelines for systems adopting it. Particularly, the influence of power allocation to the system performance, both w.r.t the achievable power efficiency and supportable bandwidth efficiency, is made clear. Considerable effort is spent on finding code structures that are matched to SM. It is shown that currently prevalent code design concepts, which are mostly derived for coded transmission with bijective uniform mapping, do not really fit with superposition mapping, which is often non-bijective and nonuniform. As the main contribution, a novel coding strategy called low-density hybrid-check (LDHC) coding is proposed. LDHC codes are optimal and universally applicable for SM with arbitrary type of power allocation

Low-Density Hybrid-Check Coded Superposition Mapping and its Application in OFDM and MIMO

Since Shannon’s landmark paper, many approaches have been proposed to achieve the channel capacity. In the low SNR regime, the problem has almost been solved by capacity achieving channel codes. The research on coded modulation in the high SNR regime is still under development. Among many methods in accomplishing this goal, superposition mapping is an elegant way as it does not require extra shaping to generate a Gaussian-like distributed signal. Superposition mapping has been shown to offer very close to capacity performance for the AWGN channel by combining with an irregular channel code. The aim of this thesis is to search for a code which provides stable performance for moderate sequence length and sufficient number of iterations, which is more suitable for implementation. Concerning channel coding for superposition mapping, a generalized code design has recently been proposed. The so-called low-density hybrid-check (LDHC) coding intends to contrive coding and modulation in a joint way. The LDHC coding is constructed by integrating modulation into the Tanner graph. Thus, the complete code can be obtained by taking the effects of all the components into account. In this thesis, the LDHC code design is extended to OFDM and MIMO. For OFDM, the bit loading can be realized in the graph. In case of MIMO with spatial multiplexing, the code is extended to the spatial domain. In both cases, a suitable system structure will be proposed in this thesis. It will also be shown how this novel code design improves the system performance

Doubly Orthogonal Wavelet Packets for Multi-Users Indoor Visible Light Communication Systems

Visible Light Communication (VLC) is a data communication technology that modulates the intensity of the light to transmit the information mostly by means of Light Emitting Diodes (LEDs). The data rate is mainly throttled by the limited bandwidth of the LEDs. To combat, Multi-carrier Code Division Multiple Access (MC-CDMA) is a favorable technique for achieving higher data rates along with reduced Inter-Symbol Interference (ISI) and easy access to multi-users at the cost of slightly reduced compromised spectral efficiency and Multiple Access Interference (MAI). In this article, a multi-user VLC system is designed using a Discrete Wavelet Transform (DWT) that eradicates the use of cyclic prefix due to the good orthogonality and time-frequency localization properties of wavelets. Moreover, the design also comprises suitable signature codes, which are generated by employing double orthogonality depending upon Walsh codes and Wavelet Packets. The proposed multi-user system is simulated in MATLAB software and its overall performance is assessed using line-of-sight (LoS) and non-line-of-sight (NLoS) configurations. Furthermore, two sub-optimum multi-users detection schemes such as zero forcing (ZF) and minimum-mean-square-error (MMSE) are also used at the receiver. The simulated results illustrate that the doubly orthogonal signature waveform-based DWT-MC-CDMA with MMSE detection scheme outperforms the Walsh code-based multi-user system

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

逐次干渉除去を用いた多元接続システムのパワー割り当てに関する研究

In future wireless communication networks, the number of devices is likely to increase dramatically due to potential development of new applications such as the Internet of Things (IoT). Consequently, radio access network is required to support multiple access of massive users and achieve high spectral efficiency. From the information theoretic perspective, orthogonal multiple access protocols are suboptimal. To achieve the multiple access capacity, non-orthogonal multiple access protocols and multiuser detection (MUD) are required. For the non-orthogonal code-division multiple access (CDMA), several MUD techniques have been proposed to improve the spectrum efficiency. Successive interference cancellation (SIC) is a promising MUD techniques due to its low complexity and good decoding performance. Random access protocols are designed for the system with bursty traffic to reduce the delay, compared to the channelized multiple access. Since the users contend for the channel instead of being assigned by the base station (BS), collisions happen with a certain probability. If the traffic load becomes relatively high, the throughput of these schemes steeply falls down because of collisions. However, it has been well-recognized that more complex procedures can permit decoding of interfering signals, which is referred to as multi-packet reception (MPR). Also, an SIC decoder might decode more packets by successively subtracting the correctly decoded packets from the collision. Cognitive radio (CR) is an emerging technology to solve the problem of spectrum scarcity by dynamically sharing the spectrum. In the CR networks, the secondary users (SUs) are allowed to dynamically share the frequency bands with primary users (PUs) under primary quality-of-service (QoS) protection such as the constraint of interference temperature at the primary base station (PBS). For the uplink multiple access to the secondary base station (SBS), transmit power allocation for the SUs is critical to control the interference temperature at the PBS. Transmit power allocation has been extensively studied in various multiple access scenarios. The power allocation algorithms can be classified into two types, depending on whether the process is controlled by the base station (BS). For the centralized power allocation (CPA) algorithms, the BS allocates the transmit powers to the users through the downlink channels. For the random access protocols, there are also efforts on decentralized power allocation (DPA) that the users select transmit powers according to given distributions of power and probability, instead of being assigned the transmit power at each time slot by the BS. In this dissertation, the DPA algorithms for the random access protocols with SIC are investigated and new methods are proposed. First a decentralized multilevel power allocation algorithm to improve the MAC throughput performance is proposed, for the general SIC receiver that can decode multiple packets from one collision. Then an improved DPA algorithm to maximize the overall system sum rate is proposed, taking into account of both the MAC layer and PHY layer. Finally, a DPA algorithm for the CR secondary random access is proposed, considering the constraint of interference temperature and the practical assumption of imperfect cancellation. An opportunistic transmission protocol for the fading environment to further reduce the interference temperature is also proposed. For the future work, the optimal DPA for the random access with the SIC receiver is still an open problem. Besides, advanced multiple access schemes that aim to approach the multiple access capacity by combining the advantages of the network coded cooperation, the repetition slotted ALOHA, and the SIC receiver are also interesting.電気通信大学201

Energy-efficient diversity combining for different access schemes in a multi-path dispersive channel

Dissertação para obtenção do Grau de Doutor em Engenharia Electrotécnica e ComputadoresThe forthcoming generation of mobile communications, 5G, will settle a new standard for a larger bandwidth and better Quality of Service (QoS). With the exploding growth rate of user generated data, wireless standards must cope with this growth and at the same time be energy efficient to avoid depleting the batteries of wireless devices. Besides these issues, in a broadband wireless setting QoS can be severely affected from a multipath dispersive channel and therefore be energy demanding. Cross-layered architectures are a good choice to enhance the overall performance of a wireless system. Examples of cross-layered Physical (PHY) - Medium Access Control (MAC) architectures are type-II Diversity Combining (DC) Hybrid-ARQ (H-ARQ) and Multi-user Detection (MUD) schemes. Cross-layered type-II DC H-ARQ schemes reuse failed packet transmissions to enhance data reception on posterior retransmissions; MUD schemes reuse data information from previously collided packets on posterior retransmissions to enhance data reception. For a multipath dispersive channel, a PHY layer analytical model is proposed for Single-Carrier with Frequency Domain Equalization (SC-FDE) that supports DC H-ARQ and MUD. Based on this analytical model, three PHY-MAC protocols are proposed. A crosslayered Time Division Multiple Access (TDMA) scheme that uses DC H-ARQ is modeled and its performance is studied in this document; the performance analysis shows that the scheme performs better with DC and achieves a better energy efficiency at the cost of a higher delay. A novel cross-layered prefix-assisted Direct-Sequence Code Division Multiple Access (DS-CDMA) scheme is proposed and modeled in this document, it uses principles of DC and MUD. This protocol performs better by means of additional retransmissions, achieving better energy efficiency, at the cost of higher redundancy from a code spreading gain. Finally, a novel cross-layered protocol H-ARQ Network Division Multiple Access (H-NDMA) is proposed and modeled, where the combination of DC H-ARQ and MUD is used with the intent of maximizing the system capacity with a lower delay; system results show that the proposed scheme achieves better energy efficiency and a better performance at the cost of a higher number of retransmissions. A comparison of the three cross-layered protocols is made, using the PHY analytical model, under normalized conditions using the same amount of maximum redundancy. Results show that the H-NDMA protocol, in general, obtains the best results, achieving a good performance and a good energy efficiency for a high channel load and low Signal-to-Noise Ratio (SNR). TDMA with DC H-ARQ achieves the best energy efficiency, although presenting the worst delay. Prefix-assisted DS-CDMA in the other hand shows good delay results but presents the worst throughput and energy efficiency

An Investigation of Orthogonal Wavelet Division Multiplexing Techniques as an Alternative to Orthogonal Frequency Division Multiplex Transmissions and Comparison of Wavelet Families and Their Children

Recently, issues surrounding wireless communications have risen to prominence because of the increase in the popularity of wireless applications. Bandwidth problems, and the difficulty of modulating signals across carriers, represent significant challenges. Every modulation scheme used to date has had limitations, and the use of the Discrete Fourier Transform in OFDM (Orthogonal Frequency Division Multiplex) is no exception. The restriction on further development of OFDM lies primarily within the type of transform it uses in the heart of its system, Fourier transform. OFDM suffers from sensitivity to Peak to Average Power Ratio, carrier frequency offset and wasting some bandwidth to guard successive OFDM symbols. The discovery of the wavelet transform has opened up a number of potential applications from image compression to watermarking and encryption. Very recently, work has been done to investigate the potential of using wavelet transforms within the communication space. This research will further investigate a recently proposed, innovative, modulation technique, Orthogonal Wavelet Division Multiplex, which utilises the wavelet transform opening a new avenue for an alternative modulation scheme with some interesting potential characteristics. Wavelet transform has many families and each of those families has children which each differ in filter length. This research consider comprehensively investigates the new modulation scheme, and proposes multi-level dynamic sub-banding as a tool to adapt variable signal bandwidths. Furthermore, all compactly supported wavelet families and their associated children of those families are investigated and evaluated against each other and compared with OFDM. The linear computational complexity of wavelet transform is less than the logarithmic complexity of Fourier in OFDM. The more important complexity is the operational complexity which is cost effectiveness, such as the time response of the system, the memory consumption and the number of iterative operations required for data processing. Those complexities are investigated for all available compactly supported wavelet families and their children and compared with OFDM. The evaluation reveals which wavelet families perform more effectively than OFDM, and for each wavelet family identifies which family children perform the best. Based on these results, it is concluded that the wavelet modulation scheme has some interesting advantages over OFDM, such as lower complexity and bandwidth conservation of up to 25%, due to the elimination of guard intervals and dynamic bandwidth allocation, which result in better cost effectiveness