Дисертації: "Functional Decode and Forward"

1

Tang, Yao. "Partial decode-forward in relay networks." Thesis, McGill University, 2014. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=121541.

Повний текст джерела

Анотація:

Cooperative transmission acts as a distributed solution for providing robust wireless communications. It pools available resources, such as power and bandwidth, across the network. The relay network is the simplest information theoretic model for a cooperative wireless network and a full understanding of communication limits over such a network can potentially shed light on the design of more efficient wireless networks. However, the capacity of the relay network is still unknown. As a step towards the goal of calculating the capacity, we derive the capacity bounds for a single-source single-destination relay network based on partial decode-forward. In the first part of the thesis, we review existing bounds on the capacity of the discrete memoryless relay channel. We also review decode-forward and partial decode-forward in the relay network. In the second part of the thesis, we first introduce a discrete memoryless relay network model consisting of one source, one destination and N relays. We then design a scheme based on partial decode-forward relaying. The source splits its message into one common part and N+1 private parts which are to be decoded at different relays. The source encodessplit message parts using length-N block Markov coding, in which each private message part is independently superimposed on the common parts of the current and N previous blocks. Using joint sliding window decoding, each relay fully recovers the common message part and its intended private message part with the same block index, then forwards them together to the following nodes in the next block. We derive the achievable rate of this scheme in a compact form. The result is a generalization of and can be particularized to a known decode-forward lower bound for an N-relay network and partial decode-forward lower bound for a two-relay network. We then apply our proposed scheme to a Gaussian relay network and obtain its capacity lower bound considering power constraints at transmitting nodes. In the third part of the thesis, we introduce the concept of exhaustive message splitting for partial decode-forward in a single-source single-destination relay network with N relays, in which the relays are divided into subsets, and each different relay subset has a distinct private message part to decode. We study this scheme in more depth in a three-relay network based on block Markov encoding. We derive its achievable rate. Finally, we apply this scheme to a Gaussian three-relay network and show that our scheme generalizes network decode-forward and the private message splitting scheme as shown in the second part.
La transmission coopérative agit comme étant une solution diffusée, permettant de fournir une communication sans fil très robuste. Elle regroupe les ressources disponibles, comme la puissance et la bande passante, à travers le réseau. Le réseau à relais est le modèle théorique le plus simple pour un réseau sans fil coopératif et la compréhension des limites de communication à travers de ce réseau permet potentiellement de saisir la conception d'un réseau sans fil plus efficace. Par contre, la capacité du réseau à relais est encore inconnue. Dans cette thèse, nous adressons la conception du schéma du decode-forward partiel dans un réseau à relais ayant une source et une destination unique. Dans la première partie de cette thèse, nous révisons le réseau à relais. Nous révisons aussi le decode-forward ainsi que le decode-forward partiel dans les réseaux à relais. Dans la deuxième partie de cette thèse, nous introduisons un réseau à relais sans mémoire composé d'une source, d'une destination et de relais N. Par la suite, nous concevons un schéma à partir du réseau decode-forward partiel. La source divise son message en une partie commune et en parties privées N+1 qui sont destinées à des relais différents. La source code les parties du message divisé en utilisant le codage length-N black Markov, dans lequel chaque partie du message privé est superposé indépendamment sur les parties communes du bloc actuel et des blocs précédents N. En utilisant le décodage conjoint fenetre coulissante, chaque relais récupère la partie du message commune et sa partie du message privé ayant le même index bloc, et les envoi par la suite ensemble aux nœuds du bloc suivant. Nous dérivons son taux réalisable dans un format compact. Le résultat permet de réduire la borne inférieure connue du decode-forward d'un réseau à N-relais et la borne inférieure du decode-forward partiel pour un réseau à deux relais. Nous appliquons par la suite notre schéma propositionnel à un réseau à relais gaussien et d'obtenir sa capacité de borne inférieure en prenant en compte les contraints de puissance aux nœuds émetteurs. Dans la troisième partie de cette thèse, nous introduisons le fractionnement exhaustif des messages pour le decode-forward partiel ayant une source et une destination unique dans un réseau à relais ayant N relais, dans lequel chaque sous-ensemble différent du relais contient un message privé distinct à décoder. Nous étudions profondément ce schéma dans un réseau à trois relais basé sur le codage un bloc Markov. Nous dérivons son taux réalisable. Nous fournissons un graphique orienté qui détaille le superpositionnement de la structure du codebook afin d'aider le lecteur à comprendre la hiérarchie de la génération du codeword. Finalement, nous appliquons ce schéma à un réseau à trois relais gaussien et nous montrons que notre schéma généralise le relais decode-forward et le schéma du fractionnement du message privé comme démontré dans la seconde partie.

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Qian, Chuyi. "Improving spectral efficiency of half-duplex decode-and-forward relay." Thesis, University of Surrey, 2014. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.665471.

Повний текст джерела

Анотація:

A fundamental research problem of cooperative half-duplex relaying network is to find its capacity as well as a practical approach in order to achieve the capacity. In this thesis, the state-of-the-art review shows that the achievable rates have been derived as well as a capacity upper bound using max-flow min-cut theorem for the degraded channel with multiple parallel relays. However, the capacity of the relay channel for general case remains unknown. In the literatures, there are several relaying strategies having been developed to push the performance towards the capacity. However, the existing strategies can achieve the desired performance only when the full channel information is available at the source, which causes a large amount of signalling overhead and channel feedback. Another problem for the half-duplex relaying network is that it suffers a loss of spectral efficiency due to the orthogonality requirement for the relay transmission. Half-duplex orthogonal relay often utilizes dedicated resources to help source-to-destination communications, which results in reduced spectral efficiency and under utilization of the allocated bandwidth. The main contributions of this thesis are three-fold: • First, we propose a novel relay selection algorithm based on mixed channel information. The proposed selection algorithm aims to reduce the signalling overhead of modulation-adaptive Decode-and-Forward (DF) relaying by exploiting statistical channel information. A novel semi-deterministic approach is proposed to perform joint rate-adaptation and best-relay selection. It is shown that the proposed algorithm can achieve a good trade-off between the spectral efficiency and signalling overhead . ., Second, to mitigate the error propagation effects of DF relaying, we propose a distributed turbo decoding algorithm exploiting the source-relay correlation with reduced complexity. By iteratively updating the decoding output of the turbo decoders, the proposed decoding algorithm can outperform the conventional selective DF relaying. o Third, the relationship between the spectral efficiency and bandwidth dedicated to the relay is theoretically established. It is shown that, with the practical model of users' channel usage, the spectral efficiency is maximized when the relay does not have any dedicated bandwidth. Moreover, this theoretical result is elaborated through extensive investigation of the DF relay adopting various MAC-layer protocols including round robin resource scheduling, best-user selection, incremental relaying employing type II hybrid automatic repeat request, as well as joint channel and power allocation. Our Monte Carlo simulations show that the DF-relay with coordinated spectrum sharing improves the spectral efficiency by at least 50% in comparison with the relay with dedicated bandwidth allocation.

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Maagh, Stefan. "Performance analysis of the HARQ dynamic decode-and-forward protocol." Thesis, Edinburgh Napier University, 2015. http://researchrepository.napier.ac.uk/Output/8849.

Повний текст джерела

Анотація:

The explosive growth of data traffic in wireless communication systems comes together with the urgent need to minimize its environmental and financial impact. Therefore, the main objective in the field of green radio communication is to improve the energy efficiency of wireless communication systems with respect to the future performance demands on the wireless communication infrastructure. In this context, recent research in cooperative and cognitive communication techniques attracts particular attention. While cognitive radio improves spectral efficiency by enhanced spectrum utilization, cooperative communication techniques achieve remarkable gains in spectral efficiency by enabling the terminals to share their resources. In particular, creating virtual multi-antenna arrays by antenna sharing enables exploitation of spatial diversity gains and multiplexing gains within a network of single antenna terminals. This technique is particularly attractive for mobile wireless networks, since power and space constraints often prohibit the integration of multiple antennas into mobile terminals. This work studies the performance of the hybrid automatic repeat-request (HARQ) dynamic decode-and-forward (DDF) protocol in the half-duplex relay channel. The reason behind exploration of the HARQ-DDF protocol is that it achieves the optimal performance in terms of the diversity-multiplexing tradeoff (DMT) and the diversity-multiplexing-delay tradeoff(DMDT). However, DMT and DMDT are evaluated as the signal-to-noise ratio (SNR) approaches infinity. In practice, key performance measures are the fixed-rate outage probability and delay-limited throughput achieved at the SNR expected during operation. To this end, it is common practice to give the performance of the DDF protocol as a function of the source-to-destination channel SNR (SD-SNR). In this dissertation the focus is to study the performance of the HARQ-DDF protocol measured as a function of the SNR as seen at the destination (D-SNR). This approach enables the performance comparison with the HARQ-SISO and the HARQ-MISO protocol from an energy efficiency perspective on the system level. Furthermore, a novel variant of the HARQ-MISO protocol, the hybrid repeat-with-diversity-request (HARDQ) MISO protocol, is introduced. Considering outage probability as measure of reliability, closed-form solutions and simulation results show that the HARDQ-MISO and the HARQ-DDF protocol outperform the HARQ-MISO protocol from an energy efficiency point of view. From a delay-limited throughput point of view the HARQ-MISO protocol is beneficial. It is demonstrated that code-rate assignment allows to achieve significant performance gains in terms of delay-limited throughput. Furthermore, reducing the decoding cost using code-rate assignment techniques comes together with only negligible performance loss.

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Elmorshedy, Lina. "RF energy harvesting in a decode-and-forward wireless relay network." Thesis, University of British Columbia, 2016. http://hdl.handle.net/2429/57607.

Повний текст джерела

Анотація:

Wireless communication has experienced tremendous growth over the past three decades. This led to the development of many novel technologies aimed at enhancing the system performance due to the limited availability of radio resources. Cooperative relaying is a promising technology which enhances transmission reliability using simple hardware. However, the extra power consumed for the process of information relaying may be an issue. Recent advances in wireless energy transfer have made it possible for self-sustainable relays that power themselves by capturing ambient energy wirelessly. In this thesis we focus on two technologies, namely, cooperative relaying which enhances the energy efficiency and reliability by allowing multi-hop communication with low power nodes, and Radio Frequency (RF) energy harvesting which obviates the need for a battery by capturing the ambient RF energy and using it as a source power. In the first part of the thesis, we study RF energy harvesting in a Decode-and-Forward (DF) Wireless Relay Network (WRN) in the presence of an interferer node. We consider the Time Switching Relaying (TSR) protocol, the Power Splitting Relaying (PSR) protocol and we propose a new hybrid TSR-PSR protocol. We derive expressions for the outage probability and throughput in the delay-sensitive transmission mode for the three relaying protocols, and compare their performances. For simplicity, we neglect the energy harvested from the interferer signal. In the second part, we study the general case in which we include the effect of harvesting energy from the interferer signal. Expressions for the outage probability and throughput in the delay-sensitive transmission mode are derived for the three relaying protocols. Numerical results are presented to illustrate the effect of including RF energy harvesting from the interferer. In the third part, we study shared and non-shared power allocation schemes for a two-hop DF WRN with multiple source-destination pairs. The pairs communicate via a single relay which harvests RF energy from the source transmissions in the presence of an interfering signal. The studied schemes are compared in terms of outage probability, throughput in the delay-sensitive transmission mode and fairness.
Applied Science, Faculty of
Electrical and Computer Engineering, Department of
Graduate

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Kumar, Kuldeep. "Optimized Constellation Mappings for Adaptive Decode-and-Forward Relay Networks using BICM-ID." International Foundation for Telemetering, 2012. http://hdl.handle.net/10150/581817.

Повний текст джерела

Анотація:

In this paper, we investigate an adaptive decode-and-forward (DF) cooperative diversity scheme based on bit interleaved coded modulation with iterative decoding (BICM-ID). Data bits are first encoded by using a convolutional code and the coded bits after an interleaver are modulated before transmission. Iterative decoding is used at the receiver. Optimized constellation mapping is designed jointly for the source and the relay using a genetic algorithm. A novel error performance analysis for the adaptive DF scheme using BICM-ID is proposed. The simulation results agree well with the analytical results at high signal-to-noise ratio (SNR). More than 5.8 dB gain in terms of SNR over the existing mappings is achieved with proposed mappings.

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Farhat, Jamil de Araujo. "Eficiência energética e throughput seguros em decode-and-forward seletivo com alocação de potência distribuída." Universidade Tecnológica Federal do Paraná, 2015. http://repositorio.utfpr.edu.br/jspui/handle/1/1368.

Повний текст джерела

Анотація:

Investiga-se a eficiência energética e o throughput seguros em sistemas de comunicações sem fio cooperativos, em que um par de usuários legítimos (Alice e Bob) são auxiliados por um nó relay e em que a comunicação ocorre na presença de um espião passivo (Eve). Diversos protocolos cooperativos são comparados em relação a estas medidas e se utiliza um algoritmo iterativo e distribuído, baseado no algoritmo Dinkelbach, para alocação de potência entre Alice e o relay. A alocação de potência é utilizada visando maximizar a eficiência energética segura, medida em bits seguros/J/Hz, ou o throughput seguro, medido em bits seguros/s/Hz. Em relação aos protocolos, consideramos o caso onde Alice tem conhecimento perfeito do estado instantâneo do canal apenas em relação aos usuários legítimos. Desta forma, empregamos o protocolo Decode-and-Forward Seletivo (SDF), que realiza a escolha entre o melhor tipo de comunicação entre Alice e Bob (comunicação direta ou cooperativa) de forma a aumentar a segurança do sistema. Para comparação, consideramos outros esquemas clássicos de cooperação como o Amplify-and-Forward (AF), Decode-and-Forward Fixo (DF) e o Cooperative Jamming (CJ). Nossos resultados demostram que o SDF supera o AF, o DF e o CJ em grande parte das situações. Contudo, quando a taxa de transmissão aumenta ou quando Eve está muito próxima aos nós legítimos, o CJ apresenta um melhor desempenho.
We investigate the secure energy efficiency and throughput in cooperative wireless communications systems, in which a pair of legitimate users (Alice and Bob) are assisted by a relay node and the communication occurs in the presence of a passive eavesdropper (Eve). Several cooperative protocols are compared with respect to these measures and we use of an iterative and distributed algorithm, based on Dinkelbach algorithm, to allocate power between Alice and the relay. The power allocation is performed in order to increase the secure energy efficiency, measured in secure bits/J/Hz, or secure throughput, measured in secure bits/s/Hz. About the protocols, we consider the case where Alice has perfect knowledge only about the instantaneous channel state of the legitimate channel. So, we employ a Selective Decode-and-Forward (SDF) protocol, which chooses the best type of communication between Alice and Bob (direct or cooperative communication) in order to improve security. For comparison, we consider other classical cooperative schemes such as the Amplify-and-Forward (AF), the Fixed Decode-and-Forward (DF) and the Cooperative Jamming (CJ). Our results show that SDF outperforms AF, DF and CJ in most situations. However, when the transmit rate increases or when Eve is close to the legitimate nodes, CJ has a better performance.

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Elsaid, Lubna A. "PHYSICAL-LAYER SECURITY WITH FULL-DUPLEX DECODE-AND-FORWARD RELAYING: SECRECY RATES AND POWER ALLOCATION." University of Akron / OhioLINK, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=akron1467375632.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Boostanimehr, Hamidreza. "Selective subcarrier pairing and power allocation for decode-and-forward OFDM relay systems with perfect and partial CSI." Thesis, University of British Columbia, 2010. http://hdl.handle.net/2429/28119.

