11 research outputs found

    An Algebraic Coding Scheme for Wireless Relay Networks With Multiple-Antenna Nodes

    Get PDF
    We consider the problem of coding over a half-duplex wireless relay network where both the transmitter and the receiver have respectively several transmit and receive antennas, whereas each relay is a small device with only a single antenna. Since, in this scenario, requiring the relays to decode results in severe rate hits, we propose a full rate strategy where the relays do a simple operation before forwarding the signal, based on the idea of distributed space-time coding. Our scheme relies on division algebras, an algebraic object which allows the design of fully diverse matrices. The code construction is applicable to systems with any number of transmit/receive antennas and relays, and has better performance than random code constructions, with much less encoding complexity. Finally, the robustness of the proposed distributed space-time codes to node failures is considered

    An Algebraic Coding Scheme for Wireless Relay Networks With Multiple-Antenna Nodes

    Full text link

    The amplify-and-forward half-duplex cooperative system: Pairwise error probability and precoder design

    Get PDF
    Abstract-In this paper, an exact asymptotic pairwise error probability (PEP) is derived for a half-duplex cooperative system employing an amplify-and-forward (AF) protocol. When compared with the PEP of a traditional multiple-input multipleoutput (MIMO) system, the "diversity gain" for the cooperative system is no longer just a simple exponential function of the signal-to-noise ratio (SNR), rather, it involves the logarithm of the SNR. The term diversity gain function is used to designate this characteristic of the PEP. The coding gain, on the other hand, is found similar to that for the MIMO system and is proportional to the determinant of the autocorrelation of the error matrix. Based on our analysis and observations, we propose a design of unitary precoder for the cooperative system to achieve the full diversity gain function. For the case of a 4-QAM signal being transmitted, we further optimize the coding gain, and arrive at a closed-form optimum precoder. Simulations indicate that our proposed precoder designs greatly improve the performance of the cooperative system. Index Terms-Cooperative system, half-duplex, amplify-andforward (AF), pairwise error probability, diversity gain function, precoder

    Communication over Asynchronous Networks: Signaling and Rate-Reliability Analysis

    Get PDF
    Asynchronism inherently exists in many communication systems specially in multi-terminal networks mainly due to the effect of multi-path and propagation delay. While in theoretical analysis of communication systems perfect synchronization of the terminals is often presumed, in some cases in which the nodes are randomly distributed over a geometrical area, it might be impossible to synchronize the nodes even if an ideal infrastructure service provider is used. In this work, two major categories of multi-user communication systems, i.e., relay networks and interference channels, are considered and the effect of the asynchronism among the terminals on characteristic properties of these channels are investigated. In Chapter 2, the construction of distributed space-time codes for a general two-hop asynchronous cooperative relay network is considered. A novel algebraic structure is proposed and shown to achieve full diversity for arbitrary number of relays, arbitrary input alphabets, and arbitrary delay profiles among the relays. Unlike previously proposed delay tolerant schemes, the new design has minimum length which translates into smaller decoding complexity at the same transmission rate. Full-rate and full-diversity are achieved by the new designs with or without the use of guard intervals between successive transmissions. Simulation results confirm the mathematical analysis of the proposed codes. In Chapter 3, the underlying asynchronous network is examined for various relaying protocols such as non-orthogonal selection decode-and-forward, orthogonal selection decode-and-forward, non-orthogonal amplify-and-forward (NAF), and orthogonal amplify-and-forward (OAF). The transmitter nodes send pulse amplitude modulation (PAM) signals, in which information symbols are linearly modulated by a shaping waveform to be sent to the destination, asynchronously. We consider two different cases with respect to the type of the shaping waveforms used in the structure of the PAM signals. In the theoretical case where band-limited shaping waveforms are used, it is shown that the asynchronism does not affect the DMT performance of the system and the same DMT as that of the corresponding synchronous network is obtained for all the aforementioned protocols. In the practical case where time-limited shaping waveforms are used, it is shown that better diversity gains can be achieved at the expense of a bandwidth expansion. More precisely, in the decode-and-forward type protocols, the asynchronous network provides a better diversity gain than that of the corresponding synchronous network throughout the range of the multiplexing gain. In the amplify-and-forward type protocols, the asynchronous network provides the same DMT as that of the corresponding synchronous counterpart under the OAF protocol; however, a better diversity gain is achieved under the NAF protocol throughout the range of the multiplexing gain. In particular, in the single relay asynchronous network, the NAF protocol provides the same DMT as that of the 2 × 1 multiple-input single-output channel. In Chapter 4, a constant K-user interference channel in which the users are not symbol synchronous is considered. It is shown that the asynchronism among the users does not affect the total number of degrees of freedom (DOF) of this channel; however, it facilitates aligning interfering signals at each receiver node. To achieve the total K/2 DOF of this channel when single antenna nodes are used, a novel practical interference alignment scheme is proposed wherein the alignment task is performed with the help of asynchronous delays which inherently exist among the received signals at each receiver node. The asynchronism causes inter-symbol-interference (ISI) among transmitted symbols by different transmitters resulting in the underlying quasi-static links to be converted to ISI and accordingly into time varying channels. It is proved that this conversion solves the lack of channel variation required for the interference alignment in quasi-static scenarios. When each node is equipped with M > 1 antennas, it is argued that the same alignment scheme proposed for the single antenna nodes’ interference channel is sufficient to achieve the total MK/2 DOF of the medium provided that each pair of the transmitters and the receivers experience the same asynchronous delay for all the corresponding antennas. In contrast to previously proposed alignment schemes, the channel state information of the links does not need to be known at the transmitter nodes. Instead, the relative delays among the received signals at each receiver node are globally known to the entire network. While the asynchronism is usually treated as a troublesome factor in communication systems, in this dissertation, we are interested to introduce it as a useful property of the wireless medium similar to the fading which can improve the system performance in some communication scenarios or facilitate signaling over the medium in some other scenarios

    Simplified decoding techniques for linear block codes

    Get PDF
    Error correcting codes are combinatorial objects, designed to enable reliable transmission of digital data over noisy channels. They are ubiquitously used in communication, data storage etc. Error correction allows reconstruction of the original data from received word. The classical decoding algorithms are constrained to output just one codeword. However, in the late 50’s researchers proposed a relaxed error correction model for potentially large error rates known as list decoding. The research presented in this thesis focuses on reducing the computational effort and enhancing the efficiency of decoding algorithms for several codes from algorithmic as well as architectural standpoint. The codes in consideration are linear block codes closely related to Reed Solomon (RS) codes. A high speed low complexity algorithm and architecture are presented for encoding and decoding RS codes based on evaluation. The implementation results show that the hardware resources and the total execution time are significantly reduced as compared to the classical decoder. The evaluation based encoding and decoding schemes are modified and extended for shortened RS codes and software implementation shows substantial reduction in memory footprint at the expense of latency. Hermitian codes can be seen as concatenated RS codes and are much longer than RS codes over the same aphabet. A fast, novel and efficient VLSI architecture for Hermitian codes is proposed based on interpolation decoding. The proposed architecture is proven to have better than Kötter’s decoder for high rate codes. The thesis work also explores a method of constructing optimal codes by computing the subfield subcodes of Generalized Toric (GT) codes that is a natural extension of RS codes over several dimensions. The polynomial generators or evaluation polynomials for subfield-subcodes of GT codes are identified based on which dimension and bound for the minimum distance are computed. The algebraic structure for the polynomials evaluating to subfield is used to simplify the list decoding algorithm for BCH codes. Finally, an efficient and novel approach is proposed for exploiting powerful codes having complex decoding but simple encoding scheme (comparable to RS codes) for multihop wireless sensor network (WSN) applications
    corecore