Secret-Key Sharing Based on Layered Broadcast Coding over Fading Channels
|
|
- Alexander Evans
- 6 years ago
- Views:
Transcription
1 Secret-Key Sharing Based on Layered Broadcast Coding over Fading Channels Xiaojun Tang WINLAB, Rutgers University Ruoheng Liu Princeton University Predrag Spasojević WINLAB, Rutgers University H. Vincent Poor Princeton University Abstract A secret-key sharing strategy based on layered broadcast coding is introduced for slow fading channels. In the odel considered, Alice wants to share a key with Bob while keeping the key secret fro a passive eavesdropper, Eve. Both Alice-Bob and Alice-Eve channels are assued to undergo slow fading, and perfect channel state inforation CSI is assued to be known only at the receivers during the transission. Layered coding facilitates adapting the reliably decoded rate at Bob to the actual channel state without CSI available at Alice. The index of a reliably decoded layer is sent back to Alice via a public and error-free channel, which is exploited by Alice and Bob to generate the secret key. In this paper, the secrecy key rate is derived. In addition, the optial power distribution over coded layers is characterized. It is shown that layered coding can increase the secrecy key rate significantly copared with single-level coding. I. INTRODUCTION Wireless secrecy has attracted considerable research interest due to the concern that wireless counication is highly vulnerable to security attacks, particularly eavesdropping attacks. Much recent research was otivated by Wyner s wire-tap channel odel [1 where the transission between two legitiate users Alice and Bob is eavesdropped upon by Eve via a degraded channel. The secrecy level in this odel is easured by the equivocation rate at Eve. Wyner showed that secret counication is possible without sharing a secret-key between legitiate users. Later, Csiszár and Körner generalized Wyner s odel to consider general broadcast channels in [2. Interestingly, the wireless ediu provides its own endowents that facilitate defending against eavesdropping. One such endowent is fading [3, whose effects on secret transission has been studied in [4 [6. In these works, assuing that all counicating parties have perfect channel state inforation CSI prior to transission, the ergodic secrecy capacity has been derived. The ergodic scenario in which Alice has no CSI about Eve s channel but knows the channel statistics has also been studied in [4. When Alice does not know any prior CSI except channel statistics, but can receive 1-bit of autoatic repeat request ARQ feedback per channel coherence interval fro Bob reliably, the throughput of several secure hybrid-arq protocols has been derived in [7. The work was supported by the National Science Foundation under Grants CNS , CCF and CCF Arguably, the ost useful application of keyless secret essage transission is secret-key sharing as discussed in [8, [9 and other related works, although there exist soe fundaental differences between these two probles. Roughly speaking, in secret essage transission, the essage is known to Alice before starting the transission; while in secret-key sharing, the key a secret essage to be shared by Alice and Bob can be established and becoe known to Alice after the transission is copleted. In this paper, we consider a key-sharing proble in which Alice wants to share a key with Bob while keeping it secret fro Eve. Alice-Bob and Alice-Eve channels are assued to undergo slow fading, and CSI is assued known only at the receivers during the transission. The key-sharing schee consists of a counication phase and a keygeneration phase. The counication phase is based on Gaussian layered broadcast coding. The index of a reliably decoded layer at Bob is sent back to Alice through a public and error-free channel. The key-generation phase is based on the layer index and follows Wyner s secrecy binning schee [1. We derive the secrecy key rate and also characterize the optial power distribution over coded layers. Interestingly, layered broadcast coding creates interference, where the undecodable layers for Bob play the role of self-interference. We show that the best Eve can do is to treat the interference as noise as Bob does, and therefore cannot benefit fro the structure of the interference either. There are several closely related works. Layered coding over slowly fading single-input single-output SISO channels was originally introduced by Shaai in [1 and discussed in ore detail in [11. The results in this paper are consistent with [1 and [11 if the additional secrecy constraint is disregarded. An ARQ-based secret-key sharing schee was studied in [12, where single-level coding is used. The schee can be viewed as a special case of the proposed layered-coding schee. Finally, the proble of secret counication over a ediu with interference was discussed in [13 for a ore general but non-fading setting. II. SYSTEM MODEL As depicted in Fig. 1, we consider a three-terinal odel, in which Alice and Bob want to share a secret key in the presence of Eve a passive eavesdropper.
2 Alice W X h 1,, v 1, v 2, Y 1, Y 2, K Bob Wˆ Eve H W { Y 2 },{ K },{ h2,, Fig. 1. Alice and Bob want to agree on a key W = Ŵ, while keeping the key secret fro Eve HW Y 2, H 2, K/n. A. Channel Model The Alice-Bob and Alice-Eve channels undergo block fading, in which the channel gains are constant within a block while varying independently fro block to block [3. We assue that each block is associated with a tie slot of duration T and bandwidth W ; that is, n 1 = 2W T real sybols can be sent in each slot. We also assue that the nuber of channel uses within each slot i.e., n 1 is large enough to allow for the invocation of rando coding arguents. In a certain tie slot indexed by, Alice sends x, which is a vector of n 1 real sybols. Bob receives y 1, through the channel gain h 1, and Eve receives y 2, through the channel gain,. A discrete tie basebandequivalent block-fading channel odel can be expressed as y t, = h t, x + z t, 1 for t = 1, 2, where {z t, } are independent and identically distributed i.i.d. circularly syetric coplex Gaussian N, 1 rando sequences. Without any confusion, we drop the index and denote h t as a rando channel realization. We assue that it is a real rando variables with a probability density function PDF f t and a cuulative distribution function CDF F t, for each t = 1, 2. Furtherore, we assue a short ter power constraint excluding power variation across tie slots such that the average power of the signal x per slot has the constraint that E[ x 2 n 1 P for every. There exists an error-free feedback channel fro Bob to Alice, through which Bob sends back k for tie slot. The feedback channel is assued to be public, and therefore k is obtained by both Alice and Eve without any error. B. Secret Key Sharing Protocol The secret-key sharing protocol consists of two phases: a counication phase and a key-generation phase. 1 Counication Phase: We assue that the transission during the counication phase takes place over M tie slots. That is, Alice sends a sequence of signals x = [x 1, x 2,..., x M to the channel. Accordingly, Bob receives fro his channel a sequence of signals denoted by y 1 = [y 1,1, y 1,2,..., y 1,M and Eve receives y 2 = } [y 2,1, y 2,2,..., y 2,M fro her channel. We let n = Mn 1 denote the nuber of sybols sent by Alice in the counication phase. Let h 1 = [h 1,1,..., h 1,M and = [,1,...,,M denote vectors whose eleents are the power gains of the Alice-Bob and Alice-Eve channels, respectively. We assue that Bob and Eve know their own channel gains perfectly; Alice does not know the CSI before its transission, except for the channel statistics. After the counication, Bob uses the feedback channel to send k = [k 1,..., k M, which is obtained by both Alice and Eve. 2 Key-Generation Phase: The counication phase is followed by a key-generation phase, in which both Alice and Bob generate the key based on the signals sent and received. Let W = {1, 2,..., 2 nrs }, where R s represents the secrecy key rate. Alice generates a secret key w W by using a decoding function f a, i.e., w = f a x, k. Bob generates the secret key ŵ W by using a decoding function f b, i.e., ŵ = f b y 1, h 1, k = f b y 1, h 1, 2 where the second equality holds since we assue that k is a deterinistic function of y 1 and h 1. The secrecy level at Eve is easured by the equivocation rate R e defined as the entropy rate of the key W conditioned upon the observations at Eve, i.e., R e 1 n HW Y 2, H 2, K. 1 3 A secrecy key rate R s is achievable if the conditions Pr W = Ŵ 1 ɛ, 4 and R e R s ɛ, 5 are satisfied for any ɛ > as the nuber of channel uses n. III. KEY SHARING BASED ON LAYERED CODING In this section, we introduce a secret-key sharing schee, in which Gaussian layered broadcast coding is used for the counication phase, and rando secrecy binning is used for the key generation phase. Before presenting the schee, we first introduce Gaussian layered broadcast coding. A. Gaussian Layered Broadcast Coding As an exaple, we consider the Alice-Bob channel given by 1. First, let us assue there are L layers in a layered coding schee. That is, the transitted codeword is a superposition of L codewords, i.e., L x = x [l 6 l=1 where x [l is a codeword fro codebook C [l with a rate r [l and a constant power p [l for l = 1,..., L, and the 1 Capital letters W, Ŵ, X, Y 1, Y 2, H 1, H 2, H 1, H 2, and K represent the rando variables or vectors, while corresponding realizations are represented by lower-case letters.
3 total power is constrained by L l=1 p[l = P. In general, L depends on the cardinality of the rando channel variable H 1. For a Gaussian fading channel, a continuu of code layers L is required. For a certain fading realization h [l, the receiver can decode up to the l-th layer, i.e., the codewords {x [1,..., x [l } can be decoded reliably, while the codewords {x [l+1,..., x [L } are undecodable. The decoding is based on successive interference cancelation. More specifically, in the decoding process, the receiver first decodes x [1 by treating the reaining codewords {x [i, i > 1} as interference. After decoding x [1, the receiver will subtract x [1 and then decode x [2 by treating the reaining codewords {x [i, i > 2} as interference. This process repeats until the l-th layer x [l is decoded reliably by treating the reaining codewords {x [i, i > l} as interference. Note that this predeterined ordering can be achieved because of the degraded nature of Gaussian SISO channels. When a continuu of layers is used, the transitter sends an infinite nuber of layers of coded inforation. Each layer conveys a fractional rate, denoted by dr, whose value depends on the index of the layer. We refer to s, the realization of the fading power, as a continuous index. The increental differential rate is given by 2 drs = log 1 + sρsds 1 + sis = sρsds 1 + sis, 7 where ρsds is the transit power of a layer paraeterized by s, and also represents the transit power distribution over coded layers. The layers indexed by u > s are undecodable and function as additional interference, whose power is denoted by Is and is given by Is = s ρudu. 8 The total power over all layers is constrained by I = ρudu = P. 9 B. Secret Key Sharing Based on Layered Coding In this section, we discuss the key sharing schee based on Gaussian layered coding. 1 Codebook Construction: We need two types of codebooks, each of which is used for the counication or key-generation phase, respectively. The codebook used for the counication phase consists of a continuu of coded layers represented by {C2 n1drs, n 1 }, where n 1 is the codeword length and drs is the increental differential rate at layer s. The sub-codebook for each layer is generated randoly and independently. That is, for any codebook C2 n1drs, n 1, we generate 2 n1drs codewords x [s w, where w = 1, 2,..., 2 n1drs, by choosing the n 1 2 n1drs Gaussian sybols with power ρsds independently at rando. 2 All logariths are to the natural base, and thus rates are in ters of nats per second per Hertz. The codebook used for the key generation phase is based on Wyner s secrecy coding [1, [4. By letting R = H1 sρsds 1 + sis df 1H 1, 1 we first generate all binary sequences {B} of length nr ɛ, where n = Mn 1. The sequences {B} are then randoly and uniforly grouped into nr s groups each with nr R s ɛ sequences. Each secret key w {1,..., 2 nrs } is then randoly assigned to a group, denoted by Bw. 2 Counication Phase: The counication takes places over M tie slots. At tie slot [1, M, Alice first randoly selects a essage w [s {1,..., 2 n1drs } for coded layer s, independent of the essage chosen for other layers. For convenience, we use w to represent the total essage sent in tie slot through all layers. Then, Alice sends a superposition of all layers to the channel. Bob receives y 1, and tries to decode all his decodable layers, which depends on his channel state h 1,. For convenience, we use w [D1 to denote the set of layers reliably decoded by Bob, and w [ D 1 to denote the set of layers undecodable to Bob in tie slot. After decoding, Bob sends back the index of the highest decodable layer represented by k to Alice. This copletes the transission in tie slot. The counication phase ends when all M independent transissions are copleted. 3 Key-Generation Phase: Once the counication phase is copleted, both Alice and Bob can generate the secret key. Based on the feedback sequence k = {k }, Alice generates a binary sequence v fro all the essages reliably decoded by Bob across all layers and tie slots based on a deterinistic one-to-one apping Φ as v = Φ{w [D 1, = 1,..., M}. 11 Alice then looks up in the key-generation codebook for a w such that v Bw, and outputs w as the secret key generated. Note that all those essages are decoded by Bob, and therefore Bob can generate the sae sequence v and the sae key w as Alice does. IV. SECRECY KEY RATE In this section, we present the secrecy key rate achieved, and the optial distribution of power over coded layers. Due to space liitations, we defer all proofs to an upcoing long version of this paper. A. Layered-Coding Based Key Sharing The following result characterizes the secrecy rate when the power distribution is given. Theore 1: For a given power distribution ρs over layers indexed by s, the secrecy key rate of the layeredcoding based key sharing schee is H1 H 1, H 2 df 2 H 2 df 1 H 1, 12
4 x [ D1 x [ D1 x a b c [ D 2 x [ D2 x Fig. 2. a Coded layers sent by Alice, b decodable and undecodable layers for Bob, and c decodable and undecodable layers for Eve, in tie slot with the channel gains h 1 >. where H 1, H 2 is given by H1 [ sρs H 1, H 2 = 1 + sis H 2ρs ds H 2 Is and Is = H 2 s ρudu with I = P. 14 We discuss soe insights fro Theore 1. First, except for the rare case in which H 1 is always saller than H 2, R s is positive. Note that this is ipossible without feedback one-way counication. Furtherore, R s can be written as [ E H1,H 2 H1, H 2, 15 where H 1, H 2 = { H1, H 2 if H 1 > H 2 otherwise. 16 The key rate R s is the average of rewards designated by H 1, H 2 collected fro all possible channel realizations. Positive rewards are obtained fro the tie slots in which Bob s channel is better than Eve s channel H 1 > H 2. On the other hand, when H 1 H 2, the reward is zero. We focus on a particular tie slot in which H 1, H 2 = h 1, with h 1 >, and use x to denote all layers sent in the slot. As depicted in Fig. 2, x can be divided as x = x [D 2 x [D 1 x [ D 2 x [ D 1, 17 where x [D 1 and x [ D 1 denote the set of decodable and undecodable layers at Bob, respectively, and x [D2 and x [ D 2 denote the set of decodable and undecodable layers at Eve, respectively. Note that x [D1 x [D2 since h 1 >. Both Alice and Bob can decode x [D 2, and neither of the can decode x [ D 1. Therefore, a nonzero reward h 1, coes fro the set of layers x [D 1 x [ D 2. To show this, we rewrite 13 as h 1, = sρsds 1 + sis ρsds 1 + Is. 18 The first ter at the right hand side of 18 is the surate decoded by Bob fro x [D 1 x [ D 2 by decoding and canceling x [D2 first, and treating the interference ter x [ D 1 as noise. Furtherore, the second ter can be written as ρsds 1 + Is = log 1 + [I Ih Ih By noticing that I Ih 1 is the total power used for the layers x [D1 x [ D 2, and Ih 1 is the total power used for the layers x [ D 1, 19 gives the rate of inforation that Eve can possibly deduce fro x [D 1 x [ D 2 through her channel with power gain. An interesting finding here is that what the best Eve can do is to treat the interference ter x [ D 1 as noise as Bob does, and therefore cannot benefit fro the structure of interference either. Due to the absence of CSI at the transitter before the transission, the layered broadcast coding strategy creates a ediu with interference, where the undecodable layers play the role of self-interference. We reark here that this is a special case of secret counication over a ediu with interference as discussed in [13. B. Single-Level-Coding Based Key Sharing When single-level coding is used, self-interference does not occur. In this case, the following secrecy key rate can be achieved. Lea 1: [12, Theore 1 The secrecy key rate of a single-level-coding based schee is given by Pr [R 1 log1 + H 1 P E H2 [R 1 log 1 + H 2 P +, 2 where R 1 is the rate of single-level coding. Coparing with the layered-coding based schee, the single-level-coding based approach has lower decoding coplexity, and requires less feedback only 1-bit per tie slot. However, it is sub-optial in general. Also, a singlelevel coding schee can be considered as a special case of a layered-coding schee, in which all power is allocated to one layer. This again otivates us to find the power distribution for optiizing the layered-coding schee. C. Secrecy Key Rate Under Optial Power Distribution The secrecy rate given by 12 is hard to evaluate and optiize. After soe tedious steps of derivation ainly integration by parts, we have an alternative for. Lea 2: The secrecy key rate given by 12 is equivalent to ax [ x [1 F 1 x ρx F 2 ydy [1 + y 2 dx, 21 with the constraint I = P, and ρx = d/dx. In certain cases, optiization of R s with respect to the power distribution ρx, or, equivalently, the interference distribution, under the power constraint P can be found by using the calculus of variations. First, we define the functional of 21 as [ x L x,, I x = [1 F 1 x I x F 2 ydy [1 + y 2.
5 A necessary condition for a axiu of the integral of Lx,, I x over x is a zero variation of the functional. By solving the associated Eüler-Lagrangian equation [14 given as L I d dx L I =, 22 we have the following characterization for the optial. Lea 3: A necessary condition for optiizing in order to axiize the secrecy rate given by 21 is to choose to satisfy x F 2 ydy [1 + y 2 = [1 F 1x F 2 x f 1 x [1 + x 2, 23 where = when x < x or x x 1. Here, x and x 1 can be found by letting Ix = P and Ix 1 = in 23. Finally, we have the following secrecy key rate under the optial power distribution. Theore 2: When the optial power distribution is used, the following secrecy key rate is achieved, x1 x [1 F 1 x 2 F 2 xd f 1 x[1 + x 2, 24 where and x, x 1 are found fro the condition given by 23. V. A RAYLEIGH FADING CHANNEL In this section, we assue Rayleigh fading for Alice- Bob and Alice-Eve channels. We consider a syetric scenario in which both fading power gains H 1 and H 2 are exponentially distributed with unit eans. The secrecy rate with layered coding is coputed by nuerically evaluating x1 e x [e x 1 x [1 + x 2 d, where can be found according to Lea 3 by solving 1 E i E i x + 1 [1 + = [1 + x { 2 exp 1 [ exp x + 1 }, 25 where E i x = [exp t/tdt is the exponential integral function. By letting Ix = P in 25, we can solve x for x. By letting Ix 1 = in 23, we can solve for x 1. Every equation has a unique solution after excluding a trivial solution. Fig. 3 shows the optial power distribution for coded layers. A clear trend is that ore power is allocated to lower layers as the total power P becoes larger. In general, the optial power distribution does not concentrate uch on a certain layer or a short interval, especially when P is large. Fig. 4 copares the secrecy key rates of layered coding and single-level coding based schees both optiized. The secrecy key rate of the layered-coding based schee is significantly higher. Power Distribution Fig. 3. Secrecy Key Rate in nats P=5 P=1 P= Layer Index Fig. 4. Optial power distribution over coded layers Single level coding Layered coding Average Power in db Secrecy key rate in nats/second/hertz REFERENCES [1 A. D. Wyner, The wire-tap channel, Bell Syst. Tech. J., vol. 54, no. 8, pp , Oct [2 I. Csiszár and J. Körner, Broadcast channels with confidential essages, IEEE Trans. Inf. Theory, vol. 24, no. 3, pp , May [3 E. Biglieri, J. Proakis, and S. Shaai Shitz, Fading channels: Inforation-theoretic and counications aspects, IEEE Trans. Inf. Theory, vol. 44, no. 6, pp , Oct [4 P. Gopala, L. Lai, and H. El Gaal, On the secrecy capacity of fading channels, IEEE Trans. Inf. Theory, vol. 54, no. 1, pp , Oct. 28. [5 Y. Liang, H. V. Poor, and S. Shaai Shitz, Secure counication over fading channels, IEEE Trans. Inf. Theory, vol. 54, no. 6, pp , Jun. 28. [6 Z. Li, R. Yates, and W. Trappe, Secrecy capacity of indepedent parallel channels, in Proc. 44th Annual Allerton Conference on Coun., Cont., and Cop., Monticello, IL, Sep. 26. [7 X. Tang, R. Liu, P. Spasojević, and H. V. Poor, On the throughput of secure hybrid-arq protocols for Gaussian block-fading channels, IEEE Trans. Inf. Theory, vol. 55, no. 4, pp , Apr. 29. [8 U. Maurer, Secret key agreeent by public discussion fro coon inforation, IEEE Trans. Inf. Theory, vol. 39, no. 3, pp , [9 R. Ahlswede and I. Csiszár, Coon randoness in inforation theory and cryptography - part I: Secret sharing, IEEE Trans. Inf. Theory, vol. 39, no. 4, pp , July [1 S. Shaai Shitz, A broadcast strategy for the Gaussian slowly fading channel, in Proc. IEEE Int. Syp. Inf. Theory, Ul, Gerany, Jun Jul [11 S. Shaai Shitz and A. Steiner, A broadcast approach for a singleuser slowly fading MIMO channel, IEEE Trans. Inf. Theory, vol. 49, no. 1, pp , Oct. 23. [12 M. A. Ghany, A. Sultan, and H. El Gaal, ARQ based secret key sharing, Oct. 28. [13 X. Tang, R. Liu, P. Spasojević, and H. V. Poor, Interference-assisted secret counication, in Proc. IEEE Inf. Theory Workshop ITW, Porto, Portugal, May 28. [14 I. M. Gelfand and S. V. Foin, Calculus of Variations. Englewood Cliffs, NJ: Prentice-Hall, 1963.
On the Secrecy Capacity of Fading Channels
On the Secrecy Capacity of Fading Channels arxiv:cs/63v [cs.it] 7 Oct 26 Praveen Kumar Gopala, Lifeng Lai and Hesham El Gamal Department of Electrical and Computer Engineering The Ohio State University
More informationImpact of Imperfect Channel State Information on ARQ Schemes over Rayleigh Fading Channels
This full text paper was peer reviewed at the direction of IEEE Counications Society subject atter experts for publication in the IEEE ICC 9 proceedings Ipact of Iperfect Channel State Inforation on ARQ
More informationThe Transactional Nature of Quantum Information
The Transactional Nature of Quantu Inforation Subhash Kak Departent of Coputer Science Oklahoa State University Stillwater, OK 7478 ABSTRACT Inforation, in its counications sense, is a transactional property.
More informationVulnerability of MRD-Code-Based Universal Secure Error-Correcting Network Codes under Time-Varying Jamming Links
Vulnerability of MRD-Code-Based Universal Secure Error-Correcting Network Codes under Tie-Varying Jaing Links Jun Kurihara KDDI R&D Laboratories, Inc 2 5 Ohara, Fujiino, Saitaa, 356 8502 Japan Eail: kurihara@kddilabsjp
More informationThis model assumes that the probability of a gap has size i is proportional to 1/i. i.e., i log m e. j=1. E[gap size] = i P r(i) = N f t.
CS 493: Algoriths for Massive Data Sets Feb 2, 2002 Local Models, Bloo Filter Scribe: Qin Lv Local Models In global odels, every inverted file entry is copressed with the sae odel. This work wells when
More informationAchieving Shannon Capacity Region as Secrecy Rate Region in a Multiple Access Wiretap Channel
Achieving Shannon Capacity Region as Secrecy Rate Region in a Multiple Access Wiretap Channel Shahid Mehraj Shah and Vinod Sharma Department of Electrical Communication Engineering, Indian Institute of
More informationOn Constant Power Water-filling
On Constant Power Water-filling Wei Yu and John M. Cioffi Electrical Engineering Departent Stanford University, Stanford, CA94305, U.S.A. eails: {weiyu,cioffi}@stanford.edu Abstract This paper derives
More informationError Exponents in Asynchronous Communication
IEEE International Syposiu on Inforation Theory Proceedings Error Exponents in Asynchronous Counication Da Wang EECS Dept., MIT Cabridge, MA, USA Eail: dawang@it.edu Venkat Chandar Lincoln Laboratory,
More informationRateless Codes for MIMO Channels
Rateless Codes for MIMO Channels Marya Modir Shanechi Dept EECS, MIT Cabridge, MA Eail: shanechi@itedu Uri Erez Tel Aviv University Raat Aviv, Israel Eail: uri@engtauacil Gregory W Wornell Dept EECS, MIT
More informationFading Wiretap Channel with No CSI Anywhere
Fading Wiretap Channel with No CSI Anywhere Pritam Mukherjee Sennur Ulukus Department of Electrical and Computer Engineering University of Maryland, College Park, MD 7 pritamm@umd.edu ulukus@umd.edu Abstract
More informationGeneralized Alignment Chain: Improved Converse Results for Index Coding
Generalized Alignent Chain: Iproved Converse Results for Index Coding Yucheng Liu and Parastoo Sadeghi Research School of Electrical, Energy and Materials Engineering Australian National University, Canberra,
More informationPower-Controlled Feedback and Training for Two-way MIMO Channels
1 Power-Controlled Feedback and Training for Two-way MIMO Channels Vaneet Aggarwal, and Ashutosh Sabharwal, Senior Meber, IEEE arxiv:0901188v3 [csit] 9 Jan 010 Abstract Most counication systes use soe
More informationFixed-to-Variable Length Distribution Matching
Fixed-to-Variable Length Distribution Matching Rana Ali Ajad and Georg Böcherer Institute for Counications Engineering Technische Universität München, Gerany Eail: raa2463@gail.co,georg.boecherer@tu.de
More informationAchievable Rates for Shaped Bit-Metric Decoding
Achievable Rates for Shaped Bit-Metric Decoding Georg Böcherer, Meber, IEEE Abstract arxiv:40.8075v6 [cs.it] 8 May 06 A new achievable rate for bit-etric decoding (BMD) is derived using rando coding arguents.
More informationA Low-Complexity Congestion Control and Scheduling Algorithm for Multihop Wireless Networks with Order-Optimal Per-Flow Delay
A Low-Coplexity Congestion Control and Scheduling Algorith for Multihop Wireless Networks with Order-Optial Per-Flow Delay Po-Kai Huang, Xiaojun Lin, and Chih-Chun Wang School of Electrical and Coputer
More informationSPECTRUM sensing is a core concept of cognitive radio
World Acadey of Science, Engineering and Technology International Journal of Electronics and Counication Engineering Vol:6, o:2, 202 Efficient Detection Using Sequential Probability Ratio Test in Mobile
More informationGroup Secret Key Agreement over State-Dependent Wireless Broadcast Channels
Group Secret Key Agreement over State-Dependent Wireless Broadcast Channels Mahdi Jafari Siavoshani Sharif University of Technology, Iran Shaunak Mishra, Suhas Diggavi, Christina Fragouli Institute of
More informationSparse beamforming in peer-to-peer relay networks Yunshan Hou a, Zhijuan Qi b, Jianhua Chenc
3rd International Conference on Machinery, Materials and Inforation echnology Applications (ICMMIA 015) Sparse beaforing in peer-to-peer relay networs Yunshan ou a, Zhijuan Qi b, Jianhua Chenc College
More informationDetection and Estimation Theory
ESE 54 Detection and Estiation Theory Joseph A. O Sullivan Sauel C. Sachs Professor Electronic Systes and Signals Research Laboratory Electrical and Systes Engineering Washington University 11 Urbauer
More informationOn the Design of MIMO-NOMA Downlink and Uplink Transmission
On the Design of MIMO-NOMA Downlink and Uplink Transission Zhiguo Ding, Meber, IEEE, Robert Schober, Fellow, IEEE, and H. Vincent Poor, Fellow, IEEE Abstract In this paper, a novel MIMO-NOMA fraework for
More informationAN INTRODUCTION TO SECRECY CAPACITY. 1. Overview
AN INTRODUCTION TO SECRECY CAPACITY BRIAN DUNN. Overview This paper introduces the reader to several information theoretic aspects of covert communications. In particular, it discusses fundamental limits
More informationNon-Parametric Non-Line-of-Sight Identification 1
Non-Paraetric Non-Line-of-Sight Identification Sinan Gezici, Hisashi Kobayashi and H. Vincent Poor Departent of Electrical Engineering School of Engineering and Applied Science Princeton University, Princeton,
More informationInformation-Theoretic Security: an overview
Information-Theoretic Security: an overview Rui A Costa 1 Relatório para a disciplina de Seminário, do Mestrado em Informática da Faculdade de Ciências da Universidade do Porto, sob a orientação do Prof
More information1 Generalization bounds based on Rademacher complexity
COS 5: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #0 Scribe: Suqi Liu March 07, 08 Last tie we started proving this very general result about how quickly the epirical average converges
More informationContent-Type Coding. arxiv: v2 [cs.it] 3 Jun Linqi Song UCLA
Content-Type Coding Linqi Song UCLA Eail: songlinqi@ucla.edu Christina Fragouli UCLA and EPFL Eail: christina.fragouli@ucla.edu arxiv:1505.03561v [cs.it] 3 Jun 015 Abstract This paper is otivated by the
More informationWitsenhausen s counterexample as Assisted Interference Suppression
Witsenhausen s counterexaple as Assisted Interference Suppression Pulkit Grover and Anant Sahai Wireless Foundations, epartent of EECS University of California at Berkeley, CA-947, USA {pulkit, sahai}@eecs.berkeley.edu
More informationSecure Degrees of Freedom of the MIMO Multiple Access Wiretap Channel
Secure Degrees of Freedom of the MIMO Multiple Access Wiretap Channel Pritam Mukherjee Sennur Ulukus Department of Electrical and Computer Engineering University of Maryland, College Park, MD 074 pritamm@umd.edu
More informationSuperposition Encoding and Partial Decoding Is Optimal for a Class of Z-interference Channels
Superposition Encoding and Partial Decoding Is Optimal for a Class of Z-interference Channels Nan Liu and Andrea Goldsmith Department of Electrical Engineering Stanford University, Stanford CA 94305 Email:
More informationOptimal Resource Allocation in Multicast Device-to-Device Communications Underlaying LTE Networks
1 Optial Resource Allocation in Multicast Device-to-Device Counications Underlaying LTE Networks Hadi Meshgi 1, Dongei Zhao 1 and Rong Zheng 2 1 Departent of Electrical and Coputer Engineering, McMaster
More informationSecret Key Agreement Using Asymmetry in Channel State Knowledge
Secret Key Agreement Using Asymmetry in Channel State Knowledge Ashish Khisti Deutsche Telekom Inc. R&D Lab USA Los Altos, CA, 94040 Email: ashish.khisti@telekom.com Suhas Diggavi LICOS, EFL Lausanne,
More informationSystem Performance of Interference Alignment under TDD Mode with Limited Backhaul Capacity
Syste Perforance of Interference Alignent under TDD Mode with Liited Bachaul Capacity Matha Deghel, Mohaad Assaad and Mérouane Debbah Departent of Telecounications SUPELEC, Gif-sur-Yvette, France Matheatical
More informationII. THE TWO-WAY TWO-RELAY CHANNEL
An Achievable Rate Region for the Two-Way Two-Relay Channel Jonathan Ponniah Liang-Liang Xie Department of Electrical Computer Engineering, University of Waterloo, Canada Abstract We propose an achievable
More informationOptimal Jamming Over Additive Noise: Vector Source-Channel Case
Fifty-first Annual Allerton Conference Allerton House, UIUC, Illinois, USA October 2-3, 2013 Optial Jaing Over Additive Noise: Vector Source-Channel Case Erah Akyol and Kenneth Rose Abstract This paper
More informationSecret Message Capacity of Erasure Broadcast Channels with Feedback
Secret Message Capacity of Erasure Broadcast Channels with Feedback László Czap Vinod M. Prabhakaran Christina Fragouli École Polytechnique Fédérale de Lausanne, Switzerland Email: laszlo.czap vinod.prabhakaran
More informationAntenna Saturation Effects on MIMO Capacity
Antenna Saturation Effects on MIMO Capacity T S Pollock, T D Abhayapala, and R A Kennedy National ICT Australia Research School of Inforation Sciences and Engineering The Australian National University,
More informationAhmed S. Mansour, Rafael F. Schaefer and Holger Boche. June 9, 2015
The Individual Secrecy Capacity of Degraded Multi-Receiver Wiretap Broadcast Channels Ahmed S. Mansour, Rafael F. Schaefer and Holger Boche Lehrstuhl für Technische Universität München, Germany Department
More informationAsynchronous Gossip Algorithms for Stochastic Optimization
Asynchronous Gossip Algoriths for Stochastic Optiization S. Sundhar Ra ECE Dept. University of Illinois Urbana, IL 680 ssrini@illinois.edu A. Nedić IESE Dept. University of Illinois Urbana, IL 680 angelia@illinois.edu
More informationThe Throughput-Outage Tradeoff of Wireless One-Hop Caching Networks
The Throughput-Outage Tradeoff of Wireless One-Hop Caching Networks Mingyue Ji, Student Meber, IEEE, Giuseppe Caire, Fellow, IEEE, and Andreas F. Molisch, Fellow, IEEE arxiv:3.637v [cs.it] 8 Jul 05 The
More informationOn the Impact of Quantized Channel Feedback in Guaranteeing Secrecy with Artificial Noise
On the Impact of Quantized Channel Feedback in Guaranteeing Secrecy with Artificial Noise Ya-Lan Liang, Yung-Shun Wang, Tsung-Hui Chang, Y.-W. Peter Hong, and Chong-Yung Chi Institute of Communications
More informationLec 05 Arithmetic Coding
Outline CS/EE 5590 / ENG 40 Special Topics (7804, 785, 7803 Lec 05 Arithetic Coding Lecture 04 ReCap Arithetic Coding About Hoework- and Lab Zhu Li Course Web: http://l.web.ukc.edu/lizhu/teaching/06sp.video-counication/ain.htl
More information!! Let x n = x 1,x 2,,x n with x j! X!! We say that x n is "-typical with respect to p(x) if
Quantu Inforation Theory and Measure Concentration Patrick Hayden (McGill) Overview!! What is inforation theory?!! Entropy, copression, noisy coding and beyond!! What does it have to do with quantu echanics?!!
More informationIterative Decoding of LDPC Codes over the q-ary Partial Erasure Channel
1 Iterative Decoding of LDPC Codes over the q-ary Partial Erasure Channel Rai Cohen, Graduate Student eber, IEEE, and Yuval Cassuto, Senior eber, IEEE arxiv:1510.05311v2 [cs.it] 24 ay 2016 Abstract In
More informationSupport Vector Machine Classification of Uncertain and Imbalanced data using Robust Optimization
Recent Researches in Coputer Science Support Vector Machine Classification of Uncertain and Ibalanced data using Robust Optiization RAGHAV PAT, THEODORE B. TRAFALIS, KASH BARKER School of Industrial Engineering
More informationUpper and Lower Bounds on the Capacity of Wireless Optical Intensity Channels
ISIT7, Nice, France, June 4 June 9, 7 Upper and Lower Bounds on the Capacity of Wireless Optical Intensity Channels Ahed A. Farid and Steve Hranilovic Dept. Electrical and Coputer Engineering McMaster
More informationBirthday Paradox Calculations and Approximation
Birthday Paradox Calculations and Approxiation Joshua E. Hill InfoGard Laboratories -March- v. Birthday Proble In the birthday proble, we have a group of n randoly selected people. If we assue that birthdays
More informationChannel Dependent Adaptive Modulation and Coding Without Channel State Information at the Transmitter
Channel Dependent Adaptive Modulation and Coding Without Channel State Information at the Transmitter Bradford D. Boyle, John MacLaren Walsh, and Steven Weber Modeling & Analysis of Networks Laboratory
More informationCompressive Sensing Over Networks
Forty-Eighth Annual Allerton Conference Allerton House, UIUC, Illinois, USA Septeber 29 - October, 200 Copressive Sensing Over Networks Soheil Feizi MIT Eail: sfeizi@it.edu Muriel Médard MIT Eail: edard@it.edu
More informationSpectrum Leasing via Cooperation for Enhanced. Physical-Layer Secrecy
Spectrum Leasing via Cooperation for Enhanced 1 Physical-Layer Secrecy Keonkook Lee, Member, IEEE, Chan-Byoung Chae, Senior Member, IEEE, Joonhyuk Kang, Member, IEEE arxiv:1205.0085v1 [cs.it] 1 May 2012
More informationFairness via priority scheduling
Fairness via priority scheduling Veeraruna Kavitha, N Heachandra and Debayan Das IEOR, IIT Bobay, Mubai, 400076, India vavitha,nh,debayan}@iitbacin Abstract In the context of ulti-agent resource allocation
More informationSymbolic Analysis as Universal Tool for Deriving Properties of Non-linear Algorithms Case study of EM Algorithm
Acta Polytechnica Hungarica Vol., No., 04 Sybolic Analysis as Universal Tool for Deriving Properties of Non-linear Algoriths Case study of EM Algorith Vladiir Mladenović, Miroslav Lutovac, Dana Porrat
More informationA remark on a success rate model for DPA and CPA
A reark on a success rate odel for DPA and CPA A. Wieers, BSI Version 0.5 andreas.wieers@bsi.bund.de Septeber 5, 2018 Abstract The success rate is the ost coon evaluation etric for easuring the perforance
More informationExploiting Partial Channel State Information for Secrecy over Wireless Channels
Exploiting Partial Channel State Information for Secrecy over Wireless Channels Matthieu R. Bloch and J. Nicholas Laneman Abstract In this paper, we investigate the effect of partial channel state information
More informationEnergy Efficient Predictive Resource Allocation for VoD and Real-time Services
Energy Efficient Predictive Resource Allocation for VoD and Real-tie Services Changyang She and Chenyang Yang 1 arxiv:1707.01673v1 [cs.it] 6 Jul 2017 Abstract This paper studies how to exploit the predicted
More informationarxiv: v1 [cs.ds] 17 Mar 2016
Tight Bounds for Single-Pass Streaing Coplexity of the Set Cover Proble Sepehr Assadi Sanjeev Khanna Yang Li Abstract arxiv:1603.05715v1 [cs.ds] 17 Mar 2016 We resolve the space coplexity of single-pass
More informationIN modern society that various systems have become more
Developent of Reliability Function in -Coponent Standby Redundant Syste with Priority Based on Maxiu Entropy Principle Ryosuke Hirata, Ikuo Arizono, Ryosuke Toohiro, Satoshi Oigawa, and Yasuhiko Takeoto
More informationOn Conditions for Linearity of Optimal Estimation
On Conditions for Linearity of Optial Estiation Erah Akyol, Kuar Viswanatha and Kenneth Rose {eakyol, kuar, rose}@ece.ucsb.edu Departent of Electrical and Coputer Engineering University of California at
More informationMinimum Rates Scheduling for MIMO OFDM Broadcast Channels
IEEE Ninth International Syposiu on Spread Spectru Techniques and Applications Miniu Rates Scheduling for MIMO OFDM Broadcast Channels Gerhard Wunder and Thoas Michel Fraunhofer Geran-Sino Mobile Counications
More informationDirty Paper Coding vs. TDMA for MIMO Broadcast Channels
TO APPEAR IEEE INTERNATIONAL CONFERENCE ON COUNICATIONS, JUNE 004 1 Dirty Paper Coding vs. TDA for IO Broadcast Channels Nihar Jindal & Andrea Goldsmith Dept. of Electrical Engineering, Stanford University
More informationDistributed Lossy Averaging
Distribute Lossy Averaging Han-I Su Departent of Electrical Engineering Stanfor University Stanfor, CA 94305, USA Eail: hanisu@stanforeu Abbas El Gaal Departent of Electrical Engineering Stanfor University
More informationGoals of Cryptography. Definition of a Cryptosystem. Security Kerckhoff's Requirements
Goals of Cryptography Chapter : Security Techniques Background Secret Key Cryptography Public Key Cryptography Hash Functions Authentication Chapter 3: Security on Network Transport Layer Chapter 4: Security
More informationApproximation in Stochastic Scheduling: The Power of LP-Based Priority Policies
Approxiation in Stochastic Scheduling: The Power of -Based Priority Policies Rolf Möhring, Andreas Schulz, Marc Uetz Setting (A P p stoch, r E( w and (B P p stoch E( w We will assue that the processing
More informationSecret Key Agreement Using Conferencing in State- Dependent Multiple Access Channels with An Eavesdropper
Secret Key Agreement Using Conferencing in State- Dependent Multiple Access Channels with An Eavesdropper Mohsen Bahrami, Ali Bereyhi, Mahtab Mirmohseni and Mohammad Reza Aref Information Systems and Security
More informationProbability Distributions
Probability Distributions In Chapter, we ephasized the central role played by probability theory in the solution of pattern recognition probles. We turn now to an exploration of soe particular exaples
More informationA Half-Duplex Cooperative Scheme with Partial Decode-Forward Relaying
A Half-Duplex Cooperative Scheme with Partial Decode-Forward Relaying Ahmad Abu Al Haija, and Mai Vu, Department of Electrical and Computer Engineering McGill University Montreal, QC H3A A7 Emails: ahmadabualhaija@mailmcgillca,
More informationSecure Multiuser MISO Communication Systems with Quantized Feedback
Secure Multiuser MISO Communication Systems with Quantized Feedback Berna Özbek*, Özgecan Özdoğan*, Güneş Karabulut Kurt** *Department of Electrical and Electronics Engineering Izmir Institute of Technology,Turkey
More informationarxiv: v1 [cs.ds] 3 Feb 2014
arxiv:40.043v [cs.ds] 3 Feb 04 A Bound on the Expected Optiality of Rando Feasible Solutions to Cobinatorial Optiization Probles Evan A. Sultani The Johns Hopins University APL evan@sultani.co http://www.sultani.co/
More informationFast Montgomery-like Square Root Computation over GF(2 m ) for All Trinomials
Fast Montgoery-like Square Root Coputation over GF( ) for All Trinoials Yin Li a, Yu Zhang a, a Departent of Coputer Science and Technology, Xinyang Noral University, Henan, P.R.China Abstract This letter
More informationRandomized Recovery for Boolean Compressed Sensing
Randoized Recovery for Boolean Copressed Sensing Mitra Fatei and Martin Vetterli Laboratory of Audiovisual Counication École Polytechnique Fédéral de Lausanne (EPFL) Eail: {itra.fatei, artin.vetterli}@epfl.ch
More informationESE 523 Information Theory
ESE 53 Inforation Theory Joseph A. O Sullivan Sauel C. Sachs Professor Electrical and Systes Engineering Washington University 11 Urbauer Hall 10E Green Hall 314-935-4173 (Lynda Marha Answers) jao@wustl.edu
More informationOn the Maximum Likelihood Estimation of Weibull Distribution with Lifetime Data of Hard Disk Drives
314 Int'l Conf. Par. and Dist. Proc. Tech. and Appl. PDPTA'17 On the Maxiu Likelihood Estiation of Weibull Distribution with Lifetie Data of Hard Disk Drives Daiki Koizui Departent of Inforation and Manageent
More informationApproximately achieving the feedback interference channel capacity with point-to-point codes
Approximately achieving the feedback interference channel capacity with point-to-point codes Joyson Sebastian*, Can Karakus*, Suhas Diggavi* Abstract Superposition codes with rate-splitting have been used
More informationOn the Communication Complexity of Lipschitzian Optimization for the Coordinated Model of Computation
journal of coplexity 6, 459473 (2000) doi:0.006jco.2000.0544, available online at http:www.idealibrary.co on On the Counication Coplexity of Lipschitzian Optiization for the Coordinated Model of Coputation
More informationA Simplified Analytical Approach for Efficiency Evaluation of the Weaving Machines with Automatic Filling Repair
Proceedings of the 6th SEAS International Conference on Siulation, Modelling and Optiization, Lisbon, Portugal, Septeber -4, 006 0 A Siplified Analytical Approach for Efficiency Evaluation of the eaving
More informationSecrecy Outage Performance of Cooperative Relay Network With Diversity Combining
Secrecy Outage erformance of Cooperative Relay Network With Diversity Combining Khyati Chopra Dept. of lectrical ngineering Indian Institute of Technology, Delhi New Delhi-110016, India mail: eez148071@ee.iitd.ac.in
More informationma x = -bv x + F rod.
Notes on Dynaical Systes Dynaics is the study of change. The priary ingredients of a dynaical syste are its state and its rule of change (also soeties called the dynaic). Dynaical systes can be continuous
More informationRate of Channel Hardening of Antenna Selection Diversity Schemes and Its Implication on Scheduling
SUBMITTED TO THE IEEE TRANSACTIONS ON INFORMATION THEORY Rate of Channel Hardening of Antenna Selection Diversity Schees and Its Iplication on Scheduling arxiv:cs/0703022v [cs.it] 5 Mar 2007 Dongwoon Bai,
More informationASSUME a source over an alphabet size m, from which a sequence of n independent samples are drawn. The classical
IEEE TRANSACTIONS ON INFORMATION THEORY Large Alphabet Source Coding using Independent Coponent Analysis Aichai Painsky, Meber, IEEE, Saharon Rosset and Meir Feder, Fellow, IEEE arxiv:67.7v [cs.it] Jul
More informationDevice-to-Device Collaboration through Distributed Storage
Device-to-Device Collaboration through Distributed Storage Negin Golrezaei, Student Meber, IEEE, Alexandros G Diakis, Meber, IEEE, Andreas F Molisch, Fellow, IEEE Dept of Electrical Eng University of Southern
More informationPEA: Polymorphic Encryption Algorithm based on quantum computation. Nikos Komninos* and Georgios Mantas
Int. J. Systes, Control and Counications, Vol. 3, No., PEA: Polyorphic Encryption Algorith based on quantu coputation Nikos Koninos* and Georgios Mantas Algoriths and Security Group, Athens Inforation
More information5296 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 56, NO. 10, OCTOBER X/$ IEEE
5296 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 56, NO. 10, OCTOBER 2008 [13] E. A. Jorswieck and E. G. Larsson, Linear precoding in ultiple antenna broadcast channels: Efficient coputation of the achievable
More informationLower Bounds for Quantized Matrix Completion
Lower Bounds for Quantized Matrix Copletion Mary Wootters and Yaniv Plan Departent of Matheatics University of Michigan Ann Arbor, MI Eail: wootters, yplan}@uich.edu Mark A. Davenport School of Elec. &
More information4196 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 64, NO. 10, OCTOBER 2016
4196 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 64, NO. 10, OCTOBER 2016 Linear Precoding ain for Large MIMO Configurations With QAM and Reduced Coplexity Thoas Ketseoglou, Senior Meber, IEEE, and Ender
More informationFinite Horizon Throughput Maximization and Sensing Optimization in Wireless Powered Devices over Fading Channels
Finite Horizon Throughput Maxiization and Sensing Optiization in Wireless Powered Devices over Fading Channels Mehdi Salehi Heydar Abad, Ozgur Ercetin arxiv:1804.01834v2 [cs.it] 9 Sep 2018 Abstract Wireless
More informationChapter 6 1-D Continuous Groups
Chapter 6 1-D Continuous Groups Continuous groups consist of group eleents labelled by one or ore continuous variables, say a 1, a 2,, a r, where each variable has a well- defined range. This chapter explores:
More informationSupport recovery in compressed sensing: An estimation theoretic approach
Support recovery in copressed sensing: An estiation theoretic approach Ain Karbasi, Ali Horati, Soheil Mohajer, Martin Vetterli School of Coputer and Counication Sciences École Polytechnique Fédérale de
More informationarxiv: v1 [cs.it] 4 Jun 2018
State-Dependent Interference Channel with Correlated States 1 Yunhao Sun, 2 Ruchen Duan, 3 Yingbin Liang, 4 Shlomo Shamai (Shitz) 5 Abstract arxiv:180600937v1 [csit] 4 Jun 2018 This paper investigates
More informationA note on the multiplication of sparse matrices
Cent. Eur. J. Cop. Sci. 41) 2014 1-11 DOI: 10.2478/s13537-014-0201-x Central European Journal of Coputer Science A note on the ultiplication of sparse atrices Research Article Keivan Borna 12, Sohrab Aboozarkhani
More informationPerformance-based Security for Encoding of Information Signals. FA ( ) Paul Cuff (Princeton University)
Performance-based Security for Encoding of Information Signals FA9550-15-1-0180 (2015-2018) Paul Cuff (Princeton University) Contributors Two students finished PhD Tiance Wang (Goldman Sachs) Eva Song
More informationOn the Duality of Gaussian Multiple-Access and Broadcast Channels
On the Duality of Gaussian ultiple-access and Broadcast Channels Xiaowei Jin I. INTODUCTION Although T. Cover has been pointed out in [] that one would have expected a duality between the broadcast channel(bc)
More information2 Q 10. Likewise, in case of multiple particles, the corresponding density in 2 must be averaged over all
Lecture 6 Introduction to kinetic theory of plasa waves Introduction to kinetic theory So far we have been odeling plasa dynaics using fluid equations. The assuption has been that the pressure can be either
More informations = (Y Q Y P)/(X Q - X P)
Elliptic Curves and their Applications in Cryptography Preeti Shara M.Tech Student Mody University of Science and Technology, Lakshangarh Abstract This paper gives an introduction to elliptic curves. The
More informationResearch Article Rapidly-Converging Series Representations of a Mutual-Information Integral
International Scholarly Research Network ISRN Counications and Networking Volue 11, Article ID 5465, 6 pages doi:1.54/11/5465 Research Article Rapidly-Converging Series Representations of a Mutual-Inforation
More informationNew Slack-Monotonic Schedulability Analysis of Real-Time Tasks on Multiprocessors
New Slack-Monotonic Schedulability Analysis of Real-Tie Tasks on Multiprocessors Risat Mahud Pathan and Jan Jonsson Chalers University of Technology SE-41 96, Göteborg, Sweden {risat, janjo}@chalers.se
More informationOptimal Power Control in Decentralized Gaussian Multiple Access Channels
1 Optimal Power Control in Decentralized Gaussian Multiple Access Channels Kamal Singh Department of Electrical Engineering Indian Institute of Technology Bombay. arxiv:1711.08272v1 [eess.sp] 21 Nov 2017
More informationOutage-Efficient Downlink Transmission Without Transmit Channel State Information
1 Outage-Efficient Downlink Transmission Without Transmit Channel State Information Wenyi Zhang, Member, IEEE, Shivaprasad Kotagiri, Student Member, IEEE, and J. Nicholas Laneman, Senior Member, IEEE arxiv:0711.1573v1
More informationSecrecy Performance of Wirelessly Powered Wiretap Channels
Secrecy Perforance of Wirelessly Powered Wiretap Channels Jiang, X, Zhong, C, Chen, X, Duong, T Q, Tsiftsis, T, & Zhang, Z 6 Secrecy Perforance of Wirelessly Powered Wiretap Channels IEEE Transactions
More informationAn improved self-adaptive harmony search algorithm for joint replenishment problems
An iproved self-adaptive harony search algorith for joint replenishent probles Lin Wang School of Manageent, Huazhong University of Science & Technology zhoulearner@gail.co Xiaojian Zhou School of Manageent,
More informationSoft Covering with High Probability
Soft Covering with High Probability Paul Cuff Princeton University arxiv:605.06396v [cs.it] 20 May 206 Abstract Wyner s soft-covering lemma is the central analysis step for achievability proofs of information
More informationAverage Consensus and Gossip Algorithms in Networks with Stochastic Asymmetric Communications
Average Consensus and Gossip Algoriths in Networks with Stochastic Asyetric Counications Duarte Antunes, Daniel Silvestre, Carlos Silvestre Abstract We consider that a set of distributed agents desire
More informationInteractive Markov Models of Evolutionary Algorithms
Cleveland State University EngagedScholarship@CSU Electrical Engineering & Coputer Science Faculty Publications Electrical Engineering & Coputer Science Departent 2015 Interactive Markov Models of Evolutionary
More information