33 research outputs found

    Turbo Decoder Using Contention-Free Interleaver and Parallel Architecture

    Full text link

    802.11 Payload Iterative decoding between multiple transmission attempts

    Get PDF
    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

    (SI10-062) Comprehensive Study on Methodology of Orthogonal Interleavers

    Get PDF
    Interleaving permutes the data bits by employing a user defined sequence to reduce burst error which at times exceeds the minimum hamming distance. It serves as the sole medium to distinguish user data in the overlapping channel and is the heart of Interleave Division Multiple Access (IDMA) scheme. Versatility of interleavers relies on various design parameters such as orthogonality, correlation, latency and performance parameters like bit error rate (BER), memory occupancy and computation complexity. In this paper, a comprehensive study of interleaving phenomenon and discussion on numerous interleavers is presented. Also, the BER performance of interleavers using IDMA scheme is displayed

    Energy Conservation and Security Enhancement in Wireless End-to-end Secure Connections

    Get PDF
    Wireless channels are vulnerable to interception. In some applications an end-to-end secure data transfer is required. However the use of cryptographic functions in communication over a wireless channel increases sensitivity to channel errors. As a result, the connection characteristics in terms of delay, throughput, and transmission energy worsen. Transmission energy is a key issue in some secure end-to-end wireless applications especially if they are running on mobile handheld devices with a limited source of energy such as batteries. That is why in most secure end-to-end wireless connections, the connection is dropped in poor channel conditions. In this thesis, models are proposed by which the performance is improved and transmission energy is lowered. A combination of a cross-layer controller, K Best Likelihood (K-BL) channel decoder, and a keyed error detection algorithm in the novel model supports the authorized receivers by a higher throughput, lower delay mean, and less transmission energy in a certain range of the Signal to Noise Ratio (SNR). This is done at the expense of additional computation at the receiving end. Ttradeoffs are examined and the simulation results of the new model are compared with those of conventional wireless communication systems. Another model is devised to mitigate the energy consumption of the Turbo Code channel decoder. The overall decoding energy consumption for each packet can be lowered by reducing the average number of iterations in the Turbo Code channel decoder. The proposed models achieve better energy consumption by reducing the number of iterations in a channel decoder that uses the Turbo decoder and by reducing the number of retransmissions in a trellis channel decoder. Furthermore, the security enhancement of the novel models is assessed in terms of the extent to which the enhancement is fully achieved

    Packet data communications over coded CDMA with hybrid type-II ARQ

    Get PDF
    This dissertation presents in-depth investigation of turbo-coded CDNIA systems in packet data communication terminology. It is divided into three parts; (1) CDMA with hybrid FEC/ARQ in deterministic environment, (2) CDMA with hybrid FEC/ARQ in random access environment and (3) an implementation issue on turbo decoding. As a preliminary, the performance of CDMA with hybrid FEC/ARQ is investigated in deterministic environment. It highlights the practically achievable spectral efficiency of CDMA system with turbo codes and the effect of code rates on the performance of systems with MF and LMMSE receivers, respectively. For given ensemble distance spectra of punctured turbo codes, an improved union bound is used to evaluate the error probability of ML turbo decoder with MF receiver and with LMMSE receiver front-end and, then, the corresponding spectral efficiency is computed as a function of system load. In the second part, a generalized analytical framework is first provided to analyze hybrid type-11 ARQ in random access environment. When applying hybrid type-11 ARQ, probability of packet success and packet length is generally different from attempt to attempt. Since the conventional analytical model, customarily employed for ALOHA system with pure or hybrid type-I ARQ, cannot be applied for this case, an expanded analytical model is introduced. It can be regarded as a network of queues and Jackson and Burke\u27s theorems can be applied to simplify the analysis. The second part is further divided into two sub topics, i.e. CDMA slotted ALOHA with hybrid type-11 ARQ using packet combining and CDMA unslotted ALOHA with hybrid type-11 ARQ using code combining. For code combining, the rate compatible punctured turbo (RCPT) codes are examined. In the third part, noticing that the decoding delay is crucial to the fast ARQ, a parallel MAP algorithm is proposed to reduce the computational decoding delay of turbo codes. It utilizes the forward and backward variables computed in the previous iteration to provide boundary distributions for each sub-block MAP decoder. It has at least two advantages over the existing parallel scheme; No performance degradation and No additional computation
    corecore