Повний текст джерела

Анотація:

This thesis investigates a decode-and-forward two-hop relaying system consisting of one source, one relay and one destination, in which orthogonal frequency division multiplexing is used. The relay forwards the message received from the source on a subset of available subcarriers in the second time slot. Firstly, a subcarrier pairing and selection algorithm is proposed, assuming that perfect channel state information (CSI) is available at all nodes, then, power is allocated to both the source and relay stations under individual power constraints in order to maximize the capacity. Secondly, subcarrier selection and pairing, and power allocation (PA) under partial CSI assumption along with individual power constraints are addressed. The result is a novel distributed algorithm with low complexity maximizing the expected value of capacity at the source and relay nodes. Finally, the simulation results show that selective relaying combined with subcarrier pairing and PA improves the system capacity to a considerable extent in both perfect and partial CSI cases.

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Xue, Q. (Qiang). "Analysis of near-optimal relaying schemes for wireless tandem and multicast relay networks." Doctoral thesis, Oulun yliopisto, 2016. http://urn.fi/urn:isbn:9789526210988.

Повний текст джерела

Анотація:

Abstract This thesis is devoted to studying two wireless relay network models, namely wireless tandem multiple-input-multiple-output (MIMO) relay networks and wireless two-hop multicast relay networks. Regarding wireless tandem MIMO relay networks, we develop a systematic approach to analyze their fundamental diversity-multiplexing tradeoff (DMT) under the assumption that the relays implement a class of practical full-duplex techniques that enable them to opt for either full-duplex or half-duplex mode. Based on the analysis, we make contribution from the following aspects: First of all, we thoroughly compare the performance of full-duplex and half-duplex mode operations in the framework of wireless tandem relay networks. We find that both full-duplex and half-duplex modes have opportunity to outperform each other. Specifically, for many tandem relay networks, in the low multiplexing gain region, the best relay-mode configuration is to let all the relays operate in half-duplex mode since this relay-mode configuration achieves the best diversity gain in the low multiplexing gain region. However, in the high multiplexing gain region, the best diversity gain is usually achieved by switching some relays to full-duplex mode. Furthermore, we study how residual interference at relays working in full-duplex mode affects the DMT of a tandem network. We find that residual interference not only derogates the performance of full-duplex mode, but also affects the optimal power allocation of the network. Specifically, if residual interference is zero or has a sufficiently low power level, a linear power allocation scheme can achieve the optimal DMT of the network. Otherwise, the optimal DMT is achieved by a nonlinear power allocation scheme. Finally, the DMT analysis illustrates an effective principle to deal with general multi-hop wireless networks, which is to break them down into small scale subnetworks with certain key structures. Then, studying the general multi-hop wireless networks essentially becomes studying those small scale subnetworks and the relationship among them. Regarding wireless two-hop multicast relay networks, we focus on a case study where a single source multicasts to two destinations through the assistance of two relays. We propose and analyze the performance of a partial decode-and-forward protocol for the network, which includes the full decode-and-forward protocol as a special case and achieves a better performance in general. Specifically, we prove that the achievable rate of the partial decode-and-forward protocol can either reach arbitrarily close to the cut-set upper bound of the network or reach within 1 bit/s/Hz to that, asymptotically with respect to the transmit power. We also show that the partial decode-and-forward protocol can achieve the optimal DMT of the network. Then, we discuss the perspective of implementing the partial decode-and-forward strategy to more general multicast relay networks
Tiivistelmä Tämä opinnäytetyö tutkii kahta langatonta välitysverkkomallia, nimittäin langatonta tandem multiple-input-multiple-output (MIMO) välitysverkkoa ja langatonta monilähetysvälitysverkkoa kahdelle hypylle. Kehitämme systemaattisen lähestymistavan diversiteetti-multipleksointi vaihtokaupan (DMT) analysointiin langattomiin tandem MIMO välitysverkkoihin, olettaen välittäjien käyttävän käytännöllisiä full-duplex lähetystekniikoita, jotka mahdollistavat valinnan joko full-duplex tai half-duplex lähetystilan välillä. Analyysin perusteella kontribuoimme seuraavilla tavoilla: Ensinnäkin, vertailemme perusteellisesti full-duplex sekä half-duplex lähetystiloja langattomissa tandem välitysverkoissa. Huomaamme, että molemmat full-duplex ja half-duplex lähetystilat voivat suoriutua toinen toistaan paremmin. Tarkemmin sanoen, monissa tandem välitysverkoissa silloin kun multipleksoinnin hyöty on alhainen, paras välitystapa on antaa kaikkien välittäjien käyttää half-duplex lähetystilaa, koska silloin saavutetaan paras diversiteettilisäys. Toisaalta, kun multipleksointilisäys on suuri, paras diversiteettilisäys saadaan yleensä asettamalla jotkin välittäjät full-duplex lähetystilaan. Lisäksi, tutkimme kuinka full-duplex lähetystilaa käyttävien välittäjien jäljelle jäävä interferenssi vaikuttaa tandemverkon DMT:aan. Huomaamme, että jäljelle jäävä interferenssi vähentää full-duplex mallin tehokkuutta ja lisäksi vaikuttaa optimaaliseen tehonjakamiseen verkossa. Tarkemmin sanoen, jos jäljelle jäävä interferenssin tehotaso on nolla tai tarpeeksi lähellä sitä, lineaarisella tehojaolla voi saavuttaa verkon optimaalisen DMT:n. Muutoin, optimaalinen DMT saavutetaan epälineaarisella tehojaolla. Lopuksi, DMT analyysi havainnollistaa tehokkaan periaatteen yleisluontoisten monihyppyverkkojen käsittelemiseen, eli verkon jakamisen pienempiin osiin erilaiin avainrakenteisiin. Tämän jälkeen yleisluntoisten langattoimen monihyppyverkkojen tutkiminen tapahtuu tutkimalla näitä pieniä osia ja niiden välisiä vuorovaikutussuhteita. Langattomaan kahden hypyn monilähetysvälitysverkkon osalta keskitymme tapaustutkimukseen, jossa yksi lähettäjä monilähettää kahdelle vastaanottajalle kahden välittäjän avulla. Ehdotamme tälle verkolle osittaista decode-and-forward protokollaa, joka sisältää täyden decode-and-forward protokollan erikoistapauksena ja saavuttaa yleisesti tätä protokollaa paremman tehokkuuden. Tarkemmin sanoen, todistamme että tällä protokollalla siirtonopeus lähetystehon suhteen joko lähenee asymptoottisesti verkon cut-set ylärajaa mielivaltaisen lähelle tai saavuttaa sen 1 bit/s/Hz sisään. Osoitamme myös, että osittainen decode-and-forward protokolla voi saavuttaa verkon optimaalisen DMT:n. Tämän jälkeen, käsittelemme osittaisen decode-and-forward strategian impelentointia yleisluontoisille monilähetysvälitysverkoille

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Marunganti, Murali Krishna. "Experimental Study of Cooperative Communication using Software Defined Radios." Cleveland State University / OhioLINK, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=csu1293249850.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

11

Samarasekera, Andawattage Chaminda Janaka. "The Performance of Dual-Hop Decode-and-Forward Underlay Cognitive Relay Networks with Interference Power Constraints over Weibull Fading Channels." Thesis, Blekinge Tekniska Högskola, Sektionen för ingenjörsvetenskap, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-3201.

Повний текст джерела

Анотація:

With the rapid development and the increasing use of wireless devices, spectrum scarcity has become a problem. The higher frequencies have bad propagation characteristics and the lower frequencies have low data rates, therefore the radio spectrum that is available for efficient wireless transmission is a limited resource. One of the proposed solutions for this problem is cognitive relay networks (CRNs), where cognitive radio is combined with a cooperative spectrum sharing system to increase the spectrum utilization. In this thesis, the outage probability performances of underlay CRNs with interference power constraints from the primary network over Weibull fading channels have been investigated for three different scenarios. The maximum transmit power of the secondary network is governed by the maximum interference power that the primary network's receiver can tolerate. The first scenario is a cognitive dual-hop decode-and-forward (DF) relay network over independent non-identically distributed (i.n.i.d.) Weibull fading channels. In the second scenario, the CRN consists of a DF relay plus the direct link transmission with a selection combining receiver at the destination over i.n.i.d. Weibull fading channels. The third CRN considered has multiple DF relays where the best relay selection scheme is employed over independent identically distributed (i.i.d.) Weibull fading channels. The analytical results have been derived using the statistical characteristics of end-to-end signal-to-noise ratios, and have been verified by Monte-Carlo simulations.

Стилі APA, Harvard, Vancouver, ISO та ін.

12

Alexopoulos, Konstantinos. "Performance analysis of decode-and-forward with cooperative diversity and Alamouti cooperative space-time coding in clustered multihop wireless networks." Thesis, Monterey, Calif. : Naval Postgraduate School, 2008. http://edocs.nps.edu/npspubs/scholarly/theses/2008/Sept/08Sep%5FAlexopoulos.pdf.

Повний текст джерела

Анотація:

Thesis (M.S. in Electrical Engineering)--Naval Postgraduate School, September 2008.
Thesis Advisor(s): Tummala, Murali ; McEachen, John C. "September 2008." Description based on title screen as viewed on October 31, 2008. Includes bibliographical references (p. 95-98). Also available in print.

Стилі APA, Harvard, Vancouver, ISO та ін.

13

Lebel, Cynthia. "Optical Brain Imaging of Motor Cortex to Decode Movement Direction using Cross-Correlation Analysis." Thesis, University of North Texas, 2019. https://digital.library.unt.edu/ark:/67531/metadc1609111/.

Повний текст джерела

Анотація:

The goal of this study is to determine the intentional movement direction based on the neural signals recorded from the motor cortex using optical brain imaging techniques. Towards this goal, we developed a cross-correlation analysis technique to determine the movement direction from the hemodynamic signals recorded from the motor cortex. Healthy human subjects were asked to perform a two-dimensional hand movement in two orthogonal directions while the hemodynamic signals were recorded from the motor cortex simultaneously with the movements. The movement directions were correlated with the hemodynamic signals to establish the cross-correlation patterns of firings among these neurons. Based on the specific cross-correlation patterns with respect to the different movement directions, we can distinguish the different intentional movement directions between front-back and right-left movements. This is based on the hypothesis that different movement directions can be determined by different cooperative firings among various groups of neurons. By identifying the different correlation patterns of brain activities with each group of neurons for each movement, we can decode the specific movement direction based on the hemodynamic signals. By developing such a computational method to decode movement direction, it can be used to control the direction of a wheelchair for paralyzed patients based on the changes in hemodynamic signals recorded using non-invasive optical imaging techniques.

Стилі APA, Harvard, Vancouver, ISO та ін.

14

Nasiri, Khormuji Majid. "Relaying Protocols for Wireless Networks." Licentiate thesis, Stockholm : Electrical Engineering, Elektrotekniska system, Kungliga Tekniska högskolan, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-4716.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

15

Poreddy, Mahathi. "Outage Probability Analysis of CooperativeCognitive Radio Networks Over κ − μ Shadowed Fading Channels". Thesis, Blekinge Tekniska Högskola, Institutionen för tillämpad signalbehandling, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-13634.

Повний текст джерела

Анотація:

Over time, wireless technology advancements in the field of communications have been attracting every individual to turn into a wireless user. To accommodate the increasing number of users and to avoid the problem of spectrum scarcity, the concept of Cognitive Radio Network (CRN) has been developed. Cognitive Radio (CR) is an intelligent radio which efficiently detects and allocates the spectrums of primary licensed users (PUs) to the secondary unlicensed users (SUs). The SUs can utilize these spectrums as long as they do not cause harmful interfere to the PUs. Interference may occur because of the following reasons: misdetection of spectrum availability, the high transmission power of SU when both SU and PU are present in the same channel at the same time. In order to avoid interference, the radio has to have a very accurate spectrum sensing method, transmit power at SU should be constrained by the peak interference power of PU and the CR should continuously sense the presence of PUs. To increase the wireless coverage area and reliability of CRN, a new technology called Cooperative Cognitive Radio Network (CCRN), which is a combination of CRN and cooperative communications was developed. A CCRN not only increases the reliability and wireless coverage area of CR but also improves the overall performance of the system. In this context, the main objective of this research work is to evaluate the outage performance of a CCRN in an environment where fading and shadowing also come into the picture and to study the importance of relay networks in CRN. To fulfill the objectives of this research work, a two-hop decode-and-forward CCRN is considered. The recently introduced κ − µ shadowed fading channel is employed over the CCRN to generate a realistic environment. In order to implement such system as a whole, a deep literature study is performed beforehand. Analytical expressions for the Probability Density Function (PDF) and Cumulative Distribution Function (CDF) of the Signal-to-Noise Ratio (SNR) are obtained. The analytical expressions and simulation results for Outage Probability (OP) are obtained and compared under different fading parameters. The importance of a multiple-relay system in CRN is presented. From the results obtained in this research work, we can conclude that the OP decreases with increase in allowable peak interference power at the PU. The transmit power at SU should always be constrained by the peak interference power at the PU to avoid interference. The overall system performance increases with increasing number of relays.

Стилі APA, Harvard, Vancouver, ISO та ін.

