In this dissertation novel methods are proposed for communicating in interference limited environments as well as detecting such interference. The methods include introducing redundancies into multicarrier signals to make them more robust, applying a novel filtering structure for mitigating radar interference to orthogonal frequency division multiplexing (OFDM) signals and for exploiting the cyclostationary nature of signals to whiten the spectrum in blind signal detection. Data symbols are repeated in both time and frequency across orthogonal frequency division multiplexing (OFDM) symbols, creating a cyclostationary nature in the signal. A Frequency Shift (FRESH) filter can then be applied to the cyclostationary signal, which is the optimal filter and is able to reject interference much better than a time-invariant filter such as the Wiener filter. A novel time-varying FRESH filter (TV-FRESH) filter is developed and its Minimum Mean Squared Error (MMSE) filter weights are found. The repetition of data symbols and their optimal combining with the TV-FRESH filter creates an effect of improving the Bit Error Rate (BER) at the receiver, similar to an error correcting code. The important distinction for the paramorphic method is that it is designed to operate within cyclostationary interference, and simulation results show that the symbol repetition can outperform other error correcting codes. Simulated annealing is used to optimize the signaling parameters, and results show that a balance between the symbol repetition and error correcting codes produces a better BER for the same spectral efficiency than what either method could have achieved alone. The TV-FRESH filter is applied to a pulsed chirp radar signal, demonstrating a new tool to use in radar and OFDM co-existence. The TV-FRESH filter applies a set of filter weights in a periodically time-varying fashion. The traditional FRESH filter is periodically time-varying due to the periodicities of the frequency shifters, but applies time-invariant filters after optimally combine any spectral redundancies in the signal. The time segmentation of the TV-FRESH filter allows spectral redundancies of the radar signal to be exploited across time due to its deterministic nature. The TV-FRESH filter improves the rejection of the radar signal as compared to the traditional FRESH filter under the simulation scenarios, improving the SINR and BER at the output of the filter. The improvement in performance comes at the cost of additional filtering complexity. A time-varying whitening filter is applied to blindly detect interference which overlaps with the desired signal in frequency. Where a time-invariant whitening filter shapes the output spectrum based on the power levels, the proposed time-varying whitener whitens the output spectrum based on the spectral redundancy in the desired signal. This allows signals which do not share the same cyclostationary properties to pass through the filter, improving the sensitivity of the algorithm and producing higher detection rates for the same probability of false alarm as compared to the time-invariant whitener. / Ph. D. / This dissertation proposes novel methods for building robust wireless communication links which can be used to improve their reliability and resilience while under interference. Wireless interference comes from many sources, including other wireless transmitters in the area or devices which emit electromagnetic waves such as microwaves. Interference reduces the quality of a wireless link and depending on the type and severity may make it impossible to reliably receive information. The contributions are both for communicating under interference and being able to detect interference. A novel method for increasing the redundancy in a wireless link is proposed which improves the resiliency of a wireless link. By transmitting additional copies of the desired information the wireless receiver is able to better estimate the original transmitted signal. The digital receiver structure is proposed to optimally combine the redundant information, and simulation results are used to show its improvement over other analogous methods. The second contribution applies a novel digital filter for mitigating interference from a radar signal to an Orthogonal Frequency Division Multiplexing (OFDM) signal, similar to the one which is being used in Long Term Evolution (LTE) mobile phones. Simulation results show that the proposed method out performs other digital filters at the most of additional complexity. The third contribution applies a digital filter and trains it such that the output of the filter can be used to detect the presence of interference. An algorithm which detects interference can tip off an appropriate response, and as such is important to reliable wireless communications. Simulation results are used to show that the proposed method produces a higher probability of detection while reducing the false alarm rate as compared to a similar digital filter trained to produce the same effect.

付記する学位プログラム名: 社会を駆動するプラットフォーム学卓越大学院プログラム / 京都大学 / 新制・課程博士 / 博士(情報学) / 甲第25441号 / 情博第879号 / 新制||情||147(附属図書館) / 京都大学大学院情報学研究科情報学専攻 / (主査)教授 原田 博司, 教授 佐藤 高史, 教授 林 和則 / 学位規則第4条第1項該当 / Doctor of Informatics / Kyoto University / DGAM

