190 research outputs found
Turbo Multiuser Detection Architectures
The discovery of Turbo Codes in 1996 by Berrou et. al. proved to be a huge boost for the research of channel coding. The Turbo Principle behind turbo codes was found to be applicable in other areas. One of these areas is Multiuser Detection. In this thesis, Turbo Multiuser Detection is investigated in order to answer two main questions. The questions concern the performance gain that is obtained when turbo multiuser detection is used instead of non-turbo multiuser detection and the convergence behavior of turbo multiuser detection. The performance gain is determined by comparing the bit-error-rate (BER) chart of a turbo multiuser detection architecture with the BER chart of a non-turbo multiuser detector. It was found that turbo multiuser detection results in a dramatical performance gain when Eb/N0 > 3 dB and more than one iteration is performed. The convergence behavior of turbo multiuser detection is analyzed with the help of EXIT charts. EXIT charts are recently proposed by S. ten Brink as a tool to analyze the convergence behavior of turbo architectures. EXIT charts are discussed in this thesis. An EXIT chart of a turbo multiuser detection architecture is created. From this chart, the minimum number of iterations to obtain the lowest BER possible are found.\ud
EXIT charts are also used to analyze the difference of iterating aposteriori and extrinsic information in a turbo architecture. The analysis shows that EXIT charts of a-posteriori information give results, which contradict the results of simulations on turbo architectures
SOVA decoding in symmetric alpha-stable noise
Soft-Output Viterbi Algorithm (SOVA) is one type of recovery memory-less Markov Chain and is used widely to decode convolutional codes. Fundamentally, conventional SOVA is designed on the basis of Maximum A-Posteriori Probability (APP) with the assumption of normal distribution. Therefore, conventional SOVA fails miserably in the presence of symmetric alpha stable noise S\ensuremathα S which is one form of stable random processes widely accepted for impulsive noise modeling. The author studies and has improved the performance of conventional SOVA by introducing Cauchy function into path-metric calculation. Substantial performance improvement was gained from Mento Carlo Simulation for SOVA based turbo codes
Improving the Performance of Viterbi Decoder using Window System
An efficient Viterbi decoder is introduced in this paper; it is called Viterbi decoder with window system. The simulation results, over Gaussian channels, are performed from rate 1/2, 1/3 and 2/3 joined to TCM encoder with memory in order of 2, 3. These results show that the proposed scheme outperforms the classical Viterbi by a gain of 1 dB. On the other hand, we propose a function called RSCPOLY2TRELLIS, for recursive systematic convolutional (RSC) encoder which creates the trellis structure of a recursive systematic convolutional encoder from the matrix âHâ. Moreover, we present a comparison between the decoding algorithms of the TCM encoder like Viterbi soft and hard, and the variants of the MAP decoder known as BCJR or forward-backward algorithm which is very performant in decoding TCM, but depends on the size of the code, the memory, and the CPU requirements of the application
Turbo codes and turbo algorithms
In the first part of this paper, several basic ideas that prompted the coming of turbo codes are commented on. We then present some personal points of view on the main advances obtained in past years on turbo coding and decoding such as the circular trellis termination of recursive systematic convolutional codes and double-binary turbo codes associated with Max-Log-MAP decoding. A novel evaluation method, called genieinitialised iterative processing (GIIP), is introduced to assess the error performance of iterative processing. We show that using GIIP produces a result that can be viewed as a lower bound of the maximum likelihood iterative decoding and detection performance. Finally, two wireless communication systems are presented to illustrate recent applications of the turbo principle, the first one being multiple-input/multiple-output channel iterative detection and the second one multi-carrier modulation with linear precoding
Serially Concatenated Continuous Phase Modulation with SOVA Turbo Decoding
For a Serially Concatenated Continuous Phase Modulation (SCCPM) system that concatenates a rate of 1/2 Convolutional Code (CC) and an M-ary full response continuous phase modulation (CPM) signal, we design a turbo decoding scheme using the Soft Output Viterbi algorithm (SOVA) and study the system performance. A decomposition model is used in CPM to reduce the number of states and separate the continuous phase encoder (CPE) with the modulator. As a soft-input soft-output (SISO) decoding algorithm, SOVA is used to generate and update the soft information of decoded signal symbols during the iterative process for both the CPM signal and the CC. Newly generated soft information from one component decoder will be used by the other component decoder to constitute an iterative, i.e., turbo, decoding process. Simulation results show that a decoding gain of at least 1 dB can be obtained by using turbo decoding compared to that without turbo decoding
802.11 Payload Iterative decoding between multiple transmission attempts
Abstract. The institute of electrical and electronics engineers (IEEE) 802.11 standard specifies widely used technology for wireless local area networks (WLAN). Standard specifies high-performance physical and media access control (MAC) layers for a distributed network but lacks an effective hybrid automatic repeat request (HARQ). Currently, the standard specifies forward error correction (FEC), error detection (ED), and automatic repeat request (ARQ), but in case of decoding errors, the previously transmitted information is not used when decoding the retransmitted packet. This is called Type 1 HARQ. Type 1 HARQ uses received energy inefficiently, but the simple implementation makes it an attractive solution. Unfortunately, research applying more sophisticated HARQ schemes on top of IEEE 802.11 is limited.
In this Masterâs Thesis, a novel HARQ technology based on packet retransmissions that can be decoded in a turbo-like manner, keeping as much as possible compatibility with vanilla 802.11, is proposed. The proposed technology is simulated with both the IEEE 802.11 code and with the robust, efficient and smart communication in unpredictable environments (RESCUE) code. An additional interleaver is added before the convolutional encoder in the proposed technology, interleaving either the whole frame or only the payload to enable effective iterative decoding. For received frames, turbo-like iterations are done between initially transmitted packet copy and retransmissions. Results are compared against the non-iterative combining method maximizing signal-to-noise ratio (SNR), maximum ratio combining (MRC). The main design goal for this technology is to maintain compatibility with the 802.11 standard while allowing efficient HARQ. Other design goals are range extension, higher throughput, and better performance in terms of bit error rate (BER) and frame error rate (FER).
This technology can be used for range extension at low SNR range and may provide up to 4 dB gain at medium SNR range compared to MRC. At high SNR, technology can reduce the penalty from retransmission allowing higher average modulation and coding scheme (MCS). However, these gains come with the cost of computational complexity from the iterative decoding. The main limiting factors of the proposed technology are decoding errors in the header and the scrambler area, and resource-hungry-processing. In simulations, perfect synchronization and packet detection is assumed, but in reality, especially at low SNR, packet detection and synchronization would be challenging. 802.11 pakettien iteratiivinen dekoodaus lÀhetysten vÀlillÀ. TiivistelmÀ. IEEE 802.11-standardi mÀÀrittelee yleisesti kÀytetyn teknologian langattomille lÀhiverkoille. Standardissa mÀÀritellÀÀn tehokas fyysinen- ja verkkoliityntÀkerros hajautetuille verkoille, mutta siitÀ puuttuu tehokas yhdistetty automaattinen uudelleenlÀhetys. NykyisellÀÀn standardi mÀÀrittelee virheenkorjaavan koodin, virheellisen paketin tunnistuksen sekÀ automaattisen uudelleenlÀhetyksen, mutta aikaisemmin lÀhetetyn paketin informaatiota ei kÀytetÀ hyvÀksi uudelleenlÀhetystilanteessa. TÀmÀ menetelmÀ tunnetaan tyypin yksi yhdistettynÀ automaattisena uudelleenlÀhetyksenÀ. Tyypin yksi yhdistetty automaattinen uudelleenlÀhetys kÀyttÀÀ vastaanotettua signaalia tehottomasti, mutta yksinkertaisuus tekee siitÀ houkuttelevan vaihtoehdon. Valitettavasti edistyneempien uudelleenlÀhetysvaihtoehtojen tutkimusta 802.11-standardiin on rajoitetusti.
TÀssÀ diplomityössÀ esitellÀÀn uusi yhdistetty uudelleenlÀhetysteknologia, joka pohjautuu pakettien uudelleenlÀhetykseen, sallien turbo-tyylisen dekoodaamisen sÀilyttÀen mahdollisimman hyvÀn taaksepÀin yhteensopivuutta alkuperÀisen 802.11-standardin kanssa. TÀmÀ teknologia on simuloitu kÀyttÀen sekÀ 802.11- ettÀ nk. RESCUE-virheenkorjauskoodia. Teknologiassa uusi lomittaja on lisÀtty konvoluutio-enkoodaajan eteen, sallien tehokkaan iteratiivisen dekoodaamisen, lomittaen joko koko paketin tai ainoastaan hyötykuorman. Vastaanotetuille paketeille tehdÀÀn turbo-tyyppinen iteraatio alkuperÀisen vastaanotetun kopion ja uudelleenlÀhetyksien vÀlillÀ. Tuloksia vertaillaan eiiteratiiviseen yhdistÀmismenetelmÀÀn, maksimisuhdeyhdistelyyn, joka maksimoi yhdistetyn signaali-kohinasuhteen. TÀrkeimpÀnÀ suunnittelutavoitteena tÀssÀ työssÀ on tehokas uudelleenlÀhetysmenetelmÀ, joka yllÀpitÀÀ taaksepÀin yhteensopivuutta IEEE 802.11-standardin kanssa. Muita tavoitteita ovat kantaman lisÀys, nopeampi yhteys ja matalampi bitti- ja pakettivirhesuhde.
KehitettyÀ teknologiaa voidaan kÀyttÀÀ kantaman lisÀykseen matalan signaalikohinasuhteen vallitessa ja se on jopa 4 dB parempi kohtuullisella signaalikohinasuhteella kuin maksimisuhdeyhdistely. Korkealla signaali-kohinasuhteella teknologiaa voidaan kÀyttÀÀ pienentÀmÀÀn hÀviötÀ epÀonnistuneesta paketinlÀhetyksestÀ ja tÀten sallien korkeamman modulaatio-koodiasteen kÀyttÀmisen. Valitettavasti nÀmÀ parannukset tulevat kasvaneen laskennallisen monimutkaisuuden kustannuksella, johtuen iteratiivisesta dekoodaamisesta. Isoimmat rajoittavat tekijÀt teknologian kÀytössÀ ovat dekoodausvirheet otsikossa ja datamuokkaimen siemenessÀ. TÀmÀn lisÀksi kÀyttöÀ rajoittaa resurssisyöppö prosessointi. Simulaatioissa oletetaan tÀydellinen synkronisointi, mutta todellisuudessa, erityisesti matalalla signaali-kohinasuhteella, paketin tunnistus ja synkronointi voivat olla haasteellisia
Space-Time Codes Concatenated with Turbo Codes over Fading Channels
The uses of space-time code (STC) and iterative processing have enabled robust communications over fading channels at previously unachievable signal-to-noise ratios. Maintaining desired transmission rate while improving the diversity from STC is challenging, and the performance of the STC suïŹers considerably due to lack of channel state information (CSI). This dissertation research addresses issues of considerable importance in the design of STC with emphasis on eïŹcient concatenation of channel coding and STC with theoretical bound derivation of the proposed schemes, iterative space-time trellis coding (STTC), and diïŹerential space-time codes.
First, we concatenate space-time block code (STBC) with turbo code for improving diversity gain as well as coding gain. Proper soft-information sharing is indispensable to the iterative decoding process. We derive the required soft outputs from STBC decoders for passing to outer turbo code. Traditionally, the performance of STBC schemes has been evaluated under perfect channel estimation. For fast time-varying channel, obtaining the CSI is tedious if not impossible. We introduce a scheme of calculating the CSI at the receiver from the received signal without the explicit channel estimation.
The encoder of STTC, which is generally decoded using Viterbi like algorithm, is based on a trellis structure. This trellis structure provides an inherent advantage for the STTC scheme that an iterative decoding is feasible with the minimal addition computational complexity. An iteratively decoded space-time trellis coding (ISTTC) is proposed in this dissertation, where the STTC schemes are used as constituent codes of turbo code. Then, the performance upper bound of the proposed ISTTC is derived.
Finally, for implementing STBC without channel estimation and maintaining trans- mission rate, we concatenate diïŹerential space-time block codes (DSTBC) with ISTTC. The serial concatenation of DSTBC or STBC with ISTTC oïŹers improving performance, even without an outer channel code. These schemes reduce the system complexity com- pared to the standalone ISTTC and increase the transmission rate under the same SNR condition. Detailed design procedures of these proposed schemes are analyzed
Near-Capacity Irregular Convolutional Coded Cooperative Differential Linear Dispersion Codes Using Multiple-Symbol Differential Detection
We propose a novel near-capacity Multiple-Symbol Differential Decoding (MSDD) aided cooperative Differential Linear Dispersion Code (DLDC) scheme, which exhibits a high grade of system design flexibility in terms of the choice of activated relays and the DLDC's rate allocation. More specifically, the system has the freedom to activate a range of DLDCs depending on both the number of relays available in the network, as well as on their position, throughput and complexity considerations
Iterative multiuser detection with integrated channel estimation for turbo coded DS-CDMA.
In present days the demand of high bandwidth and data rate in wireless communications is increasing rapidly to accommodate multimedia applications, including services such as wireless video and high-speed Internet access. In this thesis, we propose a receiver algorithm for mobile communications systems which apply CDMA (Code division multiple access) as multiple access technique. Multiuser Detection and turbo coding are the two most powerful techniques for enhancing the performance of future wireless services. The standardization of direct sequence CDMA (DS-CDMA) systems in the third generation of mobile communication system has raised the interest in exploiting the capabilities and capacity of this type of Technology. However the conventional DS-CDMA system has the major drawback of multiple Access Interference (MAI). The MAI is unavoidable because receivers deal with the information which is transmitted not by a single information source but by several uncoordinated and geographically separated sources. To overcome this problem MUD is a promising approach to increase capacity. (Abstract shortened by UMI.)Dept. of Electrical and Computer Engineering. Paper copy at Leddy Library: Theses & Major Papers - Basement, West Bldg. / Call Number: Thesis2005 .C465. Source: Masters Abstracts International, Volume: 45-01, page: 0404. Thesis (M.Sc.)--University of Windsor (Canada), 2005
- âŠ