京都大学 / 0048 / 新制・課程博士 / 博士(情報学) / 甲第20031号 / 情博第626号 / 新制||情||109(附属図書館) / 33127 / 京都大学大学院情報学研究科通信情報システム専攻 / (主査)教授 守倉 正博, 教授 原田 博司, 教授 梅野 健 / 学位規則第4条第1項該当 / Doctor of Informatics / Kyoto University / DGAM

No description available.

Network coding has emerged as an attractive alternative to routing because of the through put improvement it provides by reducing the number of channel uses. In a wireless scenario, in addition, further improvement can be obtained through Physical layer Network Coding (PNC), a technique in which nodes are allowed to transmit simultaneously, instead of transmitting in orthogonal slots. In this thesis, the design and analysis of network coding schemes are considered, for wireless two-way relaying, multi-user Multiple Access Relay Channel (MARC) and wireline networks. In a wireless two-way relay channel with PNC, the simultaneous transmissions of user nodes result in Multiple Access Interference (MAI) at there lay node. The harmful effect of MAI is the presence of signal set dependent deep channel fade conditions, called singular fade states, under which the minimum distance of the effective constellation at the relay become zero. Adaptively changing the network coding map used at the relay according to channel conditions greatly reduces the impact of this MAI. In this work, we obtain these adaptive PNC maps, which are finite in number ,by completing partially filled Latin Squares and using graph vertex coloring. Having obtained the network coding maps, the set of all possible channel realizations is quantized into a finite number of regions, with a specific network coding map chosen in a particular region and such a quantization is obtained analytically for 2λ-PSK signal set. The performance of the adaptive PNC scheme for two-way relaying is analyzed and tight high SNR upper bounds are obtained for the average end-to-end symbol error probability, in terms of the average error probability of a point-to-point fading channel. The adaptive PNC scheme is generalized for two-way relaying with multiple antennas at the nodes. As an alternative to the adaptive PNC scheme for two-way relaying, a Distributed Space Time Coding (DSTC) scheme is proposed, which effectively re-moves the effect of singular fade states at the transmitting nodes itself without any Channel State Information at the Transmitter (CSIT), and without any need to change the PNC map as a function of channel fade conditions. It is shown that the singular fade states can be viewed equivalently as vector subspaces of C2, which are referred to as the singular fade subspaces. DSTC design criterion to minimize the number of singular fade subspaces and maximize the coding gain is formulated and explicit low decoding complexity DSTC designs are provided. For the K-user MARC, in which K source nodes want to transmit messages to a destination node D with the help of are lay node R, a new PNC scheme is proposed. Use of a many-to-one PNC map with conventional minimum squared Euclidean distance decoding at D, results in a loss of diversity order due to error propagation from the relay node. To counter this, we propose a novel low complexity decoder which offers the maximum diversity order of two. Next, we consider wire line networks and explore the connections between linear network coding, linear index coding and discrete polymatroids, which are the multi-set analogue of matroids. We define a discrete polymatroidal network and show that a fractional vector linear solution over a field Fq exists for a network if and only if the network is discrete polymatroidal with respect to a discrete polymatroid representable over Fq.An algorithm to construct networks starting from certain class of discrete polymatroids is provided. Every representation over Fq for the discrete polymatroid, results in a fractional vector linear solution over Fq for the constructed network. It is shown that a linear solution to an index coding problem exists if and only if there exists a representable discrete polymatroid satisfying certain conditions which are determined by the index coding problem considered. El Rouayheb et. al. showed that the problem of finding a multi-linear representation for a matroid can be reduced to finding a perfect linear index coding solution for an index coding problem obtained from that matroid. Multi-linear representation of a matroid can be viewed as a special case of representation of an appropriate discrete polymatroid. We generalize the result of El Rouayheb et. al. by showing that the problem of finding a representation for a discrete polymatroid can be reduced to finding a perfect linear index coding solution for an index coding problem obtained from that discrete polymatroid.

