Spelling suggestions: "subject:"date 1region"" "subject:"date 5ªregion""
1 |
Secure Symmetrical Multilevel Diversity CodingLi, Shuo 2012 May 1900 (has links)
Secure symmetrical multilevel diversity coding (S-SMDC) is a source coding problem, where a total of L - N discrete memoryless sources (S1,...,S_L-N) are to be encoded by a total of L encoders. This thesis considers a natural generalization of SMDC to the secure communication setting with an additional eavesdropper. In a general S-SMDC system, a legitimate receiver and an eavesdropper have access to a subset U and A of the encoder outputs, respectively. Which subsets U and A will materialize are unknown a priori at the encoders. No matter which subsets U and A actually occur, the sources (S1,...,Sk) need to be perfectly reconstructable at the legitimate receiver whenever |U| = N +k, and all sources (S1,...,S_L-N) need to be kept perfectly secure from the eavesdropper as long as |A| <= N. A precise characterization of the entire admissible rate region is established via a connection to the problem of secure coding over a three-layer wiretap network and utilizing some properties of basic polyhedral structure of the admissible rate region. Building on this result, it is then shown that superposition coding remains optimal in terms of achieving the minimum sum rate for the general secure SMDC problem.
|
2 |
Optimal Distributed Beamforming for MISO Interference ChannelsQiu, Jiaming 2011 May 1900 (has links)
In this thesis, the problem of quantifying the Pareto optimal boundary of the achievable rate region is considered over multiple-input single-output(MISO)interference channels, where the problem boils down to solving a sequence of convex feasibility problems after certain transformations. The feasibility problem is solved by two new distributed optimal beam forming algorithms, where the first one is to parallelize the computation based on the method of alternating projections, and the second one is to localize the computation based on the method of cyclic projections. Convergence proofs are established for both algorithms.
|
3 |
Characterization of Rate Region and User Removal in Interference Channels with Constrained PowerHajar, Mahdavidoost January 2007 (has links)
Channel sharing is known as a unique solution to satisfy the increasing
demand for the spectral-efficient communication. In the channel
sharing technique, several users concurrently communicate through
a shared wireless medium. In such a scheme, the interference of
users over each other is the main source of impairment. The task
of performance evaluation and signaling design in the presence of
such interference is known as a challenging problem. In this
thesis, a system including $n$ parallel interfering AWGN
transmission paths is considered, where the power of the
transmitters are subject to some upper-bounds. For such a system,
we obtain a closed form for the boundaries of the rate region
based on the Perron-Frobenius eigenvalue of some non-negative
matrices. While the boundary of the rate region for the case of
unconstrained power is a well-established result, this is the
first result for the case of constrained power. This result is
utilized to develop an efficient user removal algorithm for
congested networks. In these networks, it may not be possible for
all users to attain a required Quality of Service (QoS). In this
case, the solution is to remove some of the users from the set of
active ones. The problem of finding the set of removed users with
the minimum cardinality is claimed to be an NP-complete problem. In this thesis, a novel sub-optimal removal
algorithm is proposed, which relies on the derived boundary of the
rate region in the first part of the thesis. Simulation results
show that the proposed algorithm outperforms other known schemes.
|
4 |
Scheduling in omnidirectional relay wireless networksWang, Shuning January 2013 (has links)
The capacity of multiuser wireless network, unclear for many years, has always been a hot research topic. Many different operation schemes and coding techniques have been proposed to enlarge the achievable rate region. And omnidirectional relay scheme is one of them.
This thesis mainly works on the achievable region of the all-source all-cast network with omnidirectional relay scheme. In order to better understand this problem, we first describe the half-duplex model on the one-dimensional and two-dimensional regular networks. And we present an optimal operation scheme for them to have the maximum achievable rate. For the one-dimensional general network, we proposed an achievable region that indicates valued improvement compared to the previous results. In the full-duplex model of the one-dimensional general network, the maximum achievable rate is presented with a simpler proof in comparison with the previous results. In this thesis, we also show some discussions on more general networks.
|
5 |
Characterization of Rate Region and User Removal in Interference Channels with Constrained PowerHajar, Mahdavidoost January 2007 (has links)
Channel sharing is known as a unique solution to satisfy the increasing
demand for the spectral-efficient communication. In the channel
sharing technique, several users concurrently communicate through
a shared wireless medium. In such a scheme, the interference of
users over each other is the main source of impairment. The task
of performance evaluation and signaling design in the presence of
such interference is known as a challenging problem. In this
thesis, a system including $n$ parallel interfering AWGN
transmission paths is considered, where the power of the
transmitters are subject to some upper-bounds. For such a system,
we obtain a closed form for the boundaries of the rate region
based on the Perron-Frobenius eigenvalue of some non-negative
matrices. While the boundary of the rate region for the case of
unconstrained power is a well-established result, this is the
first result for the case of constrained power. This result is
utilized to develop an efficient user removal algorithm for
congested networks. In these networks, it may not be possible for
all users to attain a required Quality of Service (QoS). In this
case, the solution is to remove some of the users from the set of
active ones. The problem of finding the set of removed users with
the minimum cardinality is claimed to be an NP-complete problem. In this thesis, a novel sub-optimal removal
algorithm is proposed, which relies on the derived boundary of the
rate region in the first part of the thesis. Simulation results
show that the proposed algorithm outperforms other known schemes.
|
6 |
Scheduling in omnidirectional relay wireless networksWang, Shuning January 2013 (has links)
The capacity of multiuser wireless network, unclear for many years, has always been a hot research topic. Many different operation schemes and coding techniques have been proposed to enlarge the achievable rate region. And omnidirectional relay scheme is one of them.
This thesis mainly works on the achievable region of the all-source all-cast network with omnidirectional relay scheme. In order to better understand this problem, we first describe the half-duplex model on the one-dimensional and two-dimensional regular networks. And we present an optimal operation scheme for them to have the maximum achievable rate. For the one-dimensional general network, we proposed an achievable region that indicates valued improvement compared to the previous results. In the full-duplex model of the one-dimensional general network, the maximum achievable rate is presented with a simpler proof in comparison with the previous results. In this thesis, we also show some discussions on more general networks.
|
7 |
Efficient Computation of Pareto Optimal Beamforming Vectors for the MISO Interference Channel with Successive Interference CancellationLindblom, Johannes, Karipidis, Eletherios, Larsson, Erik G. January 2013 (has links)
We study the two-user multiple-input single-output (MISO) Gaussian interference channel where the transmitters have perfect channel state information and employ single-stream beamforming. The receivers are capable of performing successive interference cancellation, so when the interfering signal is strong enough, it can be decoded, treating the desired signal as noise, and subtracted from the received signal, before the desired signal is decoded. We propose efficient methods to compute the Pareto-optimal rate points and corresponding beamforming vector pairs, by maximizing the rate of one link given the rate of the other link. We do so by splitting the original problem into four subproblems corresponding to the combinations of the receivers' decoding strategies - either decode the interference or treat it as additive noise. We utilize recently proposed parameterizations of the optimal beamforming vectors to equivalently reformulate each subproblem as a quasi-concave problem, which we solve very efficiently either analytically or via scalar numerical optimization. The computational complexity of the proposed methods is several orders-of-magnitude less than the complexity of the state-of-the-art methods. We use the proposed methods to illustrate the effect of the strength and spatial correlation of the channels on the shape of the rate region.
|
8 |
On Resource Allocation for Communication Systems with Delay and Secrecy ConstraintsBalasubramanian, Anantharaman 2009 December 1900 (has links)
This dissertation studies fundamental limits of modern digital communication
systems in presence/absence of delay and secrecy constraints.
In the first part of this dissertation, we consider a typical time-division wireless
communication system wherein the channel strengths of the wireless users vary with
time with a power constraint at the base station and which is not subject to any
delay constraint. The objective is to allocate resources to the wireless users in an
equitable manner so as to achieve a specific throughput. This problem has been
looked at in different ways by previous researchers. We address this problem by
developing a systematic way of designing scheduling schemes that can achieve any
point on the boundary of the rate region. This allows us to map a desired throughput
to a specific scheduling scheme which can then be used to service the wireless users.
We then propose a simple scheme by which users can cooperate and then show that a
cooperative scheduling scheme enlarges the achievable rate region. A simple iterative
algorithm is proposed to find the resource allocation parameters and the scheduling
scheme for the cooperative system.
In the second part of the dissertation, a downlink time-division wireless sys-
tem that is subject to a delay constraint is studied, and the rate region and optimal
scheduling schemes are derived. The result of this study concludes that the achievable throughput of users decrease as the delay constraint is increased. Next, we consider
a problem motivated by cognitive radio applications which has been proposed as a
means to implement efficient reuse of the licensed spectrum. Previous research on this
topic has focussed largely on obtaining fundamental limits on achievable throughput
from a physical layer perspective. In this dissertation, we study the impact of im-
posing Quality of Service constraints (QoS) on the achievable throughput of users.
The result of this study gives insights on how the cognitive radio system needs to be
operated in the low and high QoS constraint regime.
Finally, the third part of this dissertation is motivated by the need for commu-
nicating information not only reliably, but also in a secure manner. To this end, we
study a source coding problem, wherein multiple sources needs to be communicated
to a receiver with the stipulation that there is no direct channel from the transmitter
to the receiver. However, there are many \agents" that can help carry the information
from the transmitter to the receiver. Depending on the reliability that the transmit-
ter has on each of the agents, information is securely encoded by the transmitter and
given to the agents, which will be subsequently given to the receiver. We study the
overhead that the transmitter has to incur for transmitting the information to the
receiver with the desired level of secrecy. The rate region for this problem is found
and simple achievable schemes are proposed. The main result is that, separate secure
coding of sources is optimal for achieving the sum-rate point for the general case of
the problem and the rate region for simple case of this problem.
|
9 |
Joint Compression and Digital Watermarking: Information-Theoretic Study and Algorithms DevelopmentSun, Wei January 2006 (has links)
In digital watermarking, a watermark is embedded into a covertext in such a way that the resulting watermarked signal is robust to certain distortion caused by either standard data processing in a friendly environment or malicious attacks in an unfriendly environment. The watermarked signal can then be used for different purposes ranging from copyright protection, data authentication,fingerprinting, to information hiding. In this thesis, digital watermarking will be investigated from both an information theoretic viewpoint and a numerical computation viewpoint. <br /><br /> From the information theoretic viewpoint, we first study a new digital watermarking scenario, in which watermarks and covertexts are generated from a joint memoryless watermark and covertext source. The configuration of this scenario is different from that treated in existing digital watermarking works, where watermarks are assumed independent of covertexts. In the case of public watermarking where the covertext is not accessible to the watermark decoder, a necessary and sufficient condition is determined under which the watermark can be fully recovered with high probability at the end of watermark decoding after the watermarked signal is disturbed by a fixed memoryless attack channel. Moreover, by using similar techniques, a combined source coding and Gel'fand-Pinsker channel coding theorem is established, and an open problem proposed recently by Cox et al is solved. Interestingly, from the sufficient and necessary condition we can show that, in light of the correlation between the watermark and covertext, watermarks still can be fully recovered with high probability even if the entropy of the watermark source is strictly above the standard public watermarking capacity. <br /><br /> We then extend the above watermarking scenario to a case of joint compression and watermarking, where the watermark and covertext are correlated, and the watermarked signal has to be further compressed. Given an additional constraint of the compression rate of the watermarked signals, a necessary and sufficient condition is determined again under which the watermark can be fully recovered with high probability at the end of public watermark decoding after the watermarked signal is disturbed by a fixed memoryless attack channel. <br /><br /> The above two joint compression and watermarking models are further investigated under a less stringent environment where the reproduced watermark at the end of decoding is allowed to be within certain distortion of the original watermark. Sufficient conditions are determined in both cases, under which the original watermark can be reproduced with distortion less than a given distortion level after the watermarked signal is disturbed by a fixed memoryless attack channel and the covertext is not available to the watermark decoder. <br /><br /> Watermarking capacities and joint compression and watermarking rate regions are often characterized and/or presented as optimization problems in information theoretic research. However, it does not mean that they can be calculated easily. In this thesis we first derive closed forms of watermarking capacities of private Laplacian watermarking systems with the magnitude-error distortion measure under a fixed additive Laplacian attack and a fixed arbitrary additive attack, respectively. Then, based on the idea of the Blahut-Arimoto algorithm for computing channel capacities and rate distortion functions, two iterative algorithms are proposed for calculating private watermarking capacities and compression and watermarking rate regions of joint compression and private watermarking systems with finite alphabets. Finally, iterative algorithms are developed for calculating public watermarking capacities and compression and watermarking rate regions of joint compression and public watermarking systems with finite alphabets based on the Blahut-Arimoto algorithm and the Shannon's strategy.
|
10 |
Joint Compression and Digital Watermarking: Information-Theoretic Study and Algorithms DevelopmentSun, Wei January 2006 (has links)
In digital watermarking, a watermark is embedded into a covertext in such a way that the resulting watermarked signal is robust to certain distortion caused by either standard data processing in a friendly environment or malicious attacks in an unfriendly environment. The watermarked signal can then be used for different purposes ranging from copyright protection, data authentication,fingerprinting, to information hiding. In this thesis, digital watermarking will be investigated from both an information theoretic viewpoint and a numerical computation viewpoint. <br /><br /> From the information theoretic viewpoint, we first study a new digital watermarking scenario, in which watermarks and covertexts are generated from a joint memoryless watermark and covertext source. The configuration of this scenario is different from that treated in existing digital watermarking works, where watermarks are assumed independent of covertexts. In the case of public watermarking where the covertext is not accessible to the watermark decoder, a necessary and sufficient condition is determined under which the watermark can be fully recovered with high probability at the end of watermark decoding after the watermarked signal is disturbed by a fixed memoryless attack channel. Moreover, by using similar techniques, a combined source coding and Gel'fand-Pinsker channel coding theorem is established, and an open problem proposed recently by Cox et al is solved. Interestingly, from the sufficient and necessary condition we can show that, in light of the correlation between the watermark and covertext, watermarks still can be fully recovered with high probability even if the entropy of the watermark source is strictly above the standard public watermarking capacity. <br /><br /> We then extend the above watermarking scenario to a case of joint compression and watermarking, where the watermark and covertext are correlated, and the watermarked signal has to be further compressed. Given an additional constraint of the compression rate of the watermarked signals, a necessary and sufficient condition is determined again under which the watermark can be fully recovered with high probability at the end of public watermark decoding after the watermarked signal is disturbed by a fixed memoryless attack channel. <br /><br /> The above two joint compression and watermarking models are further investigated under a less stringent environment where the reproduced watermark at the end of decoding is allowed to be within certain distortion of the original watermark. Sufficient conditions are determined in both cases, under which the original watermark can be reproduced with distortion less than a given distortion level after the watermarked signal is disturbed by a fixed memoryless attack channel and the covertext is not available to the watermark decoder. <br /><br /> Watermarking capacities and joint compression and watermarking rate regions are often characterized and/or presented as optimization problems in information theoretic research. However, it does not mean that they can be calculated easily. In this thesis we first derive closed forms of watermarking capacities of private Laplacian watermarking systems with the magnitude-error distortion measure under a fixed additive Laplacian attack and a fixed arbitrary additive attack, respectively. Then, based on the idea of the Blahut-Arimoto algorithm for computing channel capacities and rate distortion functions, two iterative algorithms are proposed for calculating private watermarking capacities and compression and watermarking rate regions of joint compression and private watermarking systems with finite alphabets. Finally, iterative algorithms are developed for calculating public watermarking capacities and compression and watermarking rate regions of joint compression and public watermarking systems with finite alphabets based on the Blahut-Arimoto algorithm and the Shannon's strategy.
|
Page generated in 0.1321 seconds