16

Nasiri, Khormuji Majid. "Coding Schemes for Relay Networks." Doctoral thesis, KTH, Kommunikationsteori, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-39199.

Повний текст джерела

Анотація:

Cooperative communications by pooling available resources—for example, power and bandwidth—across the network, is a distributed solution for providing robust wireless transmission. Motivated by contemporary applications in multi-hop transmission and ad hoc networks, the classical three-node relay channel (RC) consisting of a source–destination pair and a relay node has received a renewed attention. One of the crucial aspects of the communication over relay networks (RNs) is the design of proper relaying protocols; that is, how the relay should take part in the transmission to meet a certain quality of service. In this dissertation, we address the design of reliable transmission strategies and quantification of the associated transmission rates over RNs. We consider three canonical examples of RNs: the classical RC, the multiple-access RC (MARC) and the two-way RC.We also investigate the three-node RC and MARC with state. The capacity of the aforementioned RNs is an open problem in general except for some special cases. In the thesis, we derive various capacity bounds, through which we also identify the capacity of some new classes of RNs. In particular, we introduce the class of state-decoupled RNs and prove that the noisy network coding is capacity achieving under certain conditions. In the thesis, we also study the effect of the memory length on the capacity of RNs. The investigated relaying protocols in the thesis can be categorized into two groups: protocols with a finite relay memory and those with infinite relay memory requirement. In particular, we consider the design of instantaneous relaying (also referred to as memoryless relaying) in which the output of the relay depends solely on the presently received signal at the relay. For optimizing the relay function, we present several algorithms constructed based on grid search and variational methods. Among other things, we surprisingly identify some classes of semi-deterministic RNs for which a properly constructed instantaneous relaying strategy achieves the capacity. We also show that the capacity of RNs can be increased by allowing the output of the relay to depend on the past received signals as well the current received signal at the relay. As an example, we propose a hybrid digital–analog scheme that outperforms the cutset upper bound for strictly causal relaying.

QC 20110909

Стилі APA, Harvard, Vancouver, ISO та ін.

17

Kaur, Kamalpreet. "Laser-induced forward transfer techniques for printing functional materials and photonic devices." Thesis, University of Southampton, 2011. https://eprints.soton.ac.uk/195001/.

Повний текст джерела

Анотація:

The subject of this thesis is to study the Laser-Induced Forward Transfer (LIFT) tech-nique using a time-resolved method in order to gain a better insight into the dynamics of the transfer process and to use the technique for rapid prototyping of photonic devices and printing piezoelectric materials for energy harvesting applications. A nanosecond shadowgraphy technique was used to study the triazene polymer (TP)-dynamic release layer (DRL) assisted LIFT technique for solid-phase ceramic materials namely gadolinium gallium oxide (Gd-Ga-O)and ytterbium doped yttrium aluminium oxide (Yb:YAG). The dependence of the distance travelled by the shockwave and the ejected donor material, their velocities and the quality of the ejected donor pixel on the laser fluence, the thickness of the TP-DRL and donor film thickness was studied and is discussed. Segmented channel waveguides, X-couplers and mode-filters based on titanium (Ti) in-diffused lithium niobate (LN) have been fabricated using the LIFT technique. The segment separation was found to be the key factor in determining mode profiles of waveguides. The corrugations due to the segmented nature of the deposits was observed to introduce non-adiabatic behavior in the mode filters which was further confrmed by theoretical modeling. Forward transfer of donor films with patterns to be transferred machined into them prior to LIFT have been investigated. This technique allows debris-free printing of thicker and fragile donors films with extremely smooth and uniform edges in intact and solid-phase without the need of any sacrificial layer. Results of debris-free printing of micro-pellets of zinc oxide (ZnO) with extremely good quality edges from donor films pre-machined using focused ion beam (FIB) are presented. Printing and post-transfer characterization of both lead zirconate titanate (PZT) and non-lead based ZnO piezoelectric materials for energy harvesting applications using the LIFT and TP-DRL assisted LIFT techniques have been studied and discussed

Стилі APA, Harvard, Vancouver, ISO та ін.

18

Coso, Sánchez Aitor del. "Achievable rates for Gaussian Channels with multiple relays." Doctoral thesis, Universitat Politècnica de Catalunya, 2008. http://hdl.handle.net/10803/6919.

Повний текст джерела

Анотація:

Los canales múltiple-entrada-múltiple-salida (MIMO) han sido ampliamente propuestos para superar los desvanecimientos aleatorios de canal en comunicaciones inalámbricas no selectivas en frecuencia. Basados en equipar tanto transmisores como receptores con múltiple antenas, sus ventajas son dobles. Por un lado, permiten al transmisor: i) concentrar la energía transmitida en una dirección-propia determinada, o ii) codificar entre antenas con el fin de superar desvanecimientos no conocidos de canal. Por otro lado, facilitan al receptor el muestreo de la señal en el dominio espacial. Esta operación, seguida por la combinación coherente de muestras, aumenta la relación señal a ruido de entrada al receptor. De esta forma, el procesado multi-antena es capaz de incrementar la capacidad (y la fiabilidad) de la transmisión en escenarios con alta dispersión.

Desafortunadamente, no siempre es posible emplazar múltiples antenas en los dispositivos inalámbricos, debido a limitaciones de espacio y/o coste. Para estos casos, la manera más apropiada de explotar el procesado multi-antena es mediante retransmisión, consistente en disponer un conjunto de repetidores inalámbricos que asistan la comunicación entre un grupo de transmisores y un grupo de receptores, todos con una única antena. Con la ayuda de los repetidores, por tanto, los canales MIMO se pueden imitar de manera distribuida. Sin embargo, la capacidad exacta de las comunicaciones con repetidores (así como la manera en que este esquema funciona con respeto al MIMO equivalente) es todavía un problema no resuelto. A dicho problema dedicamos esta tesis.

En particular, la presente disertación tiene como objetivo estudiar la capacidad de canales Gaussianos asistidos por múltiples repetidores paralelos. Dos repetidores se dicen paralelos si no existe conexión directa entre ellos, si bien ambos tienen conexión directa con la fuente y el destino de la comunicación. Nos centramos en el análisis de tres canales ampliamente conocidos: el canal punto-a-punto, el canal de múltiple-acceso y el canal de broadcast, y estudiamos su mejora de funcionamiento con repetidores. A lo largo de la tesis, se tomarán las siguientes hipótesis: i) operación full-duplex en los repetidores, ii) conocimiento de canal tanto en transmisión como en recepción, y iii) desvanecimiento sin memoria, e invariante en el tiempo.

En primer lugar, analizamos el canal con múltiples repetidores paralelos, en el cual una única fuente se comunica con un único destino en presencia de N repetidores paralelos. Derivamos límites inferiores de la capacidad del canal por medio de las tasas de transmisión conseguibles con distintos protocolos: decodificar-y-enviar, decodificar-parcialmente-y-enviar, comprimir-y-enviar, y repetición lineal. Asimismo, con un fin comparativo, proveemos un límite superior, obtenido a través del Teorema de max-flow-min-cut. Finalmente, para el número de repetidores tendiendo a infinito, presentamos las leyes de crecimiento de todas las tasas de transmisión, así como la del límite superior.

A continuación, la tesis se centra en el canal de múltiple-acceso (MAC) con múltiples repetidores paralelos. El canal consiste en múltiples usuarios comunicándose simultáneamente con un único destino en presencia de N repetidores paralelos. Derivamos una cota superior de la región de capacidad de dicho canal utilizando, de nuevo, el Teorema de max-flow-min-cut, y encontramos regiones de tasas de transmisión conseguibles mediante: decodificar-y-enviar, comprimir-y-enviar, y repetición lineal. Asimismo, se analiza el valor asintótico de dichas tasas de transmisión conseguibles, asumiendo el número de usuarios creciendo sin límite. Dicho estudio nos permite intuir el impacto de la diversidad multiusuario en redes de acceso con repetidores.

Finalmente, la disertación considera el canal de broadcast (BC) con múltiples repetidores paralelos. En él, una única fuente se comunica con múltiples destinos en presencia de N repetidores paralelos. Para dicho canal, derivamos tasas de transmisión conseguibles dado: i) codificación de canal tipo dirty paper en la fuente, ii) decodificar-y-enviar, comprimir-y-enviar, y repetición lineal, respectivamente, en los repetidores. Además, para repetición lineal, demostramos que la dualidad MAC-BC se cumple. Es decir, la región de tasas de transmisión conseguibles en el BC es igual a aquélla del MAC con una limitación de potencia suma. Utilizando este resultado, se derivan algoritmos de asignación óptima de recursos basados en teoría de optimización convexa.
Multiple-input-multiple-output (MIMO) channels are extensively proposed as a means to overcome the random channel impairments of frequency-flat wireless communications. Based upon placing multiple antennas at both the transmitter and receiver sides of the communication, their virtues are twofold. On the one hand, they allow the transmitter: i) to concentrate the transmitted power onto a desired eigen-direction, or ii) tocode across antennas to overcome unknown channel fading. On the other hand, they permit the receiver to sample the signal on the space domain. This operation, followed by the coherent combination of samples, increases the signal-to-noise ratio at the input of the detector. In fine, MIMO processing is able to provide large capacity (and reliability) gains within rich-scattered scenarios.

Nevertheless, equipping wireless handsets with multiple antennas is not always possible or worthwhile. Mainly, due to size and cost constraints, respectively. For these cases, the most appropriate manner to exploit multi-antenna processing is by means of relaying. This consists of a set of wireless relay nodes assisting the communication between a set of single-antenna sources and a set of single-antenna destinations. With the aid of relays, indeed, MIMO channels can be mimicked in a distributed way. However, the exact channel capacity of single-antenna communications with relays (and how this scheme performs with respect to the equivalent MIMO channel) is a long-standing open problem. To it we have devoted this thesis.

In particular, the present dissertation aims at studying the capacity of Gaussian channels when assisted by multiple, parallel, relays. Two relays are said to be parallel if there is no direct link between them, while both have direct link from the source and towards the destination. We focus on three well-known channels: the point-to-point channel, the multi-access channel and the broadcast channel, and study their performance improvement with relays. All over the dissertation, the following assumptions are taken: i) full-duplex operation at the relays, ii) transmit and receive channel state information available at all network nodes, and iii) time-invariant, memory-less fading.

Firstly, we analyze the multiple-parallel relay channel, where a single source communicates to a single destination in the presence of N parallel relays. The capacity of the channel is lower bounded by means of the achievable rates with different relaying protocols, i.e. decode-and-forward, partial decode-and-forward, compress-and-forward and linear relaying. Likewise, a capacity upper bound is provided for comparison, derived using the max-flow-min-cut Theorem. Finally, for number of relays growing to infinity, the scaling laws of all achievable rates are presented, as well as the one of the upper bound.

Next, the dissertation focusses on the multi-access channel (MAC) with multiple-parallel relays. The channel consists of multiple users simultaneously communicating to a single destination in the presence of N parallel relay nodes. We bound the capacity region of the channel using, again, the max-flow-min-cut Theorem and find achievable rate regions by means of decode-and-forward, linear relaying and compress-and-forward. In addition, we analyze the asymptotic performance of the obtained achievable sum-rates, given the number of users growing without bound. Such a study allows us to grasp the impact of multi-user diversity on access networks with relays.

Finally, the dissertation considers the broadcast channel (BC) with multiple parallel relays. This consists of a single source communicating to multiple receivers in the presence of N parallel relays. For the channel, we derive achievable rate regions considering: i) dirty paper encoding at the source, and ii) decode-and-forward, linear relaying and compress-and-forward, respectively, at the relays. Moreover, for linear relaying, we prove that MAC-BC duality holds. That is, the achievable rate region of the BC is equal to that of the MAC with a sum-power constraint. Using this result, the computation of the channel's weighted sum-rate with linear relaying is notably simplified. Likewise, convex resource allocation algorithms can be derived.

Стилі APA, Harvard, Vancouver, ISO та ін.

19

Gregoratti, David. "Randomized space-time block coding for the multiple-relay channel." Doctoral thesis, Universitat Politècnica de Catalunya, 2010. http://hdl.handle.net/10803/6949.

Повний текст джерела

Анотація:

En la última década, la cooperación entre usuarios ha generado un gran interés por la posibilidad de mejorar la velocidad de transmisión en las redes de comunicaciones inalámbricas. El objetivo es formar un array con las antenas de todos los dispositivos y, de esta forma, aplicar técnicas de procesado espacio-temporal. El esquema de cooperación más sencillo es el canal con relays: todos los terminales que escuchen una comunicación entre dos puntos pueden ayudar a la fuente retransmitiendo lo que hayan recibido.

En un sistema realista, los relays no disponen de información sobre el canal en trasmisión. En este escenario, los códigos espacio-temporales (STC, del inglés space-time coding) son la alternativa más eficiente para aprovechar la diversidad introducida por los relays. Sin embargo, los STC clásicos están diseñados para un número limitado y fijo de antenas transmisoras y no se adaptan bien a sistemas cooperativos donde el número de relays puede ser elevado y, sobretodo, puede variar en el tiempo, según los usuarios entren o salgan de la red. El problema principal es la necesidad de usar un código nuevo cada vez que cambie la configuración de la red, generando un importante tráfico de señalización.

Esta tesis analiza un código espacio-temporal a bloques de dispersión lineal (LD-STBC, del inglés linear-dispersion space-time block coding), aleatorio y distribuido: a cada relay se le asigna una matriz aleatoria que aplica una transformación lineal al vector que contiene los símbolos de la fuente. Cada matriz se genera de forma independiente y sin ninguna relación con el número de usuarios involucrados. De esta manera, el número de nodos puede variar sin necesidad de modificar los códigos existentes.

La forma más intuitiva de construir matrices de dispersión lineal independientes es que sus elementos sean variables aleatorias independientes e idénticamente distribuidas (i.i.d.). Por esta razón, se estudia primero la eficiencia espectral obtenida por este tipo de LD-STBC. Es importante remarcar que la eficiencia espectral es una cantidad aleatoria, ya que es una función de los códigos aleatorios anteriormente descritos. Sin embargo, cuando las dimensiones de las matrices crecen infinitamente pero manteniendo constante la tasa del código (relación entre número de símbolos de la fuente sobre el número de símbolos de los relays), la eficiencia espectral converge rápidamente hacia una cantidad determinista. Este resultado se demuestra usando la teoría de las matrices aleatorias. Por esta razón, el sistema se analiza aproximando la eficiencia espectral con su limite. Por ejemplo, la comparación con el canal directo entre fuente y destino permite definir unas condiciones suficientes en donde el sistema con relays es superior a la comunicación punto a punto.

