411 research outputs found

    Collaborative HARQ Schemes for Cooperative Diversity Communications in Wireless Networks

    Get PDF
    Wireless technology is experiencing spectacular developments, due to the emergence of interactive and digital multimedia applications as well as rapid advances in the highly integrated systems. For the next-generation mobile communication systems, one can expect wireless connectivity between any devices at any time and anywhere with a range of multimedia contents. A key requirement in such systems is the availability of high-speed and robust communication links. Unfortunately, communications over wireless channels inherently suffer from a number of fundamental physical limitations, such as multipath fading, scarce radio spectrum, and limited battery power supply for mobile devices. Cooperative diversity (CD) technology is a promising solution for future wireless communication systems to achieve broader coverage and to mitigate wireless channels’ impairments without the need to use high power at the transmitter. In general, cooperative relaying systems have a source node multicasting a message to a number of cooperative relays, which in turn resend a processed version message to an intended destination node. The destination node combines the signal received from the relays, and takes into account the source’s original signal to decode the message. The CD communication systems exploit two fundamental features of the wireless medium: its broadcast nature and its ability to achieve diversity through independent channels. A variety of relaying protocols have been considered and utilized in cooperative wireless networks. Amplify and forward (AAF) and decode and forward (DAF) are two popular protocols, frequently used in the cooperative systems. In the AAF mode, the relay amplifies the received signal prior to retransmission. In the DAF mode, the relay fully decodes the received signal, re-encodes and forwards it to the destination. Due to the retransmission without decoding, AAF has the shortcoming that noise accumulated in the received signal is amplified at the transmission. DAF suffers from decoding errors that can lead to severe error propagation. To further enhance the quality of service (QoS) of CD communication systems, hybrid Automatic Repeat-reQuest (HARQ) protocols have been proposed. Thus, if the destination requires an ARQ retransmission, it could come from one of relays rather than the source node. This thesis proposes an improved HARQ scheme with an adaptive relaying protocol (ARP). Focusing on the HARQ as a central theme, we start by introducing the concept of ARP. Then we use it as the basis for designing three types of HARQ schemes, denoted by HARQ I-ARP, HARQ II-ARP and HARQ III-ARP. We describe the relaying protocols, (both AAF and DAF), and their operations, including channel access between the source and relay, the feedback scheme, and the combining methods at the receivers. To investigate the benefits of the proposed HARQ scheme, we analyze its frame error rate (FER) and throughput performance over a quasi-static fading channel. We can compare these with the reference methods, HARQ with AAF (HARQ-AAF) and HARQ with perfect distributed turbo codes (DTC), for which correct decoding is always assumed at the relay (HARQ-perfect DTC). It is shown that the proposed HARQ-ARP scheme can always performs better than the HARQ-AAF scheme. As the signal-to-noise ratio (SNR) of the channel between the source and relay increases, the performance of the proposed HARQ-ARP scheme approaches that of the HARQ-perfect DTC scheme

    Relay communications over frequency-selective fading channels

    Get PDF
    Wireless communications over long distances can be assisted by a third radio acting as a relay. If the relay is placed close to the source, then the source-relay link will be characterized as a fairly benign additive white Gaussian noise (AWGN) channel. However, the long distance link from relay to destination is susceptible to frequency-selective fading. This thesis explores the design and analysis of a particular relay communication system characterized by a low power source, a relay that is close to the source, and a frequency-selective channel from relay to destination. Because the direct link from source to destination is very weak, it is not exploited, but rather communications is via a traditional two-hop process.;Link design is based on the high speed download packet access (HSDPA) standard, which uses a combination of turbo coding, hybrid-ARQ, and multicode CDMA. To provide further diversity, the relay-destination link uses a secondary spreading code, rake reception, and multiple receive antennas. An extensive analysis was conducted to study the influence of a wide variety of link configurations and channel conditions. The study was accelerated through the use of a quasi-analytical approach based on the concept of information-outage, which allows the link to be simulated without requiring a turbo decoder

    Polar Coding Schemes for Cooperative Transmission Systems

    Get PDF
    : In this thesis, a serially-concatenated coding scheme with a polar code as the outer code and a low density generator matrix (LDGM) code as the inner code is firstly proposed. It is shown that that the proposed scheme provides a method to improve significantly the low convergence of polar codes and the high error floor of LDGM codes while keeping the advantages of both such as the low encoding and decoding complexity. The bit error rate results show that the proposed scheme by reasonable design have the potential to approach a performance close to the capacity limit and avoid error floor effectively. Secondly, a novel transmission protocol based on polar coding is proposed for the degraded half-duplex relay channel. In the proposed protocol, the relay only needs to forward a part of the decoded source message that the destination needs according to the exquisite nested structure of polar codes. It is proved that the scheme can achieve the capacity of the half-duplex relay channel while enjoying low encoding/decoding complexity. By modeling the practical system, we verify that the proposed scheme outperforms the conventional scheme designed by low-density parity-check codes by simulations. Finally, a generalized partial information relaying protocol is proposed for degraded multiple-relay networks with orthogonal receiver components (MRN-ORCs). In such a protocol, each relay node decodes the received source message with the help of partial information from previous nodes and re-encodes part of the decoded message for transmission to satisfy the decoding requirements for the following relay node or the destination node. For the design of polar codes, the nested structures are constructed based on this protocol and the information sets corresponding to the partial messages forwarded are also calculated. It is proved that the proposed scheme achieves the theoretical capacity of the degraded MRN-ORCs while still retains the low-complexity feature of polar codes

    Distributed Cooperative Spatial Multiplexing System

    Get PDF
    Multiple-Input-Multiple-Output (MIMO) spatial multiplexing systems can increase the spectral efficiency manyfold, without extra bandwidth or transmit power, however these advantages are based on the assumption that channels between different transmit antenna and receive antenna are independent which requires the elements in antenna array be separated by several wavelengths. For small mobile devices, the requirement is difficult to implement in practice. Cooperative spatial multiplexing (C-SM) system provides a solution: it organizes antennas on distributed mobile stations to form a virtual antenna array (VAA) to support spatial multiplexing. In this thesis, we propose a novel C-SM system design which includes a transmitter with two antennas, a single antenna receiver and a relay group with two single antenna relays. In this design, we assume that the transmitter tries to transmit two coded independent messages to the receiver simultaneously but the transmitter-receiver link is too weak to support the transmission. Thus a relay group is introduced to help with the transmission. After relays receive the messages from the transmitter via a 2Ă—22\times 2 MIMO link, they first detect and quantize the received messages, then compress them independently according to the Slepian and Wolf theorem, the compressed messages are sent to the receiver simultaneously where de-compression and de-quantization are performed on the received messages. After that the resulting messages are combined to estimate the original coded messages. The estimated coded messages are decoded to produce the original messages. The basic system structure is studied and an analytical bit error rate expression is derived. Several transmission protocols are also introduced to enhance the system BER performance. The merit of this design is focus on the relay destination link. Because the Slepian and Wolf theorem is applied on the relay-destination link, messages at the relays can be compressed independently and de-compressed jointly at the receiver with arbitrarily small error probability but still achieve the same compression rate as a joint compression scheme does. The Slepian and Wolf theorem is implemented by a joint source-channel code in this thesis. Several schemes are introduced and tested, the testing results and performance analysis are given in this thesis. According to the chief executive officer (CEO) problem in the network information theory, we discover an error floor in this design. An analytical expression for this error floor is derived. A feedback link is also introduced from the receiver to the relays to allow the relays to cooperatively adapt their compression rates to the qualities of the received messages. Two combination schemes at the receiver are introduced, their performances are examined from the information theory point of view, the results and performance analysis are given in this thesis. As we assume that the relay destination link is a multiple access channel (MAC) suffers from block Rayleigh fading and white Gaussian noise, the relationship between the MAC channel capacity and the Slepian and Wolf compression rate region is studied to analyse the system performance

    Cooperative Distributed Transmission and Reception

    Get PDF
    In telecommunications, a cooperative scheme refers to a method where two or more users share or combine their information in order to increase diversity gain or power gain. In contrast to conventional point-to-point communications, cooperative communications allow different users in a wireless network to share resources so that instead of maximizing the performance of its own link, each user collaborates with its neighbours to achieve an overall improvement in performance. In this dissertation, we consider different models for transmission and reception and explore cooperative techniques that increase the reliability and capacity gains in wireless networks, with consideration to practical issues such as channel estimation errors and backhaul constraints. This dissertation considers the design and performance of cooperative communication techniques. Particularly, the first part of this dissertation focuses on the performance comparison between interference alignment and opportunistic transmission for a 3-user single-input single- output (SISO) interference channel in terms of average sum rate in the presence of channel estimation errors. In the case of interference alignment, channel estimation errors cause interference leakage which consequently results in a loss of achievable rate. In the case of opportunistic transmission, channel estimation errors result in a non-zero probability of incorrectly choosing the node with the best channel. The effect of these impairments is quantified in terms of the achievable average sum rate of these transmission techniques. Analysis and numerical examples show that SISO interference alignment can achieve better average sum rate with good channel estimates and at high SNR whereas opportunistic transmission provides better performance at low SNR and/or when the channel estimates are poor. We next considers the problem of jointly decoding binary phase shift keyed (BPSK) messages from a single distant transmitter to a cooperative receive cluster connected by a local area network (LAN). An approximate distributed receive beamforming algorithm is proposed based on the exchange of coarsely- quantized observations among some or all of the nodes in the receive cluster. By taking into account the differences in channel quality across the receive cluster, the quantized information from other nodes in the receive cluster can be appropriately combined with locally unquantized information to form an approximation of the ideal receive beamformer decision statistic. The LAN throughput requirements of this technique are derived as a function of the number of participating nodes in the receive cluster, the forward link code rate, and the quantization parameters. Using information-theoretic analysis and simulations of an LDPC coded system in fading channels, numerical results show that the performance penalty (in terms of outage probability and block error rate) due to coarse quantization is small in the low SNR regimes enabled by cooperative distributed reception. An upper/lower bound approximation is derived based on a circle approximation in the channel magnitude domain which provides a pretty fast way to compute the outage probability performance for a system with arbitrary number of receivers at a given SNR. In the final part of this dissertation, we discuss the distributed reception technique with higher- order modulation schemes in the forward link. The extension from BPSK to QPSK is straightforward and is studied in the second part of this dissertation. The extension to 8PSK, 4PAM and 16QAM forward links, however, is not trivial. For 8PSK, two techniques are proposed: pseudobeamforming and 3-bit belief combining where the first one is intuitive and turns out to be suboptimal,the latter is optimal in terms of outage probability performance. The idea of belief combining can be applied to the 4PAM and 16QAM and it is shown that better/finer quantizer design can further improve the block error rate performance. Information-theoretic analysis and numerical results are provided to show that significant reliability and SNR gains can be achieved by using the proposed schemes

    Covert Communication in Autoencoder Wireless Systems

    Get PDF
    The broadcast nature of wireless communications presents security and privacy challenges. Covert communication is a wireless security practice that focuses on intentionally hiding transmitted information. Recently, wireless systems have experienced significant growth, including the emergence of autoencoder-based models. These models, like other DNN architectures, are vulnerable to adversarial attacks, highlighting the need to study their susceptibility to covert communication. While there is ample research on covert communication in traditional wireless systems, the investigation of autoencoder wireless systems remains scarce. Furthermore, many existing covert methods are either detectable analytically or difficult to adapt to diverse wireless systems. The first part of this thesis provides a comprehensive examination of autoencoder-based communication systems in various scenarios and channel conditions. It begins with an introduction to autoencoder communication systems, followed by a detailed discussion of our own implementation and evaluation results. This serves as a solid foundation for the subsequent part of the thesis, where we propose a GAN-based covert communication model. By treating the covert sender, covert receiver, and observer as generator, decoder, and discriminator neural networks, respectively, we conduct joint training in an adversarial setting to develop a covert communication scheme that can be integrated into any normal autoencoder. Our proposal minimizes the impact on ongoing normal communication, addressing previous works shortcomings. We also introduce a training algorithm that allows for the desired tradeoff between covertness and reliability. Numerical results demonstrate the establishment of a reliable and undetectable channel between covert users, regardless of the cover signal or channel condition, with minimal disruption to the normal system operation

    On implementation aspects of decode and forward and compress and forward relay protocols

    Get PDF
    In this work, the common relay protocols Decode-and-Forward and Compress-and-Forward (CF) are investigated from a practical point of view: This involves on the one hand the impact of imperfections like channel and carrier phase stimation errors and on the other hand, the question of how to implement relay protocol specific signal processing like quantization for CF which is modeled in information theory simply by additive quantizer noise. To evaluate the performance, achievable rates are determined either numerically with the help of the Max-Flow Min-Cut theorem or by link level simulations.Diese Arbeit untersucht die Relay-Protokolle Decode-and-Forward und Compress-and-Forward (CF) mit dem Fokus auf einer praktischen Umsetzung. Es werden sowohl Störeinflüsse wie Kanal- und Phasenschätzfehler betrachtet als auch spezielle Kompressionsverfahren für das CF Protokoll implementiert. Von großer Bedeutung ist hier die Kompression in Form der Quantisierung, weil diese in der Informationstheorie lediglich durch Quantisierungsrauschen modelliert wird. Zur Auswertung der Leistungsfähigkeit der Protokolle werden die erzielbaren Raten entweder numerisch oder durch Simulation bestimmt

    Capacity Approaching Coding Strategies for Machine-to-Machine Communication in IoT Networks

    Get PDF
    Radio access technologies for mobile communications are characterized by multiple access (MA) strategies. Orthogonal MA techniques were a reasonable choice for achieving good performance with single user detection. With the tremendous growth in the number of mobile users and the new internet of things (IoT) shifting paradigm, it is expected that the monthly mobile data traffic worldwide will exceed 24.3 exabytes by 2019, over 100 billion IoT connections by 2025, and the financial impact of IoT on the global economy varies in the range of 3.9 to 11.1 trillion dollars by 2025. In light of the envisaged exponential growth and new trends, one promising solution to further enhance data rates without increasing the bandwidth is by increasing the spectral efficiency of the channel. Non-orthogonal MA techniques are potential candidates for future wireless communications. The two corner points on the boundary region of the MA channel are known to be achievable by single user decoding followed by successive decoding (SD). Other points can also be achieved using time sharing or rate splitting. On the other hand, machine-to-machine (M2M) communication which is an enabling technology for the IoT, enables massive multipurpose networked devices to exchange information among themselves with minor or no human intervention. This thesis consists of three main parts. In the first part, we propose new practical encoding and joint belief propagation (BP) decoding techniques for 2-user MA erasure channel (MAEC) that achieve any rate pair close to the boundary of the capacity region without using time sharing nor rate splitting. While at the encoders, the corresponding parity check matrices are randomly built from a half-rate LDPC matrix, the joint BP decoder employs the associated Tanner graphs of the parity check matrices to iteratively recover the erasures in the received combined codewords. Specifically, the joint decoder performs two steps in each decoding iteration: 1) simultaneously and independently runs the BP decoding process at each constituent sub-graph to recover some of the common erasures, 2) update the other sub-graph with newly recovered erasures and vice versa. When the number of erasures in the received combined codewords is less than or equal to the number of parity check constraints, the decoder may successfully decode both codewords, otherwise the decoder declares decoding failure. Furthermore, we calculate the probability of decoding failure and the outage capacity. Additionally, we show how the erasure probability evolves with the number of decoding iterations and the maximum tolerable loss. Simulations show that any rate pair close to the capacity boundary is achievable without using time sharing. In the second part, we propose a new cooperative joint network and rateless coding strategy for machine-type communication (MTC) devices in the multicast settings where three or more MTC devices dynamically form a cluster to disseminate messages between themselves. Specifically, in the basic cluster, three MTC devices transmit their respective messages simultaneously to the relay in the first phase. The relay broadcasts back the combined messages to all MTC devices within the basic cluster in the second phase. Given the fact that each MTC device can remove its own message, the received signal in the second phase is reduced to the combined messages coming from the other two MTC devices. Hence, this results in exploiting the interference caused by one message on the other and therefore improving the bandwidth efficiency. Furthermore, each group of three MTC devices in vicinity can form a basic cluster for exchanging messages, and the basic scheme extends to N MTC devices. Furthermore, we propose an efficient algorithm to disseminate messages among a large number of MTC devices. Moreover, we implement the proposed scheme employing practical Raptor codes with the use of two relaying schemes, namely amplify and forward (AF) and de-noise and forward (DNF). We show that with very little processing at the relay using DNF relaying scheme, performance can be further enhanced. We also show that the proposed scheme achieves a near optimal sum rate performance. In the third part, we present a comparative study of joint channel estimation and decoding of factor graph-based codes over flat fading channels and propose a simple channel approximation scheme that performs close to the optimal technique. Specifically, when channel state information (CSI) is not available at the receiver, a simpler approach is to estimate the channel state of a group of received symbols, then use the approximated value of the channel with the received signal to compute the log likelihood ratio. Simulation results show that the proposed scheme exhibits about 0.4 dB loss compared to the optimal solution when perfect CSI is available at the receiver
    • …
    corecore