This thesis describes the use of a multi-amplitude minimum shift keying (MAMSK) signal in various types of wireless communication system. A MAMSK signal is a bandwidth efficient modulation scheme obtained by superimposing ℳ minimum shift keying (MSK) signals with unequal amplitudes. The overall phase of a MAMSK signal is controlled by the phase of the largest component MSK signal which allows the use of a low-complexity differential detector. A closed form expression for the average bit error rate (BER) for coherent detection of an MAMSK in AWGN is derived and is shown to achieve the same BER as that of square constellation quadrature amplitude modulation (QAM) with the same average transmit power. We describe the design and implementation of a STBC-based MIMO radio system in conjunction with MAMSK modulation. The proposed system provides high capacity data transmission by carrying information not only in the phases but also in the amplitude. Despite using a simple MAMSK differential receiver the system achieves performance within 1 dB of coherent detection. The existing MSK modems in conjunction with STBC could easily be modified to construct the proposed system. The MAMSK modulation scheme is extended to a multiuser relaying network where two nodes cooperate in a half-duplex environment to achieve diversity gain. The cooperative scheme is based on superposition modulation using a decode-and-forward (DF) strategy. In the proposed scheme, each node simultaneously transmits its own and the relayed signals by superimposing one on the other. A MAMSK signal is an excellent choice for this type of cooperative communication due its being obtained by a superposition technique. The proposed system exploits the overall phase of a MAMSK signal which allows differential detection and as a result it provides the lowest decoding complexity and memory requirements among the existing superposition based cooperation schemes. The performance of the system is evaluated by simulation, where it is shown that the MAMSK cooperative system outperforms a conventional DF scheme in terms of both power and bandwidth efficiency.

The reliability of protection systems has emerged as an important topic because protection failures have critical influence on the reliability of power systems. The goal of this research is to develop novel approaches for modeling and analysis of the impact of protection system failures on power system reliability. It is shown that repairable and non-repairable assumptions make a remarkable difference in reliability modeling. A typical all-digital protection system architecture is modeled and numerically analyzed. If an all-digital protection system is indeed repairable but is modeled in a non-repairable manner for analysis, the calculated values of reliability indices could be grossly pessimistic. The smart grid is emerging with the penetration of information-age technologies and the development of the Special Protection System (SPS) will be greatly influenced. A conceptual all-digital SPS architecture is proposed for the future smart grid. Calculation of important reliability indices by the network reduction method and the Markov modeling method is illustrated in detail. Two different Markov models are proposed for reliability evaluation of the 2-out-of-3 voting gates structure in a generation rejection scheme. If the model with consideration of both detectable and undetectable logic gate failures is used as a benchmark, the simple model which only considers detectable failures will significantly overestimate the reliability of the 2-out-of-3 voting gates structure. The two types of protection failures, undesired-tripping mode and fail-to-operate mode are discussed. A complete Markov model for current-carrying components is established and its simplified form is then derived. The simplified model can appropriately describe the overall reliability situation of individual components under the circumstances of complex interactions between components due to protection failures. New concepts of the self-down state and the induced-down state are introduced and utilized to build up the composite unit model. Finally, a two-layer Markov model for power systems with protection failures is proposed. It can quantify the impact of protection failures on power system reliability. Using the developed methodology, we can see that the assumption of perfectly reliable protection can introduce errors in reliability evaluation of power systems.

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. Thenew 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.

Dans les communications coopératives, deux ou plusieurs terminaux de transmissionsont combinés pour accroître la diversité et/ou la puissance des signaux arrivant à un récepteur. Récemment, l'analyse tensorielle s'est avérée une approche efficace pour l'estimation de canaux dans les systèmes coopératifs. Cependant, parmi les quelques travaux consacrés à cette tâche, l'utilisation de la décomposition tensorielle PARAFAC pour modéliser les signaux reçus ne permet pas l'estimation conjointe des symboles et des canaux de communication. Afin d'éviter l'utilisation de séquences de symboles pilotes, l'objectif de cette thèse est de fournir de nouvelles approches tensorielles, en termes de systèmes de transmission et de récepteurs semi-aveugles, pour des systèmes de communication MIMO avec relai mono-directionnels, à deux sauts. Deux systèmes de transmission sont proposés en utilisant un codage spatio-temporel du type Khatri-Rao et deux stratégies de traitement Amplify-and-Forward (AF) au relai. Pour ces systèmes, appelés PT2-AF et NP-AF, les signaux reçus au niveau de la destination satisfont respectivement des modèles tensoriels du type PARATUCK2 et nested PARAFAC. En exploitant les propriétés d'unicité de ces modèles tensoriels établies dans la thèse, plusieurs récepteurs semi-aveugles sont dérivés. Certains de ces récepteurs sont du type ALS, tandis que d'autres sont des solutions non itératives basées sur des factorisations de produits de Khatri-Rao. Des résultats de simulation sont présentés pour illustrer les performances des récepteurs proposés qui sont comparés à des estimateurs supervisés. / In cooperative communication systems, two or more transmitting terminals arecombined to increase the diversity and/or the power of the signals arriving at aparticular receiver. Recently, the so-called tensor analysis has been an efficient approach for channel estimation in systems with cooperative diversity. However, among the few works devoted to this task, the utilization of the PARAFAC tensor decomposition for modeling the received signals did not allow the development of techniques for joint symbol and channel estimation. Aiming to avoid the use of pilot-based sequences, the objective of this thesis is to provide new tensor-based strategies, including transmission systems and semi-blind receivers, for one-way two-hop relaying systems. Based on a Khatri-Rao space-time coding at the source and two different Amplify-and-Forward (AF) relaying strategies, two transmission systems are proposed. For these systems, named PT2-AF and NP-AF, the received signals at the destination node follow respectively a PARATUCK2 and a nested PARAFAC tensor model. Exploiting uniqueness properties of these tensor models which are established in the thesis, several semi-blind receivers are derived. Some of these receivers are of iterative form using an ALS algorithm, whereas some other ones are close-form solutions associated with Khatri-Rao factorizations. Some simulation results are finally presented to illustrate the performance of the proposed receivers which are compared to some state-of-the-art supervised techniques.