Posteriormente se debe analizar la probabilidad de outage, es decir la probabilidad de que, debido a la baja calidad del canal, la eficiencia espectral sea menor que la velocidad de transmisión solicitada por el sistema. Como ya se ha mencionado anteriormente, los relays se introducen para aumentar la diversidad del canal y, con ella, el número de caminos independientes entre la fuente y el receptor, reduciendo la probabilidad de outage. Para los LD-STBC i.i.d. las prestaciones en términos de outage dependen del tipo de relay (amplify and forward o decode and forward) y son función de la tasa del código, que debe ser cuidadosamente elegida para maximizar el orden de diversidad sin desperdiciar demasiados recursos.

Finalmente, en el último capítulo de la tesis se considera otro tipo de LD-STBC, distinto del i.i.d. analizado hasta ahora. En este caso, las matrices de dispersión lineal siguen siendo independientes la una de la otra pero se añade la restricción de que cada una tenga columnas (o filas, según la tasa del código) ortogonales. Así, se consigue que el código siga siendo flexible con respecto a las variaciones en el número de usuarios, pero su estructura permite reducir la interferencia generada por cada relay, como se puede notar comparando su eficiencia espectral con la eficiencia espectral obtenida por el código i.i.d. Cabe destacar que el análisis asintótico de estos códigos (llamados isométricos) se basa en herramientas matemáticas más sofisticadas que las anteriores y, por lo tanto, es necesario un estudio más profundo para poder entender cómo se comporta en términos de outage.
In the last decade, cooperation among multiple terminals has been seen as one of the more promising strategies to improve transmission speed in wireless communications networks. Basically, the idea is to mimic an antenna array and apply distributed versions of well-known space-diversity techniques. In this context, the simplest cooperative scheme is the relay channel: all the terminals (relays) that overhear a point-to-point communication between a source and a destination may decide to aid the source by forwarding (relaying) its message.

In a mobile system, it is common to assume that the relays do not have any information about the channel between them and the destination. Under this hypothesis, the best solution to exploit the diversity offered by multiple transmitting antennas is to use space-time coding (STC). However, classical STC's are designed for systems with a fixed and usually low number of antennas. Thus, they are not suitable for relaying in most mobile communications systems where the number of terminals is potentially large and may vary as users join or leave the network. For each new configuration, a new code has to be chosen and notified to the relays, introducing a set-up overhead of signaling traffic.

In this dissertation we will propose and analyze a randomized distributed linear-dispersion space-time block code (LD-STBC): each relay is assigned a specific matrix which linearly transforms (left-multiplies) the column vector of source symbols. Each matrix is independently generated and does not depend on the total number of transmitters, which can thus change without interrupting data transmission for a new code--relay assignment.

The more intuitive way to build independent linear-dispersion matrices is to fill them with independent and identically distributed (i.i.d.) random variables. Therefore, we will first consider these i.i.d. codes and characterize the resulting spectral efficiency. In order to analyze the performance achieved by the system, we consider a large-system analysis based on random matrix theory. We will show that the random spectral efficiency (function of the random linear-dispersion matrices) converges almost surely to a deterministic quantity when the dimensions of the code grow indefinitely while keeping constant the coding rate. Since convergence is very fast, the random spectral efficiency will be approximated by the deterministic limit in the subsequent analysis. By comparison with the direct link, sufficient conditions are derived for the superiority of relaying.

Next, we will analyze the outage probability of the system, that is the probability that the spectral efficiency falls below a given target rate due to channel fading. The main purpose of diversity techniques is to introduce alternative paths from the source to the destination, so that data transmission does not fail when the direct link undergoes deep fading. We will show that the diversity behavior of LD-STBC relaying mainly depends on both the coding rate and the relaying strategy (amplify and forward or decode and forward). It is then important to choose the coding rate that maximizes the diversity order without wasting too many resources.

To conclude the dissertation, we will consider a different code based on independent isometric Haar-distributed random linear-dispersion matrices. The
new code maintains the flexibility of the previous one with respect to variations in the number of relays. However, the more complex structure of the codes allows a noticeable reduction of the interference generated by the relays. Unfortunately, isometric codes also require more sophisticated mathematical tools for their asymptotic analysis. For this reason, we simply introduce the problem by showing that it is possible to have some spectral-efficiency gain with respect to i.i.d. codes. The outage-probability analysis requires a more thorough understanding and will be the subject of future work.

Стилі APA, Harvard, Vancouver, ISO та ін.

20

Chin, Yiyong. "Slotted cooperative communication in half duplex relay networks." Thesis, Queensland University of Technology, 2013. https://eprints.qut.edu.au/60551/1/Yiyong_Chin_Thesis.pdf.

Повний текст джерела

Анотація:

In cooperative communication systems, several wireless communication terminals collaborate to form a virtual-multiple antenna array system and exploit the spatial diversity to achieve a better performance. This thesis proposes a practical slotted protocol for cooperative communication systems with half-duplex single antennas. The performance of the proposed slotted cooperative communication protocol is evaluated in terms of the pairwise error probability and the bit error rate. The proposed protocol achieves the multiple-input single-output performance bound with a novel relay ordering and scheduling strategy.

Стилі APA, Harvard, Vancouver, ISO та ін.

21

Heitzman, Jill Elaine. "Effect of Individual Height and Testing Methods on Outcome of the Forward Functional Reach Test." Diss., NSUWorks, 2018. https://nsuworks.nova.edu/hpd_pt_stuetd/61.

Повний текст джерела

Анотація:

Background: With falls a leading cause of injuries among those over age 65, early recognition of risk is imperative to reduce rising rates. The Forward Functional Reach test (FFRT) (Duncan et al., 1990) is frequently used to identify fall risk, however, the variability in cut values found in the research may be related to height and reach strategies. Purpose: The purpose of this study was to determine if FFRT is affected by an individual’s height and if bilateral reach to height ratio could more accurately identify fall risk. Methods: Sixty-six participants (60 and older) were recruited from a senior center in Alabama. Inclusion criteria required: ability to stand for two minutes, walk independently with or without an assistive device for 20’, no restrictive neurological/orthopedic injury or vital signs. Participants were classified into height groups; short < 65”, medium 65” to 69”, or tall > 69” and as fall risk (1) or non-fall risk (0) based on health/fall history, Activities-Specific Balance Confidence Scale (ABC), Timed Up and Go (TUG), and handgrip strength; summative as fall risk composite score (FRCS). Distance using the FFRT for unilateral forward functional reach (UFFR) and bilateral forward functional reach (BFFR) was found then unilateral reach to height ratio (URHR) and bilateral reach to height ratio (BRHF) were calculated. Research Analysis/Discussion: A Pearson Correlation showed UFFR, BFFR, URHR, and BRHR negatively correlated to FRCS (-0.51 to -0.54) however height correlated greater with UFFR (0.59) and BFFR (0.63) than URHR (0.42) and BRHR (0.47). An ANOVA between height group comparison showed statistical differences; UFFR (p=3.03x10-6), BFFR (p=7.8x10-7), URHR (p=0.00123), BRHR (p=0.00052); greater difference for BFFR than UFFR. A multilinear regression showed both BFFR and BRHR more influential to FRCS. Using a scatterplot between UFFR and BFFR, BFFR cut point values specific to height groups reduced false negatives by >60% in all height groups. Conclusion: Height is a factor in FFRT. The extra calculation for reach to height ratio does not add improve fall risk identification. BFFR with cut points by height group, 10” for short, 11” for medium and 12” for tall, improves fall risk identification.

Стилі APA, Harvard, Vancouver, ISO та ін.

22

Barros, José Fábio Santos de. "Um estudo sobre o desempenho de protocolos de comunicações digitais cooperativas." reponame:Repositório Institucional da UFABC, 2015.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

23

Vanyan, Anna. "Extension and analysis of hybrid ARQ schemes in the context of cooperative relaying." Phd thesis, Université Paris Sud - Paris XI, 2014. http://tel.archives-ouvertes.fr/tel-01058051.

Повний текст джерела

Анотація:

In the wireless channel, cooperative communications allow one or many relays to assist the communication between the source and the destination. The aim of this thesis is the development of tools for the analysis of cooperative systems, when HARQ techniques are employed to provide cross-layer error protection. The first chapter of the thesis gives background information on network coding in cooperative relay networks, and introduces the motivation for this work. The second chapter is devoted to the analysis of the energetic-fair performance evaluations of FEC, ARQ-STBC and HARQ schemes at the MAC and IP layers. New analytical framework is derived and applied to a point-to-point network scenario. This framework allows to make energetic fair comparisons between the schemes with and without retransmissions. We determine under which channel conditions the cross-layer error protection is energetically more efficient than the simple channel coding. In the third chapter of this thesis we study the cooperative deterministic protocols. The protocols that we consider differ based on the behaviour of the relay(s), source(s), and destination. We consider two major types of cooperative protocols: decode-and forward (DCF), and demodulate-and-forward (DMF). Each of these protocols in its turn is analysed with and without combining mechanisms at the destination. We derive the soft decoders at the destination side for each respective case, and compare the performances of these protocols at the MAC layer. The following quality of service metrics are evaluated: frame error rate, delay, efficiency, goodput. The analysis is done evaluating the steady-state, using finite state Markov chains and a combinatorial approach. The analysis, however, becomes very complex as the number of transmissions and/or nodes in the network increases. The fourth chapter introduces a class of probabilistic communication protocols, where the devices retransmit with a given probability. We prove the existence of an equivalent class of protocols, with the same performances as the deterministic class. Using proofs of concept it is shown that the probabilistic protocol class allows for tractable steady-state analysis, even for many nodes in the network. Based on this, we then derive the QoS metrics and evalute them also by simulations. The derived performance evaluation metrics are then optimized by constraining the frame error rate, and trying to find the most optimal transmissions number and code rates which maximize the goodput. It is furthermore shown, that the equivalent protocol has larger optimal region than the deterministic one.

Стилі APA, Harvard, Vancouver, ISO та ін.

24

Mehmood, Faisal, and Muneeb Ejaz. "Performance Analysis of 3-hop using DAF and DF over 2-hop Relaying Protocols." Thesis, Blekinge Tekniska Högskola, Sektionen för ingenjörsvetenskap, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-4229.

Повний текст джерела

Анотація:

In wireless Communication, the need of radio spectrum increases nowadays. But in the system we are losing approximately 82-86% of spectrum most of the time due to the absence of Primary User (PU). To overcome this issue Cognitive Radio (CR) is an admirable approach. The concept of cooperative communication needs to be considering because high data rate is the demand for wireless services. Cooperative diversity in the network realized by 3-hop Decode, Amplify and Forward (DAF) and Decode and Forward (DF) and in 2-hop DF and Amplify and Forward (AF) Protocols implemented in cognitive radio communication network using Orthogonal Space Time Block Coding (OSTBC). The communication between end points is accomplished by using Multiple Input and Multiple Output (MIMO) antenna arrangement. During the Propagation, Alamouti Space Time Block Coding is used to accomplish spatial diversity and the encoded data is transmitted through Rayleigh fading channel. CR decodes the transmitted signal using Maximum Likelihood (ML) decoding method. Afterward signal broadcast toward the destination. To check the energy level of signal, energy detection technique applies at the Cognitive Controller (CC). Finally, CC will take ultimate decision for the presence of primary user if the energy level of signal is greater than predefined threshold level, it means PU is present otherwise it is absent. The main objective of this thesis is to analyze the performance of 3-hop and 2-hop communication network using relays. The performance is compared on the bases of two parameters i.e. Bit Error Rate (BER) and Probability of Detection (PD). The results are processed and validated by MATLAB simulation.

Стилі APA, Harvard, Vancouver, ISO та ін.

25

Sinclair, Peter James. "Forward dynamic modelling of cycling for people with spinal cord injury." University of Sydney. Exercise and Sport Science, 2001. http://hdl.handle.net/2123/512.

Повний текст джерела

Анотація:

A forward dynamic model was developed to predict the performance of Spinal Cord Injured (SCI) individuals cycling an isokinetic ergometer using Neuromuscular Electrical Stimulation (NMES) to elicit contractions of the quadriceps, hamstring and gluteal muscles. Computer simulations were performed using three inter-connected models: a kinematic model of segmental linkages, a muscle model predicting forces in response to stimulation, and a kinetic model predicting ergometer pedal forces resulting from muscle stimulation. Specific model parameters for SCI individuals were determined through measurements from isometric and isokinetic contractions of the quadriceps muscles elicited using surface stimulation. The muscle model was fitted to data resulting from these isolated experiments in order to tailor the model's parameters to characteristics of muscles from SCI individuals. Isometric data from a range of knee angles were used to fit tendon slack lengths to the rectus femoris and vastus muscles. Adjustments to the quadriceps moment arm function were not able to improve the match between measured and modelled knee extension torques beyond those using moment arms taken from available literature. Similarly, literature values for constants from the muscle force - velocity relationship provided a satisfactory fit to the decline in torque with angular velocity, and parameter fitting did not improve this fit. Passive visco-elastic resistance remained constant for all velocities of extension except the highest (240 deg/s). Since knee angular velocities this high were not experienced during cycling, a visco-elastic dampener was not included within the present cycling model. The rise and fall in torque following NMES onset and cessation were used to fit constants to match the rate of change in torque. Constants for the rise in torque following NMES onset were significantly altered by changes in knee angle, with more extended angles taking longer for torque to rise. This effect was small, however, within the range of angles used during cycling, and consequently was not included within the cycling model. The decline in torque after NMES cessation was not affected by knee angle. A period of five minutes cyclical isometric activity of the quadriceps resulted in torque declining by more than 75% from rested levels. The activation time constants were largely unaffected by this fatigue, however, with only a small increase in the time for torque to decline, and no change in rise time or the delay between stimulation changes and resulting torque changes. The cycling model, therefore, did not incorporate any effect for changes in activation timing with fatigue. Performance of the full model was evaluated through measurements taken from SCI individuals cycling a constant velocity ergometer using NMES elicited contractions of the quadriceps, hamstring and gluteal muscles. Pedal transducers measured forces applied to the pedals for comparison between measured and modelled values. A five minute period of continuous cycling using just the quadriceps muscles produced similar results to those found for isolated knee extension. External power output dropped by 50% over the five-minute period, however there was no change in the pattern of torque production with fatigue. Cycling experiments were conducted using single muscle groups across a range of NMES firing angles. Experimental protocols were designed to seek the firing angles for each muscle that maximised power output by that group. Changes in power output in response to firing angle changes were not large, however, in comparison to the effects of cumulative fatigue and inconsistent power output between trials. This lead to large uncertainties in the determination of those firing angles that maximised power output by each muscle. Results suggest that NMES firing angles to maximise power output by the quadriceps muscles were relatively similar for each subject. For the hamstring muscles, however, substantial differences were observed in the range of firing angles that maximised power output. Results for the gluteal muscles were variable, with some subjects not applying any measurable torque to the cranks, even with maximal stimulation applied. The model produced a good match to experimental data for the quadriceps muscles, both in the shape of pedal force curves and the firing angles that maximised external power output. The individual variability in hamstring responses was not, however, predicted by the model. Modification of the relative size of the hamstrings' moment arms about the hip and knee substantially improved the match between measured and modelled data. Analysis of results suggests that individual variability in the relative size of these moment arms is a major cause of variation in individual's response to hamstring stimulation. There were apparent limitations in the model's ability to predict the shape of crank torques resulting from stimulation of the gluteus maximus muscle. It is suggested that further research be conducted to enable modelling of this muscle using a range of fibre lengths and moment arms.

