200 results
Search Results
42. High SNR performance of amplify-and-forward relaying in Rayleigh fading wiretap channels
- Abstract
This paper investigates amplify-and-forward (AF) relaying for secrecy in quasi-static Rayleigh fading channels. We consider a four-node network where a helping node intends to enhance secrecy of the transmission between the source and the destination in presence of a passive eavesdropper. In this scenario, the common assumption of full CSI on the eavesdropper's channels is not realistic, and thus, we study the performance of cooperation from an outage perspective. Starting from the secrecy outage probability, we introduce a novel measure, the conditional secrecy outage probability to analyze the performance of AF. In particular, we derive closed-form expressions for AF for these two secrecy measures under a high SNR assumption. Moreover, we use numerical examples to illustrate our results and to characterize the effect of the nodes' geometry. We also show numerically how AF improves the secrecy performance in comparison to direct transmission in terms of outage probability and secure throughput., QC 20131112
- Published
- 2013
- Full Text
- View/download PDF
43. Analytical model of proportional fair scheduling in interference-limited OFDMA/LTE networks
- Abstract
Various system tasks like interference coordination, handover decisions, admission control etc. in upcoming cellular networks require precise mid-term (spanning over a few seconds) performance models. Due to channel-dependent scheduling at the base station, these performance models are not simple to obtain. Furthermore, upcoming cellular systems will be interference-limited, hence, the way interference is modeled is crucial for the accuracy. In this paper we present an analytical model for the SINR distribution of the scheduled subcarriers of an OFDMA system with proportional fair scheduling. The model takes the precise SINR distribution into account. We furthermore refine our model with respect to uniform modulation and coding, as applied in LTE networks. The derived models are validated by means of simulations. In additon, we show that our models are approximate estimators for the performance of rate-based proportional fair scheduling, while they outperform some simpler prediction models from related work significantly., QC 20140102
- Published
- 2013
- Full Text
- View/download PDF
44. Analytical model of proportional fair scheduling in interference-limited OFDMA/LTE networks
- Abstract
Various system tasks like interference coordination, handover decisions, admission control etc. in upcoming cellular networks require precise mid-term (spanning over a few seconds) performance models. Due to channel-dependent scheduling at the base station, these performance models are not simple to obtain. Furthermore, upcoming cellular systems will be interference-limited, hence, the way interference is modeled is crucial for the accuracy. In this paper we present an analytical model for the SINR distribution of the scheduled subcarriers of an OFDMA system with proportional fair scheduling. The model takes the precise SINR distribution into account. We furthermore refine our model with respect to uniform modulation and coding, as applied in LTE networks. The derived models are validated by means of simulations. In additon, we show that our models are approximate estimators for the performance of rate-based proportional fair scheduling, while they outperform some simpler prediction models from related work significantly., QC 20140102
- Published
- 2013
- Full Text
- View/download PDF
45. Analytical model of proportional fair scheduling in interference-limited OFDMA/LTE networks
- Abstract
Various system tasks like interference coordination, handover decisions, admission control etc. in upcoming cellular networks require precise mid-term (spanning over a few seconds) performance models. Due to channel-dependent scheduling at the base station, these performance models are not simple to obtain. Furthermore, upcoming cellular systems will be interference-limited, hence, the way interference is modeled is crucial for the accuracy. In this paper we present an analytical model for the SINR distribution of the scheduled subcarriers of an OFDMA system with proportional fair scheduling. The model takes the precise SINR distribution into account. We furthermore refine our model with respect to uniform modulation and coding, as applied in LTE networks. The derived models are validated by means of simulations. In additon, we show that our models are approximate estimators for the performance of rate-based proportional fair scheduling, while they outperform some simpler prediction models from related work significantly., QC 20140102
- Published
- 2013
- Full Text
- View/download PDF
46. Analytical model of proportional fair scheduling in interference-limited OFDMA/LTE networks
- Abstract
Various system tasks like interference coordination, handover decisions, admission control etc. in upcoming cellular networks require precise mid-term (spanning over a few seconds) performance models. Due to channel-dependent scheduling at the base station, these performance models are not simple to obtain. Furthermore, upcoming cellular systems will be interference-limited, hence, the way interference is modeled is crucial for the accuracy. In this paper we present an analytical model for the SINR distribution of the scheduled subcarriers of an OFDMA system with proportional fair scheduling. The model takes the precise SINR distribution into account. We furthermore refine our model with respect to uniform modulation and coding, as applied in LTE networks. The derived models are validated by means of simulations. In additon, we show that our models are approximate estimators for the performance of rate-based proportional fair scheduling, while they outperform some simpler prediction models from related work significantly., QC 20140102
- Published
- 2013
- Full Text
- View/download PDF
47. On selection of search space dimension in compressive sampling matching pursuit
- Abstract
Compressive Sampling Matching Pursuit (CoSaMP) is one of the popular greedy methods in the emerging field of Compressed Sensing (CS). In addition to the appealing empirical performance, CoSaMP has also splendid theoretical guarantees for convergence. In this paper, we propose a modification in CoSaMP to adaptively choose the dimension of search space in each iteration, using a threshold based approach. Using Monte Carlo simulations, we show that this modification improves the reconstruction capability of the CoSaMP algorithm in clean as well as noisy measurement cases. From empirical observations, we also propose an optimum value for the threshold to use in applications., QC 20130226
- Published
- 2012
- Full Text
- View/download PDF
48. Subspace pursuit embedded in orthogonal matching pursuit
- Abstract
Orthogonal Matching Pursuit (OMP) is a popular greedy pursuit algorithm widely used for sparse signal recovery from an undersampled measurement system. However, one of the main shortcomings of OMP is its irreversible selection procedure of columns of measurement matrix. i.e., OMP does not allow removal of the columns wrongly estimated in any of the previous iterations. In this paper, we propose a modification in OMP, using the well known Subspace Pursuit (SP), to refine the subspace estimated by OMP at any iteration and hence boost the sparse signal recovery performance of OMP. Using simulations we show that the proposed scheme improves the performance of OMP in clean and noisy measurement cases., QC 20130226
- Published
- 2012
- Full Text
- View/download PDF
49. Cooperation for Secure Broadcasting in Cognitive Radio Networks
- Abstract
This paper explores the trade-off between cooperation and secrecy in cognitive radio networks. We consider a scenario consisting of a primary and a secondary system. In the simplest case, each system is represented by a pair of transmitter and receiver. We assume a secrecy constraint on the transmission in the sense that the message of the primary transmitter has to be concealed from the secondary receiver. Both situations where the secondary transmitter is aware and unaware of the primary message are investigated and compared. In the first case, the secondary transmitter helps by allocating power for jamming, which increases the secrecy of the first message. In the latter case, it can also act as a relay for the primary message, thus improving the reliability of the primary transmission. Furthermore, we extend our results to the scenario where the secondary system comprises multiple receivers. For each case we present achievable rate regions. We then provide numerical illustrations for these rate regions. Our main result is that, in spite of the secrecy constraint, cooperation is beneficial in terms of the achievable rates. In particular, the secondary system can achieve a significant rate without decreasing the primary rate below the benchmark rate achievable without the help of the secondary transmitter. Finally, we investigate the influence of the distances between users on the system's performance., QC 20121219
- Published
- 2012
- Full Text
- View/download PDF
50. Analysis of Sparse Representations Using Bi-Orthogonal Dictionaries
- Abstract
The sparse representation problem of recovering an N dimensional sparse vector x from M < N linear observations y = Dx given dictionary D is considered. The standard approach is to let the elements of the dictionary be independent and identically distributed (IID) zero-mean Gaussian and minimize the l1-norm of x under the constraint y = Dx. In this paper, the performance of l1-reconstruction is analyzed, when the dictionary is bi-orthogonal D = [O1 O2], where O1, O 2 are independent and drawn uniformly according to the Haar measure on the group of orthogonal M × M matrices. By an application of the replica method, we obtain the critical conditions under which perfect l 1-recovery is possible with bi-orthogonal dictionaries., QC 20130219
- Published
- 2012
- Full Text
- View/download PDF
51. A new inner bound for the interference relay channel
- Abstract
This paper proposes a new coding scheme for the discrete memoryless interference channel with a dedicated relay. The scheme is built upon rate-splitting encoding, layered noisy network coding, and joint decoding. The result is extended to two Gaussian channels. For the Gaussian channel whose relay is connected to the destinations via orthogonal links we indirectly show that the proposed scheme achieves a bounded gap to the capacity region under certain channel conditions. For the Gaussian channel wherein the relay receives and transmits in the same spectral resource with the transmitters the numerical results show that the proposed scheme achieves higher sum rate than other compress-forward-based schemes. This work, together with our previous work [1], shows that noisy network coding can be extended by the well-known rate-splitting technique of the interference channel to achieve a bounded gap to the capacity region of some multi-unicast networks., QC 20121212
- Published
- 2012
- Full Text
- View/download PDF
52. Ground Plane Feature Detection in Mobile Vision-Aided Inertial Navigation
- Abstract
In this paper, a method for determining ground plane features in a sequence of images captured by a mobile camera is presented. The hardware of the mobile system consists of a monocular camera that is mounted on an inertial measurement unit (IMU). An image processing procedure is proposed, first to extract image features and match them across consecutive image frames, and second to detect the ground plane features using a two-step algorithm. In the first step, the planar homography of the ground plane is constructed using an IMU-camera motion estimation approach. The obtained homography constraints are used to detect the most likely ground features in the sequence of images. To reject the remaining outliers, as the second step, a new plane normal vector computation approach is proposed. To obtain the normal vector of the ground plane, only three pairs of corresponding features are used for a general camera transformation. The normal-based computation approach generalizes the existing methods that are developed for specific camera transformations. Experimental results on real data validate the reliability of the proposed method., QC 20121107
- Published
- 2012
- Full Text
- View/download PDF
53. Layered quantize-forward for the two-way relay channel
- Abstract
This paper proposes two new coding schemes for the discretememoryless two-way relay channel. The main target is to show thebenefits of compress-forward without Wyner-Ziv binning and oflayered relaying in networks wherein a relay is to help multipledestinations, that may have unequal channel quality and/or haveaccess to different side information. Numerical results for aGaussian channel show that the new coding schemes outperformvariants of compress-forward relaying and offer a good trade-offbetween achievable rates and complexity and decoding delay. The ideacan also be applied to other relay networks., QC 20121115
- Published
- 2012
- Full Text
- View/download PDF
54. Video coding with adaptive motion-compensated orthogonal transforms
- Abstract
Well-known standard hybrid coding techniques utilize the concept of motion-compensated predictive coding in a closed-loop. The resulting coding dependencies are a major challenge for packet-based networks like the Internet. On the other hand, subband coding techniques avoid the dependencies of predictive coding and are able to generate video streams that better match packet-based networks. An interesting class for subband coding is the so-called motion-compensated orthogonal transform. It generates orthogonal subband coefficients for arbitrary underlying motion fields. In this paper, a theoretical signal model based on Gaussian distributions is discussed to construct a cost function for efficient rate allocation. Additionally, a rate-distortion efficient video coding scheme is developed that takes advantage of motion-compensated orthogonal transforms. The scheme combines multiple types of motion-compensated orthogonal transforms, variable block sizes, and half-pel accurate motion compensation. The experimental results show that this adaptive scheme outperforms individual motion-compensated orthogonal transforms by up to 2 dB., QC 20120807
- Published
- 2012
- Full Text
- View/download PDF
55. On the asymptotic sum-rate of the relay-assisted amplify-and-forward cognitive MIMO channel
- Abstract
This paper studies the asymptotic sum-rate of the primary network within the relay-assisted multi-antenna cognitive radio system performing amplify-and-forward relaying. The achievable sum-rates are derived in the large-system limit by means of the replica method. A closed-form expression for the sum-rate of the primary network is obtained for large antenna arrays as a function of parameters obtained by solving a set of fixed-point equations. Numerical simulations confirm the validity of the results even for systems with only a few antennas at each terminal., QC 20121219
- Published
- 2012
- Full Text
- View/download PDF
56. Linear source coding over rings and applications
- Abstract
This paper studies linear coding (LC) techniques in the setting of computing functions of correlated memoryless sources. Instead of linear mappings over finite fields, we consider using linear mappings over finite rings as encoders. It is shown that generally the region c×R, where c ≥ 1 is a constant and R is the Slepian-Wolf (SW) region, is achievable with LC over ring (LCoR) when the function to compute is the identity function. c = 1 if the ring used is a field. Hence, LCoR could be suboptimal in terms of achieving the best coding rates (the SW region) for computing the identity function. In spite of that, the ring version shows several advantages. It is demonstrated that there exists a function that is neither linear nor can be linearized over any finite field. Thus, LC over field (LCoF) does not apply directly for computing such a function unless the polynomial approach [1], [2] is used. On the contrary, such a function is linear over some ring. Using LCoR, an achievable region containing the SW region can be obtained for computing this function. In addition, the alphabet sizes of the encoders are strictly smaller than using LCoF. More interestingly, LCoF is not useful if some special requirement is imposed., QC 20130104
- Published
- 2012
- Full Text
- View/download PDF
57. Feedback capacity of the bidirectional broadcast channel
- Abstract
This paper shows that feedback does not increase the capacity of the two-receiver discrete memoryless bidirectional broadcast channel., QC 20130118
- Published
- 2012
- Full Text
- View/download PDF
58. FROGS : A serial reversible greedy search algorithm
- Abstract
For compressed sensing, in the framework of greedy search reconstruction algorithms, we introduce the notion of initial support-set. The initial support-set is an estimate given to a reconstruction algorithm to improve the performance of the reconstruction. Furthermore, we classify existing greedy search algorithms as being serial or parallel. Based on this classification and the goal of robustness to errors in the initial support-sets we develop a new greedy search algorithm called FROGS. We end the paper with careful numerical experiments concluding that FROGS perform well compared to existing algorithms (both in terms of performance and execution time) and that it is robust against errors in the initial support-set., QC 20121108
- Published
- 2012
- Full Text
- View/download PDF
59. Ground Plane Feature Detection in Mobile Vision-Aided Inertial Navigation
- Abstract
In this paper, a method for determining ground plane features in a sequence of images captured by a mobile camera is presented. The hardware of the mobile system consists of a monocular camera that is mounted on an inertial measurement unit (IMU). An image processing procedure is proposed, first to extract image features and match them across consecutive image frames, and second to detect the ground plane features using a two-step algorithm. In the first step, the planar homography of the ground plane is constructed using an IMU-camera motion estimation approach. The obtained homography constraints are used to detect the most likely ground features in the sequence of images. To reject the remaining outliers, as the second step, a new plane normal vector computation approach is proposed. To obtain the normal vector of the ground plane, only three pairs of corresponding features are used for a general camera transformation. The normal-based computation approach generalizes the existing methods that are developed for specific camera transformations. Experimental results on real data validate the reliability of the proposed method., QC 20121107
- Published
- 2012
- Full Text
- View/download PDF
60. Ground Plane Feature Detection in Mobile Vision-Aided Inertial Navigation
- Abstract
In this paper, a method for determining ground plane features in a sequence of images captured by a mobile camera is presented. The hardware of the mobile system consists of a monocular camera that is mounted on an inertial measurement unit (IMU). An image processing procedure is proposed, first to extract image features and match them across consecutive image frames, and second to detect the ground plane features using a two-step algorithm. In the first step, the planar homography of the ground plane is constructed using an IMU-camera motion estimation approach. The obtained homography constraints are used to detect the most likely ground features in the sequence of images. To reject the remaining outliers, as the second step, a new plane normal vector computation approach is proposed. To obtain the normal vector of the ground plane, only three pairs of corresponding features are used for a general camera transformation. The normal-based computation approach generalizes the existing methods that are developed for specific camera transformations. Experimental results on real data validate the reliability of the proposed method., QC 20121107
- Published
- 2012
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.