Self-concatenated code design and its application in power-efficient cooperative communications

In this tutorial, we have focused on the design of binary self-concatenated coding schemes with the help of EXtrinsic Information Transfer (EXIT) charts and Union bound analysis. The design methodology of future iteratively decoded self-concatenated aided cooperative communication schemes is presented. In doing so, we will identify the most important milestones in the area of channel coding, concatenated coding schemes and cooperative communication systems till date and suggest future research directions

Dispensing with channel estimation: differentially modulated cooperative wireless communications

As a benefit of bypassing the potentially excessive complexity and yet inaccurate channel estimation, differentially encoded modulation in conjunction with low-complexity noncoherent detection constitutes a viable candidate for user-cooperative systems, where estimating all the links by the relays is unrealistic. In order to stimulate further research on differentially modulated cooperative systems, a number of fundamental challenges encountered in their practical implementations are addressed, including the time-variant-channel-induced performance erosion, flexible cooperative protocol designs, resource allocation as well as its high-spectral-efficiency transceiver design. Our investigations demonstrate the quantitative benefits of cooperative wireless networks both from a pure capacity perspective as well as from a practical system design perspective

Efficient Transmission Techniques in Cooperative Networks: Forwarding Strategies and Distributed Coding Schemes

This dissertation focuses on transmission and estimation schemes in wireless relay network, which involves a set of source nodes, a set of destination nodes, and a set of nodes helps communication between source nodes and destination nodes, called relay nodes. It is noted that the overall performance of the wireless relay systems would be impacted by the relay methods adopted by relay nodes. In this dissertation, efficient forwarding strategies and channel coding involved relaying schemes in various relay network topology are studied.First we study a simple structure of relay systems, with one source, one destination and one relay node. By exploiting “analog codes” -- a special class of error correction codes that can directly encode and protect real-valued data, a soft forwarding strategy –“analog-encode-forward (AEF)”scheme is proposed. The relay node first soft-decodes the packet from the source, then re-encodes this soft decoder output (Log Likelihood Ratio) using an appropriate analog code, and forwards it to the destination. At the receiver, both a maximum-likelihood (ML) decoder and a maximum a posterior (MAP) decoder are specially designed for the AEF scheme.The work is then extended to parallel relay networks, which is consisted of one source, one destination and multiple relay nodes. The first question confronted with us is which kind of soft information to be relayed at the relay nodes. We analyze a set of prevailing soft information for relaying considered by researchers in this field. A truncated LLR is proved to be the best choice, we thus derive another soft forwarding strategy – “Z” forwarding strategy. The main parameter effecting the overall performance in this scheme is the threshold selected to cut the LLR information. We analyze the threshold selection at the relay nodes, and derive the exact ML estimation at the destination node. To circumvent the catastrophic error propagation in digital distributed coding scheme, a distributed soft coding scheme is proposed for the parallel relay networks. The key idea is the exploitation of a rate-1 soft convolutional encoder at each of the parallel relays, to collaboratively form a simple but powerful distributed analog coding scheme. Because of the linearity of the truncated LLR information, a nearly optimal ML decoder is derived for the distributed coding scheme. In the last part, a cooperative transmission scheme for a multi-source single-destination system through superposition modulation is investigated. The source nodes take turns to transmit, and each time, a source “overlays” its new data together with (some or all of) what it overhears from its partner(s), in a way similar to French-braiding the hair. We introduce two subclasses of braid coding, the nonregenerative and the regenerative cases, and, using the pairwise error probability (PEP) as a figure of merit, derive the optimal weight parameters for each one. By exploiting the structure relevance of braid codes with trellis codes, we propose a Viterbi maximum-likelihood (ML) decoding method of linear-complexity for the regenerative case. We also present a soft-iterative joint channel-network decoding. The overall decoding process is divided into the forward message passing and the backward message passing, which makes effective use of the available reliability information from all the received signals. We show that the proposed “braid coding” cooperative scheme benefits not only from the cooperative diversity but also from the bit error rate (BER) performance gain