The objective of this dissertation is to better understand the impact of the range extension and interference effects of opportunistic large arrays (OLAs), in the context of cooperative routing in multi-hop ad hoc networks. OLAs are a type of concurrent cooperative transmission (CCT), in which the number and location of nodes that will participate in a particular CCT cannot be known a priori. The motivation of this research is that the previous CCT research simplifies or neglects significant issues that impact the CCT-based network performance. Therefore, to develop and design more efficient and realistic OLA-based protocols, we clarify and examine through experimentation and analysis the simplified or neglected characteristics of CCT, which should be considered in the network-level system design. The main contributions of this research are (i) intra-flow interference analysis and throughput optimization in both disk- and strip-shaped networks, for multi-packet OLA transmission, (ii) CCT link modeling focusing on path-loss disparity and link asymmetry, (iii) demonstration of CCT range-extension and OLA-based routing using a software-defined radio (SDR) test-bed, (iv) a new OLA-based routing protocol with practical error control algorithm. In the throughput optimization in presence of the intra-channel interference, we analyze the feasibility condition of spatially pipelined OLA transmissions using the same channel and present numerical results with various system parameters. In the CCT link model, we provide the impact of path-loss disparity that are inherent in a virtual multiple-input-single-output (VMISO) link and propose an approximate model to calculate outage rates in high signal-to-noise-ratio (SNR) regime. Moreover, we present why link asymmetry is relatively more severe in CCT compared to single-input-single-output (SISO) links. The experimental studies show actual measurement values of the CCT range extension and realistic performance evaluation of OLA-based routing. Lastly, OLA with primary route set-up (OLA-PRISE) is proposed with a practical route recovery technique.

