• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 19
  • 5
  • 1
  • 1
  • 1
  • 1
  • 1
  • Tagged with
  • 34
  • 10
  • 8
  • 6
  • 6
  • 6
  • 6
  • 6
  • 6
  • 5
  • 5
  • 5
  • 5
  • 5
  • 5
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
11

Cross-layer optimization of cooperative and coordinative schemes for next generation cellular networks / Optimisation inter-couches de schémas de coordination et de coopération pour les futurs réseaux cellulaires

Khreis, Alaa 06 November 2018 (has links)
Les demandes de haut débit, faible latence et grande fiabilité augmentent dans les nouvelles générations de systèmes de radiocommunications. Par conséquent, on propose de combiner la transmission non orthogonale avec les retransmissions HARQ afin de combattre les fluctuations de canal de transmission à haut débit. Dans la première partie de la thèse, on propose des protocoles de retransmissions HARQ avec l'aide d'un relai afin d'améliorer le débit et la fiabilité du système. Une version renforcée du protocole HARQ qui prend en compte le délai de retour est proposée dans la seconde partie de la thèse. / HARQ has become an important research field in the wireless digital communications area during the last years. In this thesis, we improve the HARQ mechanisms in terms of throughput and/or latency which are the bottleneck of next generation wireless communication systems. More precisely, we improve the time-slotted HARQ systems by mimicking NOMA, which means using superposed packets in a single-user context. In the first part of the thesis, we propose HARQ protocols using the help of a relay to improve the transmission rate and reliability. An enhanced HARQ protocol adapted to delayed feedback is proposed in the second part. In this new multi-layer HARQ protocol, additional redundant packets are sent preemptively before receiving the acknowledgement, and in superposition to other HARQ processes.
12

On Forward Error Correction in IEEE 802.15.4 Wireless Sensor Networks

Li, Wei, Guo, Zhiyuan January 2012 (has links)
Wireless Sensor Networks (WSN) are used in many applications, for example industrial applications, automatic control applications, monitoring applications, to name but a few. Although WSN can employ different standards in order to achieve short range wireless communication, the mainstream of the market is toadopt the low-power, low-rate IEEE 802.15.4 standard. However, this standard does not specify any block codes on the Physical layer (PHY) and the MAC sublayer. Reliability and energy efficiency are two important metrics used to evaluate the WSN performance. In order to enhance the reliability of the WSN performance, schemes such as Forward Error Correction (FEC) and HybridAutomatic Repeat-reQuest (HARQ) can be introduced on the PHY and MACsublayer when transmitting signals. However, this will reduce the energy efficiency of the WSN. In order to investigate what does affect the reliability and energy efficiency, this thesis has been conducted with the assistance of Matlab simulations, which simulate different transmission schemes proposed by the authors. Based on the simulations, both the reliability and energy efficiency can be evaluated and the results are illustrated for both metrics. The objective of this thesis is to determine a scheme that is able to meet these metric requirements.
13

HARQ Packet Scheduling Based on RTT Estimation in LTE Networks

Li, Yi-Wei 15 February 2012 (has links)
In an LTE (Long-Term Evolution) network, HARQ (Hybrid Automatic Repeat reQuest) is used to reduce the error probability of retransmitted packets. However, HARQ cannot guarantee delay constraints for real-time traffic when RBs (Resource Blocks) are allocated improperly. To avoid the retransmitted real-time packets exceeding their delay constraints, we propose an HARQ scheduling scheme based on RTT (Round-Trip-Time) estimation. In this scheme, traffic are classified into real-time and non-real-time queues in which real-time queue are further classified into four sub-queues according to their retransmission times; i.e., the first transmission queue, the first retransmission queue, the second retransmission queue, and the third retransmission queue. For the four real-time queues, we estimate RTT and compute the number of RBs required satisfying the delay constraints. To prevent from starvation of non-real-time traffic, after allocating the RBs for real-time traffic, the remaining RBs are allocated for non-real-time traffic according to their MBR (Minimum Bit Rate). To analyze the proposed scheduling scheme, we build a mathematical model to derive the successful probability of retransmitted packets and the expected value of packet retransmission times. Finally, we compute average packet delay, average packet loss rate, and the throughput for both real-time and none-real-time traffic by varying packet error probability and the delay constraints of real-time traffic.
14

Mécanismes de fiabilité bi-directionnels “couches basses” pour les communications par satellite / Bidirectional reliability mechanisms for lower layers of satellite communications