Стилі APA, Harvard, Vancouver, ISO та ін.

26

Kim, Hyun. "Lower Extremity Neuromechanics During a Forward-Side Jump Following Functional Fatigue in Patients with Ankle Instability." BYU ScholarsArchive, 2015. https://scholarsarchive.byu.edu/etd/5976.

Повний текст джерела

Анотація:

Ankle instability (AI) and fatigue impair neuromuscular control as well as dynamic joint stability of the lower extremity. No one has comprehensively examined the effects of AI and fatigue on neuromechanics of the lower extremity during a functional activity. Deficits associated with AI and fatigue could be additive in increasing the risk for injury in patients with AI. PURPOSE: To examine the interaction of AI and fatigue on lower extremity muscle activity, kinematic, and kinetic patterns during a forward-side jump. METHODS: 25 AI (23.3 ± 1.9 yrs, 176.5 ± 10.5 cm, 70.9 ± 11.4 kg), and 25 matched control subjects (23.7 ± 2.5 yrs, 175.0 ± 10.8 cm, 70.3 ± 12.8 kg) were categorized according to the Foot and Ankle Ability Measure (FAAM) (ADL: 84.3 ± 7.6%, Sport: 63.6 ± 8.6%) and the Modified Ankle Instability Instrument (MAII) (3.7 ± 1.2). Fifty-nine reflective markers were place over anatomical landmarks and eight electromyography (EMG) electrodes were placed on tibialis anterior (TA), peroneus longus (PL), medial gastrocmedius (MG), medial hamstring (MH), vastus lateralis (VL), adductor longus (AL), gluteus medius (GMed), and gluteus maximus (GMax) muscles in the involved leg. Subjects performed five forward-side jumps on a force plate before and after functional fatiguing exercises. To induce fatigue, subjects began 5-min incremental running on a treadmill between 5 and 6 mph. Next, subjects performed 20-second lateral counter movement jumps (CMJ), and 20 vertical CMJs. After each fatigue cycle, subjects performed one max vertical jump. Subjects repeated three exercises until Borg's rating of perceived exertion (RPE) reached 17 and the vertical jump height fell below 80% of their max jump height. Functional analysis of variance (FANOVA) (p < 0.05) was used to evaluate differences (a group by fatigue interaction) between two conditions (pre- vs post-fatigue) in each group (AI and control) for lower-extremity kinematic, kinetic and neuromuscular patterns. Pairwise comparison functions as well as 95% confidence interval (CI) bands were plotted to determine specific differences. If 95% CI bands did not cross the zero line, we considered the difference significant. RESULTS: Compared to the control group, the AI group demonstrated less range of dorsiflexion, knee and hip flexion motions during early phase of landing after fatigue. For sagittal-plane hip kinetics, subjects with AI decreased the hip extension moment while control subjects increased hip extension moments during landing following functional fatiguing exercise. The AI group showed less reduction of anterior-posterior ground reaction force (AP GRF) during transition phase of a forward-side jump after fatigue compared to control subjects. The AI group decreased EMG amplitude of PL, MH, and GMed while increased VL and GMax during landing after fatigue compared to control subjects. CONCLUSION: AI subjects demonstrated greater impairments in neuromechanical control patterns than a matched control group during a sport movement as fatigue progressed. Compared to AI group, control subjects showed a coordinated joint control strategy after fatigue, increasing joint angles from distal (ankle) to proximal (hip) joints by increasing hip extensor moments during landing from a forward-side jump in an attempt to reduce ground impact force. EMG alterations were consistent with patterns observed in injured patients, which may predispose patients to poor positions associated with lower extremity joint injury. These interactions between neuromuscular fatigue and AI may predispose individuals to lower extremity injuries.

Стилі APA, Harvard, Vancouver, ISO та ін.

27

Ben, Chikha Haithem. "Etude et Amélioration de Turbo-Codage Distribué pour les Réseaux Coopératifs." Thesis, Valenciennes, 2012. http://www.theses.fr/2012VALE0011/document.

Повний текст джерела

Анотація:

Dans les systèmes radio mobiles, la diversité représente une technique efficace pour lutter contre l’évanouissement dû aux multi-trajets. La pleine diversité spatiale est atteinte dans les systèmes multiple-input multiple-output (MIMO). Mais, souvent l’intégration d’antennes multiples au niveau de l’émetteur ou du récepteur est coûteuse. Comme alternative, dans les réseaux sans fil multi-hop, la diversité coopérative garantit des gains de diversité spatiale en exploitant les techniques MIMO traditionnelles sans avoir besoin d’antennes multiples. En outre, la diversité coopérative fournit au réseau : un débit important, une énergie réduite et une couverture d’accès améliorée.Dans ce contexte, l’objectif de cette thèse est de concevoir des schémas de codage pour le canal à relais afin de réaliser une meilleure performance en termes de gain de diversité et de gain de codage. D’abord, nous étudions un système de turbo-codage distribué à L-relais en mode soft-decode-and-forward. Ensuite, nous proposons un système de turbocodage coopératif distribué à L-relais en utilisant la concaténation en parallèle des codes convolutifs. Enfin, afin d’améliorer la fiabilité de détection au niveau du noeud relais, nous proposons la technique de sélection d’antenne/relayage-soft. Pour une modulation BPSK, nous dérivons des expressions de la borne supérieure de la probabilité d’erreurbinaire où les différents sous-canaux sont supposés à évanouissement de Rayleigh, indépendants et pleinement entrelacés avec une information instantanée d’état de canal idéal. Une validation des résultats théoriques est également menée par la simulation
Diversity provides an efficient method for combating multipath fading in mobile radio systems. One of the most common forms of spatial diversity is multiple-input multipleoutput (MIMO), where full diversity is obtained. However, embedding multiple antennas at the transmitter or the receiver can sometimes be expensive. As an alternative to collocated antennas, cooperative diversity in wireless multi-hop networks confirms their ability to achieve spatial diversity gains by exploiting the spatial diversity of the traditional MIMO techniques, without each node necessarily having multiple antennas. In addition, cooperative diversity has been shown to provide the network with importantthroughput, reduced energy requirements and improved access coverage.In light of this, the objective of this thesis is to devise coding schemes suitable for relay channels that aim at showing the best compromise between performance of diversity and coding gains. Firstly, we investigate a distributed turbo coding scheme dedicated to L-relay channels operating in the soft-decode-and-forward mode. Then, we present a proposed distributed turbo coded cooperative (DTCC) scheme, called parallel concatenated convolutional-based distributed coded cooperation. Finally, we investigate antenna/soft-relaying selection for DTCC networks in order to improve their end-to-end performance. Assuming BPSK transmission for fully interleaved channels with ideal channel state information, we define the explicit upper bounds for error probability inRayleigh fading channels with independent fading. Both theoretical limits and simulation results are presented to demonstrate the performances

Стилі APA, Harvard, Vancouver, ISO та ін.

28

Wu, Victor Kai Yuen. "OFDM-based cooperative communications in a single path relay network and a multiple path relay network." Thesis, Available online, Georgia Institute of Technology, 2006, 2006. http://etd.gatech.edu/theses/available/etd-11092006-152421/.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

29

Yu, Hyungseok. "Performance of cooperative relaying systems with co-channel interference." Diss., Georgia Institute of Technology, 2012. http://hdl.handle.net/1853/45744.

Повний текст джерела

Анотація:

The cooperative relaying scheme is a promising technique for increasing the capacity and reliability of wireless communication. Even though extensive research has performed in information theoretical aspect, there are still many unresolved practical problems of cooperative relaying system. This dissertation analyzes the performance of cooperative decode-and-forward (DF) relaying systems in the presence of multiple interferers and improve network throughput for these systems. We propose and summarize various systems in the view of network topology, transmission structure, and slot allocation. We present closed-form expressions for the end-to-end outage probability, average symbol-error-probability, average packet-error-probability, and network throughput of the proposed systems. This dissertation shows that the robustness of the destination against interference is more important than robustness of the relay against interference from an interference management perspective, and increasing the number of branches yields better outage and error performance improvements against shadowing than increasing the number of hops. In cellular networks, the cooperative diversity systems can outperform the dual-Rx antenna system, but only when the relay is located in a relatively small portion of the total cell area with respect the the destination mobile terminal. The results also show that since the effective regions of the uplink and the downlink do not overlap, different relays should be utilized for cell sectorization in the uplink and the downlink. Finally, the proposed variable-slot selection DF scheme can reduce the system complexity and make the maximum throughput point in the low and moderate signal-to-interference-plus-noise ratio region.

Стилі APA, Harvard, Vancouver, ISO та ін.

30

Ma, Bingkui. "Growth modification of the temporomandibular joint by functional appliances : a histomorphometric study using sheep." Title page, contents and summary only, 2002. http://web4.library.adelaide.edu.au/theses/09PH/09phm1112.pdf.

Повний текст джерела

Анотація:

Bibliography: leaves 234-245. In order to investigate growth modifications of the temporomandibular joint (TMJ) during dentofacial orthopaedic treatment, various functional appliances have been used to prompt the mandible into a protrusive position in various animal experimental models. The general purpose of this project was (i) to test the effectiveness of a functional appliance specially designed for sheep; (ii) to clarify whether or not forward mandibular displacement in sheep is associated with faster and/or redirected condylar growth; (iii) to evaluate the sheep as a model for dentofacial orthopaedic research by comparing the similarities of mandibular condylar growth in sheep and humans; (iv) to detail the position of the mandible during forward mandibular posturing and the effects of mandibular forward displacement on modelling and remodelling of the mandibular condyle.

Стилі APA, Harvard, Vancouver, ISO та ін.

31

Sohn, Mark Hongchul. "Assessing functional stability of predicted muscle activation patterns for postural control using a neuromechanical model of the cat hindlimb." Thesis, Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/42869.

Повний текст джерела

Анотація:

The underlying principles of how the nervous system selects specific muscle activation pattern, among many that produce the same movement, remain unknown. Experimental studies suggest that the nervous system may use fixed groups of muscles, referred to as muscle synergies, to produce functional motor outputs relevant to the task. In contrast, predictions from biomechanical models suggest that minimizing muscular effort may be the criteria how a muscle coordination pattern is organized for muscle synergies. However, both experimental and modeling evidence shows that stability, as well as energetic efficiency, also needs to be considered. Based on the hypothesis that the nervous system uses functionally stable muscle activation pattern for a muscle synergy, we investigated the stability of muscle patterns using a neuromechanical model of the cat hindlimb. Five unique muscle patterns that generate each of the five experimentally-identified muscle synergy force vectors at the endpoint were found using a minimum-effort criterion. We subjected the model to various perturbed conditions and evaluated functional stability of each of the five minimum-effort muscle synergies using a set of empirical criteria derived from experimental observations. Results show that minimum-effort muscle synergies can be functionally stable or unstable, suggesting that minimum-effort criterion is not always sufficient to predict physiologically relevant postural muscle synergies. Also, linearized system characteristics can robustly predict the behavior exhibited by fully dynamic and nonlinear biomechanical simulations. We conclude that functional stability, which assesses stability of a biomechanical system in a physiological context, must be considered when choosing a muscle activation pattern for a given motor task.

Стилі APA, Harvard, Vancouver, ISO та ін.

32

Hatefi, Atoosa. "Distributed Coding for Wireless Cooperative Networks." Thesis, Supélec, 2012. http://www.theses.fr/2012SUPL0015/document.

Повний текст джерела

Анотація:

Cette thèse est consacrée à l'étude théorique et à la conception pratique de schémas de codage conjoint réseau/canal adaptés à différents scénarii de communications dans les réseaux sans fil. Contrairement aux hypothèses conventionnelles retenues dans la littérature (accès multiple orthogonal, absence d'erreurs sur certains liens), les caractéristiques de diffusion et de superposition des signaux propres au canal radio et la présence d'évanouissements lents et de bruit sur tous les liens sont prises en compte dans la formulation du problème et exploitées. Différentes stratégies de coopération au niveau du ou des relais sont examinées et comparées. Le point commun entre toutes ces stratégies est que le système doit fonctionner même en absence de coopération. Seuls le ou les relais et la destination sont informés d'une coopération. Ni les sources, ni le ou les relais ne connaissent l'état du canal à l'émission. Le premier volet de la thèse porte sur le canal à accès multiple avec relais unique (slow fading MARC). Le problème du codage et décodage conjoint canal/réseau (JNCC/JNCD) est étudié sur un plan théorique et pratique. Différentes hypothèses au niveau de l'accès multiple (semi-orthogonal et non-orthogonal) et différents modes de fonctionnement du relais (half-duplex et full-duplex) sont envisagés. Une nouvelle stratégie de coopération adaptative (SDF pour selective decode and forward) est définie dans laquelle le relais calcule et retransmet une fonction déterministe des messages de sources qu'il a pu décoder sans erreur. Le ré-encodage, défini sur un corps fini (corps binaire), est également conçu de manière à assurer que la performance finale au niveau de la destination atteint bien un ordre de diversité 2. Le modèle de canal MARC est par la suite étendu à plusieurs relais (slow fading MAMRC). Une analyse théorique est conduite et des nouveaux schémas JNCC/JNCD permettant de s'approcher des limites théoriques sont décrits. Afin d'assurer la diversité pleine, nous proposons de combiner un codage canal binaire et un codage réseau non-binaire. Pour les deux types de canaux, nous montrons que l'interférence naturellement induite par la diffusion des signaux dans un environnement sans fil, n'est pas un inconvénient mais bien un avantage dès lors qu'on est en mesure de la traiter via des techniques de codage et de décodage sophistiquées (turbo codes et leur décodage, turbo détection). Les gains en termes de capacité (rapportée à une certaine probabilité de coupure) obtenus avec un accès multiple semi-orthogonal ou non-orthogonal sont substantiels comparés à un accès multiple orthogonal (référence). Dans la dernière partie de la thèse, la stratégie de coopération SDF est comparée à deux autres stratégies de coopération s'appuyant sur un procédé de décodage-et-retransmission "souple" (sans prise de décisions intermédiaires) : l'une basée sur les rapports logarithmiques de probabilité a posteriori sur les bits codés et l'autre basée sur l'estimation de l'erreur quadratique moyenne (MSE). Nous vérifions que la stratégie de coopération SDF fonctionne bien dans la plupart des configurations, les stratégies de coopération souples n'améliorant légèrement les performances que dans certains cas extrêmes
With the rapid growth of wireless technologies, devices and mobile applications, the quest of high throughput and ubiquitous connectivity in wireless communications increases rapidly as well. Relaying is undoubtedly a key concept to provide coverage extension and capacity increase in wireless networks. Network coding, which allows the intermediate nodes to share their computation capabilities in addition to their resource and their power, has grabbed a significant research attention since its inception in information theory. It has become an attractive candidate to bring promising performance improvement, especially in terms of throughput, in relay-based cellular networks. Substantial research efforts are currently focused on theoretical analysis, implementation and evaluation of network coding from a physical layer perspective. The question is, what is the most efficient and practical way to use network coding in wireless relay-based networks, and whether it is beneficial to exploit the broadcast and multiple-access properties of the wireless medium to perform network coding. It is in such a context, that this thesis proceeds. In the first part of the thesis, the problem of Joint Network-Channel Coding (JNCC) for a Multiple Access Relay Channel (MARC) is investigated in the presence of multiple access interferences and for both of the relay operating modes, namely, half-duplex and full-duplex. To this end, three new classes of MARC, referred to as Half-Duplex Semi-Orthogonal MARC (HD-SOMARC), Half-Duplex Non-Orthogonal MARC (HD-NOMARC), and Full-Duplex Non-Orthogonal MARC (FD-NOMARC) have been introduced and studied. The relaying function in all of the classes is based on a Selective Decode-and-Forward (SDF) strategy, which is individually implemented for each source, i.e, the relay forwards only a deterministic function of the error-free decoded messages. For each class, an information-theoretic analysis is conducted, and practical coding and decoding techniques are proposed. The proposed coding schemes, perform very close to the outage limit for both cases of HD-SOMARC and HD-NOMARC. Besides, in the case of HD-NOMARC, the optimal allocation of the transmission time to the relay is considered. It is also verified that exploiting multiple access interferences, either partially or totally, results in considerable gains for MARC compared to the existing interference-avoiding structures, even in the case of single receive antenna. In the second part of the thesis, the network model is extended by considering multiple relays which help multiple sources to communicate with a destination. A new class of Multiple Access Multiple Relay Channel (MAMRC), referred to as Half-Duplex Semi-Orthogonal MAMRC (HD-SOMAMRC) is then proposed and analyzed from both information theoretic and code design perspective. New practical JNCC schemes are proposed, in which binary channel coding and non binary network coding are combined, and they are shown to perform very close to the outage limit. Moreover, the optimal allocation of the transmission time to the sources and relays is considered. Finally, in the third part of the thesis, different ways of implementing cooperation, including practical relaying protocols are investigated for the half-duplex MARC with semi-orthogonal transmission protocol and in the case of JNCC. The hard SDF approach is compared with two Soft Decode and Forward (SoDF) relaying functions: one based on log a posterior probability ratios (LAPPRs) and the other based on Mean Square Error (MSE) estimate. It is then shown that SDF works well in most of the configurations and just in some extreme cases, soft relaying functions (based on LAPPR or MSE estimate) can slightly outperform the hard selective one

Стилі APA, Harvard, Vancouver, ISO та ін.

33

Schwartz, Yannick. "Large-scale functional MRI analysis to accumulate knowledge on brain functions." Thesis, Paris 11, 2015. http://www.theses.fr/2015PA112056/document.

Повний текст джерела

Анотація:

Comment peut-on accumuler de la connaissance sur les fonctions cérébrales ? Comment peut-on bénéficier d'années de recherche en IRM fonctionnelle (IRMf) pour analyser des processus cognitifs plus fins et construire un modèle exhaustif du cerveau ? Les chercheurs se basent habituellement sur des études individuelles pour identifier des régions cérébrales recrutées par les processus cognitifs. La comparaison avec l'historique du domaine se fait généralement manuellement pas le biais de la littérature, qui permet de définir des régions d'intérêt dans le cerveau. Les méta-analyses permettent de définir des méthodes plus formelles et automatisables pour analyser la littérature. Cette thèse examine trois manières d'accumuler et d'organiser les connaissances sur le fonctionnement du cerveau en utilisant des cartes d'activation cérébrales d'un grand nombre d'études. Premièrement, nous présentons une approche qui utilise conjointement deux expériences d'IRMf similaires pour mieux conditionner une analyse statistique. Nous montrons que cette méthode est une alternative intéressante par rapport aux analyses qui utilisent des régions d'intérêts, mais demande cependant un travail manuel dans la sélection des études qui l'empêche de monter à l'échelle. A cause de la difficulté à sélectionner automatiquement les études, notre deuxième contribution se focalise sur l'analyse d'une unique étude présentant un grand nombre de conditions expérimentales. Cette méthode estime des réseaux fonctionnels (ensemble de régions cérébrales) et les associe à des profils fonctionnels (ensemble pondéré de descripteurs cognitifs). Les limitations de cette approche viennent du fait que nous n'utilisons qu'une seule étude, et qu'elle se base sur un modèle non supervisé qui est par conséquent plus difficile à valider. Ce travail nous a cependant apporté la notion de labels cognitifs, qui est centrale pour notre dernière contribution. Cette dernière contribution présente une méthode qui a pour objectif d'apprendre des atlas fonctionnels en combinant plusieurs jeux de données. [Henson2006] montre qu'une inférence directe, c.a.d. la probabilité d'une activation étant donné un processus cognitif, n'est souvent pas suffisante pour conclure sur l'engagement de régions cérébrales pour le processus cognitif en question. Réciproquement, [Poldrack 2006] présente l'inférence inverse qui est la probabilité qu'un processus cognitif soit impliqué étant donné qu'une région cérébrale est activée, et décrit le risque de raisonnements fallacieux qui peuvent en découler. Pour éviter ces problèmes, il ne faut utiliser l'inférence inverse que dans un contexte où l'on suffisamment bien échantillonné l'espace cognitif pour pouvoir faire une inférence pertinente. Nous présentons une méthode qui utilise un « meta-design » pour décrire des tâches cognitives avec un vocabulaire commun, et qui combine les inférences directe et inverse pour mettre en évidence des réseaux fonctionnels qui sont cohérents à travers les études. Nous utilisons un modèle prédictif pour l'inférence inverse, et effectuons les prédictions sur de nouvelles études pour s'assurer que la méthode n'apprend pas certaines idiosyncrasies des données d'entrées. Cette dernière contribution nous a permis d'apprendre des réseaux fonctionnels, et de les associer avec des concepts cognitifs. Nous avons exploré différentes approches pour analyser conjointement des études d'IRMf. L'une des difficultés principales était de trouver un cadre commun qui permette d'analyser ensemble ces études malgré leur diversité. Ce cadre s'est instancié sous la forme d'un vocabulaire commun pour décrire les tâches d'IRMf. et a permis d'établir un modèle statistique du cerveau à grande échelle et d'accumuler des connaissances à travers des études d'IRM fonctionnelle
How can we accumulate knowledge on brain functions? How can we leverage years of research in functional MRI to analyse finer-grained psychological constructs, and build a comprehensive model of the brain? Researchers usually rely on single studies to delineate brain regions recruited by mental processes. They relate their findings to previous works in an informal way by defining regions of interest from the literature. Meta-analysis approaches provide a more principled way to build upon the literature. This thesis investigates three ways to assemble knowledge using activation maps from a large amount of studies. First, we present an approach that uses jointly two similar fMRI experiments, to better condition an analysis from a statistical standpoint. We show that it is a valuable data-driven alternative to traditional regions of interest analyses, but fails to provide a systematic way to relate studies, and thus does not permit to integrate knowledge on a large scale. Because of the difficulty to associate multiple studies, we resort to using a single dataset sampling a large number of stimuli for our second contribution. This method estimates functional networks associated with functional profiles, where the functional networks are interacting brain regions and the functional profiles are a weighted set of cognitive descriptors. This work successfully yields known brain networks and automatically associates meaningful descriptions. Its limitations lie in the unsupervised nature of this method, which is more difficult to validate, and the use of a single dataset. It however brings the notion of cognitive labels, which is central to our last contribution. Our last contribution presents a method that learns functional atlases by combining several datasets. [Henson 2006] shows that forward inference, i.e. the probability of an activation given a cognitive process, is often not sufficient to conclude on the engagement of brain regions for a cognitive process. Conversely, [Poldrack 2006] describes reverse inference as the probability of a cognitive process given an activation, but warns of a logical fallacy in concluding on such inference from evoked activity. Avoiding this issue requires to perform reverse inference with a large coverage of the cognitive space. We present a framework that uses a "meta-design" to describe many different tasks with a common vocabulary, and use forward and reverse inference in conjunction to outline functional networks that are consistently represented across the studies. We use a predictive model for reverse inference, and perform prediction on unseen studies to guarantee that we do not learn studies' idiosyncrasies. This final contribution permits to learn functional atlases, i.e. functional networks associated with a cognitive concept. We explored different possibilities to jointly analyse multiple fMRI experiments. We have found that one of the main challenges is to be able to relate the experiments with one another. As a solution, we propose a common vocabulary to describe the tasks. [Henson 2006] advocates the use of forward and reverse inference in conjunction to associate cognitive functions to brain regions, which is only possible in the context of a large scale analysis to overcome the limitations of reverse inference. This framing of the problem therefore makes it possible to establish a large statistical model of the brain, and accumulate knowledge across functional neuroimaging studies

Стилі APA, Harvard, Vancouver, ISO та ін.

34

Ben, chikha Haithem. "Etude et Amélioration de Turbo-Codage Distribué pour les Réseaux Coopératifs." Phd thesis, Université de Valenciennes et du Hainaut-Cambresis, 2012. http://tel.archives-ouvertes.fr/tel-00739684.

Повний текст джерела

Анотація:

Dans les systèmes radio mobiles, la diversité représente une technique efficace pour lutter contre l'évanouissement dû aux multi-trajets. La pleine diversité spatiale est atteinte dans les systèmes multiple-input multiple-output (MIMO). Mais, souvent l'intégration d'antennes multiples au niveau de l'émetteur ou du récepteur est coûteuse. Comme alternative, dans les réseaux sans fil multi-hop, la diversité coopérative garantit des gains de diversité spatiale en exploitant les techniques MIMO traditionnelles sans avoir besoin d'antennes multiples. En outre, la diversité coopérative fournit au réseau : un débit important, une énergie réduite et une couverture d'accès améliorée.Dans ce contexte, l'objectif de cette thèse est de concevoir des schémas de codage pour le canal à relais afin de réaliser une meilleure performance en termes de gain de diversité et de gain de codage. D'abord, nous étudions un système de turbo-codage distribué à L-relais en mode soft-decode-and-forward. Ensuite, nous proposons un système de turbocodage coopératif distribué à L-relais en utilisant la concaténation en parallèle des codes convolutifs. Enfin, afin d'améliorer la fiabilité de détection au niveau du noeud relais, nous proposons la technique de sélection d'antenne/relayage-soft. Pour une modulation BPSK, nous dérivons des expressions de la borne supérieure de la probabilité d'erreurbinaire où les différents sous-canaux sont supposés à évanouissement de Rayleigh, indépendants et pleinement entrelacés avec une information instantanée d'état de canal idéal. Une validation des résultats théoriques est également menée par la simulation.

Стилі APA, Harvard, Vancouver, ISO та ін.

35

Azarian, Yazdi Kambiz. "Outage limited cooperative channels protocols and analysis /." Columbus, Ohio : Ohio State University, 2006. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1154740723.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

36

Demarco, Raffaella Michaela. "Optimal model points in term life insurance." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2019. http://amslaurea.unibo.it/18236/.

Повний текст джерела

Анотація:

This thesis is focused on the problem of seeking an optimal set of the model points selection when dealing with a portfolio of term insurance policies and a LIBOR Market Model that determines the dynamics of the forward rates. Specifically, the study is associated to the problem of minimizing a specific risk functional which measures the average discrepancy between two portfolios: the given portfolio of policies and the model points, a small group of representative contracts which substitute the first one, without misrepresenting its inherent risk structure. This optimization process is aimed to reducing the computation difficulties of the valuation of the performance of any portfolios of policies, projections to be made daily by life insurance companies. In particular, in the present thesis, after a brief reference to some basic concepts in the interest rate field, there are described the LIBOR Market Model and the risk functional in a Banach space. The portfolio representation problem is also examined, because it allows to define the dynamics of those portfolios within a certain class that best represents the inherent risk structure of a given financial exposure. Finally, it is analyzed the particular case of the term life insurance.

Стилі APA, Harvard, Vancouver, ISO та ін.

37

Lu, P. S. (Pen-Shun). "Decoding and lossy forwarding based multiple access relaying." Doctoral thesis, Oulun yliopisto, 2015. http://urn.fi/urn:isbn:9789526207742.

Повний текст джерела

Анотація:

Abstract The goal of this thesis is to provide a unified concept of lossy-forwarding from the theoretical analysis to practical scheme design for the decode-and-forward-based multiple access relay channel (MARC) system. To improve the performance of MARC with the relay subject to resources or/and time constraints, the erroneous estimates output from simple detection schemes are used at the relay are forwarded and exploited. A correlation is then found between two sequences: one is the network-coded sequence sent from the relay, and the other is their corresponding exclusive-OR-ed information sequence. Several joint network-channel coding (JNCC) techniques are provided in which the correlation is utilized to update the log-likelihood ratio sequences during the iterative decoding process at the destination. As a result, the bit error rate (BER) and frame error rate (FER) are improved compared with those of MARC with select DF strategy (SDF-MARC). The MARC proposed above is referred to as erroneous estimates-exploiting MARC (e-MARC). To investigate the achieved FER performance of the e-MARC system, the outage probability for e-MARC with two source nodes is theoretically derived. We re-formulate the e-MARC system and identify its admissible rate region according to the Slepian-Wolf theorem with a helper. Then, the outage probability is obtained by a set of integral over the rate region with respect to the probability density functions of all the links' instantaneous signal-to-noise power ratios. It is found through simulations that, as one of the source nodes is far away from both the relay and destination, e-MARC is superior to SDF-MARC in terms of outage performance. Furthermore, a joint adaptive network-channel coding (JANCC) technique is then proposed to support e-MARC with more source nodes. A vector is constructed at the destination in JANCC to identify the indices of the incorrectly decoded source node(s), and re-transmitted to the relay for requesting additional redundancy. The relay performs network-coding only over the estimates specified by the vector upon receiving the request. Numerical results show that JANCC-aided e-MARC is superior to e-MARC in terms of FER and goodput efficiency. In addition, compared iterative decoding is performed at relay with SDF-MARC, the use of differential detection with JANCC-aided e-MARC significantly reduces the computational complexity and latency with only a small loss in the FER
Tiivistelmä Tämän väitöskirjan tarkoituksena on tuottaa yhtenäinen kokonaisuus häviöllisestä lähetyksestä pura-ja-lähetä (DF) -pohjaisessa monikäyttörelejärjestelmässä (MARC) sekä teoreettisesta että käytännöllisestä näkökulmasta. Parantaakseen resurssi- tai aikarajoitetun MARC-järjestelmän suorituskykyä, vastaanotin hyödyntää riippuvuussuhdetta releen välittämien informaatiosekvenssien virheellisten estimaattien ja suoraan lähteestä tulevien informaatiosekvenssien välillä (e-MARC). Työssä ehdotetaan useita yhdistetyn verkko -ja kanavakoodauksen menetelmiä (JNCC), joissa log-uskottavuussuhdesekvenssit iteratiivisen purkamisprosessin aikana päivitetään hyödyntämällä sekvenssien riippuvuussuhdetta vastaanottimessa. Tämän tuloksena sekä bittivirhe- että kehysvirhesuhdetta saadaan parannettua verrattuna selektiiviseen pura-ja-lähetä menetelmää käyttävään MARC-strategiaan (SDF-MARC). Kehysvirheen suorituskyvyn tarkastelua varten työssä johdetaan teoreettinen epäkäytettävyyden todennäköisyys e-MARC-menetelmälle kahden lähettimen tapauksessa. Lisäksi e-MARC-menetelmälle määritetään tiedonsiirtonopeusalue Slepian-Wolf -teoreeman mukaisesti. Tämän jälkeen saadaan epäkäytettävyyden todennäköisyys kaikkien linkkien signaalikohinasuhteen todennäköisyystiheysfunktion integraalina tiedonsiirtonopeusalueen yli. Simulointitulokset osoittavat e-MARC-menetelmän paremman epäkäytettävyyden todennäköisyyden verrattuna SDF-MARC-menetelmään silloin kun yksi lähettimistä on kaukana sekä releestä että vastaanottimesta. Mahdollistaakseen useamman lähteen käytön e-MARC-menetelmässä, työssä ehdotetaan lisäksi adaptiivinen yhdistetyn verkko-ja kanavakoodauksen menetelmä (JANCC). Siinä vastaanotin määrittää väärin purettujen sekvenssien lähettimet ja ilmoittaa ne vektorimuodossa takaisin releelle pyytääkseen näiden lähettimien informaation uudelleenlähetystä. Tämän jälkeen rele suorittaa verkkokoodauksen vain tunnistusvektorin määrittämien informaatiosekvenssien estimaatteihin perustuen. Tulokset näyttävät, että JANCC-menetelmää käyttävä e-MARC saavuttaa paremman kehysvirheen ja hyödyllisen läpäisyn tehokkuuden verrattuna e-MARC-menetelmään

Стилі APA, Harvard, Vancouver, ISO та ін.

38

Eleblu, John Saviour Yaw. "Functional charaterization of CmWIP1 gene in the sex determination pathway of Cucumis melo using Arabidopsis thaliana as a model system." Thesis, Paris 11, 2013. http://www.theses.fr/2013PA112065.

Повний текст джерела

Анотація:

Les gènes des doigts WIP-zinc provenaient de l'établissement de l'évolution rapide du clade Viridiplantae de bryophytes et ptéridophytes. Depuis les bryophytes ancestrales des premières plantes terrestres deux clades principaux ont evolveld, basé sur notre analyse cladistique de la partie C-terminale des WIP. Le thème commun et le caractère démontré par les protéines à doigts de zinc AtWIP sont mis en évidence par leurs découvertes dans des rôles régulateurs de croissance et de développement orgue. Cependant, la protéine moléculaire interagissant partenaires et les mécanismes par lesquels les fonctions de WIP sont orchestrés restent encore inconnues. Ici, nous montrons les interactions entre protéines moléculaires et des modes de localisation sub-cellulaire de CmWIP1 et ses interacteurs pour élucider son rôle de régulateur dans le sexe détermination Cucumis melo fleurs. Sur la base des interactions levures deux écran hybride de protéine-protéine de la banque d'ADNc de melon généré, nous déclarons que la protéine interagit physiquement CmWIP1 très fortement avec CmbZIP et CmLHP1. Aussi interaction n'a été observée avec le complexe CKII en C. melo qui se compose de CmCKIIα, CmCKIIβ1 et CmCKIIβ2 sous-unités. Approches de génétique inverse ont été utilisées pour tenter de valider fonctionnellement les interacteurs clés in planta. Le passage d'homme à fleurs femelles en traits gynoïques résultats de répression épigénétique de l'expression d'un facteur de doigt de zinc de type de transcription, CmWIP1 situé au niveau des loci g dans Cucumis melo. Lorsqu'elle est exprimée, CmWIP1 est responsable de l'avortement carpien entraînant simples fleurs mâles sexués d'une origine bisexuel initial. La surexpression de CmWIP1 (sous promoteur 35SCaMV) chez Arabidopsis thaliana a donné lieu à des plantes présentant un retard de croissance global du-et-dessus des parties sous-sol plantes, feuilles dentelées vrais, des anomalies de croissance floraux et sillique ainsi que médiocre rendement des semences. 35S: CmWIP1 lignées d'insertion développés ont été surveillés en permanence et phénotypées sur T1 à T4 générations pour la stabilité de la dentelure phénotype feuilles. Fait intéressant, deux autres lignes sur-expression portant AtWIP1 et AtWIP2 causés dentelures des feuilles semblables à celles de CmWIP1 surexpression tout sous promoteurs 35SCaMV. Deux lignées stables homozygote pour 35S: CmWIP1 insertion ont été sélectionnés à la génération T4 et muté à 0,3% EMS. Un millier de vracs lignées familiales m2 (5 plants par vrac) ont été examinés pour les personnes réversion avec des feuilles non dentelée et taux de croissance restaurés. Écrans stade végétatif révélé deux révertants putatifs et 7% albinos. Les écrans suivants pour révertants ont été réalisées à des stades de reproduction et également pour les essais de la longueur des racines primaires ont été réalisées afin de valider révertants putatifs. Révertants putatifs familles ont encore été validés en tant que candidats pour la cartographie suppresseur par séquençage Sanger de la 35S :: CmWIP1 insertion par le dépistage de la séquence des mutations qui pourraient être la mutation causale
The WIP-zinc finger genes originated from the early evolutionary establishment of the Viridiplantae clade from bryophytes and pteridophytes. From the ancestral bryophytes the first terrestrial plants two main clades have evolveld, based on our cladistic analysis of the C-terminal part of the WIPs. From the in silico analysis, CmWIP1 encodes are largely bi-partite protein in nature with the N-terminal acquired for protein-protein interactions whilst the C-terminal part is possibly mainly for DNA binding and some unknown processes involved in chromatin modulation/regulation (the presence of POST-SET domains). The common theme and character demonstrated by the AtWIP-Zinc finger proteins are highlighted by their discoveries in regulatory roles of organ growth and development. However, the molecular protein interacting partners and mechanisms by which the WIP functions are orchestrated still remain unknown. Here we show molecular protein interactions and sub-cellular localization patterns of CmWIP1 and its interactors to elucidate its regulatory role in the sex determination Cucumis melo flowers. Based on the protein-protein interactions yeast two hybrid screen of the melon cDNA library generated, we report that CmWIP1 protein physically interacts very strongly with CmbZIP and CmLHP1. Also interactions were observed with the CKII complex in C. melo which is made up of CmCKIIα, CmCKIIβ1 and CmCKIIβ2 subunits. CmWIP1 also interacts with CmTHF1 and CmPTR. Reverse genetic approaches were utilized in attempts to functionally validate the key interactors in planta. The transition from male to female flowers in gynoecious lines results from epigenetic repression of the expression of a zinc finger type transcription factor, CmWIP1 located at the g loci in Cucumis melo. When expressed, CmWIP1 is responsible for carpel abortion resulting in single sexed male flowers from an initial bisexual origin. Over-expression of CmWIP1 (under 35SCaMV promoter) in Arabidopsis thaliana resulted in plants with overall growth retardation of above- and under-ground plant parts, serrated true leaves, floral and sillique growth abnormalities as well as poor seed yield. 35S:CmWIP1 insertion lines developed were continuously monitored and phenotyped over T1 to T4 generations for stability of the leaf serration phenotype. Interestingly, two other over-expression lines carrying AtWIP1 and AtWIP2 caused leaf serrations similar to that of CmWIP1 overexpression all under 35SCaMV promoters. Two stable lines homozygote for 35S:CmWIP1 insertion were selected at the T4 generation and mutagenized with 0.3 % EMS. A thousand bulks of M2 family lines (5 plants per bulk) were screened for revertant individuals with unserrated leaves and restored growth rates. Vegetative stage screens revealed both putative revertants and 7 % albinos. Subsequent screens for revertants were carried out at the reproductive stages and also for primary root length assays were carried out to validate putative revertants. Putative revertants families were further validated as candidates for suppressor mapping via Sanger sequencing of the 35S::CmWIP1 insert by screening of the sequence for mutations which could be the causative mutation

Стилі APA, Harvard, Vancouver, ISO та ін.

39

Smirani, Sinda. "Étude du codage réseau au niveau de la couche physique pour les canaux bidirectionnels à relais." Phd thesis, Université Paris Sud - Paris XI, 2014. http://tel.archives-ouvertes.fr/tel-00962333.

Повний текст джерела

Анотація:

Le codage réseau est apparu comme une technique alternative au routage au niveau de la couche réseau permettant d'améliorer le débit et d'optimiser l'utilisation de la capacité du réseau. Récemment, le codage réseau a été appliqué au niveau de la couche physique des réseaux sans-fil pour profiter de la superposition naturelle des signaux effectuée par le lien radio. Le codage réseau peut être vue comme un traitement interne du réseau pour lequel différentes techniques de relayage peuvent être utilisées. Cette thèse étudie un ensemble de traitements ayant des compromis variés en terme de performance et complexité. Nous considérons le canal bidirectionnel à relais, un modèle de canal de communication typique dans les réseaux coopératifs, où deux terminaux s'échangent mutuellement des messages par l'intermédiaire d'un relais. La communication se déroule en deux phases, une phase à accès multiple et une phase de broadcast. Pour ce scénario, nous analysons, dans une première partie, une stratégie de "decode-and-forward". Nous considérons, pour cette étude, des alphabets de taille finie et nous calculons les probabilités moyennes d'erreur de bout-en-bout en se basant sur la métrique d'exposant d'erreur du codage aléatoire. Puis, nous dérivons les régions des débits atteignables par rapport à une probabilité d'erreur maximale tolérable au niveau de chaque nœud. Dans une deuxième partie de la thèse, nous proposons deux schémas de codage réseau pratiques, avec complexité réduite, qui se basent sur la stratégie de relayage "compress-and-forward" (CF). Le premier schéma utilise un codage en réseau de points imbriqués (nested lattices). Le deuxième schéma est une version améliorée qui permet d'atteindre des débits de données supérieurs pour l'utilisateur qui a les meilleures conditions canal. Nous construisons les régions des débits atteignables par les deux schémas proposés tout en optimisant la répartition du temps alloué à chacune des deux phases de transmission. Après l'étude du régime asymptotique, nous analysons le schéma de codage CF avec des réseaux de points de dimension finie. Nous nous concentrons sur le problème de la transmission analogique où la distorsion est optimisée. Enfin, nous étudions l'application d'un schéma de codage, basé sur la stratégie CF avec des réseaux de points imbriqués, pour le canal bidirectionnel à canaux parallèles. Ainsi, nous présentons deux régions de débits atteignables selon la technique de traitement, conjoint ou séparé, des sous-canaux par le relais.

Стилі APA, Harvard, Vancouver, ISO та ін.

40

Islam, Shama Naz. "Multi-way relay networks: characterization, performance analysis and transmission scheme design." Phd thesis, 2015. http://hdl.handle.net/1885/13648.

Повний текст джерела

Анотація:

Multi-way relay networks (MWRNs) are a growing research area in the field of relay based wireless networks. Such networks provide a pathway for solving the ever in- creasing demand for higher data rate and spectral efficiency in a general multi-user scenario. MWRNs have potential applications in video conferencing, file sharing in a social network, as well as satellite networks and sensor networks. Recent research on MWRNs focuses on efficient transmission protocol design by harnessing different network coding schemes, higher dimensional structured codes and advanced relaying protocols. However, the existing research misses out the characterization and analysis of practical issues that influence the performance of MWRNs. Moreover, the existing transmission schemes suffer some significant limitations, that need to be solved for maximizing the benefits of MWRNs. In this thesis, we investigate the practical issues that critically influence the perfor- mance of a MWRN and propose solutions that can outperform existing schemes. To be specific, we characterize error propagation phenomenon for additive white Gaus- sian noise (AWGN) and fading channels with functional decode and forward (FDF) and amplify and forward (AF) relaying protocols, propose a new pairing scheme that out- performs the existing schemes for lattice coded FDF MWRNs in terms of the achievable rate and error performance and finally, analyze the impact of imperfect channel state information (CSI) and optimum power allocation on MWRNs. At first, we analyze the error performance of FDF and AF MWRNs with pair- wise transmission using binary phase shift keying (BPSK) modulation in AWGN and Rayleigh fading channels. We quantify the possible error events in an L-user FDF or AF MWRN and derive accurate asymptotic bounds on the probability for the general case that a user incorrectly decodes the messages of exactly k (k ∈ [1, L − 1]) other users. We show that at high signal-to-noise ratio (SNR), the higher order error events (k ≥ 3) are less probable in AF MWRN, but all error events are equally probable in a FDF MWRN. We derive the average BER of a user in a FDF or AF MWRN under high SNR conditions and provide simulation results to verify them. Next, we propose a novel user pairing scheme for lattice coded FDF MWRNs. Lattice codes can achieve the capacity of AWGN channels and are used in digital communica- tions as high-rate signal constellations. Our proposed pairing scheme selects a common user with the best average channel gain and thus, allows it to positively contribute to the overall system performance. Assuming lattice code based transmissions, we derive upper bounds on the average common rate and the average sum rate with the proposed pairing scheme. In addition, considering M-ary QAM with square constellation as a special case of lattice codes, we derive asymptotic average symbol error rate (SER) of the MWRN. We show that in terms of the achievable rates and error performance, the proposed pairing scheme outperforms the existing pairing schemes under a wide range of channel scenarios. Finally, we investigate lattice coded FDF and AF MWRNs with imperfect CSI. Con- sidering lattice codes of sufficiently large dimension, we obtain the bounds on the com- mon rate and sum rate. In addition, considering M-ary quadrature amplitude mod- ulation (QAM) with square constellations, we obtain expressions for the average SER in FDF MWRNs. For AF MWRNs, considering BPSK modulation as the simplest case of lattice codes, we obtain the average BER. Moreover, we obtain the optimum power allocation coefficients to maximize the sum rate in AF MWRN. For both FDF and AF relaying protocols, the average common rate and sum rate are decreasing functions of the estimation error. The analysis shows that the error performance of a FDF MWRN is an increasing function of both the channel estimation error and the number of users, whereas, for AF MWRN, the error performance is an increasing function of only the channel estimation error. Also, we show that to achieve the same sum rate in AF MWRN, optimum power allocation requires 7 − 9 dB less power compared to equal power allocation depending upon users’ channel conditions.

Стилі APA, Harvard, Vancouver, ISO та ін.

41

Chen, Yu-Neng, and 陳玉能. "Dynamic Decode and Forward with Network Coding." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/53072526891916529225.

Повний текст джерела

Анотація:

碩士
國立中正大學
通訊工程研究所
99
This paper is divided into two parts. In the first part, we analyze outage probability of dynamic-decode-and-forward (DDF) with network coding (NC) and compare outage probability with using NC and without using NC. In the second part, we use C/C++ programming language to simulate our system model. We simulate outage probability and compare this simulation result with numerical value of outage probability in the first part to prove the correctness. Our results show that network coding cannot improve outage probability of considered system model.

Стилі APA, Harvard, Vancouver, ISO та ін.

42

Chao, Mu-lan, and 趙慕嵐. "Enhanced Static Decode and Forward With Network Coding." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/67149854737126503254.

Повний текст джерела

Анотація:

碩士
國立中正大學
通訊工程研究所
99
This paper is about enhanced static decode and forward with network coding protocol. In this system, there is one sources, two relays and one destination. Our research includes outage probability and diversity-multiplexing tradeoff analysis. In our system, we find that there is clearly difference between ESDF with network coding and ESDF without network coding. Hence, we should use a simple system model to analyze the performance about the protocol when we want to apply this protocol to a practical system.

Стилі APA, Harvard, Vancouver, ISO та ін.

43

Chen, Weiyu, and 陳威羽. "Enhanced Dynamic Decode and Forward and Network Coding." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/88085113631399606313.

Повний текст джерела

Анотація:

碩士
國立中正大學
通訊工程研究所
99
Cooperative communications and network coding are emerging wireless communications techniques in the recent years. The principle of network coding is to replace routers in a network by encoders and mixing two or more messages. Receivers can decode the original messages via appropriate calculation. The advantages of network coding are improving network throughput, lowering network delay, and decreasing transmission energy. The technique which combines cooperative communications and network coding is called the cooperative network coding (CNC). Cooperative network coding has two advantages. The first one is that CNC does not need to make any changes in physical layer. The second one is the high spectral efficiency. Compared with the conventional cooperative communications, CNC can improve the system performance in terms of diversity-multiplexing tradeoff (DMT). In this thesis, we consider a transmitter, one relay, and one receiver as a cooperative communication system, using the enhanced dynamic decode and forward (EDDF) protocol, and using network coding at relays. Outage probability and diversity-multiplexing tradeoff (DMT) are two commonly used measure to evaluate the performance of cooperative communications systems. We use the two measures to observe how much additional benefits can CNC bring us. The ultimate goal is to use CNC to further enhance the performance of relay networks.After research and analysis, EDDF with network coding can improve the system performance.

Стилі APA, Harvard, Vancouver, ISO та ін.

44

Lee, Chung-Pi, and 李崇丕. "Lattice Codes for Multiple-access Relay Channel: Decode-and-Forward and Compute-and-Forward." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/bex2pm.

Повний текст джерела

Анотація:

博士
國立臺灣大學
電信工程學研究所
102
For the uplink relay-aided transmission in a cellular system, the spectral efficiency of mobile radio networks can be improved by introducing relays to assist the transmissions of mobile stations. Further performance improvement can be expected if each relay aids not just a single mobile station, but many simultaneously. In this dissertation, we study the multiple-access relay channel (MARC), in which multiple users transmit messages to a common destination with the assistance of a relay. There are two protocols to be considered: 1) dynamic decode-and-forward (DDF) protocol and 2) compute-and-forward (CMF)protocol. In a variety of MARC settings, DDF protocol is very useful due to its outstanding rate performance. However, the lack of good structured codebooks so far hinders practical applications of DDF for the MARC. For the DDF protocol, two classes of structured codes for theMARC are proposed: 1) one-to-one relay-mapper aided multiuser lattice coding (OMLC), and 2) modulo-sum relay-mapper aided multiuser lattice coding (MS-MLC). The former enjoys better rate performance, while the latter provides more flexibility to tradeoff between the complexity of the relay mapper and the rate performance. It is shown that, in order to approach the rate performance achievable by an unstructured codebook with maximum-likelihood decoding, it is crucial to use a new K-stage coset decoder for structured O-MLC instead of the one-stage decoder proposed in previous works. However, if O-MLC is decoded with the one-stage decoder only, it can still achieve the optimal DDF diversity-multiplexing gain tradeoff in the high signal-to-noise ratio regime. As for MSMLC, its rate performance can approach that of the O-MLC by increasing the complexity of the modulo-sum relay-mapper. Finally, for practical implementations of both O-MLC and MS-MLC, practical short length lattice codes with linear mappers are designed, which facilitate efficient lattice decoding. When the channel links from the users to the relay are weak, DF-based protocol may fail to decode all users at the relay. Aiming to solve this problem, we propose a new lattice coding based on the CMF protocol, where the relay only needs to decode an integerweighted-sum of users’ lattice codewords, re-maps it with a modulo-basedmapper and then forwards the corresponding codeword. Although the decoding at the relay is akin to the orthogonal CMF protocol, we relax the restriction imposed by previous works that the users have to be silent when the relay is transmitting to avoid interference. The key ingredient is the joint multiuser lattice decoding performed at the destination. This jointly decoding strategy not only complicates the corresponding code design but also the error analysis. Simulation results show that the proposed coding schemes outperform existing schemes in terms of outage probabilities and the achievable rates in a variety of channel settings.

Стилі APA, Harvard, Vancouver, ISO та ін.

45

"On decode-and-forward cooperative systems with errors in relays." 2009. http://library.cuhk.edu.hk/record=b5893894.

Повний текст джерела

Анотація:

Mi, Wengang.
Thesis (M.Phil.)--Chinese University of Hong Kong, 2009.
Includes bibliographical references (leaves 80-85).
Abstracts in English and Chinese.
Abstract --- p.i
Acknowledgement --- p.iii
Chapter 1 --- Introduction --- p.1
Chapter 1.1 --- Path loss and fading channel --- p.2
Chapter 1.2 --- Relay Channel --- p.4
Chapter 1.3 --- Power allocation --- p.6
Chapter 1.4 --- Network coding --- p.8
Chapter 1.5 --- Outline of the thesis --- p.8
Chapter 2 --- Background Study --- p.10
Chapter 2.1 --- Cooperative communication --- p.10
Chapter 2.1.1 --- User cooperation diversity --- p.11
Chapter 2.1.2 --- Cooperative diversity --- p.14
Chapter 2.1.3 --- Coded cooperation --- p.18
Chapter 2.2 --- Power control and resource allocation in cooperative communication --- p.19
Chapter 2.3 --- Network coding --- p.21
Chapter 3 --- Power allocation in DF system --- p.24
Chapter 3.1 --- Introduction --- p.24
Chapter 3.2 --- System Model --- p.25
Chapter 3.3 --- BER analysis with power allocation --- p.27
Chapter 3.3.1 --- BER analysis of single relay system --- p.27
Chapter 3.3.2 --- Generalization for N-relay cooperation system --- p.30
Chapter 3.4 --- Approximation --- p.31
Chapter 3.5 --- Conclusion --- p.37
Chapter 4 --- Network coding cooperation --- p.38
Chapter 4.1 --- Introduction --- p.38
Chapter 4.2 --- System model --- p.39
Chapter 4.3 --- Performance analysis --- p.44
Chapter 4.3.1 --- Network coding cooperation --- p.47
Chapter 4.3.2 --- Conventional repetition cooperation --- p.48
Chapter 4.3.3 --- Simulation result --- p.49
Chapter 4.4 --- More nodes with network coding --- p.52
Chapter 4.4.1 --- System model: to be selfish or not --- p.53
Chapter 4.4.2 --- Performance analysis --- p.56
Chapter 4.4.3 --- Simulation result --- p.62
Chapter 4.5 --- Further discussion --- p.63
Chapter 5 --- Conclusion --- p.64
Chapter A --- Equation Derivation --- p.66
Chapter A.l --- Proof of proposition 1 --- p.66
Chapter A.2 --- Generalized solution --- p.68
Chapter A.3 --- System outage probability of generous scheme --- p.69
Chapter A.4 --- System outage probability of selfish scheme --- p.74
Bibliography --- p.79

Стилі APA, Harvard, Vancouver, ISO та ін.

46

Lee, Meng-ying, and 李孟穎. "Joint Amplify-and-Forward and Decode-and-ForwardCooperative Relay Systems." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/xn8ase.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

47

Peng, Jui-Che, and 彭瑞哲. "Hybrid Amplify-and-Forward and Decode-and-Forward Relaying Method Based on Average Symbol Error Rate Analysis." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/57290794566287595366.

Повний текст джерела

Анотація:

碩士
國立中央大學
通訊工程學系
103
Using relays is an important technique to expand communication coverage in modern mobile communication systems. Amplify-and-Forward (AF) and Decode-and-Forward (DF) are the most two popular strategies in the relaying methods. AF has low complexity but the noise can be amplified while in contrast, DF improves transmission reliability in some situations using the coding scheme to suppress the noise. In this paper, we explore the symbol error probabilities of the AF and DF models for the hybrid AF/DF relaying strategy, in which the BPSK and M-QAM modulation types are considered, along with calculating the average bit error rate based on the Chernoff upper bound.

Стилі APA, Harvard, Vancouver, ISO та ін.

48

Tsai, Ming-Hung. "Performance of Decode-and-Forward Cooperative Communications over Nakagami-m Fading Channels." 2008. http://www.cetd.com.tw/ec/thesisdetail.aspx?etdun=U0020-2107200820320600.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

49

Huang, Ting-An, and 黃廷安. "A Novel Relay Selection Criterion for Decode-and-Forward(DF) Cooperative Communication Systems." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/56607723159031738284.

Повний текст джерела

Анотація:

碩士
中興大學
電機工程學系所
99
Cooperative system network has been most popular in the generation. Among cooperative protocols, amplify- and-forward (AF) and decode-and-forward (DF) are the most popular ones. In this paper, we will first propose an upper bound on the SER performance of DF protocol based on the property of sinusoid function, this upper bound can reflect the SER relationships among relays, and we will compare the other selection criterion. The simulation result shows we proposed selection criterion is capable of selecting better relays than the harmonic mean and Ma-Min.

Стилі APA, Harvard, Vancouver, ISO та ін.

50

Yu, Po-Hsiang, and 游博翔. "A Cooperative Multihop Transmission Scheme for Two-Way Decode-and-Forward Relay Networks." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/37863171664393978149.

Повний текст джерела

Анотація:

碩士
國立清華大學
通訊工程研究所
101
Two-way relaying is a promising technique to improve the spectral efficiency of wireless communications, where a relay or a set of relays are used to realize information exchange between two sources at the same time and frequency. For long distance transmission, two-way relaying needs to be further combined with a multihop routing mechanism for efficient information exchange. In this thesis, we propose a new cooperative multihop transmission scheme for two-way decode-and-forward relay networks, in which multiple single-antenna relays are considered and distributed between two sources. The proposed scheme mainly consists of a forwarder selection part and a relay selection part; the former aims to minimize the number of transmission hops, and the latter is used to improve the reliability of communication links. We obtain the coverage regions of available relays and forwarders based on an asymptotic symbol error probability (SEP) analysis, and then combine the results with geographic information for minimum-SEP relay selection and maximum-coverage forwarder selection. It is shown that the proposed approach provides better effective throughput performance than a related method. In addition, an asymptotic overall end-to-end SEP for the proposed scheme is derived with a closed-form expression. Simulation results are given to validate the analyses as well as to demonstrate the effectiveness of the proposed approach.

Стилі APA, Harvard, Vancouver, ISO та ін.

Дисертації з теми "Functional Decode and Forward"

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями