Dissertations / Theses on the topic 'Functional Decode and Forward'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Functional Decode and Forward.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
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.
Full textLa 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.
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.
Full textMaagh, Stefan. "Performance analysis of the HARQ dynamic decode-and-forward protocol." Thesis, Edinburgh Napier University, 2015. http://researchrepository.napier.ac.uk/Output/8849.
Full textElmorshedy, Lina. "RF energy harvesting in a decode-and-forward wireless relay network." Thesis, University of British Columbia, 2016. http://hdl.handle.net/2429/57607.
Full textApplied Science, Faculty of
Electrical and Computer Engineering, Department of
Graduate
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.
Full textFarhat, 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.
Full textWe 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.
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.
Full textBoostanimehr, 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.
Full textXue, 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.
Full textTiivistelmä 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
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.
Full textSamarasekera, 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.
Full textAlexopoulos, 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.
Full textThesis 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.
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/.
Full textNasiri, Khormuji Majid. "Relaying Protocols for Wireless Networks." Licentiate thesis, Stockholm : Electrical Engineering, Elektrotekniska system, Kungliga Tekniska högskolan, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-4716.
Full textPoreddy, 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.
Full textNasiri, Khormuji Majid. "Coding Schemes for Relay Networks." Doctoral thesis, KTH, Kommunikationsteori, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-39199.
Full textQC 20110909
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/.
Full textCoso, 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.
Full textDesafortunadamente, 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.
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.
Full textEn 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.
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.
Full textHeitzman, 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.
Full textBarros, José Fábio Santos de. "Um estudo sobre o desempenho de protocolos de comunicações digitais cooperativas." reponame:Repositório Institucional da UFABC, 2015.
Find full textVanyan, 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.
Full textMehmood, 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.
Full textSinclair, 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.
Full textKim, 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.
Full textBen, 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.
Full textDiversity 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
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/.
Full textYu, Hyungseok. "Performance of cooperative relaying systems with co-channel interference." Diss., Georgia Institute of Technology, 2012. http://hdl.handle.net/1853/45744.
Full textMa, 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.
Full textSohn, 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.
Full textHatefi, Atoosa. "Distributed Coding for Wireless Cooperative Networks." Thesis, Supélec, 2012. http://www.theses.fr/2012SUPL0015/document.
Full textWith 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
Schwartz, Yannick. "Large-scale functional MRI analysis to accumulate knowledge on brain functions." Thesis, Paris 11, 2015. http://www.theses.fr/2015PA112056/document.
Full textHow 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
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.
Full textAzarian, Yazdi Kambiz. "Outage limited cooperative channels protocols and analysis /." Columbus, Ohio : Ohio State University, 2006. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1154740723.
Full textDemarco, Raffaella Michaela. "Optimal model points in term life insurance." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2019. http://amslaurea.unibo.it/18236/.
Full textLu, P. S. (Pen-Shun). "Decoding and lossy forwarding based multiple access relaying." Doctoral thesis, Oulun yliopisto, 2015. http://urn.fi/urn:isbn:9789526207742.
Full textTiivistelmä 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
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.
Full textThe 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
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.
Full textIslam, Shama Naz. "Multi-way relay networks: characterization, performance analysis and transmission scheme design." Phd thesis, 2015. http://hdl.handle.net/1885/13648.
Full textChen, Yu-Neng, and 陳玉能. "Dynamic Decode and Forward with Network Coding." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/53072526891916529225.
Full text國立中正大學
通訊工程研究所
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.
Chao, Mu-lan, and 趙慕嵐. "Enhanced Static Decode and Forward With Network Coding." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/67149854737126503254.
Full text國立中正大學
通訊工程研究所
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.
Chen, Weiyu, and 陳威羽. "Enhanced Dynamic Decode and Forward and Network Coding." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/88085113631399606313.
Full text國立中正大學
通訊工程研究所
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.
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.
Full text國立臺灣大學
電信工程學研究所
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.
"On decode-and-forward cooperative systems with errors in relays." 2009. http://library.cuhk.edu.hk/record=b5893894.
Full textThesis (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
Lee, Meng-ying, and 李孟穎. "Joint Amplify-and-Forward and Decode-and-ForwardCooperative Relay Systems." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/xn8ase.
Full textPeng, 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.
Full text國立中央大學
通訊工程學系
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.
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.
Full textHuang, 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.
Full text中興大學
電機工程學系所
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.
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.
Full text國立清華大學
通訊工程研究所
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.