Ali Ahmad, Rami 24 June 2016 (has links)
Dans le cadre des communications par satellite, les caractéristiques du lien rendent difficile la mis en œuvre des systèmes de télécommunications. Pour certaines applications, le problème principal est le délai de propagation. Un autre problème est la perte des données due aux caractéristiques du canal. Le but de cette thèse est de proposer un mécanisme qui assure la fiabilité de la communication tout en maximisant l’efficacité d’utilisation de la bande passante. Le protocole HARQ est reconnu pour sa capacité à atteindre le meilleur compromis fiabilité/débit. Cependant, ce mécanisme doit être optimisé pour pouvoir être utilisé sur un lien satellite. Dans un premier temps, nous proposons une méthode de fiabilisation basée sur l’HARQ statique, où le nombre de bits à envoyer à chaque transmission est fixé à l’avance. Cette méthode s’adresse aux services qui tolèrent un certain délai avant la réception du message. À partir de la distribution statistique du canal, elle définit la probabilité de décodage optimale à chaque transmission. Le nombre de bits à envoyer est calculé en fonction de ces probabilités et de la distribution d’information mutuelle du canal. Dans un deuxième temps, nous introduisons une version adaptative de la méthode précédente. Le récepteur calcule le nombre de bits à envoyer en fonction de l’état du canal pendant la transmission actuelle. Le nombre de bits calculé est renvoyé dans un acquittement vers l’émetteur. Finalement, nous présentons une structure de trame couche physique dans le cadre des mécanismes HARQ proposés et nous évaluons ses performances en faisant varier les paramètres du système. L’objectif est de trouver l’ordre de grandeur optimal des tailles de trames et des codes correcteurs d'erreurs à utiliser. / As part of a satellite communications system, the characteristics of the communication links make it difficult to set up telecommunications systems. For certain applications, the main problem is the propagation delay. Another problem is the loss of data due to the characteristics of the channel. The aim of this thesis is to propose a mechanism that ensures the reliability of communication and maximize the utilization efficiency of the available bandwidth. HARQ protocol is known for its ability to achieve the best compromise reliability/ throughput.However, this mechanism must be optimized to be used on a satellite link. First, we propose a reliability method based on static HARQ, where the number to be sent is fixed previously. This method is specifically for services that tolerate some delay before the reception of the message. It consists in defining the probability of decoding at each transmission, using an optimization algorithm that we propose. The number of bits to be sent is calculated based on these probabilities and the distribution of the mutual information, assuming knowledge of the statistical distribution of the channel attenuation. Secondly, we introduce an adaptive version of the proposed method. This new approach calculates the number of bits to be sent by taking into account variations of the channel state during the communication. The receiver calculates the number of bits to be sent depending on the channel state during the current transmission. This calculated number is sent in an acknowledgement to the transmitter. Finally, we propose a frame structure for a physical layer that implements the proposed mechanisms and evaluate their performance by varying the system parameters. The aim is to find the optimal order of frame sizes and codes to be used.
15

Turbo Equalization for HSPA / Turboutjämning för HSPA

Konuskan, Cagatay January 2010 (has links)
<p>New high quality mobile telecommunication services are offered everyday and the demand for higher data rates is continuously increasing. To maximize the uplink throughput in HSPA when transmission is propagated through a dispersive channel causing self-interference, equalizers are used. One interesting solution, where the equalizer and decoder exchange information in an iterative way, for improving the equalizer performance is Turbo equalization.</p><p>In this thesis a literature survey has been performed on Turbo equalization methods and a chosen method has been implemented for the uplink HSPA standard to evaluate the performance in heavily dispersive channels. The selected algorithm has been adapted for multiple receiving antennas, oversampled processing and HARQ retransmissions. The results derived from the computer based link simulations show that the implemented algorithm provide a gain of approximately 0.5 dB when performing up to 7 Turbo equalization iterations. Gains up to 1 dB have been obtained by disabling power control, not using retransmission combining and utilizing a single receiver antenna. The algorithm has also been evaluated considering alternative dispersive channels, Log-MAP decoding, different code rates, number of Turbo equalization iterations and number of Turbo decoding iterations.</p><p>The simulation results do not motivate a real implementation of the chosen algorithm considering the increased computational complexity and small gain achieved in a full featured receiver system. Further studies are needed before concluding the HSPA uplink Turbo equalization approach.</p>
16