In this thesis, the process of optimizing Cooperative Spectrum Sensing in Cognitive Radio has been investigated in fast-fading environments where simulation results have shown that its performance is limited by the Probability of Reporting Errors. By proposing a transmit diversity scheme using Differential space-time block codes (D-STBC) where channel state information (CSI) is not required and regarding multiple pairs of Cognitive Radios (CR's) with single antennas as a virtual MIMO antenna arrays in multiple clusters, Differential space-time coding is applied for the purpose of decision reporting over Rayleigh channels. Both Hard and Soft combination schemes were investigated at the fusion center to reveal performance advantages for Hard combination schemes due to their minimal bandwidth requirements and simplistic implementation. The simulations results show that this optimization process achieves full transmit diversity, albeit with slight performance degradation in terms of power with improvements in performance when compared to conventional Cooperative Spectrum Sensing over non-ideal reporting channels. Further research carried out in this thesis shows performance deficits of Cooperative Spectrum Sensing due to interference on sensing channels of Cognitive Radio. Interference Alignment (IA) being a revolutionary wireless transmission strategy that reduces the impact of interference seems well suited as a strategy that can be used to optimize the performance of Cooperative Spectrum Sensing. The idea of IA is to coordinate multiple transmitters so that their mutual interference aligns at their receivers, facilitating simple interference cancellation techniques. Since its inception, research efforts have primarily been focused on verifying IA's ability to achieve the maximum degrees of freedom (an approximation of sum capacity), developing algorithms for determining alignment solutions and designing transmission strategies that relax the need for perfect alignment but yield better performance. With the increased deployment of wireless services, CR's ability to opportunistically sense and access the unused licensed frequency spectrum, without causing harmful interference to the licensed users becomes increasingly diminished, making the concept of introducing IA in CR a very attractive proposition. For a multiuser multiple-input-multiple-output (MIMO) overlay CR network, a space-time opportunistic IA (ST-OIA) technique has been proposed that allows spectrum sharing between a single primary user (PU) and multiple secondary users (SU) while ensuring zero interference to the PUs. With local CSI available at both the transmitters and receivers of SUs, the PU employs a space-time WF (STWF) algorithm to optimize its transmission and in the process, frees up unused eigenmodes that can be exploited by the SU. STWF achieves higher performance than other WF algorithms at low to moderate signal-to-noise ratio (SNR) regimes, which makes it ideal for implementation in CR networks. The SUs align their transmitted signals in such a way their interference impairs only the PU's unused eigenmodes. For the multiple SUs to further exploit the benefits of Cooperative Spectrum Sensing, it was shown in this thesis that IA would only work when a set of conditions were met. The first condition ensures that the SUs satisfy a zero interference constraint at the PU's receiver by designing their post-processing matrices such that they are orthogonal to the received signal from the PU link. The second condition ensures a zero interference constraint at both the PU and SUs receivers i.e. the constraint ensures that no interference from the SU transmitters is present at the output of the post-processing matrices of its unintended receivers. The third condition caters for the multiple SUs scenario to ensure interference from multiple SUs are aligned along unused eigenmodes. The SU system is assumed to employ a time division multiple access (TDMA) system such that the Principle of Reciprocity is employed towards optimizing the SUs transmission rates. Since aligning multiple SU transmissions at the PU is always limited by availability of spatial dimensions as well as typical user loads, the third condition proposes a user selection algorithm by the fusion centre (FC), where the SUs are grouped into clusters based on their numbers (i.e. two SUs per cluster) and their proximity to the FC, so that they can be aligned at each PU-Rx. This converts the cognitive IA problem into an unconstrained standard IA problem for a general cognitive system. Given the fact that the optimal power allocation algorithms used to optimize the SUs transmission rates turns out to be an optimal beamformer with multiple eigenbeams, this work initially proposes combining the diversity gain property of STBC, the zero-forcing function of IA and beamforming to optimize the SUs transmission rates. However, this solution requires availability of CSI, and to eliminate the need for this, this work then combines the D-STBC scheme with optimal IA precoders (consisting of beamforming and zero-forcing) to maximize the SUs data rates.

In this dissertation, we study data collection and its achievable network capacity in Wireless Sensor Networks (WSNs). Firstly, we investigate the data collection issue in dual-radio multi-channel WSNs under the protocol interference model. We propose a multi-path scheduling algorithm for snapshot data collection, which has a tighter capacity bound than the existing best result, and a novel continuous data collection algorithm with comprehensive capacity analysis. Secondly, considering most existing works for the capacity issue are based on the ideal deterministic network model, we study the data collection problem for practical probabilistic WSNs. We design a cell-based path scheduling algorithm and a zone-based pipeline scheduling algorithm for snapshot and continuous data collection in probabilistic WSNs, respectively. By analysis, we show that the proposed algorithms have competitive capacity performance compared with existing works. Thirdly, most of the existing works studying the data collection capacity issue are for centralized synchronous WSNs. However, wireless networks are more likely to be distributed asynchronous systems. Therefore, we investigate the achievable data collection capacity of realistic distributed asynchronous WSNs and propose a data collection algorithm with fairness consideration. Theoretical analysis of the proposed algorithm shows that its achievable network capacity is order-optimal as centralized and synchronized algorithms do and independent of network size. Finally, for completeness, we study the data aggregation issue for realistic probabilistic WSNs. We propose order-optimal scheduling algorithms for snapshot and continuous data aggregation under the physical interference model.

Spectrum sharing is known as a key solution to accommodate the increasing number of users and the growing demand for throughput in wireless networks. While spectrum sharing improves the data rate in sparse networks, it suffers from interference of concurrent links in dense networks. In fact, interference is the primary barrier to enhance the overall throughput of the network, especially in the medium and high signal-to-noise ratios (SNR’s). Managing interference to overcome this barrier has emerged as a crucial step in developing efficient wireless networks. This thesis deals with optimum and sub-optimum interference management-cancelation in non-cooperative networks. Several techniques for interference management including novel strategies such as interference alignment and structural coding are investigated. These methods are applied to obtain optimum and sub-optimum coding strategies in such networks. It is shown that a single strategy is not able to achieve the maximum throughput in all possible scenarios and in fact a careful design is required to fully exploit all available resources in each realization of the system. This thesis begins with a complete investigation of the capacity region of the two-user Gaussian interference channel. This channel models the basic interaction between two users sharing the same spectrum for data communication. New outer bounds outperforming known bounds are derived using Genie-aided techniques. It is proved that these outer bounds meet the known inner bounds in some special cases, revealing the sum capacity of this channel over a certain range of parameters which has not been known in the past. A novel coding scheme applicable in networks with single antenna nodes is proposed next. This scheme converts a single antenna system to an equivalent Multiple Input Multiple Output (MIMO) system with fractional dimensions. Interference can be aligned along these dimensions and higher multiplexing gains can be achieved. Tools from the field of Diophantine approximation in number theory are used to show that the proposed coding scheme in fact mimics the traditional schemes used in MIMO systems where each data stream is sent along a direction and alignment happens when several streams are received along the same direction. Two types of constellation are proposed for the encoding part, namely the single layer constellation and the multi-layer constellation. Using single layer constellations, the coding scheme is applied to the two-user $X$ channel. It is proved that the total Degrees-of-Freedom (DOF), i.e. $\frac{4}{3}$, of the channel is achievable almost surely. This is the first example in which it is shown that a time invariant single antenna system does not fall short of achieving this known upper bound on the DOF. Using multi-layer constellations, the coding scheme is applied to the symmetric three-user GIC. Achievable DOFs are derived for all channel gains. It is observed that the DOF is everywhere discontinuous (as a function of the channel gain). In particular, it is proved that for the irrational channel gains the achievable DOF meets the upper bound of $\frac{3}{2}$. For the rational gains, the achievable DOF has a gap to the known upper bounds. By allowing carry over from multiple layers, however, it is shown that higher DOFs can be achieved for the latter. The $K$-user single-antenna Gaussian Interference Channel (GIC) is considered, where the channel coefficients are NOT necessarily time-variant or frequency selective. It is proved that the total DOF of this channel is $\frac{K}{2}$ almost surely, i.e. each user enjoys half of its maximum DOF. Indeed, we prove that the static time-invariant interference channels are rich enough to allow simultaneous interference alignment at all receivers. To derive this result, we show that single-antenna interference channels can be treated as \emph{pseudo multiple-antenna systems} with infinitely-many antennas. Such machinery enables us to prove that the real or complex $M \times M$ MIMO GIC achieves its total DOF, i.e., $\frac{MK}{2}$, $M \geq 1$. The pseudo multiple-antenna systems are developed based on a recent result in the field of Diophantine approximation which states that the convergence part of the Khintchine-Groshev theorem holds for points on non-degenerate manifolds. As a byproduct of the scheme, the total DOFs of the $K\times M$ $X$ channel and the uplink of cellular systems are derived. Interference alignment requires perfect knowledge of channel state information at all nodes. This requirement is sometimes infeasible and users invoke random coding to communicate with their corresponding receivers. Alternative interference management needs to be implemented and this problem is addressed in the last part of the thesis. A coding scheme for a single user communicating in a shared medium is proposed. Moreover, polynomial time algorithms are proposed to obtain best achievable rates in the system. Successive rate allocation for a $K$-user interference channel is performed using polynomial time algorithms.

Spectrum sharing is known as a key solution to accommodate the increasing number of users and the growing demand for throughput in wireless networks. While spectrum sharing improves the data rate in sparse networks, it suffers from interference of concurrent links in dense networks. In fact, interference is the primary barrier to enhance the overall throughput of the network, especially in the medium and high signal-to-noise ratios (SNR’s). Managing interference to overcome this barrier has emerged as a crucial step in developing efficient wireless networks. This thesis deals with optimum and sub-optimum interference management-cancelation in non-cooperative networks. Several techniques for interference management including novel strategies such as interference alignment and structural coding are investigated. These methods are applied to obtain optimum and sub-optimum coding strategies in such networks. It is shown that a single strategy is not able to achieve the maximum throughput in all possible scenarios and in fact a careful design is required to fully exploit all available resources in each realization of the system. This thesis begins with a complete investigation of the capacity region of the two-user Gaussian interference channel. This channel models the basic interaction between two users sharing the same spectrum for data communication. New outer bounds outperforming known bounds are derived using Genie-aided techniques. It is proved that these outer bounds meet the known inner bounds in some special cases, revealing the sum capacity of this channel over a certain range of parameters which has not been known in the past. A novel coding scheme applicable in networks with single antenna nodes is proposed next. This scheme converts a single antenna system to an equivalent Multiple Input Multiple Output (MIMO) system with fractional dimensions. Interference can be aligned along these dimensions and higher multiplexing gains can be achieved. Tools from the field of Diophantine approximation in number theory are used to show that the proposed coding scheme in fact mimics the traditional schemes used in MIMO systems where each data stream is sent along a direction and alignment happens when several streams are received along the same direction. Two types of constellation are proposed for the encoding part, namely the single layer constellation and the multi-layer constellation. Using single layer constellations, the coding scheme is applied to the two-user $X$ channel. It is proved that the total Degrees-of-Freedom (DOF), i.e. $\frac{4}{3}$, of the channel is achievable almost surely. This is the first example in which it is shown that a time invariant single antenna system does not fall short of achieving this known upper bound on the DOF. Using multi-layer constellations, the coding scheme is applied to the symmetric three-user GIC. Achievable DOFs are derived for all channel gains. It is observed that the DOF is everywhere discontinuous (as a function of the channel gain). In particular, it is proved that for the irrational channel gains the achievable DOF meets the upper bound of $\frac{3}{2}$. For the rational gains, the achievable DOF has a gap to the known upper bounds. By allowing carry over from multiple layers, however, it is shown that higher DOFs can be achieved for the latter. The $K$-user single-antenna Gaussian Interference Channel (GIC) is considered, where the channel coefficients are NOT necessarily time-variant or frequency selective. It is proved that the total DOF of this channel is $\frac{K}{2}$ almost surely, i.e. each user enjoys half of its maximum DOF. Indeed, we prove that the static time-invariant interference channels are rich enough to allow simultaneous interference alignment at all receivers. To derive this result, we show that single-antenna interference channels can be treated as \emph{pseudo multiple-antenna systems} with infinitely-many antennas. Such machinery enables us to prove that the real or complex $M \times M$ MIMO GIC achieves its total DOF, i.e., $\frac{MK}{2}$, $M \geq 1$. The pseudo multiple-antenna systems are developed based on a recent result in the field of Diophantine approximation which states that the convergence part of the Khintchine-Groshev theorem holds for points on non-degenerate manifolds. As a byproduct of the scheme, the total DOFs of the $K\times M$ $X$ channel and the uplink of cellular systems are derived. Interference alignment requires perfect knowledge of channel state information at all nodes. This requirement is sometimes infeasible and users invoke random coding to communicate with their corresponding receivers. Alternative interference management needs to be implemented and this problem is addressed in the last part of the thesis. A coding scheme for a single user communicating in a shared medium is proposed. Moreover, polynomial time algorithms are proposed to obtain best achievable rates in the system. Successive rate allocation for a $K$-user interference channel is performed using polynomial time algorithms.

The cyclic prefix (CP) is usually adopted in single carrier frequency domain equalization (SC-FDE) system to avoid inter-block interference (IBI) and inter-symbol interference (ISI) in multipath fading channels. In addition, the use of CP also converts the linear convolution between the transmitted signal and the channel into a circular convolution, leading to significant decrease in receiver equalization. However, the use of CP reduces the bandwidth efficiency. Therefore the SC-FDE system without CP is investigated in this thesis. A number of schemes have been proposed to improve the performance of systems without CP, where both IBI and ICI are dramatically increased. Unfortunately, most of the existing schemes have extremely high computational complexity and are difficult to realize. In this thesis, a novel low-complexity CP reconstruction (CPR) scheme is proposed for interference cancellation, where the successive interference cancellation (SIC) and QR decomposition (QRD) are adopted. In addition, the system performance is further improved by using the fact that the interferences of different symbols are not the same. Simulation experiments are conducted to verify the system performance of the proposed scheme. It is shown that the proposed scheme can effectively reduce the interference, while maintain a low computational complexity.

In the single carrier systems with cyclic-prefix (CP), the use of CP does not only eliminate the inter-block interference (IBI), but also convert linear convolution of the transmitted signal with the channel into circular convolution, which leads to the computation complexity of the frequency domain equalization (FDE) at the receiver is reduced. Unfortunately, the use of CP considerably decreases the bandwidth utilization. In order to increase the bandwidth utilization, the single carrier systems with frequency domain equalization (SC-FDE) is investigated. When FDE is used in a single carrier system without CP, the IBI is induced by the modulated symbols and then the bit-error rate (BER) is increased. To reduce the interference and then improve the system performance, a novel interference cancellation scheme is proposed in this thesis. After FDE, it is shown that interference is induced from the right end of a time domain signal block and most of the interference is located at both ends of an equalized time domain signal block. Based on this observation, the modulated symbols which induce the interference are detected according to the maximum-likelihood (ML) principle and then the interference is regenerated and eliminated. For simplifying the computation complexity, we further propose a successive interference cancellation scheme, which is implemented by using the Viterbi algorithm. The simulation results demonstrate that the proposed scheme improves BER performance significantly in SC-FDE systems. In addition, the proposed architecture has comparable BER performance with the SC-CP systems when the multi-path channel is exponentially decayed.

A new type of photolithography, Pattern-Integrated Interference Lithography (PIIL), was demonstrated. PIIL is the first-ever integration of pattern imaging with interference lithography in a single-exposure step. The result is an optical-intensity distribution composed of a subwavelength periodic lattice with integrated functional circuit elements. To demonstrate the PIIL method, a Pattern-Integrated Interference Exposure System (PIIES) was developed that incorporates a projection imaging capability in a novel three-beam interference configuration. The purpose of this system was to fabricate, in a single-exposure step, representative photonic-crystal structures. Initial experimental results have confirmed the PIIL concept, demonstrating the potential application of PIIL in nano-electronics, photonic crystals, biomedical structures, optical trapping, metamaterials, and in numerous subwavelength structures. In the design of the PIIES configuration, accurate motif geometry models were developed for the 2D plane-group symmetries possible via linearly-polarized three-beam interference, optimized for maximum absolute contrast and primitive-lattice-vector direction equal contrast. Next, a straightforward methodology was presented to facilitate a thorough analysis of effects of parametric constraints on interference-pattern symmetries, motif geometries, and their absolute contrasts. With this information, the design of the basic PIIES configuration was presented along with a model that simulates the resulting optical-intensity distribution at the system sample plane. Appropriate performance metrics were defined in order to quantify the characteristics of the resulting photonic-crystal structure.