DOCSLIB.ORG

Gallaeer Codes for CDMA Applications

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Gallaeer Codes for CDMA Applications Gallaeeru Codes for CDMA Applications Vladislav Sorokine A t hesis submit ted in conformity with the requirement s for the Degree of Doctor of Philosophy, Graduate Department of Electrical asd Computer Engineering, University of Toronto @ Copyright by Vladislav Sorokine 1998 National Library Bibliothèque nationale du Canada Acquisitions and Acquisitions et Bibliographie Services services bibliographiques 395 Weilingtan Street 395, nie WelIingtan OtrawaON KlAûN4 OttawaON K1AON4 Canada canada The author has granted a non- L'auteur a accordé une licence non exclusive licence allowing the exclusive permettant à la National Libmy of Canada to Bibliothèque nationale du Canada de reproduce, loaq distribute or sell reproduire, prêter, distriîuer ou copies of this thesis in microform, vendre des copies de cette thèse sous paper or electronic formats. la fome de microfiche/nlm, de reproduction sur papier ou sur format électronique. The author retains ownership of the L'auteur consewe la propriété du copyright in this thesis. Neither the droit d'auteur qui protège cette thèse. thesis nor subsîantial extracts fiom it Ni Ia thèse ni des extraits substantiels rnay be printed or othenvise de celle-ci ne doivent être imprimés reproduced without the author's ou autrement reproduits sans son permission. autorisation. To My Teachers Gallager Codes for CDMA Applications A thesis for the degree of Doctor of Philosophy, 1998 Depart ment of Elect rical and Computer Engineering University of Toront O Abstract In this thesis, we develop a new coding system for direct sequence code-division multiple access (DS-CDMA) that supports more multiple users than many previously reported DS-CDMA systems. The most important distinctive feature of this new approach is the use of powerful short fiame Gallager codes for data error protection. These codes combine strong protection against multiple access interference (MAI) and channel noise with small data delays. This combination makes these Gallager codes an excellent choice as an error-protecting scherne in speech-oriented CDMA applications. We investigate the theoretical performance of Gallager codes with maximum- likelihood decoder and derive new block error probability bounds for short frame Gallager codes. We show that these bounds are smaller than block error probabil- ity bounds for many orthogonal and superorthogonal convolutional codes that were previously suggested for similar applications. We propose a new construction for Gallager codes that results in a significant per- formance improvement for short frame Gdager codes and hence makes them strong candidates for CD MA applications. We discuss low complexity iterative decoding al- gorithrns (suboptimal a-pos teriori probability (APP ) algorithms) for Galtager codes. We show that the decoding complexity of Gallager codes obtained in the proposed construction is lower than the decoding complexity of turbo codes and other Gallager code constructions, a feature that leads to implementation of fast software-oriented decoders for Gdager codes. We also investigate decoder hardware implementation issues t hat exploit inherent parallelism of the decoding algorit hm. We present simulation results for Gallager codes in additive white Gaussian noise (AWGN) and fading channels. We show that the strong performance of Gdager codes in AWGN channels successfUy combats multiple access interference in CDMA systems. Gallager codes &O exhibit good performance in fading channels making them particularly suitable for mobile environment. We conclude that Gallager codes are strong candidates for wireless CDMA systerns that are emerging recently as a communication system of choice for the rapidly developing PCS market. ... Ill Acknowledgement s I wish to thank my supervisor Prof. F. Kschischang for his encouragement and in- tellectual challenge in my research. His Mendly advice and participation are among major factors that made my years in the University of Toronto fruitfùl and enjoyable. I wish to thank my co-supervisor Prof. S. Pasupathy for a great many thing that I have leanied from him. He taught me how to discover unexpected connections in the research work. My philosophical outiook would not be complete without a major influence fkom Prof. S. Pasupathy. My discussions with Dr. D. MacKay fiom Cambridge University proved to be extremely fixitfd for this work. 1 would also like to thank my good Glend Prof. S. Dumant of the Mernorial Uni- versity of Newfoundland whose constant encouragement of rny work 1 greatly value. 1am indebted to Communications Group students and faculty for creating a pos- itive atmosphere in the Group. 1 drew fiom multi-cultural experience of my friends and colleagues and 1 would like to thank them for being kind and understanding. Findy, I appreciate the financial support provided by the University of Toronto Open Fellowship, Idormation Technology and Research Center Scholatship, Edward (Ted) Rogers Scholarship and Ontario Graduate Student Scholarship. Contents Abstract Acknowledgements Contents v List of Figures ... List of Tables ~1l1 1 Introduction 1 1.1 Advant ages of error control coding in CDMA .............. 1 1.2 Delays associated with FEC ....................... 3 1.3 Turbo codes, Gdager codes and iterative decoding algorithms .... 4 1.4 Organization of the thesis ........................ 5 2 Gdager codes: theory, generalizations and constructions 7 v 2.1 Background ................................ I 2.2 Notation and definitions ......................... II 2.3 Constructions for Gallager codes ..................... 14 2.4 Generator matrices for Gallager codes .................. 21 2.5 {N, -,3) Gallager codes: minimum Hamming distance and usehl bounds ................................... 22 2.6 Average probability of maximum-likelihood decoding error ...... 33 3 Iterative decoding algorithms: formulations. enhancements. imple- mentations and complexity 43 3.1 Background ................................ 43 3.2 The sum-product algorithm ....................... 47 3.3 The min-sum algorithm ......................... 49 3.4 Algorithm modifications ......................... 51 3.4.1 Computations in the log domain ................. 52 3.4.2 Re-iteration techniques ...................... 54 3.5 Software impIementation issues ..................... 59 3.6 Hardwareimplementationissues ..................... 62 3.7 Encoding and decoding comput ationd complexity ........... 71 3.7.1 Encoding ............................. 71 3.7.2 Decoding ............................. 73 4 CDMA system capacity and simulation results 4.1 Background ................................ 4.2 Combined error-control coding and DS-spreading ............................... 4.3 Capacity of a CDMA cell ......................... 4.4 Successive user cancellation ....................... 4.5 Simulation results for AWGN and fading channels ........... 4.5.1 Performance of Gdager codes in AWGN channels ....... 4.5.2 Performance of Gdager codes in fully interleaved flat Rayleigh- fading channels .......................... 4.5.3 Decoder complexity ........................ 5 Summary of the thesis and future work 92 5.1 Summary of results ............................ 92 5.2 Suggestions for future research ...................... 94 A The min-sum algorithm for Gallager codes 98 References vii List of Figures 1.1 CDMA Systern model: dK(t)is the data stream of K-th user. CK is the K-th user's spreading code, encoder and decoder provide error protection against channel noise and multiple access interference. 2.1 An example of {20,3,4) Gallager code. 2.2 Construction of a general Gallager code. 2.3 Parity-check matrix of Construction 1. - . 2.4 Himination of short cycles in Construction 1. 2.5 Parity-check matrix of Construction 2. 2.6 Exponent &(A) in the upper bound on the average number of codewords of Hamming weight 1 in an {N,-, 3) code. - . - . 2.7 Exponent B2(4in the upper bound on the average nurnber of codewords of Hamrning weight 1 in an {N,-,3) code. - . 2.8 Dependence of function &(A) on the parameter a in (2.30): (a) a = 50. (b) a! = 100. (c) a = 150. - . - . 2.9 Dependence of function Bz(X)on the parameter a in (2.30): (a) a = 50. (b) cr = 100. (c) a = 150. - . - 2.10 Function B(X):(a) obtained by direct enurneration of sequences (Propo- sitions 4-5). (b) obtained by bounding techniques of Propositions 1-2. 2.11 Number of sequencesof weight I = 1536 x X versus A. Left graph: to see the initial growth in the number of sequences of the Hamrning weight I, only Hamming weights such that the corresponding number of codewords is fewer than 1000, have been shown. The typical minimum Hamming distance is 0.15 x 1536 = 230 for {N,-, 3) codes. Right graph: as the Hamming weight of codewords increases. the number of codewords with this Hamming weight grows exponentially. The majority of codewords in the code have a Hamming weight greater than 0.35 x 1536 = 538. ... 2.12 Upper bounds on the maximum-likelihood block error rate versus signal-te noise ratio: (-) (1536, -, 3) Gallager codes; superorthogonal codes [l]: (x) d=3, (+) d=4, (O) d=5.. ....................... 2.13 Bounds on the maximum-likelihood error probability: (-) the union bound; (O) the Gallager bounds with parameter values given in Table 1. ..... Tanner graph of Construction 2 (Fig. 2.5); 0 denotes a site s{1-9) and @ denotes a check cil-?}. ........................ Likelihoods of two possible values for each site given observed values for each site. .................................. Downstream flow of the information in the min-sum
Load more

Recommended publications
  • Ts 136 212 V11.1.0 (2013-02)
    ETSI TS 136 212 V11.1.0 (2013-02) Technical Specification LTE; Evolved Universal Terrestrial Radio Access (E-UTRA); Multiplexing and channel coding (3GPP TS 36.212 version 11.1.0 Release 11) 3GPP TS 36.212 version 11.1.0 Release 11 1 ETSI TS 136 212 V11.1.0 (2013-02) Reference RTS/TSGR-0136212vb10 Keywords LTE ETSI 650 Route des Lucioles F-06921 Sophia Antipolis Cedex - FRANCE Tel.: +33 4 92 94 42 00 Fax: +33 4 93 65 47 16 Siret N° 348 623 562 00017 - NAF 742 C Association à but non lucratif enregistrée à la Sous-Préfecture de Grasse (06) N° 7803/88 Important notice Individual copies of the present document can be downloaded from: http://www.etsi.org The present document may be made available in more than one electronic version or in print. In any case of existing or perceived difference in contents between such versions, the reference version is the Portable Document Format (PDF). In case of dispute, the reference shall be the printing on ETSI printers of the PDF version kept on a specific network drive within ETSI Secretariat. Users of the present document should be aware that the document may be subject to revision or change of status. Information on the current status of this and other ETSI documents is available at http://portal.etsi.org/tb/status/status.asp If you find errors in the present document, please send your comment to one of the following services: http://portal.etsi.org/chaircor/ETSI_support.asp Copyright Notification No part may be reproduced except as authorized by written permission.
    [Show full text]
  • Tm Synchronization and Channel Coding—Summary of Concept and Rationale
    Report Concerning Space Data System Standards TM SYNCHRONIZATION AND CHANNEL CODING— SUMMARY OF CONCEPT AND RATIONALE INFORMATIONAL REPORT CCSDS 130.1-G-3 GREEN BOOK June 2020 Report Concerning Space Data System Standards TM SYNCHRONIZATION AND CHANNEL CODING— SUMMARY OF CONCEPT AND RATIONALE INFORMATIONAL REPORT CCSDS 130.1-G-3 GREEN BOOK June 2020 TM SYNCHRONIZATION AND CHANNEL CODING—SUMMARY OF CONCEPT AND RATIONALE AUTHORITY Issue: Informational Report, Issue 3 Date: June 2020 Location: Washington, DC, USA This document has been approved for publication by the Management Council of the Consultative Committee for Space Data Systems (CCSDS) and reflects the consensus of technical panel experts from CCSDS Member Agencies. The procedure for review and authorization of CCSDS Reports is detailed in Organization and Processes for the Consultative Committee for Space Data Systems (CCSDS A02.1-Y-4). This document is published and maintained by: CCSDS Secretariat National Aeronautics and Space Administration Washington, DC, USA Email: [email protected] CCSDS 130.1-G-3 Page i June 2020 TM SYNCHRONIZATION AND CHANNEL CODING—SUMMARY OF CONCEPT AND RATIONALE FOREWORD This document is a CCSDS Report that contains background and explanatory material to support the CCSDS Recommended Standard, TM Synchronization and Channel Coding (reference [3]). Through the process of normal evolution, it is expected that expansion, deletion, or modification of this document may occur. This Report is therefore subject to CCSDS document management and change control procedures, which are defined in Organization and Processes for the Consultative Committee for Space Data Systems (CCSDS A02.1-Y-4). Current versions of CCSDS documents are maintained at the CCSDS Web site: http://www.ccsds.org/ Questions relating to the contents or status of this document should be sent to the CCSDS Secretariat at the email address indicated on page i.
    [Show full text]
  • Ioag Infusion Plans and Roadmaps
    IOAG ROADMAP DRAFT IOAG INFUSION PLANS AND ROADMAPS (this version contains all IOAG agency(s) input) (Draft IOAG-8 Version – July 2005) (Draft IOAG-8 Version, Revision 1 – August 2005) IOAG ROADMAP This document is uncontrolled when printed. Please check the IOAG web site at http://www.ioag.org prior to use to ensure this is the latest version. IOAG ROADMAP TABLE OF CONTENTS 1 – INTRODUCTION .................................................................................................................1 2 – STRUCTURE AND MANAGEMENT OF THE PRESENT DOCUMENT...........................1 2-1 STRUCTURE ..................................................................................................................1 2-2 DOCUMENT MANAGEMENT..........................................................................................2 3 – IOAG STRATEGY PLAN....................................................................................................2 3-1 IOAG OBJECTIVES ........................................................................................................2 3-2 IOAG AREAS OF INTEREST ..........................................................................................3 4 – IOAG INTEROPERABILITY ITEMS...................................................................................6 5 – AGENCIES’ INFUSION PLANS AND ROADMAPS..........................................................7 ANNEX-1 – ASI INFUSION PLAN AND ROADMAP ...........................................................1-1 ANNEX-2 – CNES INFUSION PLAN AND ROADMAP
    [Show full text]
  • Short Low-Rate Non-Binary Turbo Codes Gianluigi Liva, Bal´Azs Matuz, Enrico Paolini, Marco Chiani
    Short Low-Rate Non-Binary Turbo Codes Gianluigi Liva, Bal´azs Matuz, Enrico Paolini, Marco Chiani Abstract—A serial concatenation of an outer non-binary turbo decoding thresholds lie within 0.5 dB from the Shannon code with different inner binary codes is introduced and an- limit in the coherent case, for a wide range of coding rates 1 alyzed. The turbo code is based on memory- time-variant (1/3 ≤ R ≤ 1/96). Remarkably, a similar result is achieved recursive convolutional codes over high order fields. The resulting codes possess low rates and capacity-approaching performance, in the noncoherent detection framework as well. thus representing an appealing solution for spread spectrum We then focus on the specific case where the inner code is communications. The performance of the scheme is investigated either an order-q Hadamard code or a first order length-q Reed- on the additive white Gaussian noise channel with coherent and Muller (RM) code, due to their simple fast Hadamard trans- noncoherent detection via density evolution analysis. The pro- form (FHT)-based decoding algorithms. The proposed scheme posed codes compare favorably w.r.t. other low rate constructions in terms of complexity/performance trade-off. Low error floors can be thus seen either as (i) a serial concatenation of an outer and performances close to the sphere packing bound are achieved Fq-based turbo code with an inner Hadamard/RM code with down to small block sizes (k = 192 information bits). antipodal signalling, or (ii) as a coded modulation Fq-based turbo/LDPC code with q-ary (bi-) orthogonal modulation.
    [Show full text]
  • Tm Synchronization and Channel Coding
    Recommendation for Space Data System Standards TM SYNCHRONIZATION AND CHANNEL CODING RECOMMENDED STANDARD CCSDS 131.0-B-3 BLUE BOOK September 2017 Recommendation for Space Data System Standards TM SYNCHRONIZATION AND CHANNEL CODING RECOMMENDED STANDARD CCSDS 131.0-B-3 BLUE BOOK September 2017 CCSDS RECOMMENDED STANDARD FOR TM SYNCHRONIZATION AND CHANNEL CODING AUTHORITY Issue: Recommended Standard, Issue 3 Date: September 2017 Location: Washington, DC, USA This document has been approved for publication by the Management Council of the Consultative Committee for Space Data Systems (CCSDS) and represents the consensus technical agreement of the participating CCSDS Member Agencies. The procedure for review and authorization of CCSDS documents is detailed in Organization and Processes for the Consultative Committee for Space Data Systems (CCSDS A02.1-Y-4), and the record of Agency participation in the authorization of this document can be obtained from the CCSDS Secretariat at the e-mail address below. This document is published and maintained by: CCSDS Secretariat National Aeronautics and Space Administration Washington, DC, USA E-mail: [email protected] CCSDS 131.0-B-3 Page i September 2017 CCSDS RECOMMENDED STANDARD FOR TM SYNCHRONIZATION AND CHANNEL CODING STATEMENT OF INTENT The Consultative Committee for Space Data Systems (CCSDS) is an organization officially established by the management of its members. The Committee meets periodically to address data systems problems that are common to all participants, and to formulate sound technical solutions to these problems. Inasmuch as participation in the CCSDS is completely voluntary, the results of Committee actions are termed Recommended Standards and are not considered binding on any Agency.
    [Show full text]
  • Download Special Issue
    Wireless Communications and Mobile Computing Error Control Codes for Next-Generation Communication Systems: Opportunities and Challenges Lead Guest Editor: Zesong Fei Guest Editors: Jinhong Yuan and Qin Huang Error Control Codes for Next-Generation Communication Systems: Opportunities and Challenges Wireless Communications and Mobile Computing Error Control Codes for Next-Generation Communication Systems: Opportunities and Challenges Lead Guest Editor: Zesong Fei Guest Editors: Jinhong Yuan and Qin Huang Copyright © 2018 Hindawi. All rights reserved. This is a special issue published in “Wireless Communications and Mobile Computing.” All articles are open access articles distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, pro- vided the original work is properly cited. Editorial Board Javier Aguiar, Spain Oscar Esparza, Spain Maode Ma, Singapore Ghufran Ahmed, Pakistan Maria Fazio, Italy Imadeldin Mahgoub, USA Wessam Ajib, Canada Mauro Femminella, Italy Pietro Manzoni, Spain Muhammad Alam, China Manuel Fernandez-Veiga, Spain Álvaro Marco, Spain Eva Antonino-Daviu, Spain Gianluigi Ferrari, Italy Gustavo Marfia, Italy Shlomi Arnon, Israel Ilario Filippini, Italy Francisco J. Martinez, Spain Leyre Azpilicueta, Mexico Jesus Fontecha, Spain Davide Mattera, Italy Paolo Barsocchi, Italy Luca Foschini, Italy Michael McGuire, Canada Alessandro Bazzi, Italy A. G. Fragkiadakis, Greece Nathalie Mitton, France Zdenek Becvar, Czech Republic Sabrina Gaito, Italy Klaus Moessner, UK Francesco Benedetto, Italy Óscar García, Spain Antonella Molinaro, Italy Olivier Berder, France Manuel García Sánchez, Spain Simone Morosi, Italy Ana M. Bernardos, Spain L. J. García Villalba, Spain Kumudu S. Munasinghe, Australia Mauro Biagi, Italy José A. García-Naya, Spain Enrico Natalizio, France Dario Bruneo, Italy Miguel Garcia-Pineda, Spain Keivan Navaie, UK Jun Cai, Canada A.-J.
    [Show full text]
  • Configurable and Scalable Turbo Decoder for 4G Wireless Decoder
    Configurable and Scalable Turbo Decoder for 4G Wireless Receivers Yang Sun Rice University, USA Joseph R. Cavallaro Rice University, USA Yuming Zhu Texas Instruments, USA Manish Goel Texas Instruments, USA ABSTRACT The increasing requirements of high data rates and quality of service (QoS) in fourth-generation (4G) wireless communication require the implementation of practical capacity approaching codes. In this chapter, the application of Turbo coding schemes that have recently been adopted in the IEEE 802.16e WiMax standard and 3GPP Long Term Evolution (LTE) standard are reviewed. In order to process several 4G wireless standards with a common hardware module, a reconfigurable and scalable Turbo decoder architecture is presented. A parallel Turbo decoding scheme with scalable parallelism tailored to the target throughput is applied to support high data rates in 4G applications. High-level decoding parallelism is achieved by employing contention-free interleavers. A multi-banked memory structure and routing network among memories and MAP decoders are designed to operate at full speed with parallel interleavers. A new on-line address generation technique is introduced to support multiple Turbo interleaving patterns, which avoids the interleaver address memory that is typically necessary in the traditional designs. Design trade-offs in terms of area and power efficiency are analyzed for different parallelism and clock frequency goals. KEYWORDS Error Correction Codes, Turbo Codes, MAP Algorithm, BCJR Algorithm, Turbo Decoder, Interleaver, Wireless PHY, 4G Receiver, VLSI Architecture INTRODUCTION The approaching fourth-generation (4G) wireless systems are promising to support very high data rates from 100 Mbps to 1 Gbps. This consequently leads to orders of complexity increases in a 4G wireless receiver.
    [Show full text]
  • BER Comparison Between Convolutional, Turbo, LDPC, and Polar Codes
    BER Comparison Between Convolutional, Turbo, LDPC, and Polar Codes Bashar Tahir∗, Stefan Schwarzy, and Markus Ruppz Institute of Telecommunications Technische Universitat¨ (TU) Wien Vienna, Austria Email: f∗bashar.tahir, ystefan.schwarz, [email protected] Abstract—Channel coding is a fundamental building block in A major breakthrough happened in 1993 when turbo codes any communications system. High performance codes, with low were introduced [5]. They represent a class of codes that complexity encoding and decoding are a must-have for future can perform very close to the capacity limit. In its common wireless systems, with requirements ranging from the operation in highly reliable scenarios, utilizing short information messages form, turbo encoding is done using two recursive convolutional and low code rates, to high throughput scenarios, working with encoders. The input stream is passed to the first encoder, and a long messages, and high code rates. permuted version is passed to the second one. At the receiving We investigate in this paper the performance of Convolutional, side, two decoders are used, each one decodes the streams Turbo, Low-Density Parity-Check (LDPC), and Polar codes, in of the corresponding encoder. By exchanging probabilistic terms of the Bit-Error-Ratio (BER) for different information block lengths and code rates, spanning the multiple scenarios information, the two decoders can iteratively help each other of reliability and high throughput. We further investigate their in a manner similar to a turbo engine. convergence behavior with respect to the number of iterations Another class of capacity-approaching codes, are the LDPC (turbo and LDPC), and list size (polar), as well as how their per- codes.
    [Show full text]
  • Services Catalog
    Deep Space Network Deep Space Network Services Catalog Document Owner: Approved by: Signature Provided 02/03/15 Signature Provided 01/22/15 Jeff Berner Date Alaudin M. Bhanji Date DSN Project Chief Engineer DSN Project Manager Prepared by: Approved by: Signature Provided 01/16/15 Signature Provided 01/16/15 Timothy Pham Date Charles Scott Date DSN Chief Systems Engineer DSN Commitment Office Manager Signature Provided 02/20/15 DSN Document Release Date DSN No. 820-100, Rev. F Issue Date: February 24, 2015 JPL D-19002 Jet Propulsion Laboratory California Institute of Technology Users must ensure that they are using the current version in PDMS: https://pdms.jpl.nasa.gov Copyright 2015 California Institute of Technology. U.S. Government sponsorship acknowledged 820-100, Rev. F Review Acknowledgment By signing below, the signatories acknowledge that they have reviewed this document and provided comments, if any, to the signatories on the Cover Page. Signature Provided 02/19/15 Signature Provided 02/17/15 Ana Guerrero Date Pat Beyer Date DSN TTC &Data Delivery Office Manager DSN Service Management Office Manager Signature Provided 02/17/15 Signature Provided 02/23/15 Peter Hames Date James A. O’dea Date DSN Antenna Front-End, Facilities and TTC System Engineer Infrastructure Office Manager Signature Provided 02/16/15 Signature Provided 02/17/15 Tim Cornish Date Alina Bedrossian Date Uplink System Engineer Science System Engineer Signature Provided 02/17/15 Signature Provided 02/17/15 Leslie Deutsch Date Cathy Cagle Date Architecture Strategic Planning and Mission Support Definition and System Engineering Manager Commitments Manager ii 820-100, Rev.
    [Show full text]
  • Dynamic Code Selection Method for Content Transfer in Deep Space Network
    University of Mississippi eGrove Electronic Theses and Dissertations Graduate School 2019 Dynamic Code Selection Method for Content Transfer in Deep Space Network Rojina Adhikary University of Mississippi Follow this and additional works at: https://egrove.olemiss.edu/etd Part of the Electrical and Computer Engineering Commons Recommended Citation Adhikary, Rojina, "Dynamic Code Selection Method for Content Transfer in Deep Space Network" (2019). Electronic Theses and Dissertations. 1528. https://egrove.olemiss.edu/etd/1528 This Dissertation is brought to you for free and open access by the Graduate School at eGrove. It has been accepted for inclusion in Electronic Theses and Dissertations by an authorized administrator of eGrove. For more information, please contact [email protected]. DYNAMIC CODE SELECTION METHOD FOR CONTENT TRANSFER IN DEEP SPACE NETWORK A Dissertation presented in partial fulfillment of requirements for the degree of Doctor of Philosophy in the Department of Electrical Engineering The University of Mississippi by Rojina Adhikary May 2019 Copyright Rojina Adhikary 2019 ALL RIGHTS RESERVED ABSTRACT Space communications feature large round-trip time delays (for example, be- tween 6.5 and 44 minutes for Mars to Earth and return, depending on the actual distance between the two planets) and highly variable data error rates, for example, bit error rate (BER) of 10−5 is very common and even higher BERs on the order of 10−1 is observed in the deep-space environment. We develop a new content transfer protocol based on RaptorQ codes and turbo codes together with a real-time channel prediction model to maximize file transfer from space vehicles to the Earth stations.
    [Show full text]
  • A 150Mbit/S 3GPP LTE Turbo Code Decoder
    A 150Mbit/s 3GPP LTE Turbo Code Decoder Matthias May, Thomas Ilnseher, Norbert Wehn Wolfgang Raab Microelectronic Systems Design Research Group, University of Kaiserslautern Infineon Technologies AG 67663 Kaiserslautern, Germany 81726 Munchen,¨ Germany {may, ilnseher, wehn}@eit.uni-kl.de wolfgang.raab@infineon.com Abstract—3GPP long term evolution (LTE) enhances the wire- parallel TC decoder architectures. In Section V, the acquisition less communication standards UMTS and HSDPA towards higher length for the decoding of highly punctured LTE TC is throughput. A throughput of 150 Mbit/s is specified for LTE discussed. Further, we investigate the scalability of different using 2×2 MIMO. For this, highly punctured Turbo codes with rates up to 0.95 are used for channel coding, which is a big TC decoder architectures to a throughput of 300 Mbit/s and challenge for decoder design. This paper investigates efficient higher for upcoming releases of LTE. The implementation of decoder architectures for highly punctured LTE Turbo codes. a 150 Mbit/s 3GPP LTE compliant TC decoder is presented in We present a 150 Mbit/s 3GPP LTE Turbo code decoder, which Section VI. is part of an industrial SDR multi-standard baseband processor chip. II. TURBO CODE DECODING I. INTRODUCTION For TC decoding a complete data block is iteratively pro- cessed in a loop which comprises two component decoders us- The outstanding forward error correction capabilities of ing the Log-MAP algorithm [1]. These two decoders exchange Turbo codes [1] made them part of many today’s communica- so called a posteriori probability information (Λe). The itera- tions standards.
    [Show full text]
  • Channel Coding for Enhanced Mobile Broadband Communication in 5G
    1 Channel Coding for Enhanced Mobile Broadband Communication in 5G Systems Heshani Gamage, Nandana Rajatheva, and Matti Latva-aho Department of Communication Engineering, University of Oulu, Finland E-mail: [email protected].fi, [email protected].fi, [email protected].fi Abstract—In this paper, candidate coding schemes are investi- enhanced compared to 4G [2]. gated for the new radio access technology (RAT) of the fifth gen- There are two significant trends which are the main drivers eration (5G) mobile communication standard. Enhanced mobile of the development of 5G network technology [2]. The most broadband(eMBB) scenario of the 5G standard corresponding the critical one is the impetuous increase in demand for wireless activities in the third generation partnership project (3GPP) is broadband services needing faster, higher-capacity networks considered. The coding schemes are evaluated in terms of block error rate (BLER), bit error rate (BER), computational com- that can deliver video and other content-rich services. This plexity, and flexibility. These parameters comprise a suitable set need is driven by the growth in the video traffic and new appli- to assess the performance of different services and applications. cations such as full high definition (FHD), live video broadcast Turbo, low density parity check (LDPC), and polar codes are and virtual reality, requiring ultra broadband services. This considered as the candidate schemes. These are investigated in was the primary drive of the 4G as well and now it needs terms of obtaining suitable rates, block lengths by proper design 1000 times more capacity and data rates.The other requirement for a fair comparison.
    [Show full text]