The aim of the diploma‘s thesis is the project of relaying of road II/150 between Domaželice village and the town of Bystřice pod Hostýnem. The road continues on to the bypass of Čechy village and Domaželice village. This bypass is under construction at this time. Relaying of road II/150 is connected on project of Bystřice pod Hostýnem bypass. The connection of the existing and intended roads is designed. The project includes the accompanying report, the drawing part and the photodocumentation. The project is drawning up in two programs called Bentley Inroads and AutoCAD according to valid standards.

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.

In this work, we study two problems in information-theoretic security. Firstly, we study a wireless network where two nodes want to securely exchange messages via an honest-but-curious bidirectional relay. There is no direct link between the user nodes, and all communication must take place through the relay. The relay behaves like a passive eavesdropper, but otherwise follows the protocol it is assigned. Our objective is to design a scheme where the user nodes can reliably exchange messages such that the relay gets no information about the individual messages. We first describe a perfectly secure scheme using nested lattices, and show that our scheme achieves secrecy regardless of the distribution of the additive noise, and even if this distribution is unknown to the user nodes. Our scheme is explicit, in the sense that for any pair of nested lattices, we give the distribution used for randomization at the encoders to guarantee security. We then give a strongly secure lattice coding scheme, and we characterize the performance of both these schemes in the presence of Gaussian noise. We then extend our perfectly-secure and strongly-secure schemes to obtain a protocol that guarantees end-to-end secrecy in a multichip line network. We also briefly study the robustness of our bidirectional relaying schemes to channel imperfections. In the second problem, we consider the scenario where multiple terminals have access to private correlated Gaussian sources and a public noiseless communication channel. The objective is to generate a group secret key using their sources and public communication in a way that an eavesdropper having access to the public communication can obtain no information about the key. We give a nested lattice-based protocol for generating strongly secure secret keys from independent and identically distributed copies of the correlated random variables. Under certain assumptions on the joint distribution of the sources, we derive achievable secret key rates. The tools used in designing protocols for both these problems are nested lattice codes, which have been widely used in several problems of communication and security. In this thesis, we also study lattice constructions that permit polynomial-time encoding and decoding. In this regard, we first look at a class of lattices obtained from low-density parity-check (LDPC) codes, called Low-density Construction-A (LDA) lattices. We show that high-dimensional LDA lattices have several “goodness” properties that are desirable in many problems of communication and security. We also present a new class of low-complexity lattice coding schemes that achieve the capacity of the AWGN channel. Codes in this class are obtained by concatenating an inner Construction-A lattice code with an outer Reed-Solomon code or an expander code. We show that this class of codes can achieve the capacity of the AWGN channel with polynomial encoding and decoding complexities. Furthermore, the probability of error decays exponentially in the block length for a fixed transmission rate R that is strictly less than the capacity. To the best of our knowledge, this is the first capacity-achieving coding scheme for the AWGN channel which has an exponentially decaying probability of error and polynomial encoding/decoding complexities.