Two-user Cooperative Transmission Using Superposition Modulation and Soft Information Combining

We propose a cooperative transmission scheme for two users with one common relay using superposition modulation. It uses distributed Turbo codes (DTCs) for each user. The relay always decodes, then interleaves and re-encodes the decoded data. A new packet is formed by combining the re-encoded packets from both users using superposition modulation. This packet is forwarded to the destination with the average receive SNRs of each user. The destination uses the cooperative Turbo decoder of [1] to improve performance. Simulation results show the proposed scheme outperforms XOR based schemes and is simple to implement

Energy Harvesting in Cooperative Communications

Ühiskommunikatsioon on võimalik meetod lahendamaks informatsiooni levimist juhtmeta võrgus mitmikteekonna korral. See võimaldab laiendada võrgu katvust ning pakkuda võimendust kasutades olemasolevat taristut. Praktikas tehakse seda kasutades sõlmpunkte vahereleedena. Nii mitmese ligipääsuga releede süsteem kui paralleelsete releede süsteem on võimalikud kandidaadid tulevastes juhtmeta ühisvõrkudes nende ülekandekiiruse efektiivsuse ning parema energiatarbe tõttu.\n\r\n\rVõimenda-ja-edasta (AF) ning dekodeeri-ja-edasta (DF) on peamised ühisreleede protokollid, mida kasutatakse üle releekanalite. Me uurime käesolevas magistritöös paralleelseid releesid AF ühiskommunikatsiooni võrkudes kasutades QPSK signaliseerimist üle Rayleigh’ kiirelt hajuva kanali koos valge aditiivse Gaussi müraga. Sihtkohas vastuvõetud signaali detekteerimiseks kasutades võrgus olevaid tegevuseta kasutatakse maksimaalse suhte ühendamise (MRC) meetodit. Mõõtes sihtkohast vastu võetud ühendsignaali sümbolite veasuhet (SER) arvutusliku simulatsiooni abil, uurime me suhet releede arvu ning kommunikatsiooni kvaliteedi vahel.\n\r\n\rSüsteemi energeetiline efektiivsus määrab selle operatsioonilise jätkusuutlikkuse. Energiakogumise (EH) meetod on hädavajalik tehnoloogia juhtmeta süsteemides, kus on piiratud ligipääs usaldusväärsele elektritoitele ja laadimisvõimalustele. Käesolevas magistritöös uurime me mitmese ligipääsuga releede süsteeme kasutades EHtehnoloogiat. Me eeldame, et lähte- ja releesõlmedel pole ühendatud energiaallikat, kuid on taaslaetav energiatalletus. Seega, iga sõlme käivitatakse ligipääsupunkti (AP) edastatud raadiosignaalidelt kogutud energiast ning iga sõlm toimib salvesta-siis- koostööta (STC) režiimis. Me simuleerime arvutuslikult ühendusetaseme jõudlust kasutades füüsilise ühenduse võrgukodeerimist EHja DF protokolli olemasolul. Käesolev magistritöö esitab erinevaid energiakogumise meetodeid (EH ja STC) ning nende katkemistõenäosusi. Esitatud skeemid saavutavad SER jõudluse, mis läheneb püsiva toiteallikaga jõudlusele ning laiendab oluliselt süsteemi energiapüsivust, samas säilitades pidevat läbilaskejõudlust.Cooperative communications is a promising technique used to combat the multipath propagation in wireless networks. It can also extend the network coverage and provide the diversity gain by using the existing infrastructure. In practice, this is often achieved by using idle nodes in the network as relays. The multiple access relay system and parallel relay system are appealing candidates for emerging wireless cooperative networks due to bandwidth efficiency and improved power consumption.\n\r\n\rThe amplify and forward (AF) and decode and forwards (DF) protocols are basic cooperative relay protocols used over the relay channels. In this thesis, we study parallel relays in AF cooperative communication networks using QPSK signalling over the Rayleigh fast fading with additive Gaussian noise channels. The maximum ratio combining (MRC) method is employed to detect the received signals at the destination. By simulating the symbol error rate (SER) of the combined received signal at the destination, we study a trade-off between the number of relays and the quality of the communications. \n\r\n\rThe energy efficiency of a system determines its operational sustainability. Energy harvesting (EH) is a crucial technology for a variety of wireless systems that have limited access to a reliable electricity supply or recharging sources. In this thesis, the design of a multiple access relay system (MARS) using EH is considered. We assume that the sources and the relay have no embedded power supply but rechargeable energy storage devices. Thus, each node is powered by harvesting the energy from the RF signals broadcasted by an access point (AP), and it operates in store-then-cooperate (STC) mode. We simulate the link level performance by using the physical layer network coding in the presence of EH with DF protocol. The thesis presents energy harvesting schemes (EH and STC) and outage probability analysis. The schemes presented in this thesis achieve SER performance approaching that of a fixed power supply and contribute significantly to sustaining the energy in the system while maintaining a constant throughput