Error Control in Wireless Sensor Networks : A Process Control Perspective

Eriksson, Oskar January 2011 (has links)
The use of wireless technology in the process industry is becoming increasingly important to obtain fast deployment at low cost. However, poor channel quality often leads to retransmissions, which are governed by Automatic Repeat Request (ARQ) schemes. While ARQ is a simple and useful tool to alleviate packet errors, it has considerable disadvantages: retransmissions lead to an increase in energy expenditure and latency. The use of Forward Error Correction (FEC) however offers several advantages. We consider a Hybrid-ARQ-Adaptive-FEC scheme (HAF) based on BCH codes and Channel State Information. This scheme is evaluated on AWGN and fading channels. It is shown that HAF offers significantly improved performance both in terms of energy efficiency and latency, as compared to ARQ.
17

Turbo Equalization for HSPA / Turboutjämning för HSPA

Konuskan, Cagatay January 2010 (has links)
New high quality mobile telecommunication services are offered everyday and the demand for higher data rates is continuously increasing. To maximize the uplink throughput in HSPA when transmission is propagated through a dispersive channel causing self-interference, equalizers are used. One interesting solution, where the equalizer and decoder exchange information in an iterative way, for improving the equalizer performance is Turbo equalization. In this thesis a literature survey has been performed on Turbo equalization methods and a chosen method has been implemented for the uplink HSPA standard to evaluate the performance in heavily dispersive channels. The selected algorithm has been adapted for multiple receiving antennas, oversampled processing and HARQ retransmissions. The results derived from the computer based link simulations show that the implemented algorithm provide a gain of approximately 0.5 dB when performing up to 7 Turbo equalization iterations. Gains up to 1 dB have been obtained by disabling power control, not using retransmission combining and utilizing a single receiver antenna. The algorithm has also been evaluated considering alternative dispersive channels, Log-MAP decoding, different code rates, number of Turbo equalization iterations and number of Turbo decoding iterations. The simulation results do not motivate a real implementation of the chosen algorithm considering the increased computational complexity and small gain achieved in a full featured receiver system. Further studies are needed before concluding the HSPA uplink Turbo equalization approach.
18

Communication performance prediction and link adaptation based on a statistical radio channel model

