Spelling suggestions: "subject:"interference ehannel"" "subject:"interference achannel""
21 |
Communication over MIMO Multi-User Systems: Signalling and FairnessMaddah-Ali, Mohammad Ali January 2007 (has links)
Employment of the multiple-antenna transmitters/receivers in communication systems is known as a promising solution to provide high-data-rate wireless links. In the multi-user environments, the problems of signaling and fairness for multi-antenna systems have emerged as challenging problems. This dissertation deals with these problems in several multi-antenna multi-user scenarios.
In part one, a simple signaling method for the multi-antenna broadcast channels is proposed. This method reduces the MIMO broadcast system to a set of parallel channels. The proposed scheme has several desirable features in terms of: (i) accommodating users with different number of receive antennas, (ii) exploiting multi-user diversity, and (iii) requiring low feedback rate. The simulation results and analytical evaluations indicate that the achieved sum-rate is close to the sum-capacity of the underlying broadcast channel.
In part two, for multiple-antenna systems with two transmitters and two receivers, a new non-cooperative scenario of data communication is studied in which each receiver receives data from both transmitters. For such a scenario, a signaling scheme is proposed which decomposes the system into two broadcast or two multi-access sub-channels. Using the decomposition scheme, it is shown that this signaling scenario outperforms the other known non-cooperative schemes in terms of the achievable multiplexing gain. In particular for some special cases, the achieved multiplexing gain is the same as the multiplexing gain of the system, where the full cooperation is provided between the transmitters and/or between the receivers.
Part three investigates the problem of fairness for a class of systems for which a subset of the capacity region, which includes
the sum-capacity facets, forms a polymatroid structure. The main purpose is to find a point on the sum-capacity facet which satisfies a notion of fairness among active users. This problem is addressed in the cases where the complexity of achieving interior points is not feasible, and where the complexity of achieving interior points is feasible.
In part four, $K$-user memoryless interference channels are considered; where each receiver sequentially decodes the data of a subset of transmitters before it decodes the data of the designated transmitter. A greedy algorithm is developed to find the users which are decoded at each receiver and the corresponding decoding order such that the minimum rate of the users is maximized. It is proven that the proposed algorithm is optimal.
The results of the parts three and four are presented for general channels which include the multiple-antenna systems as special cases.
|
22 |
Communication over MIMO Multi-User Systems: Signalling and FairnessMaddah-Ali, Mohammad Ali January 2007 (has links)
Employment of the multiple-antenna transmitters/receivers in communication systems is known as a promising solution to provide high-data-rate wireless links. In the multi-user environments, the problems of signaling and fairness for multi-antenna systems have emerged as challenging problems. This dissertation deals with these problems in several multi-antenna multi-user scenarios.
In part one, a simple signaling method for the multi-antenna broadcast channels is proposed. This method reduces the MIMO broadcast system to a set of parallel channels. The proposed scheme has several desirable features in terms of: (i) accommodating users with different number of receive antennas, (ii) exploiting multi-user diversity, and (iii) requiring low feedback rate. The simulation results and analytical evaluations indicate that the achieved sum-rate is close to the sum-capacity of the underlying broadcast channel.
In part two, for multiple-antenna systems with two transmitters and two receivers, a new non-cooperative scenario of data communication is studied in which each receiver receives data from both transmitters. For such a scenario, a signaling scheme is proposed which decomposes the system into two broadcast or two multi-access sub-channels. Using the decomposition scheme, it is shown that this signaling scenario outperforms the other known non-cooperative schemes in terms of the achievable multiplexing gain. In particular for some special cases, the achieved multiplexing gain is the same as the multiplexing gain of the system, where the full cooperation is provided between the transmitters and/or between the receivers.
Part three investigates the problem of fairness for a class of systems for which a subset of the capacity region, which includes
the sum-capacity facets, forms a polymatroid structure. The main purpose is to find a point on the sum-capacity facet which satisfies a notion of fairness among active users. This problem is addressed in the cases where the complexity of achieving interior points is not feasible, and where the complexity of achieving interior points is feasible.
In part four, $K$-user memoryless interference channels are considered; where each receiver sequentially decodes the data of a subset of transmitters before it decodes the data of the designated transmitter. A greedy algorithm is developed to find the users which are decoded at each receiver and the corresponding decoding order such that the minimum rate of the users is maximized. It is proven that the proposed algorithm is optimal.
The results of the parts three and four are presented for general channels which include the multiple-antenna systems as special cases.
|
23 |
Feedback and Cooperation in Wireless NetworksAbdoli Hoseinabadi, Mohammad Javad January 2012 (has links)
The demand for wireless data services has been dramatically growing over the last decade. This growth has been accompanied by a significant increase in the number of users sharing the same wireless medium, and as a result, interference management has become a hot topic of research in recent years. In this dissertation, we investigate feedback and transmitter cooperation as two closely related tools to manage the interference and achieve high data rates in several wireless networks, focusing on additive white Gaussian noise (AWGN) interference, X, and broadcast channels.
We start by a one-to-many network, namely, the three-user multiple-input multiple-output (MIMO) Gaussian broadcast channel, where we assume that the transmitter obtains the channel state information (CSI) through feedback links after a finite delay. We also assume that the feedback delay is greater than the channel coherence time, and thus, the CSI expires prior to being exploited by the transmitter for its current transmission. Nevertheless, we show that this delayed CSI at the transmitter (delayed CSIT) can help the transmitter to achieve significantly higher data rates compared to having no CSI. We indeed show that delayed CSIT increases the channel degrees of freedom (DoF), which is translated to an unbounded increase in capacity with increasing signal-to-noise-ratio (SNR). For the symmetric case, i.e. with the same number of antennas at each receiver, we propose different transmission schemes whose achievable DoFs meet the upper bound for a wide range of transmit-receive antenna ratios. Also, for the general non-symmetric case, we propose transmission schemes that characterize the DoF region for certain classes of antenna configurations.
Subsequently, we investigate channels with distributed transmitters, namely, Gaussian single-input single-output (SISO) K-user interference channel and 2×K X channel under the delayed CSIT assumption. In these channels, in major contrast to the broadcast channel, each transmitter has access only to its own messages. We propose novel multiphase transmission schemes wherein the transmitters collaboratively align the past interference at appropriate receivers using the knowledge of past CSI. Our achievable DoFs are greater than one (which is the channel DoF without CSIT), and strictly increasing in K. Our results are yet the best available reported DoFs for these channels with delayed CSIT. Furthermore, we consider the K-user r-cyclic interference channel, where each transmitter causes interference on only r receivers in a cyclic manner. By developing a new upper bound, we show that this channel has K/r DoF with no CSIT. Moreover, by generalizing our multiphase transmission ideas, we show that, for r=3, this channel can achieve strictly greater than K/3 DoF with delayed CSIT.
Next, we add the capability of simultaneous transmission and reception, i.e. full-duplex operation, to the transmitters, and investigate its impact on the DoF of the SISO Gaussian K-user interference and M×K X channel under the delayed CSIT assumption. By proposing new cooperation/alignment techniques, we show that the full-duplex transmitter cooperation can potentially yield DoF gains in both channels with delayed CSIT. This is in sharp contrast to the previous results on these channels indicating the inability of full-duplex transmitter cooperation to increase the channel DoF with either perfect instantaneous CSIT or no CSIT. With the recent technological advances in implementation of full-duplex communication, it is expected to play a crucial role in the future wireless systems.
Finally, we consider the Gaussian K-user interference and K×K X channel with output feedback, wherein each transmitter causally accesses the output of its paired receiver. First, using the output feedback and under no CSIT assumption, we show that both channels can achieve DoF values greater than one, strictly increasing in K, and approaching the limiting value of 2 as K→∞. Then, we develop transmission schemes for the same channels with both output feedback and delayed CSIT, known as Shannon feedback. Our achievable DoFs with Shannon feedback are greater than those with the output feedback for almost all values of K.
|
24 |
Feedback and Cooperation in Wireless NetworksAbdoli Hoseinabadi, Mohammad Javad January 2012 (has links)
The demand for wireless data services has been dramatically growing over the last decade. This growth has been accompanied by a significant increase in the number of users sharing the same wireless medium, and as a result, interference management has become a hot topic of research in recent years. In this dissertation, we investigate feedback and transmitter cooperation as two closely related tools to manage the interference and achieve high data rates in several wireless networks, focusing on additive white Gaussian noise (AWGN) interference, X, and broadcast channels.
We start by a one-to-many network, namely, the three-user multiple-input multiple-output (MIMO) Gaussian broadcast channel, where we assume that the transmitter obtains the channel state information (CSI) through feedback links after a finite delay. We also assume that the feedback delay is greater than the channel coherence time, and thus, the CSI expires prior to being exploited by the transmitter for its current transmission. Nevertheless, we show that this delayed CSI at the transmitter (delayed CSIT) can help the transmitter to achieve significantly higher data rates compared to having no CSI. We indeed show that delayed CSIT increases the channel degrees of freedom (DoF), which is translated to an unbounded increase in capacity with increasing signal-to-noise-ratio (SNR). For the symmetric case, i.e. with the same number of antennas at each receiver, we propose different transmission schemes whose achievable DoFs meet the upper bound for a wide range of transmit-receive antenna ratios. Also, for the general non-symmetric case, we propose transmission schemes that characterize the DoF region for certain classes of antenna configurations.
Subsequently, we investigate channels with distributed transmitters, namely, Gaussian single-input single-output (SISO) K-user interference channel and 2×K X channel under the delayed CSIT assumption. In these channels, in major contrast to the broadcast channel, each transmitter has access only to its own messages. We propose novel multiphase transmission schemes wherein the transmitters collaboratively align the past interference at appropriate receivers using the knowledge of past CSI. Our achievable DoFs are greater than one (which is the channel DoF without CSIT), and strictly increasing in K. Our results are yet the best available reported DoFs for these channels with delayed CSIT. Furthermore, we consider the K-user r-cyclic interference channel, where each transmitter causes interference on only r receivers in a cyclic manner. By developing a new upper bound, we show that this channel has K/r DoF with no CSIT. Moreover, by generalizing our multiphase transmission ideas, we show that, for r=3, this channel can achieve strictly greater than K/3 DoF with delayed CSIT.
Next, we add the capability of simultaneous transmission and reception, i.e. full-duplex operation, to the transmitters, and investigate its impact on the DoF of the SISO Gaussian K-user interference and M×K X channel under the delayed CSIT assumption. By proposing new cooperation/alignment techniques, we show that the full-duplex transmitter cooperation can potentially yield DoF gains in both channels with delayed CSIT. This is in sharp contrast to the previous results on these channels indicating the inability of full-duplex transmitter cooperation to increase the channel DoF with either perfect instantaneous CSIT or no CSIT. With the recent technological advances in implementation of full-duplex communication, it is expected to play a crucial role in the future wireless systems.
Finally, we consider the Gaussian K-user interference and K×K X channel with output feedback, wherein each transmitter causally accesses the output of its paired receiver. First, using the output feedback and under no CSIT assumption, we show that both channels can achieve DoF values greater than one, strictly increasing in K, and approaching the limiting value of 2 as K→∞. Then, we develop transmission schemes for the same channels with both output feedback and delayed CSIT, known as Shannon feedback. Our achievable DoFs with Shannon feedback are greater than those with the output feedback for almost all values of K.
|
25 |
Contribuições para regulamentação da tecnologia PLC no Brasil com base em testes de campo / Contributions to regulation of PLC technology in Brazil based on trial testMARQUES, Fabio da Silva 27 February 2009 (has links)
Made available in DSpace on 2014-07-29T15:08:21Z (GMT). No. of bitstreams: 1
dissertacao fabio eec.pdf: 1006220 bytes, checksum: 43033f339ebf19cc211f32332aca4110 (MD5)
Previous issue date: 2009-02-27 / This work describes the data transmission technology called PLC (Power Line
Communications) that demanded discussions in order to assess the potential for interference in
services currently in operation and using radio frequency in the range of 1,705MHz to 30MHz
The equipment used in this type of technology, and its principle of operation principle based
on the field trials in indoor and outdoor environments are described. It is presented in this
paper a case study about the influence caused in carrying on a network PLC because of
electromagnetic interference. It was possible determining the noise influence from electricelectronic
equipment in the performance of a network PLC and what types of equipment are
more harmful to the communication. Finally some suggestions are pointing, as the use of
mitigation techniques which technology has greatest potential for success by contributing to
the regulation and standardization in Brazil / Este trabalho descreve a tecnologia de transmissão de dados denominada PLC
(Power Line Communications), que tem demandado discussões no sentido de se avaliar o
potencial de interferência nos serviços atualmente em operação e que utilizam
radiofreqüências na faixa de 1,705MHz a 30MHz. São descritos os equipamentos utilizados
nesse tipo de tecnologia, bem como seu princípio de funcionamento baseados em testes de
campo em ambientes internos e externos. Também é apresentado neste trabalho um estudo de
caso acerca da influência causada no desempenho em uma rede PLC em virtude de
interferências eletromagnéticas. Assim, foi possível determinar a influência de ruídos oriundos
de equipamentos eletro-eletrônicos no desempenho de uma rede PLC e quais tipos de
equipamentos são mais prejudiciais à comunicação, e finalmente apontar possíveis sugestões
como o uso de técnicas de mitigação em que a tecnologia tem maior potencial de sucesso
contribuindo para a regulamentação e padronização no Brasil
|
26 |
Key Agreement over Wiretap Models with Non-Causal Side InformationZibaeenejad, Ali January 2012 (has links)
The security of information is an indispensable element of a communication system when transmitted signals are vulnerable to eavesdropping. This issue is a challenging problem in a wireless network as propagated signals can be easily captured by unauthorized receivers, and so achieving a perfectly secure communication is a desire in such a wiretap channel. On the other hand, cryptographic algorithms usually lack to attain this goal due to the following restrictive assumptions made for their design. First, wiretappers basically have limited computational power and time. Second, each authorized party has often access to a reasonably large sequence of uniform random bits concealed from wiretappers.
To guarantee the security of information, Information Theory (IT) offers the following two approaches based on physical-layer security.
First, IT suggests using wiretap (block) codes to securely and reliably transmit messages over a noisy wiretap channel. No confidential common key is usually required for the wiretap codes. The secrecy problem investigates an optimum wiretap code that achieves the secrecy capacity of a given wiretap channel.
Second, IT introduces key agreement (block) codes to exchange keys between legitimate parties over a wiretap model. The agreed keys are to be reliable, secure, and (uniformly) random, at least in an asymptotic sense, such that they can be finally employed in symmetric key cryptography for data transmission. The key agreement problem investigates an optimum key agreement code that obtains the key capacity of a given wiretap model.
In this thesis, we study the key agreement problem for two wiretap models: a Discrete Memoryless (DM) model and a Gaussian model. Each model consists of a wiretap channel
paralleled with an authenticated public channel. The wiretap channel is from a transmitter, called Alice, to an authorized receiver, called Bob, and to a wiretapper, called Eve. The Probability Transition Function (PTF) of the wiretap channel is controlled by a random sequence of Channel State Information (CSI), which is assumed to be non-causally available at Alice. The capacity of the public channel is C_P₁∈[0,∞) in the forward direction from Alice to Bob and C_P₂∈[0,∞) in the backward direction from Bob to Alice. For each model, the key capacity as a function of the pair (C_P₁, C_P₂) is denoted by C_K(C_P₁, C_P₂). We investigate the forward key capacity of each model, i.e., C_K(C_P₁, 0) in this thesis. We also study the key generation over the Gaussian model when Eve's channel is less noisy than Bob's.
In the DM model, the wiretap channel is a Discrete Memoryless State-dependent Wiretap Channel (DM-SWC) in which Bob and Eve each may also have access to a sequence of Side Information (SI) dependent on the CSI. We establish a Lower Bound (LB) and an Upper Bound (UB) on the forward key capacity of the DM model. When the model is less noisy in Bob's favor, another UB on the forward key capacity is derived. The achievable key agreement code is asymptotically optimum as C_P₁→ ∞. For any given DM model, there also exists a finite capacity C⁰_P₁, which is determined by the DM-SWC, such that the forward key capacity is achievable if C_P₁≥ C⁰_P₁. Moreover, the key generation is saturated at capacity C_P₁= C⁰_P₁, and thus increasing the public channel capacity beyond C⁰_P₁ makes no improvement on the forward key capacity of the DM model. If the CSI is fully known at Bob in addition to Alice, C⁰_P₁=0, and so the public channel has no contribution in key generation when the public channel is in the forward direction.
The achievable key agreement code of the DM model exploits both a random generator and the CSI as resources for key generation at Alice. The randomness property of channel states can be employed for key generation, and so the agreed keys depend on the CSI in general. However, a message is independent of the CSI in a secrecy problem. Hence, we justify that the forward key capacity can exceed both the main channel capacity and the secrecy capacity of the DM-SWC.
In the Gaussian model, the wiretap channel is a Gaussian State-dependent Wiretap Channel (G-SWC) with Additive White Gaussian Interference (AWGI) having average power Λ. For simplicity, no side information is assumed at Bob and Eve.
Bob's channel and Eve's channel suffer from Additive White Gaussian Noise (AWGN), where the correlation coefficient between noise of Bob's channel and that of Eve's channel is given by ϱ.
We prove that the forward key capacity of the Gaussian model is independent of ϱ. Moreover, we establish that the forward key capacity is positive unless Eve's channel is less noisy than Bob's. We also prove that the key capacity of the Gaussian model vanishes if the G-SWC is physically degraded in Eve's favor. However, we justify that obtaining a positive key capacity is feasible even if Eve's channel is less noisy than Bob's according to our achieved LB on the key capacity for case (C_P₁, C_P₂)→ (∞, ∞). Hence, the key capacity of the Gaussian model is a function of ϱ.
In this thesis, an LB on the forward key capacity of the Gaussian model is achieved. For a fixed Λ, the achievable key agreement code is optimum for any C_P₁∈[0,∞) in both low Signal-to-Interference Ratio (SIR) and high SIR regimes. We show that the forward key capacity is asymptotically independent of C_P₁ and Λ as the SIR goes to infinity, and thus the public channel and the interference have negligible contributions in key generation in the high SIR regime. On the other hand, the forward key capacity is a function of C_P₁ and Λ in the low SIR regime. Contributions of the interference and the public channel in key generation are significant in the low SIR regime that will be illustrated by simulations.
The proposed key agreement code asymptotically achieves the forward key capacity of the Gaussian model for any SIR as C_P₁→ ∞. Hence, C_K(∞,0) is calculated, and it is suggested as a UB on C_K(C_P₁,0). Using simulations, we also compute the minimum required C_P₁ for which the forward key capacity is upper bounded within a given tolerance.
The achievable key agreement code is designed based on a generalized version of the Dirty Paper Coding (DPC) in which transmitted signals are correlated with the CSI. The correlation coefficient is to be determined by C_P₁. In contrast to the DM model, the LB on the forward key capacity of a Gaussian model is a strictly increasing function of C_P₁ according to our simulations. This fact is an essential difference between this model and the DM model.
For C_P₁=0 and a fixed Λ, the forward key capacity of the Gaussian model exceeds the main channel capacity of the G-SWC in the low SIR regime. By simulations, we show that the interference enhances key generation in the low SIR regime. In this regime, we also justify that the positive effect of the interference on the (forward) key capacity is generally more than its positive effect on the secrecy capacity of the G-SWC, while the interference has no influence on the main channel capacity of the G-SWC.
|
27 |
Coordinated Beamforming and Common Message Decoding for Intercell Interference Mitigation in Multicell NetworksDahrouj, Hayssam 15 February 2011 (has links)
Conventional multicell wireless systems operate with out-of-cell interference treated as background noise; consequently, their performance faces two major limitations: 1)Signal processing is performed on a per-cell basis; and 2)Intercell interference detection is infeasible as intercell interference, although significantly above the noise level, is typically quite weak. In this thesis, we consider a multicell downlink scenario, where base-stations are equipped with multiple transmit antennas, the remote users are equipped with a single antenna, and multiple remote users are active simultaneously via spatial division multiplexing. We propose solutions for the above limitations by considering techniques for mitigating interference.
The first part of the thesis proposes solutions for the first limitation. It considers the benefit of coordinating base-stations across multiple cells, where
multiple base-stations may jointly optimize their respective beamformers to improve the overall system performance. It focuses on the design criteria of minimizing either the total weighted transmitted power or the maximum per-antenna power across the base-stations subject to signal-to-interference-and-noise-ratio (SINR) constraints at the remote users. The main contribution of this part is an efficient algorithm for finding the joint globally optimal beamformers across all base-stations. The proposed algorithm is based on a generalization of uplink-downlink duality to the multicell setting using the Lagrangian duality theory. An important feature is that it naturally leads to a distributed implementation in time-division duplex (TDD) systems. Simulation results suggest that coordinating the beamforming vectors alone already provides appreciable performance improvements as compared to the conventional per-cell optimized network.
The second part of the thesis considers the transmission of both private and common messages for the sole purpose of intercell
interference mitigation. It solves the issues of the second limitation mentioned above. It considers the benefit of designing
decodable interference signals by allowing common-private message splitting at the transmitter and common message decoding by users in adjacent cells. It solves a network optimization problem of jointly determining the appropriate users in adjacent cells for
rate splitting, the optimal beamforming vectors for both common and private messages, and the optimal common-private rates to minimize the total transmit power across the base-stations subject to service rate requirements for remote users. Observe that for fixed user selection and fixed common-private rate splitting, the optimization of beamforming vectors can be performed using a semidefinite programming approach. Further, this part of the thesis proposes a heuristic user-selection and rate splitting strategy to maximize the benefit of common message decoding. This part proposes a heuristic algorithm to characterize the improvement in the feasible rates with common-message decoding. Simulation results show that common message decoding can significantly improve both the total transmit power and the feasibility region for cell-edge users when base-stations are closely spaced from each other.
|
28 |
Coordinated Beamforming and Common Message Decoding for Intercell Interference Mitigation in Multicell NetworksDahrouj, Hayssam 15 February 2011 (has links)
Conventional multicell wireless systems operate with out-of-cell interference treated as background noise; consequently, their performance faces two major limitations: 1)Signal processing is performed on a per-cell basis; and 2)Intercell interference detection is infeasible as intercell interference, although significantly above the noise level, is typically quite weak. In this thesis, we consider a multicell downlink scenario, where base-stations are equipped with multiple transmit antennas, the remote users are equipped with a single antenna, and multiple remote users are active simultaneously via spatial division multiplexing. We propose solutions for the above limitations by considering techniques for mitigating interference.
The first part of the thesis proposes solutions for the first limitation. It considers the benefit of coordinating base-stations across multiple cells, where
multiple base-stations may jointly optimize their respective beamformers to improve the overall system performance. It focuses on the design criteria of minimizing either the total weighted transmitted power or the maximum per-antenna power across the base-stations subject to signal-to-interference-and-noise-ratio (SINR) constraints at the remote users. The main contribution of this part is an efficient algorithm for finding the joint globally optimal beamformers across all base-stations. The proposed algorithm is based on a generalization of uplink-downlink duality to the multicell setting using the Lagrangian duality theory. An important feature is that it naturally leads to a distributed implementation in time-division duplex (TDD) systems. Simulation results suggest that coordinating the beamforming vectors alone already provides appreciable performance improvements as compared to the conventional per-cell optimized network.
The second part of the thesis considers the transmission of both private and common messages for the sole purpose of intercell
interference mitigation. It solves the issues of the second limitation mentioned above. It considers the benefit of designing
decodable interference signals by allowing common-private message splitting at the transmitter and common message decoding by users in adjacent cells. It solves a network optimization problem of jointly determining the appropriate users in adjacent cells for
rate splitting, the optimal beamforming vectors for both common and private messages, and the optimal common-private rates to minimize the total transmit power across the base-stations subject to service rate requirements for remote users. Observe that for fixed user selection and fixed common-private rate splitting, the optimization of beamforming vectors can be performed using a semidefinite programming approach. Further, this part of the thesis proposes a heuristic user-selection and rate splitting strategy to maximize the benefit of common message decoding. This part proposes a heuristic algorithm to characterize the improvement in the feasible rates with common-message decoding. Simulation results show that common message decoding can significantly improve both the total transmit power and the feasibility region for cell-edge users when base-stations are closely spaced from each other.
|
29 |
A Physical Channel Model And Analysis Of Nanoscale Neuro-spike CommunicationBalevi, Eren 01 August 2010 (has links) (PDF)
Nanoscale communication is appealing domain in nanotechnology. There are many
existing nanoscale communication methods. In addition to these, novel techniques
can be derived depending on the naturally existing phenomena such as molecular
communication. It uses molecules as an information carrier such as molecular motors,
pheromones and neurotransmitters for neuro-spike communication. Among them,
neuro-spike communication is a vastly unexplored area. The ultimate goal of this
thesis is to accurately investigate it by obtaining a realistic physical channel model.
This model can be exploited in different disciplines. Furthermore, the model can help
designing novel artificial nanoscale communication paradigms. The modeled channel
is analyzed regarding the error probability of detecting spikes depending on channel
parameters. Moreover, channel delay is characterized and information theoretical
analysis of packet release mechanism in the channel is performed.
The modeled channel is extended to multi-input single output terminal. In this case,
input neurons can simultaneously send information through the same synapse leading to interference. However, there is an interference repressing technique in these
synapses called automatic gain control. It decreases the interference level observed
on weaker signal. The first aim for this case is to define the interference channel at
synapse having automatic gain control. The second aim is to analyze the achievable
rate region of this channel. The analysis shows that gain control mechanism prevents
the decrease in achievable rate region because of the weaker signal. Moreover, power,
firing rate and number of stronger inputs do not affect the achievable rate region.
|
30 |
Designing MIMO interference alignment networksNosrat Makouei, Behrang 25 October 2012 (has links)
Wireless networks are increasingly interference-limited, which motivates the development of sophisticated interference management techniques. One recently discovered approach is interference alignment, which attains the maximum sum rate scaling (with signal-to-noise ratio) in many network configurations. Interference alignment is not yet well understood from an engineering perspective. Such design considerations include (i) partial rather than complete knowledge of channel state information, (ii) correlated channels, (iii) bursty packet-based network traffic that requires the frequent setup and tear down of sessions, and (iv) the spatial distribution and interaction of transmit/receive pairs. This dissertation aims to establish the benefits and limitations of interference alignment under these four considerations.
The first contribution of this dissertation considers an isolated group of transmit/receiver pairs (a cluster) cooperating through interference alignment and derives the signal-to-interference-plus-noise ratio distribution at each receiver for each stream. This distribution is used to compare interference alignment to beamforming and spatial multiplexing (as examples of common transmission techniques) in terms of sum rate to identify potential switching points between them. This dissertation identifies such switching points and provides design recommendations based on severity of the correlation or the channel state information uncertainty.
The second contribution considers transmitters that are not associated with any interference alignment cooperating group but want to use the channel. The goal is to retain the benefits of interference alignment amid interference from the out-of-cluster transmitters. This dissertation shows that when the out-of-cluster transmitters have enough antennas, they can access the channel without changing the performance of the interference alignment receivers. Furthermore, optimum transmit filters maximizing the sum rate of the out-of-cluster transmit/receive pairs are derived. When insufficient antennas exist at the out-of-cluster transmitters, several transmit filters that trade off complexity and sum rate performance are presented.
The last contribution, in contrast to the first two, takes into account the impact of large scale fading and the spatial distribution of the transmit/receive pairs on interference alignment by deriving the transmission capacity in a decentralized clustered interference alignment network. Channel state information uncertainty and feedback overhead are considered and the optimum training period is derived. Transmission capacity of interference alignment is compared to spatial multiplexing to highlight the tradeoff between channel estimation accuracy and the inter-cluster interference; the closer the nodes to each other, the higher the channel estimation accuracy and the inter-cluster interference. / text
|
Page generated in 0.0906 seconds