In this dissertation, we address code design problem for cooperative communication over different channel models with emphasis on low complexity designs and structured codes that are attractive for practical implementation. We start with the problem of designing efficient codes for the relay node in Gaussian relay channels. For a class of capacity approaching codes for this channel model, called bilayer lengthened LDPC (BL-LDPC) codes, we calculate a measure of decoding complexity as a function of the number of decoding iterations and propose a technique to design complexity-optimized BL-LDPC codes by minimizing the complexity measure of these codes. This is made possible by generalizing the EXIT charts to the case of BL-LDPC codes. Motivated by the fact that there are usually stricter hardware restrictions at the relay node, our technique targets minimizing the decoding complexity of the relay code. Furthermore, excessive delay due to decoding high rate codes at the relay results in additional delay at the destination. Using our technique, we design bilayer codes with noticeable reduction in decoding complexity and delay compared to the rate-optimized codes reported in the literature. Next, we study the achievable rates for the decode-and-forward (DF) relaying strategy for the Rayleigh fading relay channel where the links have independent normalized Rayleigh fading coefficients and the channel side information is perfectly known at the corresponding receivers but not at the transmitters. We design BL-LDPC codes for this scenario for the case when the source-relay link is much stronger than the source-destination link as well as for the case when these two links have comparable SNRs. We also propose a novel two-user cooperation scheme for the block fading channel model that employs protograph-based LDPC codes. The proposed scenario is based on time division where each user transmits its message to the base station (BS) in two successive frames. Cooperation is performed by employing the Alamouti scheme Whenever it is possible. Additionally, the users encode their information over protograph-based LDPC codes that allow flexible selection of rates and code lengths. Finally, we introduce rate-compatible protograph-based root LDPC (RCPB-R-LDPC) codes for cooperative communication over block fading channels and propose two methods to construct these codes. The proposed techniques are based on the extension technique and offer broad design rates resulting in high flexibility. Furthermore, they are based on protograph constructions with minimum distance growing linearly with the block length, a property that improves the error floor performance of the designed codes. The outage probability limit under BPSK modulation is obtained for the cooperative scheme employed in this work and was used to evaluate the WER performance of the designed codes.

With the rapid expansion of communication networks, there has been an increasing demand for efficient and reliable digital data transmission and storage systems. Many efficient codes have been developed. The LDPC code is one of them. In this thesis, the sum-product algorithm is used in the decoding of LDPC codes. Some schemes for encoding LDPC codes have been studied. In particular, two methods of producing regular H matrices have been attempted that include short cycles of length four with code rates of 0.5, and we present three schemes of finding regular H matrices which do not include short cycles of length four with code rate being 0.5. The effect of short cycles in the bipartite graph of regular LDPC codes has been considered. The simulation results show that the BER performances of regular H matrices that do not include short cycles of length four based on BPSK or 8PSK on AWGN channel is better than those of regular H matrices that include short cycles of length four. In conclusion, in order to obtain good performance with LDPC code, one should design H matrix related to bipartite graph without short cycles.

Facilitating Cooperation for Wireless Systems Cooperative Communications: Hardware, Channel & PHY focuses on issues pertaining to the PHY layer of wireless communication networks, offering a rigorous taxonomy of this dispersed field, along with a range of application scenarios for cooperative and distributed schemes, demonstrating how these techniques can be employed. The authors discuss hardware, complexity and power consumption issues, which are vital for understanding what can be realized at the PHY layer, showing how wireless channel models differ from more traditional models, and highlighting the reliance of PHY algorithm performance on the underlying channel models. Numerous transparent and regenerative relaying protocols are described in detail for a variety of transparent and regenerative cooperative schemes. Key Features: Introduces background, concepts, applications, milestones and thorough taxonomy Identifies the potential in this emerging technology applied to e.g. LTE/WiMAX, WSN Discusses latest wireless channel models for transparent and regenerative protocols Addresses the fundamentals as well as latest emerging PHY protocols Introduces transparent distributed STBC, STTC, multiplexing and beamforming protocols Quantifies regenerative distributed space-time, channel and network coding protocols Explores system optimization, such as distributed power allocation and relay selection Introduces and compares analog and digital hardware architectures Quantifies complexity, memory and power consumption of 3G UMTS & 4G LTE/WiMAX relay Highlights future research challenges within the cooperative communications field This book is an invaluable guide for professionals and researchers in communications fields. It will also be of interest to graduates of communications and electronic engineering courses. It forms part of an entire series dedicated to cooperative wireless systems.

Channel coding provides the means of patterning signals so as to reduce their energy or bandwidth consumption for a given error performance. LDPC codes have been shown to have good error correcting performance which enables efficient and reliable communication. LDPC codes have linear decoding complexity but performance approaching close to shannon capacity with iterative probabilistic decoding algorithm. In this dissertation, the performance of different error correcting code such as convolution, Reed Solomon(RS), hamming, block code are evaluated based on different parameters like code rate, bit error rate (BER), Eb/No, complexity, coding gain and compare with LDPC code. In general, message passing algorithm and the sum-product algorithm are used to decode the message. We showed that logarithmic sum-product algorithm with long block length code reduces multiplication to addition by introducing logarithmic likelihood ratio so that it achieves the highest BER performance among all the decoding algorithms. The astonishing performance combined with proposed modified MS decoding algorithm make these codes very attractive for the next generations digital broadcasting system (ABS - S).

Offers practitioners, researchers, and academicians with fundamental principles of cooperative communication. This book provides readers diverse findings and exposes underlying issues in the analysis, design, and optimization of wireless systems.

This book is one of the most comprehensive and up-to-date books written on Energy Efficiency. The readers will learn about different technologies for energy efficiency policies and programs to reduce the amount of energy. The book provides some studies and specific sets of policies and programs that are implemented in order to maximize the potential for energy efficiency improvement. It contains unique insights from scientists with academic and industrial expertise in the field of energy efficiency collected in this multi-disciplinary forum.

With the number of machine-to-machine (M2M)–enabled devices projected to reach 20 to 50 billion by 2020, there is a critical need to understand the demands imposed by such systems. Machine-to-Machine Communications: Architectures, Technology, Standards, and Applications offers rigorous treatment of the many facets of M2M communication, including its integration with current technology. Presenting the work of a different group of international experts in each chapter, the book begins by supplying an overview of M2M technology. It considers proposed standards, cutting-edge applications, architectures, and traffic modeling and includes case studies that highlight the differences between traditional and M2M communications technology. Details a practical scheme for the forward error correction code design Investigates the effectiveness of the IEEE 802.15.4 low data rate wireless personal area network standard for use in M2M communications Identifies algorithms that will ensure functionality, performance, reliability, and security of M2M systems Illustrates the relationship between M2M systems and the smart power grid Presents techniques to ensure integration with and adaptation of existing communication systems to carry M2M traffic Providing authoritative insights into the technologies that enable M2M communications, the book discusses the challenges posed by the use of M2M communications in the smart grid from the aspect of security and proposes an efficient intrusion detection system to deal with a number of possible attacks. After reading this book, you will develop the understanding required to solve problems related to the design, deployment, and operation of M2M communications networks and systems.