Analysis and Design of Non-Orthogonal Multiple Access (NOMA) Techniques for Next Generation Wireless Communication Systems

The current surge in wireless connectivity, anticipated to amplify significantly in future wireless technologies, brings a new wave of users. Given the impracticality of an endlessly expanding bandwidth, there’s a pressing need for communication techniques that efficiently serve this burgeoning user base with limited resources. Multiple Access (MA) techniques, notably Orthogonal Multiple Access (OMA), have long addressed bandwidth constraints. However, with escalating user numbers, OMA’s orthogonality becomes limiting for emerging wireless technologies. Non-Orthogonal Multiple Access (NOMA), employing superposition coding, serves more users within the same bandwidth as OMA by allocating different power levels to users whose signals can then be detected using the gap between them, thus offering superior spectral efficiency and massive connectivity. This thesis examines the integration of NOMA techniques with cooperative relaying, EXtrinsic Information Transfer (EXIT) chart analysis, and deep learning for enhancing 6G and beyond communication systems. The adopted methodology aims to optimize the systems’ performance, spanning from bit-error rate (BER) versus signal to noise ratio (SNR) to overall system efficiency and data rates. The primary focus of this thesis is the investigation of the integration of NOMA with cooperative relaying, EXIT chart analysis, and deep learning techniques. In the cooperative relaying context, NOMA notably improved diversity gains, thereby proving the superiority of combining NOMA with cooperative relaying over just NOMA. With EXIT chart analysis, NOMA achieved low BER at mid-range SNR as well as achieved optimal user fairness in the power allocation stage. Additionally, employing a trained neural network enhanced signal detection for NOMA in the deep learning scenario, thereby producing a simpler signal detection for NOMA which addresses NOMAs’ complex receiver problem

Combined distributed turbo coding and space frequency block coding techniques

The distributed space-time (frequency) coding and distributed channel turbo coding used independently represent two cooperative techniques that can provide increased throughput and spectral efficiency at an imposed maximum Bit Error Rate (BER) and delay required from the new generation of cellular networks. This paper proposes two cooperative algorithms that employ jointly the two types of techniques, analyzes their BER and spectral efficiency performances versus the qualities of the channels involved, and presents some conclusions regarding the adaptive employment of these algorithms. © 2010 V. Bota et al.FP7/ICT/2007/21547

Combined distributed turbo coding and space frequency block coding techniques

The distributed space-time (frequency) coding and distributed channel turbo coding used independently represent two cooperative techniques that can provide increased throughput and spectral efficiency at an imposed maximum Bit Error Rate (BER) and delay required from the new generation of cellular networks. This paper proposes two cooperative algorithms that employ jointly the two types of techniques, analyzes their BER and spectral efficiency performances versus the qualities of the channels involved, and presents some conclusions regarding the adaptive employment of these algorithms. © 2010 V. Bota et al.FP7/ICT/2007/21547