Huusko, J. (Jarkko) 29 March 2016 (has links)
Abstract This thesis seeks to develop a robust semi-analytical performance prediction method for an advanced iterative receiver that processes spatially multiplexed signals that have propagated through frequency-selective receive correlated multiple-input multiple-output (MIMO) wireless communication channels. In a change of perspective, the proposed performance prediction methods are applied at the transmitter, which seeks to attain a target frame error rate (FER) either by adaptive power control or by adaptive modulation and coding (AMC). The performance prediction scheme utilises the statistical properties of the channel—namely noise variance, number of separable propagation paths and the eigenvalues of the receive correlation matrix—to predict the signal-to-interference-plus-noise ratio (SINR) at the output of a frequency domain soft interference cancellation minimum mean square error equaliser. The SINR distribution is used to derive the distribution of the variance of the log-likelihood ratios (LLRs) at the output of a soft symbol-to-bit demapper. Mutual information transfer charts establish a bijective relationship between the variance of the LLRs and mutual information. A 3rd Generation Partnership Project compliant turbo code is assumed. Since the decoder operates independently from the channel, its extrinsic information transfer (EXIT) charts can be simulated in advance. By utilising the approximate LLR variance distribution of the demapped equaliser output, it is possible to evaluate the probability of an intersection between an equaliser chart associated with a random channel realisation and a fixed decoder chart. This probability provides the FER. Since the proposed performance prediction method does not require any instantaneous channel state information, it can be applied at the transmitter side as a robust link adaptation scheme. In adaptive transmission power control, the modulation order and code rate are fixed. By iteratively adjusting transmission power, the transmitter attempts to find an equaliser output LLR variance distribution that reaches a specified target FER. In AMC, transmission power is fixed. The equaliser output's LLR variance distribution is determined by the modulation order, while the decoder chart's position is determined by the code rate. The transmitter iteratively adjusts the code rate and attempts to find a modulation order and code rate pairing that reaches the target FER. For vertically encoded spatially multiplexed systems, the adaptive transmission power control and AMC schemes are complemented by adaptive repeat redundancy and incremental redundancy hybrid automatic repeat request (HARQ) techniques, respectively. / Tiivistelmä Työn tavoitteena on kehittää luotettava semianalyyttinen suorituskyvyn ennustusmenetelmä tehokkaalle iteratiiviselle vastaanottimelle, joka käsittelee taajuusselektiivisen, vastaanotinpäässä tilakorreloituneen moniantennikanavan kautta kulkeneita tilakanavoituja signaaleja. Toisessa vaiheessa esitettyjä ennustusmenetelmiä hyödynnetään mukauttamalla lähetystehoa tai modulaatioastetta ja koodisuhdetta (adaptive modulation and coding [AMC]), samalla säilyttäen tavoitteeksi asetetun kehysvirhesuhteen (frame error rate [FER]). Suorituskyvyn ennustusmenetelmä hyödyntää kanavan tilastollisia ominaisuuksia – kohinan varianssia, eroteltavien etenemispolkujen lukumäärää sekä vastaanottimen korrelaatiomatriisin ominaisarvoja – ennustaakseen signaali–kohina-plus-interferenssisuhteen (signal-to-interference-plus-noise ratio [SINR]) jakauman taajuustasossa toimivan, häiriötä poistavan pienimmän keskineliösumman kanavakorjaimen lähdössä. SINR-jakaumasta johdetaan pehmän symboleista biteiksi -muunnoksen jälkeisten logaritmisten bittitodennäköisyyksien suhdelukujen (log-likelihood ratio [LLR]) jakauma. Keskinäisinformaation siirroskartat perustuvat LLR:ien varianssin sekä keskinäisinformaation väliseen bijektiivisyyteen. Informaatio on kanavakoodattu 3rd Generation Partnership Project -standardin mukaisella turbokoodilla. Turbodekooderin toiminta on kanavasta riippumatonta, joten dekooderin lisäinformaation siirroskartat (extrinsic information transfer [EXIT] charts) voidaan simuloida itsenäisesti. Hyödyntämällä kanavakorjaimen lähdön pehmeiden bittipäätösten LLR:ien varianssin jakaumaa, on mahdollista arvioida millä todennäköisyydellä korjaimen satunnaisen kanavarealisaation siirroskartta leikkaa dekooderin siirroskartan. Tämä todennäköisyys voidaan tulkita kehysvirhesuhteeksi. Koska suorituskyvyn ennustusmenetelmä ei vaadi hetkellistä tietoa kanavan tilasta, sitä voidaan hyödyntää lähetyksen mukautuksessa. Mukautuvassa tehonsäädössä modulaatio ja koodisuhde eivät muutu. Lähetin pyrkii iteratiivisella tehonsäädöllä löytämään korjaimen lähdölle LLR-jakauman, joka tuottaa halutun kehysvirhesuhteen. Mukautuvassa modulaation ja koodisuhteen valinnassa lähetysteho säilyy vakiona. Modulaatioaste vaikuttaa korjaimen lähdön LLR-jakaumaan ja koodisuhde dekooderin siirroskartan muotoon. Iteratiivisesti koodisuhdetta säätämällä lähetin pyrkii löytämään modulaation ja koodisuhteen yhdistelmän, joka saavuttaa tavoitellun kehysvirhesuhteen. Vertikaalisesti tilakanavoiduissa järjestelmissä mukautuvaa tehonsäätöä täydennetään lähetystehoa mukauttavilla uudellenlähetyksillä, kun taas mukautuvaa modulaation ja koodisuhteen valintaa täydennetään puolestaan koodisuhdetta pienentävillä automattisilla uudelleenlähetyspyynnöillä (hybrid automatic repeat request [HARQ]).
19

Optimisation des techniques de codage pour les transmissions radio avec voie de retour

EL AOUN, Moustapha 12 July 2012 (has links) (PDF)
Dans la plupart des systèmes radio, la correction des erreurs de transmission se base sur un protocole ARQ hybride (HARQ), qui combine un code correcteur d'erreurs (FEC) avec un protocole de retransmission (ARQ). La grande majorité des études portant sur l'HARQ se focalise essentiellement sur l'analyse et l'optimisation du code correcteur d'erreurs. Dans cette thèse, nous proposons une optimisation conjointe inter-couches du protocole ARQ hybride, en considérant à la fois des aspects de communications numériques et des aspects protocolaires. Dans les schémas HARQ classiques, dits simple paquet (SP), les paquets de redondance transmis sont tous relatifs au même paquet de données. Chaque retransmission réduit alors significativement le débit utile lorsque la taille des paquets est fixe. D'autre part, le débit est également très sensible à la présence d¿erreurs sur la voie retour. Nous proposons donc une nouvelle approche dite multi-paquets (MP), qui vise à réduire le nombre moyen de retransmissions par paquet grâce à la construction de paquets de redondance pouvant aider au décodage simultané de plusieurs paquets de données. Cette approche offre un gain significatif en débit par rapport aux schémas HARQ-SP lorsque le rapport signal à bruit (RSB) est suffisamment élevé. Les schémas HARQ classiques demeurent toutefois plus performants à faible RSB. Nous montrons par ailleurs que l'approche MP est plus robuste aux erreurs sur la voie de retour que l'approche SP. Ces résultats nous ont conduits à proposer un protocole hybride SP/MP qui bénéficie des avantages propres à chaque stratégie. Nous montrons par une analyse théorique ainsi que par simulation, que ce schéma hybride réalise un très bon compromis entre SP et MP sur toute la plage de RSB.
20

HARQ Systems: Resource Allocation, Feedback Error Protection, and Bits-to-Symbol Mappings

Tumula V. K., Chaitanya January 2013 (has links)
Reliability of data transmission is a fundamental problem in wireless communications. Fading in wireless channels causes the signal strength to vary at the receiver and this results in loss of data packets. To improve the reliability, automatic repeat request (ARQ) schemes were introduced. However these ARQ schemes suffer from a reduction in the throughput. To address the throughput reduction, conventional ARQ schemes were combined with forward error correction (FEC) schemes to develop hybrid-ARQ (HARQ) schemes. For improving the reliability of data transmission, HARQ schemes are included in the present wireless standards like LTE, LTE-Advanced and WiMAX. Conventional HARQ systems use the same transmission power and the same number of channel uses in different ARQ rounds. However this is not optimal in terms of minimizing the average transmit power or the average energy spent for successful transmission of a data packet. We address this issue in the first part of the dissertation, where we consider optimal resource allocation in HARQ systems with a limit on the maximum number of allowed transmissions for a data packet. Specifically, we consider the problem of minimizing the packet drop probability (PDP) under an average transmit power constraint or equivalently minimizing the average transmit power under a fixed PDP constraint. We consider both incremental redundancy (IR)-based and Chase combining (CC)-based HARQ systems in our work. For an IR-HARQ system, for the special case of two allowed transmissions for each packet, we provide a solution for the optimal number of channel uses and the optimal power to be used in each ARQ round. For a CC-HARQ system, we solve the problem of optimal power allocation in i.i.d. Rayleigh fading channels as well as correlated Rayleigh fading channels. For the CC-HARQ case, we also provide a low complexity geometric programming (GP) solution using an approximation of the outage probability expression. HARQ systems conventionally use one bit acknowledgement (ACK)/negative ACK (NACK) feedback from the receiver to the transmitter. In the 3GPP-LTE systems, one method for sending these HARQ acknowledgement bits is to jointly code them with the other control signaling information using a specified Reed-Muller code consisting of 20 coded bits. Even though the resources used for sending this control signaling information can inherently provide a diversity gain, the Reed-Muller code with such a short block size is not good at extracting all of the available diversity. To address this issue, in the second part of this dissertation, we propose two new methods: i) based on complex-field coding (CFC), and ii) using repetition across frequency bands, to extract the inherent diversity available in the channel resources and improve the error protection for the HARQ acknowledgement bits along with the other control signaling information. In the second part of the dissertation, we also propose a new signal space diversity (SSD) scheme, which results in transmit signals having constant envelope (CE). The proposed CE-SSD scheme results in a better overall power efficiency due to the reduced back-off requirements on the radio frequency power amplifier. Moreover, the proposed CE-SSD technique can be useful for application scenarios involving transmission of small number of information bits, such as in the case of control signaling information transmission. In conventional HARQ systems, during the retransmission phase, the channel resources are exclusively used for the retransmitted data packet. This is not optimal in terms of efficient resource utilization. For efficient utilization of channel resources during the retransmissions, a superposition coding (SPC) based HARQ scheme was proposed in the literature. In an SPC based HARQ system, an erroneous packet is transmitted together with a new data packet by superposition in the Euclidean space. In the final part of this dissertation, we study performance of different bits-to-symbol mappings for such an SPC based HARQ system.

Page generated in 0.0467 seconds