id
stringlengths 9
10
| submitter
stringlengths 2
52
⌀ | authors
stringlengths 4
6.51k
| title
stringlengths 4
246
| comments
stringlengths 1
523
⌀ | journal-ref
stringlengths 4
345
⌀ | doi
stringlengths 11
120
⌀ | report-no
stringlengths 2
243
⌀ | categories
stringlengths 5
98
| license
stringclasses 9
values | abstract
stringlengths 33
3.33k
| versions
list | update_date
timestamp[s] | authors_parsed
list | prediction
stringclasses 1
value | probability
float64 0.95
1
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
cs/0611160
|
Kai-Uwe Schmidt
|
Kai-Uwe Schmidt
|
Complementary Sets, Generalized Reed-Muller Codes, and Power Control for
OFDM
| null |
IEEE Trans. Inf. Theory, vol. 53, no. 2, pp. 808-814, 2007
|
10.1109/TIT.2006.889723
| null |
cs.IT math.IT
| null |
The use of error-correcting codes for tight control of the peak-to-mean
envelope power ratio (PMEPR) in orthogonal frequency-division multiplexing
(OFDM) transmission is considered in this correspondence. By generalizing a
result by Paterson, it is shown that each q-phase (q is even) sequence of
length 2^m lies in a complementary set of size 2^{k+1}, where k is a
nonnegative integer that can be easily determined from the generalized Boolean
function associated with the sequence. For small k this result provides a
reasonably tight bound for the PMEPR of q-phase sequences of length 2^m. A new
2^h-ary generalization of the classical Reed-Muller code is then used together
with the result on complementary sets to derive flexible OFDM coding schemes
with low PMEPR. These codes include the codes developed by Davis and Jedwab as
a special case. In certain situations the codes in the present correspondence
are similar to Paterson's code constructions and often outperform them.
|
[
{
"version": "v1",
"created": "Thu, 30 Nov 2006 10:38:59 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Schmidt",
"Kai-Uwe",
""
]
] |
new_dataset
| 0.973972 |
cs/0612083
|
Wenbing Zhao
|
Wenbing Zhao
|
A Byzantine Fault Tolerant Distributed Commit Protocol
|
To appear in the proceedings of the 3rd IEEE International Symposium
on Dependable, Autonomic and Secure Computing, 2007
| null |
10.1109/DASC.2007.10
| null |
cs.DC cs.DB
| null |
In this paper, we present a Byzantine fault tolerant distributed commit
protocol for transactions running over untrusted networks. The traditional
two-phase commit protocol is enhanced by replicating the coordinator and by
running a Byzantine agreement algorithm among the coordinator replicas. Our
protocol can tolerate Byzantine faults at the coordinator replicas and a subset
of malicious faults at the participants. A decision certificate, which includes
a set of registration records and a set of votes from participants, is used to
facilitate the coordinator replicas to reach a Byzantine agreement on the
outcome of each transaction. The certificate also limits the ways a faulty
replica can use towards non-atomic termination of transactions, or semantically
incorrect transaction outcomes.
|
[
{
"version": "v1",
"created": "Mon, 18 Dec 2006 09:31:43 GMT"
},
{
"version": "v2",
"created": "Tue, 30 Jan 2007 17:27:10 GMT"
},
{
"version": "v3",
"created": "Wed, 1 Aug 2007 04:54:38 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Zhao",
"Wenbing",
""
]
] |
new_dataset
| 0.999532 |
cs/0701065
|
Ioannis Chatzigeorgiou
|
I. Chatzigeorgiou, M. R. D. Rodrigues, I. J. Wassell, R. Carrasco
|
Can Punctured Rate-1/2 Turbo Codes Achieve a Lower Error Floor than
their Rate-1/3 Parent Codes?
|
5 pages, 7 figures, Proceedings of the 2006 IEEE Information Theory
Workshop, Chengdu, China, October 22-26, 2006
| null |
10.1109/ITW2.2006.323763
| null |
cs.IT math.IT
| null |
In this paper we concentrate on rate-1/3 systematic parallel concatenated
convolutional codes and their rate-1/2 punctured child codes. Assuming
maximum-likelihood decoding over an additive white Gaussian channel, we
demonstrate that a rate-1/2 non-systematic child code can exhibit a lower error
floor than that of its rate-1/3 parent code, if a particular condition is met.
However, assuming iterative decoding, convergence of the non-systematic code
towards low bit-error rates is problematic. To alleviate this problem, we
propose rate-1/2 partially-systematic codes that can still achieve a lower
error floor than that of their rate-1/3 parent codes. Results obtained from
extrinsic information transfer charts and simulations support our conclusion.
|
[
{
"version": "v1",
"created": "Tue, 9 Jan 2007 16:32:59 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Chatzigeorgiou",
"I.",
""
],
[
"Rodrigues",
"M. R. D.",
""
],
[
"Wassell",
"I. J.",
""
],
[
"Carrasco",
"R.",
""
]
] |
new_dataset
| 0.992617 |
cs/0703078
|
Igor Bjelakovic
|
Tobias J. Oechtering, Igor Bjelakovic, Clemens Schnurr and Holger
Boche
|
Broadcast Capacity Region of Two-Phase Bidirectional Relaying
|
25 pages, 2 figures, submitted to IEEE Transactions on Information
Theory
| null |
10.1109/TIT.2007.911158
| null |
cs.IT math.IT
| null |
In a three-node network a half-duplex relay node enables bidirectional
communication between two nodes with a spectral efficient two phase protocol.
In the first phase, two nodes transmit their message to the relay node, which
decodes the messages and broadcast a re-encoded composition in the second
phase. In this work we determine the capacity region of the broadcast phase. In
this scenario each receiving node has perfect information about the message
that is intended for the other node. The resulting set of achievable rates of
the two-phase bidirectional relaying includes the region which can be achieved
by applying XOR on the decoded messages at the relay node. We also prove the
strong converse for the maximum error probability and show that this implies
that the $[\eps_1,\eps_2]$-capacity region defined with respect to the average
error probability is constant for small values of error parameters $\eps_1$,
$\eps_2$.
|
[
{
"version": "v1",
"created": "Thu, 15 Mar 2007 10:26:04 GMT"
}
] | 2016-11-17T00:00:00 |
[
[
"Oechtering",
"Tobias J.",
""
],
[
"Bjelakovic",
"Igor",
""
],
[
"Schnurr",
"Clemens",
""
],
[
"Boche",
"Holger",
""
]
] |
new_dataset
| 0.992018 |
1604.07957
|
Minho Yang
|
Minho Yang, Sang-Woon Jeon, Dong Ku Kim
|
Degrees of Freedom of Full-Duplex Cellular Networks with Reconfigurable
Antennas at Base Station
|
Submitted to IEEE Transactions on Wireless Communications
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Full-duplex (FD) cellular networks are considered in which a FD base station
(BS) simultaneously supports a set of half-duplex (HD) downlink (DL) users and
a set of HD uplink (UL) users. The transmitter and the receiver of the BS are
equipped with reconfigurable antennas, each of which can choose its transmit or
receive mode from several preset modes. Under the no self-interference
assumption arisen from FD operation at the BS, the sum degrees of freedom (DoF)
of FD cellular networks is investigated for both no channel state information
at the transmit side (CSIT) and partial CSIT. In particular, the sum DoF is
completely characterized for no CSIT model and an achievable sum DoF is
established for the partial CSIT model, which improves the sum DoF of the
conventional HD cellular networks. For both no CSIT and partial CSIT models,
the results show that the FD BS with reconfigurable antennas can double the sum
DoF even in the presence of user-to-user interference as both the numbers of DL
and UL users and preset modes increase. It is further demonstrated that such
DoF improvement indeed yields the sum rate improvement at the finite and
operational signal-to-noise ratio regime.
|
[
{
"version": "v1",
"created": "Wed, 27 Apr 2016 07:23:58 GMT"
},
{
"version": "v2",
"created": "Tue, 15 Nov 2016 00:55:55 GMT"
}
] | 2016-11-16T00:00:00 |
[
[
"Yang",
"Minho",
""
],
[
"Jeon",
"Sang-Woon",
""
],
[
"Kim",
"Dong Ku",
""
]
] |
new_dataset
| 0.996667 |
1611.04061
|
Enys Mones
|
Enys Mones and Arkadiusz Stopczynski and Sune Lehmann
|
Contact activity and dynamics of the online elite
| null | null | null | null |
cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Humans interact through numerous channels to build and maintain social
connections: they meet face-to-face, initiate phone calls or send text
messages, and interact via social media. Although it is known that the network
of physical contacts, for example, is distinct from the network arising from
communication events via phone calls and instant messages, the extent to which
these networks differ is not clear. In fact, the network structure of these
channels shows large structural variations. Each network of interactions,
however, contains both central and peripheral individuals: central members are
characterized by higher connectivity and can reach a high fraction of the
network within a low number of connections, contrary to the nodes on the
periphery. Here we show that the various channels account for diverse
relationships between pairs of individuals and the corresponding interaction
patterns across channels differ to an extent that hinders the simple reduction
of social ties to a single layer. Furthemore, the origin and purpose of each
network also determine the role of their respective central members: highly
connected individuals in the person-to-person networks interact with their
environment in a regular manner, while members central in the social
communication networks display irregular behavior with respect to their
physical contacts and are more active through rare, social events. These
results suggest that due to the inherently different functions of communication
channels, each one favors different social behaviors and different strategies
for interacting with the environment. Our findings can facilitate the
understanding of the varying roles and impact individuals have on the
population, which can further shed light on the prediction and prevention of
epidemic outbreaks, or information propagation.
|
[
{
"version": "v1",
"created": "Sun, 13 Nov 2016 00:37:36 GMT"
}
] | 2016-11-16T00:00:00 |
[
[
"Mones",
"Enys",
""
],
[
"Stopczynski",
"Arkadiusz",
""
],
[
"Lehmann",
"Sune",
""
]
] |
new_dataset
| 0.985396 |
1611.04358
|
Weijie Huang
|
Weijie Huang, Jun Wang
|
Character-level Convolutional Network for Text Classification Applied to
Chinese Corpus
|
MSc Thesis, 44 pages
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This article provides an interesting exploration of character-level
convolutional neural network solving Chinese corpus text classification
problem. We constructed a large-scale Chinese language dataset, and the result
shows that character-level convolutional neural network works better on Chinese
corpus than its corresponding pinyin format dataset. This is the first time
that character-level convolutional neural network applied to text
classification problem.
|
[
{
"version": "v1",
"created": "Mon, 14 Nov 2016 12:24:27 GMT"
},
{
"version": "v2",
"created": "Tue, 15 Nov 2016 14:41:23 GMT"
}
] | 2016-11-16T00:00:00 |
[
[
"Huang",
"Weijie",
""
],
[
"Wang",
"Jun",
""
]
] |
new_dataset
| 0.982983 |
1611.04636
|
Honglin Zheng
|
Honglin Zheng, Tianlang Chen, Jiebo Luo
|
When Saliency Meets Sentiment: Understanding How Image Content Invokes
Emotion and Sentiment
|
7 pages, 5 figures, submitted to AAAI-17
| null | null | null |
cs.AI cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Sentiment analysis is crucial for extracting social signals from social media
content. Due to the prevalence of images in social media, image sentiment
analysis is receiving increasing attention in recent years. However, most
existing systems are black-boxes that do not provide insight on how image
content invokes sentiment and emotion in the viewers. Psychological studies
have confirmed that salient objects in an image often invoke emotions. In this
work, we investigate more fine-grained and more comprehensive interaction
between visual saliency and visual sentiment. In particular, we partition
images in several primary scene-type dimensions, including: open-closed,
natural-manmade, indoor-outdoor, and face-noface. Using state of the art
saliency detection algorithm and sentiment classification algorithm, we examine
how the sentiment of the salient region(s) in an image relates to the overall
sentiment of the image. The experiments on a representative image emotion
dataset have shown interesting correlation between saliency and sentiment in
different scene types and in turn shed light on the mechanism of visual
sentiment evocation.
|
[
{
"version": "v1",
"created": "Mon, 14 Nov 2016 22:02:09 GMT"
}
] | 2016-11-16T00:00:00 |
[
[
"Zheng",
"Honglin",
""
],
[
"Chen",
"Tianlang",
""
],
[
"Luo",
"Jiebo",
""
]
] |
new_dataset
| 0.998967 |
1611.04665
|
Omid Kavehei
|
Jeeson Kim, Taimur Ahmed, Hussein Nili, Jiawei Yang, Doo Seok Jeong,
Paul Beckett, Sharath Sriram, Damith C. Ranasinghe, Omid Kavehei
|
A Physical Unclonable Function with Redox-based Nanoionic Resistive
Memory
|
12 pages, 8 figures
| null | null | null |
cs.ET cond-mat.other
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A unique set of characteristics are packed in emerging nonvolatile
reduction-oxidation (redox)-based resistive switching memories (ReRAMs) such as
their underlying stochastic switching processes alongside their intrinsic
highly nonlinear current-voltage characteristic, which in addition to known
nano-fabrication process variation make them a promising candidate for the next
generation of low-cost, low-power, tiny and secure Physically Unclonable
Functions (PUFs). This paper takes advantage of this otherwise disadvantageous
ReRAM feature using a combination of novel architectural and peripheral
circuitry. We present a physical one-way function, nonlinear resistive Physical
Unclonable Function (nrPUF), potentially applicable in variety of
cyber-physical security applications given its performance characteristics. We
experimentally verified performance of Valency Change Mechanism (VCM)-based
ReRAM in nano-fabricated crossbar arrays across multiple dies and runs. In
addition to a massive pool of Challenge-Response Pairs (CRPs), using a
combination of experimental and simulation, our proposed PUF shows a
reliability of 98.67%, a uniqueness of 49.85%, a diffuseness of 49.86%, a
uniformity of 47.28%, and a bit-aliasing of 47.48%.
|
[
{
"version": "v1",
"created": "Tue, 15 Nov 2016 01:21:33 GMT"
}
] | 2016-11-16T00:00:00 |
[
[
"Kim",
"Jeeson",
""
],
[
"Ahmed",
"Taimur",
""
],
[
"Nili",
"Hussein",
""
],
[
"Yang",
"Jiawei",
""
],
[
"Jeong",
"Doo Seok",
""
],
[
"Beckett",
"Paul",
""
],
[
"Sriram",
"Sharath",
""
],
[
"Ranasinghe",
"Damith C.",
""
],
[
"Kavehei",
"Omid",
""
]
] |
new_dataset
| 0.997764 |
1611.04786
|
Battista Biggio
|
Igino Corona and Battista Biggio and Davide Maiorca
|
AdversariaLib: An Open-source Library for the Security Evaluation of
Machine Learning Algorithms Under Attack
| null | null | null | null |
cs.CR cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present AdversariaLib, an open-source python library for the security
evaluation of machine learning (ML) against carefully-targeted attacks. It
supports the implementation of several attacks proposed thus far in the
literature of adversarial learning, allows for the evaluation of a wide range
of ML algorithms, runs on multiple platforms, and has multi-processing enabled.
The library has a modular architecture that makes it easy to use and to extend
by implementing novel attacks and countermeasures. It relies on other
widely-used open-source ML libraries, including scikit-learn and FANN.
Classification algorithms are implemented and optimized in C/C++, allowing for
a fast evaluation of the simulated attacks. The package is distributed under
the GNU General Public License v3, and it is available for download at
http://sourceforge.net/projects/adversarialib.
|
[
{
"version": "v1",
"created": "Tue, 15 Nov 2016 10:54:58 GMT"
}
] | 2016-11-16T00:00:00 |
[
[
"Corona",
"Igino",
""
],
[
"Biggio",
"Battista",
""
],
[
"Maiorca",
"Davide",
""
]
] |
new_dataset
| 0.996886 |
1611.04853
|
Qingchun Chen
|
Lei Zheng, Qifa Yan, Qingchun Chen, Xiaohu Tang
|
On the Coded Caching Delivery Design over Wireless Networks
|
18 pages, 7 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Coded caching scheme is a promising technique to migrate the network burden
in peak hours, which attains more prominent gains than the uncoded caching. The
coded caching scheme can be classified into two types, namely, the centralized
and the decentralized scheme, according to whether the placement procedures are
carefully designed or operated at random. However, most of the previous
analysis assumes that the connected links between server and users are
error-free. In this paper, we explore the coded caching based delivery design
in wireless networks, where all the connected wireless links are different. For
both centralized and decentralized cases, we proposed two delivery schemes,
namely, the orthogonal delivery scheme and the concurrent delivery scheme. We
focus on the transmission time slots spent on satisfying the system requests,
and prove that for both the centralized and the decentralized cases, the
concurrent delivery always outperforms orthogonal delivery scheme. Furthermore,
for the orthogonal delivery scheme, we derive the gap in terms of transmission
time between the decentralized and centralized case, which is essentially no
more than 1.5.
|
[
{
"version": "v1",
"created": "Tue, 15 Nov 2016 14:29:38 GMT"
}
] | 2016-11-16T00:00:00 |
[
[
"Zheng",
"Lei",
""
],
[
"Yan",
"Qifa",
""
],
[
"Chen",
"Qingchun",
""
],
[
"Tang",
"Xiaohu",
""
]
] |
new_dataset
| 0.993372 |
0704.3199
|
Enrico Paolini
|
E. Paolini, M. Fossorier, M. Chiani
|
Generalized Stability Condition for Generalized and Doubly-Generalized
LDPC Codes
|
5 pages, 2 figures, to appear in Proc. of IEEE ISIT 2007
| null |
10.1109/ISIT.2007.4557440
| null |
cs.IT math.IT
| null |
In this paper, the stability condition for low-density parity-check (LDPC)
codes on the binary erasure channel (BEC) is extended to generalized LDPC
(GLDPC) codes and doublygeneralized LDPC (D-GLDPC) codes. It is proved that, in
both cases, the stability condition only involves the component codes with
minimum distance 2. The stability condition for GLDPC codes is always expressed
as an upper bound to the decoding threshold. This is not possible for D-GLDPC
codes, unless all the generalized variable nodes have minimum distance at least
3. Furthermore, a condition called derivative matching is defined in the paper.
This condition is sufficient for a GLDPC or DGLDPC code to achieve the
stability condition with equality. If this condition is satisfied, the
threshold of D-GLDPC codes (whose generalized variable nodes have all minimum
distance at least 3) and GLDPC codes can be expressed in closed form.
|
[
{
"version": "v1",
"created": "Tue, 24 Apr 2007 14:11:58 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Paolini",
"E.",
""
],
[
"Fossorier",
"M.",
""
],
[
"Chiani",
"M.",
""
]
] |
new_dataset
| 0.997826 |
0708.2273
|
Ozgur Oyman
|
Ozgur Oyman
|
Opportunism in Multiuser Relay Channels: Scheduling, Routing and
Spectrum Reuse
|
5 pages
|
IEEE International Symposium on Information Theory (ISIT), Nice,
France, June 2007
|
10.1109/ISIT.2007.4557240
| null |
cs.IT math.IT
| null |
In order to understand the key merits of multiuser diversity techniques in
relay-assisted cellular multihop networks, this paper analyzes the spectral
efficiency of opportunistic (i.e., channel-aware) scheduling algorithms over a
fading multiuser relay channel with $K$ users in the asymptotic regime of large
(but finite) number of users. Using tools from extreme-value theory, we
characterize the limiting distribution of spectral efficiency focusing on Type
I convergence and utilize it in investigating the large system behavior of the
multiuser relay channel as a function of the number of users and physical
channel signal-to-noise ratios (SNRs). Our analysis results in very accurate
formulas in the large (but finite) $K$ regime, provides insights on the
potential performance enhancements from multihop routing and spectrum reuse
policies in the presence of multiuser diversity gains from opportunistic
scheduling and helps to identify the regimes and conditions in which
relay-assisted multiuser communication provides a clear advantage over direct
multiuser communication.
|
[
{
"version": "v1",
"created": "Thu, 16 Aug 2007 21:44:43 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Oyman",
"Ozgur",
""
]
] |
new_dataset
| 0.993411 |
0712.1169
|
Shengshan Cui
|
Shengshan Cui, Alexander M. Haimovich, Oren Somekh and H. Vincent Poor
|
Opportunistic Relaying in Wireless Networks
|
17 pages, 8 figures, To appear in IEEE Transactions on Information
Theory
| null |
10.1109/TIT.2009.2030435
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Relay networks having $n$ source-to-destination pairs and $m$ half-duplex
relays, all operating in the same frequency band in the presence of block
fading, are analyzed. This setup has attracted significant attention and
several relaying protocols have been reported in the literature. However, most
of the proposed solutions require either centrally coordinated scheduling or
detailed channel state information (CSI) at the transmitter side. Here, an
opportunistic relaying scheme is proposed, which alleviates these limitations.
The scheme entails a two-hop communication protocol, in which sources
communicate with destinations only through half-duplex relays. The key idea is
to schedule at each hop only a subset of nodes that can benefit from
\emph{multiuser diversity}. To select the source and destination nodes for each
hop, it requires only CSI at receivers (relays for the first hop, and
destination nodes for the second hop) and an integer-value CSI feedback to the
transmitters. For the case when $n$ is large and $m$ is fixed, it is shown that
the proposed scheme achieves a system throughput of $m/2$ bits/s/Hz. In
contrast, the information-theoretic upper bound of $(m/2)\log \log n$ bits/s/Hz
is achievable only with more demanding CSI assumptions and cooperation between
the relays. Furthermore, it is shown that, under the condition that the product
of block duration and system bandwidth scales faster than $\log n$, the
achievable throughput of the proposed scheme scales as $\Theta ({\log n})$.
Notably, this is proven to be the optimal throughput scaling even if
centralized scheduling is allowed, thus proving the optimality of the proposed
scheme in the scaling law sense.
|
[
{
"version": "v1",
"created": "Fri, 7 Dec 2007 16:19:52 GMT"
},
{
"version": "v2",
"created": "Wed, 7 Jan 2009 07:17:19 GMT"
},
{
"version": "v3",
"created": "Fri, 24 Jul 2009 06:06:23 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Cui",
"Shengshan",
""
],
[
"Haimovich",
"Alexander M.",
""
],
[
"Somekh",
"Oren",
""
],
[
"Poor",
"H. Vincent",
""
]
] |
new_dataset
| 0.996671 |
0802.1815
|
Ding Yang
|
Yang Ding
|
A Construction for Constant-Composition Codes
|
4 pages, submitted to IEEE Infromation Theory
| null |
10.1109/TIT.2008.926380
| null |
cs.IT math.IT
| null |
By employing the residue polynomials, a construction of constant-composition
codes is given. This construction generalizes the one proposed by Xing[16]. It
turns out that when d=3 this construction gives a lower bound of
constant-composition codes improving the one in [10]. Moreover, for d>3, we
give a lower bound on maximal size of constant-composition codes. In
particular, our bound for d=5 gives the best possible size of
constant-composition codes up to magnitude.
|
[
{
"version": "v1",
"created": "Wed, 13 Feb 2008 12:59:04 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Ding",
"Yang",
""
]
] |
new_dataset
| 0.998961 |
0803.3632
|
Mikhail Nesterenko
|
Mikhail Nesterenko, Adnan Vora
|
Void Traversal for Guaranteed Delivery in Geometric Routing
| null |
The 2nd IEEE International Conference on Mobile Ad-hoc and Sensor
Systems (MASS 2005), Washington, DC, November, 2005
|
10.1109/MAHSS.2005.1542862
| null |
cs.OS cs.DC cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Geometric routing algorithms like GFG (GPSR) are lightweight, scalable
algorithms that can be used to route in resource-constrained ad hoc wireless
networks. However, such algorithms run on planar graphs only. To efficiently
construct a planar graph, they require a unit-disk graph. To make the topology
unit-disk, the maximum link length in the network has to be selected
conservatively. In practical setting this leads to the designs where the node
density is rather high. Moreover, the network diameter of a planar subgraph is
greater than the original graph, which leads to longer routes. To remedy this
problem, we propose a void traversal algorithm that works on arbitrary
geometric graphs. We describe how to use this algorithm for geometric routing
with guaranteed delivery and compare its performance with GFG.
|
[
{
"version": "v1",
"created": "Tue, 25 Mar 2008 20:52:17 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Nesterenko",
"Mikhail",
""
],
[
"Vora",
"Adnan",
""
]
] |
new_dataset
| 0.978078 |
0804.0996
|
Boris Kudryashov D.
|
Irina E. Bocharova, Rolf Johannesson, Boris D.Kudryashov, Victor V.
Zyablov
|
Woven Graph Codes: Asymptotic Performances and Examples
|
Submitted to IEEE Trans. Inform. Theory
| null |
10.1109/TIT.2009.2034787
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Constructions of woven graph codes based on constituent block and
convolutional codes are studied. It is shown that within the random ensemble of
such codes based on $s$-partite, $s$-uniform hypergraphs, where $s$ depends
only on the code rate, there exist codes satisfying the Varshamov-Gilbert (VG)
and the Costello lower bound on the minimum distance and the free distance,
respectively. A connection between regular bipartite graphs and tailbiting
codes is shown. Some examples of woven graph codes are presented. Among them an
example of a rate $R_{\rm wg}=1/3$ woven graph code with $d_{\rm free}=32$
based on Heawood's bipartite graph and containing $n=7$ constituent rate
$R^{c}=2/3$ convolutional codes with overall constraint lengths $\nu^{c}=5$ is
given. An encoding procedure for woven graph codes with complexity proportional
to the number of constituent codes and their overall constraint length
$\nu^{c}$ is presented.
|
[
{
"version": "v1",
"created": "Mon, 7 Apr 2008 09:56:10 GMT"
},
{
"version": "v2",
"created": "Tue, 22 Apr 2008 09:21:50 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Bocharova",
"Irina E.",
""
],
[
"Johannesson",
"Rolf",
""
],
[
"Kudryashov",
"Boris D.",
""
],
[
"Zyablov",
"Victor V.",
""
]
] |
new_dataset
| 0.999774 |
0804.2998
|
G.Susinder Rajan
|
G. Susinder Rajan and B. Sundar Rajan
|
OFDM based Distributed Space Time Coding for Asynchronous Relay Networks
|
5 pages, 2 figures, to appear in IEEE International Conference on
Communications, Beijing, China, May 19-23, 2008
| null |
10.1109/ICC.2008.218
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recently Li and Xia have proposed a transmission scheme for wireless relay
networks based on the Alamouti space time code and orthogonal frequency
division multiplexing to combat the effect of timing errors at the relay nodes.
This transmission scheme is amazingly simple and achieves a diversity order of
two for any number of relays. Motivated by its simplicity, this scheme is
extended to a more general transmission scheme that can achieve full
cooperative diversity for any number of relays. The conditions on the
distributed space time block code (DSTBC) structure that admit its application
in the proposed transmission scheme are identified and it is pointed out that
the recently proposed full diversity four group decodable DSTBCs from precoded
co-ordinate interleaved orthogonal designs and extended Clifford algebras
satisfy these conditions. It is then shown how differential encoding at the
source can be combined with the proposed transmission scheme to arrive at a new
transmission scheme that can achieve full cooperative diversity in asynchronous
wireless relay networks with no channel information and also no timing error
knowledge at the destination node. Finally, four group decodable distributed
differential space time block codes applicable in this new transmission scheme
for power of two number of relays are also provided.
|
[
{
"version": "v1",
"created": "Fri, 18 Apr 2008 11:17:50 GMT"
},
{
"version": "v2",
"created": "Sat, 19 Apr 2008 09:19:49 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Rajan",
"G. Susinder",
""
],
[
"Rajan",
"B. Sundar",
""
]
] |
new_dataset
| 0.999324 |
0804.4187
|
Hazer Inaltekin
|
Hazer Inaltekin, Mung Chiang, Harold Vincent Poor and Stephen B.
Wicker
|
On the Asymptotic Behavior of Selfish Transmitters Sharing a Common
Channel
|
Proceedings of the 2008 IEEE International Symposium on Information
Theory, Toronto, ON, Canada, July 6 - 11, 2008
| null |
10.1109/ISIT.2008.4595345
| null |
cs.IT cs.GT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper analyzes the asymptotic behavior of a multiple-access network
comprising a large number of selfish transmitters competing for access to a
common wireless communication channel, and having different utility functions
for determining their strategies. A necessary and sufficient condition is given
for the total number of packet arrivals from selfish transmitters to converge
in distribution. The asymptotic packet arrival distribution at Nash equilibrium
is shown to be a mixture of a Poisson distribution and finitely many Bernoulli
distributions.
|
[
{
"version": "v1",
"created": "Sat, 26 Apr 2008 18:31:59 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Inaltekin",
"Hazer",
""
],
[
"Chiang",
"Mung",
""
],
[
"Poor",
"Harold Vincent",
""
],
[
"Wicker",
"Stephen B.",
""
]
] |
new_dataset
| 0.996103 |
0805.0241
|
David G. M. Mitchell
|
David G. M. Mitchell, Ali E. Pusane, Kamil Sh. Zigangirov, and Daniel
J. Costello, Jr
|
Asymptotically Good LDPC Convolutional Codes Based on Protographs
|
Proceedings of the 2008 IEEE International Symposium on Information
Theory, Toronto, ON, Canada, July 6 - 11, 2008
| null |
10.1109/ISIT.2008.4595143
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
LDPC convolutional codes have been shown to be capable of achieving the same
capacity-approaching performance as LDPC block codes with iterative
message-passing decoding. In this paper, asymptotic methods are used to
calculate a lower bound on the free distance for several ensembles of
asymptotically good protograph-based LDPC convolutional codes. Further, we show
that the free distance to constraint length ratio of the LDPC convolutional
codes exceeds the minimum distance to block length ratio of corresponding LDPC
block codes.
|
[
{
"version": "v1",
"created": "Fri, 2 May 2008 16:13:16 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Mitchell",
"David G. M.",
""
],
[
"Pusane",
"Ali E.",
""
],
[
"Zigangirov",
"Kamil Sh.",
""
],
[
"Costello,",
"Daniel J.",
"Jr"
]
] |
new_dataset
| 0.997091 |
0806.1819
|
Pavan Srinath
|
K. Pavan Srinath, B. Sundar Rajan
|
A Low-Complexity, Full-Rate, Full-Diversity 2 X 2 STBC with Golden
Code's Coding Gain
|
Submitted to IEEE Globecom - 2008. 6 pages, 3 figures, 1 table
| null |
10.1109/GLOCOM.2008.ECP.235
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a low-ML-decoding-complexity, full-rate, full-diversity
space-time block code (STBC) for a 2 transmit antenna, 2 receive antenna
multiple-input multiple-output (MIMO) system, with coding gain equal to that of
the best and well known Golden code for any QAM constellation. Recently, two
codes have been proposed (by Paredes, Gershman and Alkhansari and by Sezginer
and Sari), which enjoy a lower decoding complexity relative to the Golden code,
but have lesser coding gain. The $2\times 2$ STBC presented in this paper has
lesser decoding complexity for non-square QAM constellations, compared with
that of the Golden code, while having the same decoding complexity for square
QAM constellations. Compared with the Paredes-Gershman-Alkhansari and
Sezginer-Sari codes, the proposed code has the same decoding complexity for
non-rectangular QAM constellations. Simulation results, which compare the
codeword error rate (CER) performance, are presented.
|
[
{
"version": "v1",
"created": "Wed, 11 Jun 2008 09:25:09 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Srinath",
"K. Pavan",
""
],
[
"Rajan",
"B. Sundar",
""
]
] |
new_dataset
| 0.987988 |
0807.4770
|
Zhang Shengli
|
Shengli Zhang, Soung-Chang Liew
|
Channel Coding and Decoding in a Relay System Operated with Physical
layer Network Coding
| null |
IEEE journal on selection area in communications, Jun. 2009
|
10.1109/JSAC.2009.090618
| null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Physical-layer Network Coding (PNC) can significantly improve the throughput
of wireless two way relay channel (TWRC) by allowing the two end nodes to
transmit messages to the relay simultaneously. To achieve reliable
communication, channel coding could be applied on top of PNC. This paper
investigates link-by-link channel-coded PNC, in which a critical process at the
relay is to transform the superimposed channel-coded packets received from the
two end nodes plus noise, Y3=X1+X2+W3, to the network-coded combination of the
source packets, S1 XOR S2 . This is in distinct to the traditional
multiple-access problem, in which the goal is to obtain S1 and S2 separately.
The transformation from Y3 to (S1 XOR S2) is referred to as the
Channel-decoding-Network-Coding process (CNC) in that it involves both channel
decoding and network coding operations. A contribution of this paper is the
insight that in designing CNC, we should first (i) channel-decode Y3 to the
superimposed source symbols S1+S2 before (ii) transforming S1+S2 to the
network-coded packets (S1 XOR S2) . Compared with previously proposed
strategies for CNC, this strategy reduces the channel-coding network-coding
mismatch. It is not obvious, however, that an efficient decoder for step (i)
exists. A second contribution of this paper is to provide an explicit
construction of such a decoder based on the use of the Repeat Accumulate (RA)
code. Specifically, we redesign the belief propagation algorithm of the RA code
for traditional point-to-point channel to suit the need of the PNC
multiple-access channel. Simulation results show that our new scheme
outperforms the previously proposed schemes significantly in terms of BER
without added complexity.
|
[
{
"version": "v1",
"created": "Wed, 30 Jul 2008 02:44:37 GMT"
},
{
"version": "v2",
"created": "Mon, 18 Jan 2010 07:04:05 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Zhang",
"Shengli",
""
],
[
"Liew",
"Soung-Chang",
""
]
] |
new_dataset
| 0.999066 |
0901.0163
|
Manish Agarwal
|
Manish Agarwal, Dongning Guo, Michael Honig
|
Limited-Rate Channel State Feedback for Multicarrier Block Fading
Channels
|
Submitted to IEEE Transactions on Information Theory
| null |
10.1109/TIT.2010.2080970
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The capacity of a fading channel can be substantially increased by feeding
back channel state information from the receiver to the transmitter. With
limited-rate feedback what state information to feed back and how to encode it
are important open questions. This paper studies power loading in a
multicarrier system using no more than one bit of feedback per sub-channel. The
sub-channels can be correlated and full channel state information is assumed at
the receiver.
|
[
{
"version": "v1",
"created": "Thu, 1 Jan 2009 05:35:05 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Agarwal",
"Manish",
""
],
[
"Guo",
"Dongning",
""
],
[
"Honig",
"Michael",
""
]
] |
new_dataset
| 0.967857 |
0901.2913
|
MinJi Kim
|
MinJi Kim, Muriel Medard, Joao Barros, Ralf Koetter
|
An Algebraic Watchdog for Wireless Network Coding
|
5 pages, 4 figures, submitted to IEEE International Symposium on
Information Theory (ISIT) 2009. This is the final version. The content has
been changed to incorporate reviewer comments and recent results
| null |
10.1109/ISIT.2009.5206004
| null |
cs.NI cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a scheme, called the "algebraic watchdog" for
wireless network coding, in which nodes can detect malicious behaviors
probabilistically, police their downstream neighbors locally using overheard
messages, and, thus, provide a secure global "self-checking network". Unlike
traditional Byzantine detection protocols which are receiver-based, this
protocol gives the senders an active role in checking the node downstream. This
work is inspired by Marti et. al.'s watchdog-pathrater, which attempts to
detect and mitigate the effects of routing misbehavior.
As the first building block of a such system, we focus on a two-hop network.
We present a graphical model to understand the inference process nodes execute
to police their downstream neighbors; as well as to compute, analyze, and
approximate the probabilities of misdetection and false detection. In addition,
we present an algebraic analysis of the performance using an hypothesis testing
framework, that provides exact formulae for probabilities of false detection
and misdetection.
|
[
{
"version": "v1",
"created": "Mon, 19 Jan 2009 19:03:04 GMT"
},
{
"version": "v2",
"created": "Mon, 25 May 2009 17:28:09 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Kim",
"MinJi",
""
],
[
"Medard",
"Muriel",
""
],
[
"Barros",
"Joao",
""
],
[
"Koetter",
"Ralf",
""
]
] |
new_dataset
| 0.952738 |
0902.1278
|
Salah A. Aly
|
Salah A. Aly, Zhenning Kong, Emina Soljanin
|
Fountain Codes Based Distributed Storage Algorithms for Large-scale
Wireless Sensor Networks
|
A method to estimate the total number of nodes in a graph is
presented in this 12 pages
|
Proc. IEEE/ACM IPSN 2008, pp 171-182
|
10.1109/IPSN.2008.64
| null |
cs.IT cs.DS cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider large-scale sensor networks with n nodes, out of which k are in
possession, (e.g., have sensed or collected in some other way) k information
packets. In the scenarios in which network nodes are vulnerable because of, for
example, limited energy or a hostile environment, it is desirable to
disseminate the acquired information throughout the network so that each of the
n nodes stores one (possibly coded) packet and the original k source packets
can be recovered later in a computationally simple way from any (1 + \epsilon)k
nodes for some small \epsilon > 0.
We developed two distributed algorithms for solving this problem based on
simple random walks and Fountain codes. Unlike all previously developed
schemes, our solution is truly distributed, that is, nodes do not know n, k or
connectivity in the network, except in their own neighborhoods, and they do not
maintain any routing tables. In the first algorithm, all the sensors have the
knowledge of n and k. In the second algorithm, each sensor estimates these
parameters through the random walk dissemination. We present analysis of the
communication/transmission and encoding/decoding complexity of these two
algorithms, and provide extensive simulation results as well
|
[
{
"version": "v1",
"created": "Sun, 8 Feb 2009 07:49:20 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Aly",
"Salah A.",
""
],
[
"Kong",
"Zhenning",
""
],
[
"Soljanin",
"Emina",
""
]
] |
new_dataset
| 0.998147 |
0907.1992
|
Zhi Quan
|
Zhi Quan, Stephen J. Shellhammer, Wenyi Zhang, and Ali H. Sayed
|
Spectrum sensing by cognitive radios at very low SNR
|
IEEE Global Communications Conference 2009
| null |
10.1109/GLOCOM.2009.5426262
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Spectrum sensing is one of the enabling functionalities for cognitive radio
(CR) systems to operate in the spectrum white space. To protect the primary
incumbent users from interference, the CR is required to detect incumbent
signals at very low signal-to-noise ratio (SNR). In this paper, we present a
spectrum sensing technique based on correlating spectra for detection of
television (TV) broadcasting signals. The basic strategy is to correlate the
periodogram of the received signal with the a priori known spectral features of
the primary signal. We show that according to the Neyman-Pearson criterion,
this spectral correlation-based sensing technique is asymptotically optimal at
very low SNR and with a large sensing time. From the system design perspective,
we analyze the effect of the spectral features on the spectrum sensing
performance. Through the optimization analysis, we obtain useful insights on
how to choose effective spectral features to achieve reliable sensing.
Simulation results show that the proposed sensing technique can reliably detect
analog and digital TV signals at SNR as low as -20 dB.
|
[
{
"version": "v1",
"created": "Sat, 11 Jul 2009 20:38:37 GMT"
},
{
"version": "v2",
"created": "Tue, 14 Jul 2009 05:15:30 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Quan",
"Zhi",
""
],
[
"Shellhammer",
"Stephen J.",
""
],
[
"Zhang",
"Wenyi",
""
],
[
"Sayed",
"Ali H.",
""
]
] |
new_dataset
| 0.993084 |
0910.0733
|
Manar Mohaisen
|
Manar Mohaisen, KyungHi Chang
|
Co-Channel Interference Cancellation in OFDM Networks using Coordinated
Symbol Repetition and Soft Decision MLE CCI Canceler
|
4 pages, 8 figures, IEEE International Conference on Signal
Processing and Communications, 2007. ICSPC 2007
| null |
10.1109/ICSPC.2007.4728510
| null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a new scheme of downlink co-channel interference (CCI)
cancellation in OFDM cellular networks is introduced for users at the
cell-edge. Coordinated symbol transmission between base stations (BS) is
operated where the same symbol is transmitted from different BS on different
sub-carriers. At the mobile station (MS) receiver, we introduce a soft decision
maximum likelihood CCI canceler and a modified maximum ratio combining (M-MRC)
to obtain an estimate of the transmitted symbols. Weights used in the combining
method are derived from the channels coefficients between the cooperated BS and
the MS. Simulations show that the proposed scheme works well under
frequency-selective channels and frequency non-selective channels. A gain of 9
dB and 6 dB in SIR is obtained under multipath fading and flat-fading channels,
respectively.
|
[
{
"version": "v1",
"created": "Mon, 5 Oct 2009 11:38:36 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Mohaisen",
"Manar",
""
],
[
"Chang",
"KyungHi",
""
]
] |
new_dataset
| 0.999223 |
1001.3475
|
Bo Niu
|
Bo Niu, Mihaela C. Beluri, Zinan Lin, Prabhakar Chitrapu
|
Relay Assisted Cooperative OSTBC Communication with SNR Imbalance and
Channel Estimation Errors
|
5 pages, 3 figures, IEEE 69th Vehicular Technology Conference
| null |
10.1109/VETECS.2009.5073832
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a two-hop relay assisted cooperative Orthogonal Space-Time
Block Codes (OSTBC) transmission scheme is considered for the downlink
communication of a cellular system, where the base station (BS) and the relay
station (RS) cooperate and transmit data to the user equipment (UE) in a
distributed fashion. We analyze the impact of the SNR imbalance between the
BS-UE and RS-UE links, as well as the imperfect channel estimation at the UE
receiver. The performance is analyzed in the presence of Rayleigh flat fading
and our results show that the SNR imbalance does not impact the spatial
diversity order. On the other hand, channel estimation errors have a larger
impact on the system performance. Simulation results are then provided to
confirm the analysis.
|
[
{
"version": "v1",
"created": "Wed, 20 Jan 2010 07:22:21 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Niu",
"Bo",
""
],
[
"Beluri",
"Mihaela C.",
""
],
[
"Lin",
"Zinan",
""
],
[
"Chitrapu",
"Prabhakar",
""
]
] |
new_dataset
| 0.998087 |
1004.0346
|
Roghieh Joda
|
Roghayeh Joda, Farshad Lahouti
|
Network Code Design for Orthogonal Two-hop Network with Broadcasting
Relay: A Joint Source-Channel-Network Coding Approach
|
27 pages, 9 figures, Submited to IEEE Transaction on Communication
| null |
10.1109/TCOMM.2011.112311.100515
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper addresses network code design for robust transmission of sources
over an orthogonal two-hop wireless network with a broadcasting relay. The
network consists of multiple sources and destinations in which each
destination, benefiting the relay signal, intends to decode a subset of the
sources. Two special instances of this network are orthogonal broadcast relay
channel and the orthogonal multiple access relay channel. The focus is on
complexity constrained scenarios, e.g., for wireless sensor networks, where
channel coding is practically imperfect. Taking a source-channel and network
coding approach, we design the network code (mapping) at the relay such that
the average reconstruction distortion at the destinations is minimized. To this
end, by decomposing the distortion into its components, an efficient design
algorithm is proposed. The resulting network code is nonlinear and
substantially outperforms the best performing linear network code. A motivating
formulation of a family of structured nonlinear network codes is also
presented. Numerical results and comparison with linear network coding at the
relay and the corresponding distortion-power bound demonstrate the
effectiveness of the proposed schemes and a promising research direction.
|
[
{
"version": "v1",
"created": "Fri, 2 Apr 2010 14:36:34 GMT"
},
{
"version": "v2",
"created": "Tue, 14 Sep 2010 14:04:24 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Joda",
"Roghayeh",
""
],
[
"Lahouti",
"Farshad",
""
]
] |
new_dataset
| 0.982034 |
1006.0284
|
Takahiro Ota Ph.D
|
Takahiro Ota, Hiroyoshi Morita
|
Asymptotic Optimality of Antidictionary Codes
|
5 pages, to appear in the proceedings of 2010 IEEE International
Symposium on Information Theory (ISIT2010)
| null |
10.1109/ISIT.2010.5513281
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An antidictionary code is a lossless compression algorithm using an
antidictionary which is a set of minimal words that do not occur as substrings
in an input string. The code was proposed by Crochemore et al. in 2000, and its
asymptotic optimality has been proved with respect to only a specific
information source, called balanced binary source that is a binary Markov
source in which a state transition occurs with probability 1/2 or 1. In this
paper, we prove the optimality of both static and dynamic antidictionary codes
with respect to a stationary ergodic Markov source on finite alphabet such that
a state transition occurs with probability $p (0 < p \leq 1)$.
|
[
{
"version": "v1",
"created": "Wed, 2 Jun 2010 03:14:46 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Ota",
"Takahiro",
""
],
[
"Morita",
"Hiroyoshi",
""
]
] |
new_dataset
| 0.997871 |
1006.0763
|
Mubarak Jibril
|
Mubarak Jibril, Martin tomlinson, Mohammed Zaki Ahmed and Cen Tjhai
|
Good Codes From Generalised Algebraic Geometry Codes
|
3 pages, to be presented at the IEEE Symposium on Information Theory
(ISIT 2010) in Austin, Texas, June 2010
| null |
10.1109/ISIT.2010.5513687
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Algebraic geometry codes or Goppa codes are defined with places of degree
one. In constructing generalised algebraic geometry codes places of higher
degree are used. In this paper we present 41 new codes over GF(16) which
improve on the best known codes of the same length and rate. The construction
method uses places of small degree with a technique originally published over
10 years ago for the construction of generalised algebraic geometry codes.
|
[
{
"version": "v1",
"created": "Fri, 4 Jun 2010 01:00:43 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Jibril",
"Mubarak",
""
],
[
"tomlinson",
"Martin",
""
],
[
"Ahmed",
"Mohammed Zaki",
""
],
[
"Tjhai",
"Cen",
""
]
] |
new_dataset
| 0.999498 |
1006.4255
|
Eren Sasoglu
|
Eren Sasoglu, Emre Telatar, Edmund Yeh
|
Polar codes for the two-user multiple-access channel
|
12 pages. Submitted to the IEEE Transactions on Information Theory
| null |
10.1109/TIT.2013.2268946
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Arikan's polar coding method is extended to two-user multiple-access
channels. It is shown that if the two users of the channel use the Arikan
construction, the resulting channels will polarize to one of five possible
extremals, on each of which uncoded transmission is optimal. The sum rate
achieved by this coding technique is the one that correponds to uniform input
distributions. The encoding and decoding complexities and the error performance
of these codes are as in the single-user case: $O(n\log n)$ for encoding and
decoding, and $o(\exp(-n^{1/2-\epsilon}))$ for block error probability, where
$n$ is the block length.
|
[
{
"version": "v1",
"created": "Tue, 22 Jun 2010 10:34:33 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Sasoglu",
"Eren",
""
],
[
"Telatar",
"Emre",
""
],
[
"Yeh",
"Edmund",
""
]
] |
new_dataset
| 0.999108 |
1006.5879
|
Ashish Khisti
|
Ashish Khisti, Gregory Wornell
|
Secure Transmission with Multiple Antennas II: The MIMOME Wiretap
Channel
|
To Appear, IEEE Trans. Information Theory
| null |
10.1109/TIT.2010.2068852
| null |
cs.IT cs.CR math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The capacity of the Gaussian wiretap channel model is analyzed when there are
multiple antennas at the sender, intended receiver and eavesdropper. The
associated channel matrices are fixed and known to all the terminals. A
computable characterization of the secrecy capacity is established as the
saddle point solution to a minimax problem. The converse is based on a
Sato-type argument used in other broadcast settings, and the coding theorem is
based on Gaussian wiretap codebooks.
At high signal-to-noise ratio (SNR), the secrecy capacity is shown to be
attained by simultaneously diagonalizing the channel matrices via the
generalized singular value decomposition, and independently coding across the
resulting parallel channels. The associated capacity is expressed in terms of
the corresponding generalized singular values. It is shown that a semi-blind
"masked" multi-input multi-output (MIMO) transmission strategy that sends
information along directions in which there is gain to the intended receiver,
and synthetic noise along directions in which there is not, can be arbitrarily
far from capacity in this regime.
Necessary and sufficient conditions for the secrecy capacity to be zero are
provided, which simplify in the limit of many antennas when the entries of the
channel matrices are independent and identically distributed. The resulting
scaling laws establish that to prevent secure communication, the eavesdropper
needs 3 times as many antennas as the sender and intended receiver have
jointly, and that the optimimum division of antennas between sender and
intended receiver is in the ratio of 2:1.
|
[
{
"version": "v1",
"created": "Wed, 30 Jun 2010 15:10:04 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Khisti",
"Ashish",
""
],
[
"Wornell",
"Gregory",
""
]
] |
new_dataset
| 0.969684 |
1010.5644
|
Camilla Hollanti
|
Roope Vehkalahti, Camilla Hollanti, and Fr\'ed\'erique Oggier
|
Fast-Decodable Asymmetric Space-Time Codes from Division Algebras
|
26 pages, 1 figure, submitted to IEEE Trans. Inf. Theory, October
2010
| null |
10.1109/TIT.2011.2176310
| null |
cs.IT math.IT math.RA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Multiple-input double-output (MIDO) codes are important in the near-future
wireless communications, where the portable end-user device is physically small
and will typically contain at most two receive antennas. Especially tempting is
the 4 x 2 channel due to its immediate applicability in the digital video
broadcasting (DVB). Such channels optimally employ rate-two space-time (ST)
codes consisting of (4 x 4) matrices. Unfortunately, such codes are in general
very complex to decode, hence setting forth a call for constructions with
reduced complexity.
Recently, some reduced complexity constructions have been proposed, but they
have mainly been based on different ad hoc methods and have resulted in
isolated examples rather than in a more general class of codes. In this paper,
it will be shown that a family of division algebra based MIDO codes will always
result in at least 37.5% worst-case complexity reduction, while maintaining
full diversity and, for the first time, the non-vanishing determinant (NVD)
property. The reduction follows from the fact that, similarly to the Alamouti
code, the codes will be subsets of matrix rings of the Hamiltonian quaternions,
hence allowing simplified decoding. At the moment, such reductions are among
the best known for rate-two MIDO codes. Several explicit constructions are
presented and shown to have excellent performance through computer simulations.
|
[
{
"version": "v1",
"created": "Wed, 27 Oct 2010 11:03:01 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Vehkalahti",
"Roope",
""
],
[
"Hollanti",
"Camilla",
""
],
[
"Oggier",
"Frédérique",
""
]
] |
new_dataset
| 0.963627 |
1011.5274
|
Amitav Mukherjee
|
Amitav Mukherjee, A. Lee Swindlehurst
|
Jamming Games in the MIMO Wiretap Channel With an Active Eavesdropper
|
27 pages, 8 figures. To appear, IEEE Transactions on Signal
Processing
| null |
10.1109/TSP.2012.2222386
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper investigates reliable and covert transmission strategies in a
multiple-input multiple-output (MIMO) wiretap channel with a transmitter,
receiver and an adversarial wiretapper, each equipped with multiple antennas.
In a departure from existing work, the wiretapper possesses a novel capability
to act either as a passive eavesdropper or as an active jammer, under a
half-duplex constraint. The transmitter therefore faces a choice between
allocating all of its power for data, or broadcasting artificial interference
along with the information signal in an attempt to jam the eavesdropper
(assuming its instantaneous channel state is unknown). To examine the resulting
trade-offs for the legitimate transmitter and the adversary, we model their
interactions as a two-person zero-sum game with the ergodic MIMO secrecy rate
as the payoff function. We first examine conditions for the existence of
pure-strategy Nash equilibria (NE) and the structure of mixed-strategy NE for
the strategic form of the game.We then derive equilibrium strategies for the
extensive form of the game where players move sequentially under scenarios of
perfect and imperfect information. Finally, numerical simulations are presented
to examine the equilibrium outcomes of the various scenarios considered.
|
[
{
"version": "v1",
"created": "Wed, 24 Nov 2010 02:23:16 GMT"
},
{
"version": "v2",
"created": "Tue, 25 Sep 2012 05:04:58 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Mukherjee",
"Amitav",
""
],
[
"Swindlehurst",
"A. Lee",
""
]
] |
new_dataset
| 0.996764 |
1101.0250
|
Jaydip Sen
|
Jaydip Sen
|
An Adaptive and Multi-Service Routing Protocol for Wireless Sensor
Networks
|
6 pages, 8 figures. 16th IEEE Asia-Pacific Conference on
Communications (APCC) 2010, Auckland, New Zealand, October 31 - November 3,
2010
| null |
10.1109/APCC.2010.5679779
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless Sensor Networks (WSNs) are highly distributed networks consisting of
a large number of tiny, low-cost, light-weight wireless nodes deployed to
monitor an environment or a system. Each node in a WSN consists of three
subsystems: the sensor subsystem which senses the environment, the processing
subsystem which performs local computations on the sensed data, and the
communication subsystem which is responsible for message exchange with
neighboring sensor nodes. While an individual sensor node has limited sensing
region, processing power, and energy, networking a large number of sensor nodes
give rise to a robust, reliable, and accurate sensor network covering a wide
region. Thus, routing in WSNs is a very important issue. This paper presents a
query-based routing protocol for a WSN that provides different levels of
Quality of Service (QoS): energy-efficiency, reliability, low latency and
fault-tolerance-under different application scenarios. The algorithm has low
computational complexity but can dynamically guarantee different QoS support
depending on the requirement of the applications. The novelty of the proposed
algorithm is its ability to provide multiple QoS support without
reconfiguration and redeployment of the sensor nodes. The algorithm is
implemented in network simulator ns-2 and its performance has been evaluated.
The results show that the algorithm is more efficient than some of the
currently existing routing algorithms for WSNs.
|
[
{
"version": "v1",
"created": "Fri, 31 Dec 2010 12:49:32 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Sen",
"Jaydip",
""
]
] |
new_dataset
| 0.989092 |
1102.3561
|
Chandramani Singh
|
Eitan Altman, Anurag Kumar, Chandramani Singh and Rajesh Sundaresan
|
Spatial SINR Games of Base Station Placement and Mobile Association
| null |
IEEE INFOCOM, April, 2009, Rio De Janeiro, Brazil
|
10.1109/INFCOM.2009.5062081
| null |
cs.NI cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study the question of determining locations of base stations that may
belong to the same or to competing service providers. We take into account the
impact of these decisions on the behavior of intelligent mobile terminals who
can connect to the base station that offers the best utility. The signal to
interference and noise ratio is used as the quantity that determines the
association. We first study the SINR association-game: we determine the cells
corresponding to each base stations, i.e., the locations at which mobile
terminals prefer to connect to a given base station than to others. We make
some surprising observations: (i) displacing a base station a little in one
direction may result in a displacement of the boundary of the corresponding
cell to the opposite direction; (ii) A cell corresponding to a BS may be the
union of disconnected sub-cells. We then study the hierarchical equilibrium in
the combined BS location and mobile association problem: we determine where to
locate the BSs so as to maximize the revenues obtained at the induced SINR
mobile association game. We consider the cases of single frequency band and two
frequency bands of operation. Finally, we also consider hierarchical equilibria
in two frequency systems with successive interference cancellation.
|
[
{
"version": "v1",
"created": "Thu, 17 Feb 2011 11:17:25 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Altman",
"Eitan",
""
],
[
"Kumar",
"Anurag",
""
],
[
"Singh",
"Chandramani",
""
],
[
"Sundaresan",
"Rajesh",
""
]
] |
new_dataset
| 0.970788 |
1103.4086
|
Jean-Claude Belfiore
|
Fr\'ed\'erique Oggier and Patrick Sol\'e and Jean-Claude Belfiore
|
Lattice Codes for the Wiretap Gaussian Channel: Construction and
Analysis
|
43 pages, 16 figures, submitted to IEEE Trans. on Inform. Theory
| null |
10.1007/978-3-642-20901-7_3
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider the Gaussian wiretap channel, where two legitimate players Alice
and Bob communicate over an additive white Gaussian noise (AWGN) channel, while
Eve is eavesdropping, also through an AWGN channel. We propose a coding
strategy based on lattice coset encoding. We analyze Eve's probability of
decoding, from which we define the secrecy gain as a design criterion for
wiretap lattice codes, expressed in terms of the lattice theta series, which
characterizes Eve's confusion as a function of the channel parameters. The
secrecy gain is studied for even unimodular lattices, and an asymptotic
analysis shows that it grows exponentially in the dimension of the lattice.
Examples of wiretap lattice codes are given. Interestingly, minimizing Eve's
probability of error involves the same optimization of the theta series as does
the flatness factor, another newly defined code design that characterizes
lattice codes that achieve strong secrecy.
|
[
{
"version": "v1",
"created": "Mon, 21 Mar 2011 17:17:41 GMT"
},
{
"version": "v2",
"created": "Tue, 8 Jan 2013 09:27:59 GMT"
},
{
"version": "v3",
"created": "Wed, 9 Jan 2013 17:34:54 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Oggier",
"Frédérique",
""
],
[
"Solé",
"Patrick",
""
],
[
"Belfiore",
"Jean-Claude",
""
]
] |
new_dataset
| 0.99006 |
1106.6174
|
Jianquan Liu
|
Jianquan Liu, Meixia Tao, and Youyun Xu
|
Pairwise Check Decoding for LDPC Coded Two-Way Relay Block Fading
Channels
|
to appear in IEEE Trans. on Communications, 2012
| null |
10.1109/TCOMM.2012.050812.110187
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Partial decoding has the potential to achieve a larger capacity region than
full decoding in two-way relay (TWR) channels. Existing partial decoding
realizations are however designed for Gaussian channels and with a static
physical layer network coding (PLNC). In this paper, we propose a new solution
for joint network coding and channel decoding at the relay, called pairwise
check decoding (PCD), for low-density parity-check (LDPC) coded TWR system over
block fading channels. The main idea is to form a check relationship table
(check-relation-tab) for the superimposed LDPC coded packet pair in the
multiple access (MA) phase in conjunction with an adaptive PLNC mapping in the
broadcast (BC) phase. Using PCD, we then present a partial decoding method,
two-stage closest-neighbor clustering with PCD (TS-CNC-PCD), with the aim of
minimizing the worst pairwise error probability. Moreover, we propose the
minimum correlation optimization (MCO) for selecting the better
check-relation-tabs. Simulation results confirm that the proposed TS-CNC-PCD
offers a sizable gain over the conventional XOR with belief propagation (BP) in
fading channels.
|
[
{
"version": "v1",
"created": "Thu, 30 Jun 2011 10:07:59 GMT"
},
{
"version": "v2",
"created": "Tue, 15 Nov 2011 10:06:18 GMT"
},
{
"version": "v3",
"created": "Thu, 1 Mar 2012 05:53:20 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Liu",
"Jianquan",
""
],
[
"Tao",
"Meixia",
""
],
[
"Xu",
"Youyun",
""
]
] |
new_dataset
| 0.979568 |
1109.3952
|
Chin Keong Ho
|
Chin Keong Ho, Kiran T. Gowda, and Sumei Sun
|
Gaussian Two-way Relay Channel with Private Information for the Relay
|
6 pages, 3 figures, accepted for publication in IEEE Transactions on
Communications
| null |
10.1109/TCOMM.2011.112311.090671
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a generalized two-way relay channel where two sources exchange
information (not necessarily of the same rate) with help from a relay, and each
source additionally sends private information to the relay. We consider the
Gaussian setting where all point-to-point links are Gaussian channels. For this
channel, we consider a two-phase protocol consisting of a multiple access
channel (MAC) phase and a broadcast channel (BC) phase. We propose a general
decode-and-forward (DF) scheme where the MAC phase is related to computation
over MAC, while the BC phase is related to BC with receiver side information.
In the MAC phase, we time share a capacity-achieving code for the MAC and a
superposition code with a lattice code as its component code. We show that the
proposed DF scheme is near optimal for any channel conditions, in that it
achieves rates within half bit of the capacity region of the two-phase
protocol.
|
[
{
"version": "v1",
"created": "Mon, 19 Sep 2011 06:55:38 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Ho",
"Chin Keong",
""
],
[
"Gowda",
"Kiran T.",
""
],
[
"Sun",
"Sumei",
""
]
] |
new_dataset
| 0.986905 |
1110.5890
|
Sergio Valcarcel Macua
|
Pavle Belanovic, Sergio Valcarcel Macua, and Santiago Zazo
|
Location-aided Distributed Primary User Identification in a Cognitive
Radio Scenario
|
Submitted to IEEE ICASSP2012
| null |
10.1109/ICASSP.2012.6288735
| null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We address a cognitive radio scenario, where a number of secondary users
performs identification of which primary user, if any, is transmitting, in a
distributed way and using limited location information. We propose two fully
distributed algorithms: the first is a direct identification scheme, and in the
other a distributed sub-optimal detection based on a simplified Neyman-Pearson
energy detector precedes the identification scheme. Both algorithms are studied
analytically in a realistic transmission scenario, and the advantage obtained
by detection pre-processing is also verified via simulation. Finally, we give
details of their fully distributed implementation via consensus averaging
algorithms.
|
[
{
"version": "v1",
"created": "Wed, 26 Oct 2011 19:32:25 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Belanovic",
"Pavle",
""
],
[
"Macua",
"Sergio Valcarcel",
""
],
[
"Zazo",
"Santiago",
""
]
] |
new_dataset
| 0.962049 |
1201.4793
|
Marco Di Renzo
|
Marco Di Renzo, Dario De Leonardis, Fabio Graziosi, and Harald Haas
|
Space Shift Keying (SSK-) MIMO with Practical Channel Estimates
|
IEEE Transactions on Communications (to appear, 2012)
| null |
10.1109/TCOMM.2012.021712.100778
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we study the performance of space modulation for
Multiple-Input-Multiple-Output (MIMO) wireless systems with imperfect channel
knowledge at the receiver. We focus our attention on two transmission
technologies, which are the building blocks of space modulation: i) Space Shift
Keying (SSK) modulation; and ii) Time-Orthogonal-Signal-Design (TOSD-) SSK
modulation, which is an improved version of SSK modulation providing
transmit-diversity. We develop a single-integral closed-form analytical
framework to compute the Average Bit Error Probability (ABEP) of a mismatched
detector for both SSK and TOSD-SSK modulations. The framework exploits the
theory of quadratic-forms in conditional complex Gaussian Random Variables
(RVs) along with the Gil-Pelaez inversion theorem. The analytical model is very
general and can be used for arbitrary transmit- and receive-antennas, fading
distributions, fading spatial correlations, and training pilots. The analytical
derivation is substantiated through Monte Carlo simulations, and it is shown,
over independent and identically distributed (i.i.d.) Rayleigh fading channels,
that SSK modulation is as robust as single-antenna systems to imperfect channel
knowledge, and that TOSD-SSK modulation is more robust to channel estimation
errors than the Alamouti scheme. Furthermore, it is pointed out that only few
training pilots are needed to get reliable enough channel estimates for data
detection, and that transmit- and receive-diversity of SSK and TOSD-SSK
modulations are preserved even with imperfect channel knowledge.
|
[
{
"version": "v1",
"created": "Mon, 23 Jan 2012 18:15:39 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Di Renzo",
"Marco",
""
],
[
"De Leonardis",
"Dario",
""
],
[
"Graziosi",
"Fabio",
""
],
[
"Haas",
"Harald",
""
]
] |
new_dataset
| 0.998352 |
1201.6313
|
Ravi Tandon
|
Ravi Tandon, Soheil Mohajer, H. Vincent Poor, Shlomo Shamai (Shitz)
|
On X-Channels with Feedback and Delayed CSI
|
Submitted to IEEE ISIT 2012 on Jan 22, 2012
| null |
10.1109/ISIT.2012.6283623
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The sum degrees of freedom (DoF) of the two-user MIMO X-channel is
characterized in the presence of output feedback and delayed channel state
information (CSI). The number of antennas at each transmitters is assumed to be
M and the number of antennas at each of the receivers is assumed to be N. It is
shown that the sum DoF of the two-user MIMO X-channel is the same as the sum
DoF of a two-user MIMO broadcast channel with 2M transmit antennas, and N
antennas at each receiver. Hence, for this symmetric antenna configuration,
there is no performance loss in the sum degrees of freedom due to the
distributed nature of the transmitters. This result highlights the usefulness
of feedback and delayed CSI for the MIMO X-channel.
The K-user X-channel with single antenna at each transmitter and each
receiver is also studied. In this network, each transmitter has a message
intended for each receiver. For this network, it is shown that the sum DoF with
partial output feedback alone is at least 2K/(K+1). This lower bound is
strictly better than the best lower bound known for the case of delayed CSI
assumption for all values of K.
|
[
{
"version": "v1",
"created": "Mon, 30 Jan 2012 18:26:21 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Tandon",
"Ravi",
"",
"Shitz"
],
[
"Mohajer",
"Soheil",
"",
"Shitz"
],
[
"Poor",
"H. Vincent",
"",
"Shitz"
],
[
"Shamai",
"Shlomo",
"",
"Shitz"
]
] |
new_dataset
| 0.996381 |
1202.0253
|
Sertac Karaman
|
Sertac Karaman, Emilio Frazzoli
|
High-speed Flight in an Ergodic Forest
|
Manuscript submitted to the IEEE Transactions on Robotics
| null |
10.1109/ICRA.2012.6225235
| null |
cs.RO cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Inspired by birds flying through cluttered environments such as dense
forests, this paper studies the theoretical foundations of a novel motion
planning problem: high-speed navigation through a randomly-generated obstacle
field when only the statistics of the obstacle generating process are known a
priori. Resembling a planar forest environment, the obstacle generating process
is assumed to determine the locations and sizes of disk-shaped obstacles. When
this process is ergodic, and under mild technical conditions on the dynamics of
the bird, it is shown that the existence of an infinite collision-free
trajectory through the forest exhibits a phase transition. On one hand, if the
bird flies faster than a certain critical speed, then, with probability one,
there is no infinite collision-free trajectory, i.e., the bird will eventually
collide with some tree, almost surely, regardless of the planning algorithm
governing the bird's motion. On the other hand, if the bird flies slower than
this critical speed, then there exists at least one infinite collision-free
trajectory, almost surely. Lower and upper bounds on the critical speed are
derived for the special case of a homogeneous Poisson forest considering a
simple model for the bird's dynamics. For the same case, an equivalent
percolation model is provided. Using this model, the phase diagram is
approximated in Monte-Carlo simulations. This paper also establishes novel
connections between robot motion planning and statistical physics through
ergodic theory and percolation theory, which may be of independent interest.
|
[
{
"version": "v1",
"created": "Wed, 1 Feb 2012 19:30:59 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Karaman",
"Sertac",
""
],
[
"Frazzoli",
"Emilio",
""
]
] |
new_dataset
| 0.999153 |
1202.4664
|
Bo Yuan
|
Zhongfeng Wang
|
Super-FEC Codes for 40/100 Gbps Networking
|
This work has been accepted by IEEE Communications Letters for future
publication. Copyright may be transferred without notice, after which this
version may no longer be accessible
| null |
10.1109/LCOMM.2012.112012.122083
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a simple approach to evaluate the performance bound at
very low bit-error-rate (BER) range for binary pseudo-product codes and
true-product codes. Moreover it introduces a super-product BCH code that can
achieve near-Shannon limit performance with very low decoding complexity. This
work has been accepted by IEEE Communications Letters for future publication.
Copyright may be transferred without notice, after which this version may no
longer be accessible.
|
[
{
"version": "v1",
"created": "Mon, 20 Feb 2012 05:54:00 GMT"
},
{
"version": "v2",
"created": "Sat, 23 Jun 2012 01:17:22 GMT"
},
{
"version": "v3",
"created": "Wed, 27 Jun 2012 01:32:12 GMT"
},
{
"version": "v4",
"created": "Mon, 29 Oct 2012 04:42:56 GMT"
},
{
"version": "v5",
"created": "Tue, 30 Oct 2012 15:59:39 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Wang",
"Zhongfeng",
""
]
] |
new_dataset
| 0.999679 |
1204.2048
|
Mostafa Rahimi Azghadi
|
Mostafa Rahimi Azghadi, O. Kavehie, K. Navi
|
A Novel Design for Quantum-dot Cellular Automata Cells and Full Adders
|
arXiv admin note: text overlap with arXiv:cond-mat/0104406
|
Journal of Applied Sciences, Vol. 7, No. 22, pp. 3460-3468, 2007
|
10.3923/jas.2007.3460.3468
| null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Quantum dot Cellular Automata (QCA) is a novel and potentially attractive
technology for implementing computing architectures at the nanoscale. The basic
Boolean primitive in QCA is the majority gate. In this paper we present a novel
design for QCA cells and another possible and unconventional scheme for
majority gates. By applying these items, the hardware requirements for a QCA
design can be reduced and circuits can be simpler in level and gate counts. As
an example, a 1-bit QCA adder is constructed by applying our new scheme and is
compared to the other existing implementation. Beside, some Boolean functions
are expressed as examples and it has been shown, how our reduction method by
using new proposed item, decreases gate counts and levels in comparison to the
other previous methods.
|
[
{
"version": "v1",
"created": "Tue, 10 Apr 2012 05:38:20 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Azghadi",
"Mostafa Rahimi",
""
],
[
"Kavehie",
"O.",
""
],
[
"Navi",
"K.",
""
]
] |
new_dataset
| 0.998992 |
1205.4208
|
Cedomir Stefanovic
|
Cedomir Stefanovic, Petar Popovski and Dejan Vukobratovic
|
Frameless ALOHA Protocol for Wireless Networks
|
To appear in IEEE Communications Letters
| null |
10.1109/LCOMM.2012.101712.121073
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a novel distributed random access scheme for wireless networks
based on slotted ALOHA, motivated by the analogies between successive
interference cancellation and iterative belief-propagation decoding on erasure
channels. The proposed scheme assumes that each user independently accesses the
wireless link in each slot with a predefined probability, resulting in a
distribution of user transmissions over slots. The operation bears analogy with
rateless codes, both in terms of probability distributions as well as to the
fact that the ALOHA frame becomes fluid and adapted to the current contention
process. Our aim is to optimize the slot access probability in order to achieve
rateless-like distributions, focusing both on the maximization of the
resolution probability of user transmissions and the throughput of the scheme.
|
[
{
"version": "v1",
"created": "Fri, 18 May 2012 17:57:42 GMT"
},
{
"version": "v2",
"created": "Tue, 11 Sep 2012 07:40:21 GMT"
},
{
"version": "v3",
"created": "Wed, 12 Sep 2012 11:30:42 GMT"
},
{
"version": "v4",
"created": "Wed, 10 Oct 2012 12:31:48 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Stefanovic",
"Cedomir",
""
],
[
"Popovski",
"Petar",
""
],
[
"Vukobratovic",
"Dejan",
""
]
] |
new_dataset
| 0.987968 |
1206.3350
|
Srinivas Yerramalli
|
Srinivas Yerramalli, Rahul Jain and Urbashi Mitra
|
Coalitional Games for Transmitter Cooperation in MIMO Multiple Access
Channels
|
in review for publication in IEEE Transactions on Signal Processing
| null |
10.1109/TSP.2013.2290496
| null |
cs.IT cs.GT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cooperation between nodes sharing a wireless channel is becoming increasingly
necessary to achieve performance goals in a wireless network. The problem of
determining the feasibility and stability of cooperation between rational nodes
in a wireless network is of great importance in understanding cooperative
behavior. This paper addresses the stability of the grand coalition of
transmitters signaling over a multiple access channel using the framework of
cooperative game theory. The external interference experienced by each TX is
represented accurately by modeling the cooperation game between the TXs in
\emph{partition form}. Single user decoding and successive interference
cancelling strategies are examined at the receiver. In the absence of
coordination costs, the grand coalition is shown to be \emph{sum-rate optimal}
for both strategies. Transmitter cooperation is \emph{stable}, if and only if
the core of the game (the set of all divisions of grand coalition utility such
that no coalition deviates) is nonempty. Determining the stability of
cooperation is a co-NP-complete problem in general. For a single user decoding
receiver, transmitter cooperation is shown to be \emph{stable} at both high and
low SNRs, while for an interference cancelling receiver with a fixed decoding
order, cooperation is stable only at low SNRs and unstable at high SNR. When
time sharing is allowed between decoding orders, it is shown using an
approximate lower bound to the utility function that TX cooperation is also
stable at high SNRs. Thus, this paper demonstrates that ideal zero cost TX
cooperation over a MAC is stable and improves achievable rates for each
individual user.
|
[
{
"version": "v1",
"created": "Fri, 15 Jun 2012 00:28:11 GMT"
},
{
"version": "v2",
"created": "Thu, 11 Oct 2012 22:15:09 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Yerramalli",
"Srinivas",
""
],
[
"Jain",
"Rahul",
""
],
[
"Mitra",
"Urbashi",
""
]
] |
new_dataset
| 0.996184 |
1208.2331
|
Nadeem Javaid
|
N. Javaid, A. Sharif, A. Mahmood, S. Ahmed, U. Qasim, Z. A. Khan
|
Monitoring and Controlling Power using Zigbee Communications
|
5th International Workshop on NGWMN with 7th IEEE International
Conference on BWCCA 2012, Victoria, Canada, 2012
| null |
10.1109/BWCCA.2012.107
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Smart grid is a modified form of electrical grid where generation,
transmission, distribution and customers are not only connected electrically
but also through strong communication network with each other as well as with
market, operation and service provider. For achieving good communication link
among them, it is very necessary to find suitable protocol. In this paper, we
discuss different hardware techniques for power monitoring, power management
and remote power controlling at home and transmission side and also discuss the
suitability of Zigbee for required communication link. Zigbee has major role in
monitoring and direct load controlling for efficient power utilization. It
covers enough area needed for communication and it works on low data rate of
20Kbps to 250Kbps with minimum power consumption. This paper describes the user
friendly control home appliances, power on/off through the internet, PDA using
Graphical User Interface (GUI) and through GSM cellular mobile phone.
|
[
{
"version": "v1",
"created": "Sat, 11 Aug 2012 09:28:39 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Javaid",
"N.",
""
],
[
"Sharif",
"A.",
""
],
[
"Mahmood",
"A.",
""
],
[
"Ahmed",
"S.",
""
],
[
"Qasim",
"U.",
""
],
[
"Khan",
"Z. A.",
""
]
] |
new_dataset
| 0.992792 |
1208.3598
|
Kai Chen
|
Kai Chen, Kai Niu and Jia-Ru Lin
|
Improved Successive Cancellation Decoding of Polar Codes
|
This paper is modified and submitted to IEEE Transactions on
Communications
| null |
10.1109/TCOMM.2013.070213.120789
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As improved versions of successive cancellation (SC) decoding algorithm,
successive cancellation list (SCL) decoding and successive cancellation stack
(SCS) decoding are used to improve the finite-length performance of polar
codes. Unified descriptions of SC, SCL and SCS decoding algorithms are given as
path searching procedures on the code tree of polar codes. Combining the ideas
of SCL and SCS, a new decoding algorithm named successive cancellation hybrid
(SCH) is proposed, which can achieve a better trade-off between computational
complexity and space complexity. Further, to reduce the complexity, a pruning
technique is proposed to avoid unnecessary path searching operations.
Performance and complexity analysis based on simulations show that, with proper
configurations, all the three improved successive cancellation (ISC) decoding
algorithms can have a performance very close to that of maximum-likelihood (ML)
decoding with acceptable complexity. Moreover, with the help of the proposed
pruning technique, the complexities of ISC decoders can be very close to that
of SC decoder in the moderate and high signal-to-noise ratio (SNR) regime.
|
[
{
"version": "v1",
"created": "Fri, 17 Aug 2012 13:42:49 GMT"
},
{
"version": "v2",
"created": "Thu, 17 Jan 2013 02:52:38 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Chen",
"Kai",
""
],
[
"Niu",
"Kai",
""
],
[
"Lin",
"Jia-Ru",
""
]
] |
new_dataset
| 0.965143 |
1210.8176
|
Paulo Urriza
|
Paulo Urriza, Eric Rebeiz, Danijela Cabric
|
Eigenvalue-based Cyclostationary Spectrum Sensing Using Multiple
Antennas
|
6 pages, 6 figures, accepted to IEEE GLOBECOM 2012
| null |
10.1109/GLOCOM.2012.6503326
| null |
cs.PF cs.IT math.IT stat.AP
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a signal-selective spectrum sensing method for
cognitive radio networks and specifically targeted for receivers with
multiple-antenna capability. This method is used for detecting the presence or
absence of primary users based on the eigenvalues of the cyclic covariance
matrix of received signals. In particular, the cyclic correlation significance
test is used to detect a specific signal-of-interest by exploiting knowledge of
its cyclic frequencies. The analytical threshold for achieving constant false
alarm rate using this detection method is presented, verified through
simulations, and shown to be independent of both the number of samples used and
the noise variance, effectively eliminating the dependence on accurate noise
estimation. The proposed method is also shown, through numerical simulations,
to outperform existing multiple-antenna cyclostationary-based spectrum sensing
algorithms under a quasi-static Rayleigh fading channel, in both spatially
correlated and uncorrelated noise environments. The algorithm also has
significantly lower computational complexity than these other approaches.
|
[
{
"version": "v1",
"created": "Tue, 30 Oct 2012 21:23:57 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Urriza",
"Paulo",
""
],
[
"Rebeiz",
"Eric",
""
],
[
"Cabric",
"Danijela",
""
]
] |
new_dataset
| 0.993245 |
1211.0313
|
Paulo Urriza
|
Paulo Urriza, Eric Rebeiz, Danijela Cabric
|
Multiple Antenna Cyclostationary Spectrum Sensing Based on the Cyclic
Correlation Significance Test
|
26 pages, 8 figures, submitted to IEEE JSAC: Cognitive Radio Series.
arXiv admin note: substantial text overlap with arXiv:1210.8176
| null |
10.1109/JSAC.2013.131118
| null |
cs.PF stat.AP
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose and analyze a spectrum sensing method based on
cyclostationarity specifically targeted for receivers with multiple antennas.
This detection method is used for determining the presence or absence of
primary users in cognitive radio networks based on the eigenvalues of the
cyclic covariance matrix of received signals. In particular, the cyclic
correlation significance test is used to detect a specific signal-of-interest
by exploiting knowledge of its cyclic frequencies. Analytical expressions for
the probability of detection and probability of false-alarm under both
spatially uncorrelated or spatially correlated noise are derived and verified
by simulation. The detection performance in a Rayleigh flat-fading environment
is found and verified through simulations. One of the advantages of the
proposed method is that the detection threshold is shown to be independent of
both the number of samples and the noise covariance, effectively eliminating
the dependence on accurate noise estimation. The proposed method is also shown
to provide higher detection probability and better robustness to noise
uncertainty than existing multiple-antenna cyclostationary-based spectrum
sensing algorithms under both AWGN as well as a quasi-static Rayleigh fading
channel.
|
[
{
"version": "v1",
"created": "Thu, 1 Nov 2012 21:30:52 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Urriza",
"Paulo",
""
],
[
"Rebeiz",
"Eric",
""
],
[
"Cabric",
"Danijela",
""
]
] |
new_dataset
| 0.986882 |
1212.3844
|
Saeed Hajizadeh
|
Saeed Hajizadeh, and Ghosheh Abed Hodtani
|
Three-Receiver Broadcast Channel with Side Information
|
13 pages, 4 figures, This paper is partially presented at 2012 IEEE
International Symposium on Information Theory
| null |
10.1109/ISIT.2012.6284216
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Three-Receiver broadcast channels (BC) are of interest due to their
information-theoretic differences with two-receiver one. In this paper, we
derive achievable rate regions for two classes of 3-receiver BC with side
information (SI), i.e. Multilevel BC (MBC) and 3-receiver less noisy BC, using
a combination of superposition coding, Gelfand-Pinsker binning scheme and
Nair-El Gamal indirect decoding. Our rate region for MBC subsumes Steinberg
rate region for 2-receiver degraded BC with SI as its special case. We will
also show that the obtained achievable rate regions in the first two cases are
tight for several classes of non-deterministic, semi-deterministic, and
deterministic 3-receiver BC when SI is available both at the transmitter and at
the receivers. We also prove that as far as a receiver is deterministic in the
three-receiver less noisy BC, the presence of side information at that receiver
does not affect the capacity region. We have also provided the writing on dirty
paper (WDP) property for 3-receiver BC is provided as an example. In the last
section, we provide simple bounds on the capacity region of the Additive
Exponential noise three-receiver broadcast channels with Additive Exponential
interference (AEN-3BC-EI).
|
[
{
"version": "v1",
"created": "Sun, 16 Dec 2012 22:30:54 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Hajizadeh",
"Saeed",
""
],
[
"Hodtani",
"Ghosheh Abed",
""
]
] |
new_dataset
| 0.96015 |
1212.5792
|
Kui Xu
|
Kui Xu, Youyun Xu, Xiaochen Xia, Dongmei Zhang
|
On Max-SINR Receiver for Hexagonal Multicarrier Transmission Over Doubly
Dispersive Channel
|
6 pages. The paper has been published in Proc. IEEE GLOBECOM 2012.
Copyright transferred to IEEE. arXiv admin note: text overlap with
arXiv:1212.5791
| null |
10.1109/GLOCOM.2012.6503687
| null |
cs.IT math.IT
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
In this paper, a novel receiver for Hexagonal Multicarrier Transmission (HMT)
system based on the maximizing Signal-to-Interference-plus-Noise Ratio
(Max-SINR) criterion is proposed. Theoretical analysis shows that the prototype
pulse of the proposed Max-SINR receiver should adapt to the root mean square
(RMS) delay spread of the doubly dispersive (DD) channel with exponential power
delay profile and U-shape Doppler spectrum. Simulation results show that the
proposed Max-SINR receiver outperforms traditional projection scheme and
obtains an approximation to the theoretical upper bound SINR performance within
the full range of channel spread factor. Meanwhile, the SINR performance of the
proposed prototype pulse is robust to the estimation error between the
estimated value and the real value of time delay spread.
|
[
{
"version": "v1",
"created": "Sun, 23 Dec 2012 13:21:10 GMT"
},
{
"version": "v2",
"created": "Thu, 10 Jan 2013 01:00:11 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Xu",
"Kui",
""
],
[
"Xu",
"Youyun",
""
],
[
"Xia",
"Xiaochen",
""
],
[
"Zhang",
"Dongmei",
""
]
] |
new_dataset
| 0.994733 |
1301.2935
|
Tao Wang Dr.
|
Tao Wang, Yong Fang, Luc Vandendorpe
|
Novel Subcarrier-pair based Opportunistic DF Protocol for Cooperative
Downlink OFDMA
|
6 pages, accepted by 2013 IEEE Wireless Communications and Networking
Conference
| null |
10.1109/WCNC.2013.6555089
| null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A novel subcarrier-pair based opportunistic DF protocol is proposed for
cooperative downlink OFDMA transmission aided by a decode-and-forward (DF)
relay. Specifically, user message bits are transmitted in two consecutive
equal-duration time slots. A subcarrier in the first slot can be paired with a
subcarrier in the second slot for the DF relay-aided transmission to a user. In
particular, the source and the relay can transmit simultaneously to implement
beamforming at the subcarrier in the second slot for the relay-aided
transmission. Each unpaired subcarrier in either the first or second slot is
used by the source for direct transmission to a user without the relay's
assistance. The sum rate maximized resource allocation (RA) problem is
addressed for this protocol under a total power constraint. It is shown that
the novel protocol leads to a maximum sum rate greater than or equal to that
for a benchmark one, which does not allow the source to implement beamforming
at the subcarrier in the second slot for the relay-aided transmission. Then, a
polynomial-complexity RA algorithm is developed to find an (at least
approximately) optimum resource allocation (i.e., source/relay power,
subcarrier pairing and assignment to users) for either the proposed or
benchmark protocol. Numerical experiments illustrate that the novel protocol
can lead to a much greater sum rate than the benchmark one.
|
[
{
"version": "v1",
"created": "Mon, 14 Jan 2013 12:05:53 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Wang",
"Tao",
""
],
[
"Fang",
"Yong",
""
],
[
"Vandendorpe",
"Luc",
""
]
] |
new_dataset
| 0.988675 |
1302.0951
|
Jun Muramatsu
|
Jun Muramatsu
|
Channel Coding and Lossy Source Coding Using a Constrained Random Number
Generator
|
submitted to IEEE Transactions on Information Theory, 42 pages
| null |
10.1109/TIT.2014.2309140
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Stochastic encoders for channel coding and lossy source coding are introduced
with a rate close to the fundamental limits, where the only restriction is that
the channel input alphabet and the reproduction alphabet of the lossy source
code are finite. Random numbers, which satisfy a condition specified by a
function and its value, are used to construct stochastic encoders. The proof of
the theorems is based on the hash property of an ensemble of functions, where
the results are extended to general channels/sources and alternative formulas
are introduced for channel capacity and the rate-distortion region. Since an
ensemble of sparse matrices has a hash property, we can construct a code by
using sparse matrices, where the sum-product algorithm can be used for encoding
and decoding by assuming that channels/sources are memoryless.
|
[
{
"version": "v1",
"created": "Tue, 5 Feb 2013 07:36:34 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Muramatsu",
"Jun",
""
]
] |
new_dataset
| 0.969341 |
1302.4706
|
Antonio Campello
|
Antonio Campello, Cristiano Torezzan and Sueli I. R. Costa
|
Curves on Flat Tori and Analog Source-Channel Codes
|
15 pages, 6 figures. Accepted for publication IEEE Trans. Inf.
Theory. arXiv admin note: substantial text overlap with arXiv:1202.2111
| null |
10.1109/TIT.2013.2269135
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we consider the problem of transmitting a continuous alphabet
discrete-time source over an AWGN channel. We propose a constructive scheme
based on a set of curves on the surface of a N-dimensional sphere. Our approach
shows that the design of good codes for this communication problem is related
to geometrical properties of spherical codes and projections of N-dimensional
rectangular lattices. Theoretical comparisons with some previous works in terms
of the mean square error as a function of the channel SNR as well as
simulations are provided.
|
[
{
"version": "v1",
"created": "Tue, 19 Feb 2013 18:53:30 GMT"
},
{
"version": "v2",
"created": "Mon, 10 Jun 2013 17:42:32 GMT"
},
{
"version": "v3",
"created": "Thu, 13 Jun 2013 00:32:49 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Campello",
"Antonio",
""
],
[
"Torezzan",
"Cristiano",
""
],
[
"Costa",
"Sueli I. R.",
""
]
] |
new_dataset
| 0.99576 |
1302.4793
|
Seunghyun Lee
|
Seunghyun Lee, Rui Zhang, Kaibin Huang
|
Opportunistic Wireless Energy Harvesting in Cognitive Radio Networks
|
This is the longer version of a paper to appear in IEEE Transactions
on Wireless Communications
| null |
10.1109/TWC.2013.072613.130323
| null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless networks can be self-sustaining by harvesting energy from ambient
radio-frequency (RF) signals. Recently, researchers have made progress on
designing efficient circuits and devices for RF energy harvesting suitable for
low-power wireless applications. Motivated by this and building upon the
classic cognitive radio (CR) network model, this paper proposes a novel method
for wireless networks coexisting where low-power mobiles in a secondary
network, called secondary transmitters (STs), harvest ambient RF energy from
transmissions by nearby active transmitters in a primary network, called
primary transmitters (PTs), while opportunistically accessing the spectrum
licensed to the primary network. We consider a stochastic-geometry model in
which PTs and STs are distributed as independent homogeneous Poisson point
processes (HPPPs) and communicate with their intended receivers at fixed
distances. Each PT is associated with a guard zone to protect its intended
receiver from ST's interference, and at the same time delivers RF energy to STs
located in its harvesting zone. Based on the proposed model, we analyze the
transmission probability of STs and the resulting spatial throughput of the
secondary network. The optimal transmission power and density of STs are
derived for maximizing the secondary network throughput under the given
outage-probability constraints in the two coexisting networks, which reveal key
insights to the optimal network design. Finally, we show that our analytical
result can be generally applied to a non-CR setup, where distributed wireless
power chargers are deployed to power coexisting wireless transmitters in a
sensor network.
|
[
{
"version": "v1",
"created": "Wed, 20 Feb 2013 02:26:27 GMT"
},
{
"version": "v2",
"created": "Fri, 12 Jul 2013 05:41:46 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Lee",
"Seunghyun",
""
],
[
"Zhang",
"Rui",
""
],
[
"Huang",
"Kaibin",
""
]
] |
new_dataset
| 0.995481 |
1302.5518
|
Lluis Pamies-Juarez
|
Lluis Pamies-Juarez, Henk D.L. Hollmann, Fr\'ed\'erique Oggier
|
Locally Repairable Codes with Multiple Repair Alternatives
|
IEEE International Symposium on Information Theory (ISIT 2013)
| null |
10.1109/ISIT.2013.6620355
| null |
cs.IT cs.DC math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Distributed storage systems need to store data redundantly in order to
provide some fault-tolerance and guarantee system reliability. Different coding
techniques have been proposed to provide the required redundancy more
efficiently than traditional replication schemes. However, compared to
replication, coding techniques are less efficient for repairing lost
redundancy, as they require retrieval of larger amounts of data from larger
subsets of storage nodes. To mitigate these problems, several recent works have
presented locally repairable codes designed to minimize the repair traffic and
the number of nodes involved per repair. Unfortunately, existing methods often
lead to codes where there is only one subset of nodes able to repair a piece of
lost data, limiting the local repairability to the availability of the nodes in
this subset. In this paper, we present a new family of locally repairable codes
that allows different trade-offs between the number of contacted nodes per
repair, and the number of different subsets of nodes that enable this repair.
We show that slightly increasing the number of contacted nodes per repair
allows to have repair alternatives, which in turn increases the probability of
being able to perform efficient repairs. Finally, we present pg-BLRC, an
explicit construction of locally repairable codes with multiple repair
alternatives, constructed from partial geometries, in particular from
Generalized Quadrangles. We show how these codes can achieve practical lengths
and high rates, while requiring a small number of nodes per repair, and
providing multiple repair alternatives.
|
[
{
"version": "v1",
"created": "Fri, 22 Feb 2013 08:40:12 GMT"
},
{
"version": "v2",
"created": "Wed, 15 May 2013 04:06:54 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Pamies-Juarez",
"Lluis",
""
],
[
"Hollmann",
"Henk D. L.",
""
],
[
"Oggier",
"Frédérique",
""
]
] |
new_dataset
| 0.998532 |
1302.6703
|
Karsten Fyhn
|
Karsten Fyhn, Tobias Lindstr{\o}m Jensen, Torben Larsen, and S{\o}ren
Holdt Jensen
|
Compressive Sensing for Spread Spectrum Receivers
|
11 pages, 11 figures, 1 table, accepted for publication in IEEE
Transactions on Wireless Communications
| null |
10.1109/TWC.2013.032113.120975
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the advent of ubiquitous computing there are two design parameters of
wireless communication devices that become very important power: efficiency and
production cost. Compressive sensing enables the receiver in such devices to
sample below the Shannon-Nyquist sampling rate, which may lead to a decrease in
the two design parameters. This paper investigates the use of Compressive
Sensing (CS) in a general Code Division Multiple Access (CDMA) receiver. We
show that when using spread spectrum codes in the signal domain, the CS
measurement matrix may be simplified. This measurement scheme, named
Compressive Spread Spectrum (CSS), allows for a simple, effective receiver
design. Furthermore, we numerically evaluate the proposed receiver in terms of
bit error rate under different signal to noise ratio conditions and compare it
with other receiver structures. These numerical experiments show that though
the bit error rate performance is degraded by the subsampling in the CS-enabled
receivers, this may be remedied by including quantization in the receiver
model. We also study the computational complexity of the proposed receiver
design under different sparsity and measurement ratios. Our work shows that it
is possible to subsample a CDMA signal using CSS and that in one example the
CSS receiver outperforms the classical receiver.
|
[
{
"version": "v1",
"created": "Wed, 27 Feb 2013 09:29:04 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Fyhn",
"Karsten",
""
],
[
"Jensen",
"Tobias Lindstrøm",
""
],
[
"Larsen",
"Torben",
""
],
[
"Jensen",
"Søren Holdt",
""
]
] |
new_dataset
| 0.96717 |
1303.1038
|
Alberto Tarable
|
Alberto Tarable, Alessandro Nordio, Fabrizio Dabbene and Roberto Tempo
|
Anytime Reliable LDPC Convolutional Codes for Networked Control over
Wireless Channel
|
5 pages, 3 figures, submitted to IEEE International Symposium on
Information Theory 2013 (ISIT 2013)
| null |
10.1109/ISIT.2013.6620589
| null |
cs.IT cs.SY math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper deals with the problem of stabilizing an unstable system through
networked control over the wireless medium. In such a situation a remote sensor
communicates the measurements to the system controller through a noisy channel.
In particular, in the AWGN scenario, we show that protograph-based LDPC
convolutional codes achieve anytime reliability and we also derive a lower
bound to the signal-to-noise ratio required to stabilize the system. Moreover,
on the Rayleigh-fading channel, we show by simulations that resorting to
multiple sensors allows to achieve a diversity gain.
|
[
{
"version": "v1",
"created": "Tue, 5 Mar 2013 14:05:24 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Tarable",
"Alberto",
""
],
[
"Nordio",
"Alessandro",
""
],
[
"Dabbene",
"Fabrizio",
""
],
[
"Tempo",
"Roberto",
""
]
] |
new_dataset
| 0.997718 |
1303.2870
|
Jie Xu Mr.
|
Jie Xu, Rui Zhang
|
CoMP Meets Smart Grid: A New Communication and Energy Cooperation
Paradigm
|
to appear in IEEE Transactions on Vehicular Technology
| null |
10.1109/TVT.2014.2345415
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we pursue a unified study on smart grid and coordinated
multi-point (CoMP) enabled wireless communication by investigating a new joint
communication and energy cooperation approach. We consider a practical CoMP
system with clustered multiple-antenna base stations (BSs) cooperatively
communicating with multiple single-antenna mobile terminals (MTs), where each
BS is equipped with local renewable energy generators to supply power and also
a smart meter to enable two-way energy flow with the grid. We propose a new
energy cooperation paradigm, where a group of BSs dynamically share their
renewable energy for more efficient operation via locally injecting/drawing
power to/from an aggregator with a zero effective sum-energy exchanged. Under
this new energy cooperation model, we consider the downlink transmission in one
CoMP cluster with cooperative zero-forcing (ZF) based precoding at the BSs. We
maximize the weighted sum-rate for all MTs by jointly optimizing the transmit
power allocations at cooperative BSs and their exchanged energy amounts subject
to a new type of power constraints featuring energy cooperation among BSs with
practical loss ratios. Our new setup with BSs' energy cooperation generalizes
the conventional CoMP transmit optimization under BSs' sum-power or
individual-power constraints. Finally, we validate our results by simulations
under various practical setups, and show that the proposed joint communication
and energy cooperation scheme substantially improves the downlink throughput of
CoMP systems powered by smart grid and renewable energy, as compared to other
suboptimal designs without communication and/or energy cooperation.
|
[
{
"version": "v1",
"created": "Tue, 12 Mar 2013 13:21:37 GMT"
},
{
"version": "v2",
"created": "Tue, 30 Jul 2013 05:31:42 GMT"
},
{
"version": "v3",
"created": "Thu, 16 Jan 2014 04:46:11 GMT"
},
{
"version": "v4",
"created": "Thu, 31 Jul 2014 06:21:09 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Xu",
"Jie",
""
],
[
"Zhang",
"Rui",
""
]
] |
new_dataset
| 0.999531 |
1307.4463
|
Mahyar Shirvanimoghaddam
|
Mahyar Shirvanimoghaddam, Yonghui Li, Shuang Tian, Branka Vucetic
|
Distributed Raptor Coding for Erasure Channels: Partially and Fully
Coded Cooperation
|
To be Published in IEEE Transaction on Communications
| null |
10.1109/TCOMM.2013.072913.120724
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a new rateless coded cooperation scheme for a
general multi-user cooperative wireless system. We develop cooperation methods
based on Raptor codes with the assumption that the channels face erasure with
specific erasure probabilities and transmitters have no channel state
information. A fully coded cooperation (FCC) and a partially coded cooperation
(PCC) strategy are developed to maximize the average system throughput. Both
PCC and FCC schemes have been analyzed through AND-OR tree analysis and a
linear programming optimization problem is then formulated to find the optimum
degree distribution for each scheme. Simulation results show that optimized
degree distributions can bring considerable throughput gains compared to
existing degree distributions which are designed for point-to-point binary
erasure channels. It is also shown that the PCC scheme outperforms the FCC
scheme in terms of average system throughput.
|
[
{
"version": "v1",
"created": "Wed, 17 Jul 2013 01:35:02 GMT"
},
{
"version": "v2",
"created": "Sun, 21 Jul 2013 21:29:22 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Shirvanimoghaddam",
"Mahyar",
""
],
[
"Li",
"Yonghui",
""
],
[
"Tian",
"Shuang",
""
],
[
"Vucetic",
"Branka",
""
]
] |
new_dataset
| 0.989855 |
1307.7105
|
Dr. Nadeem Javaid
|
Q. Nadeem, M. B. Rasheed, N. Javaid, Z. A. Khan, Y. Maqsood, A. Din
|
M-GEAR: Gateway-Based Energy-Aware Multi-Hop Routing Protocol for WSNs
|
IEEE 8th International Conference on Broadband and Wireless
Computing, Communication and Applications (BWCCA'13), Compiegne, France
| null |
10.1109/BWCCA.2013.35
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this research work, we advise gateway based energy-efficient routing
protocol (M-GEAR) for Wireless Sensor Networks (WSNs). We divide the sensor
nodes into four logical regions on the basis of their location in the sensing
field. We install Base Station (BS) out of the sensing area and a gateway node
at the centre of the sensing area. If the distance of a sensor node from BS or
gateway is less than predefined distance threshold, the node uses direct
communication. We divide the rest of nodes into two equal regions whose
distance is beyond the threshold distance. We select cluster heads (CHs)in each
region which are independent of the other region. These CHs are selected on the
basis of a probability. We compare performance of our protocol with LEACH (Low
Energy Adaptive Clustering Hierarchy). Performance analysis and compared
statistic results show that our proposed protocol perform well in terms of
energy consumption and network lifetime.
|
[
{
"version": "v1",
"created": "Fri, 26 Jul 2013 17:24:18 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Nadeem",
"Q.",
""
],
[
"Rasheed",
"M. B.",
""
],
[
"Javaid",
"N.",
""
],
[
"Khan",
"Z. A.",
""
],
[
"Maqsood",
"Y.",
""
],
[
"Din",
"A.",
""
]
] |
new_dataset
| 0.998754 |
1307.7111
|
Dr. Nadeem Javaid
|
Y. Khan, N. Javaid, M. J. Khan, Y. Ahmad, M. H. Zubair, S. A. Shah
|
LPCH and UDLPCH: Location-aware Routing Techniques in WSNs
|
IEEE 8th International Conference on Broadband and Wireless
Computing, Communication and Applications (BWCCA'13), Compiegne, France
| null |
10.1109/BWCCA.2013.25
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless sensor nodes along with Base Station (BS) constitute a Wireless
Sensor Network (WSN). Nodes comprise of tiny power battery. Nodes sense the
data and send it to BS. WSNs need protocol for efficient energy consumption of
the network. In direct transmission and minimum transmission energy routing
protocols, energy consumption is not well distributed. However, LEACH
(Low-Energy Adaptive Clustering Hierarchy) is a clustering protocol; randomly
selects the Cluster Heads (CHs) in each round. However, random selection of CHs
does not guarantee efficient energy consumption of the network. Therefore, we
proposed new clustering techniques in routing protocols, Location-aware
Permanent CH (LPCH) and User Defined Location-aware Permanent CH (UDLPCH). In
both protocols, network field is physically divided in to two regions, equal
number of nodes are randomly deployed in each region. In LPCH, number of CHs
are selected by LEACH algorithm in first round. However in UDLPCH, equal and
optimum number of CHs are selected in each region, throughout the network life
time number of CHs are remain same. Simulation results show that stability
period and throughput of LPCH is greater than LEACH, stability period and
throughput of UDLPCH is greater than LPCH.
|
[
{
"version": "v1",
"created": "Fri, 26 Jul 2013 17:36:42 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Khan",
"Y.",
""
],
[
"Javaid",
"N.",
""
],
[
"Khan",
"M. J.",
""
],
[
"Ahmad",
"Y.",
""
],
[
"Zubair",
"M. H.",
""
],
[
"Shah",
"S. A.",
""
]
] |
new_dataset
| 0.996711 |
1307.7242
|
Dr. Nadeem Javaid
|
N. Javaid, S. Faisal, Z. A. Khan, D. Nayab, M. Zahid
|
Measuring Fatigue of Soldiers in Wireless Body Area Sensor Networks
|
IEEE 8th International Conference on Broadband and Wireless
Computing, Communication and Applications (BWCCA'13), Compiegne, France
| null |
10.1109/BWCCA.2013.43
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless Body Area Sensor Networks (WBASNs) consist of on-body or in-body
sensors placed on human body for health monitoring. Energy conservation of
these sensors, while guaranteeing a required level of performance, is a
challenging task. Energy efficient routing schemes are designed for the
longevity of network lifetime. In this paper, we propose a routing protocol for
measuring fatigue of a soldier. Three sensors are attached to soldier's body
that monitor specific parameters. Our proposed protocol is an event driven
protocol and takes three scenarios for measuring the fatigue of a soldier. We
evaluate our proposed work in terms of network lifetime, throughput, remaining
energy of sensors and fatigue of a soldier.
|
[
{
"version": "v1",
"created": "Sat, 27 Jul 2013 09:44:05 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Javaid",
"N.",
""
],
[
"Faisal",
"S.",
""
],
[
"Khan",
"Z. A.",
""
],
[
"Nayab",
"D.",
""
],
[
"Zahid",
"M.",
""
]
] |
new_dataset
| 0.996601 |
1307.7245
|
Dr. Nadeem Javaid
|
A. Rao, M. Akbar, N. Javaid, S. N. Mohammad, S. Sarfraz
|
AM-DisCNT: Angular Multi-hop DIStance based Circular Network
Transmission Protocol for WSNs
|
IEEE 8th International Conference on Broadband and Wireless
Computing, Communication and Applications (BWCCA'13), Compiegne, France
| null |
10.1109/BWCCA.2013.14
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The nodes in wireless sensor networks (WSNs) contain limited energy
resources, which are needed to transmit data to base station (BS). Routing
protocols are designed to reduce the energy consumption. Clustering algorithms
are best in this aspect. Such clustering algorithms increase the stability and
lifetime of the network. However, every routing protocol is not suitable for
heterogeneous environments. AM-DisCNT is proposed and evaluated as a new energy
efficient protocol for wireless sensor networks. AM-DisCNT uses circular
deployment for even consumption of energy in entire wireless sensor network.
Cluster-head selection is on the basis of energy. Highest energy node becomes
CH for that round. Energy is again compared in the next round to check the
highest energy node of that round. The simulation results show that AM-DisCNT
performs better than the existing heterogeneous protocols on the basis of
network lifetime, throughput and stability of the system.
|
[
{
"version": "v1",
"created": "Sat, 27 Jul 2013 10:21:02 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Rao",
"A.",
""
],
[
"Akbar",
"M.",
""
],
[
"Javaid",
"N.",
""
],
[
"Mohammad",
"S. N.",
""
],
[
"Sarfraz",
"S.",
""
]
] |
new_dataset
| 0.966615 |
1307.8257
|
Mauro Femminella
|
Mauro Femminella, Francesco Giacinti, and Gianluca Reali
|
Enhancing Java Call Control with Media Server Control functions
|
Accepted for publication in IEEE Communications Magazine, Design and
Implementation (D&I) Series
| null |
10.1109/MCOM.2013.6619577
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a novel abstraction layer for application service
implementation compliant with the Java Call Control (JCC) specifications. It
simplifies creation of multimedia services using the Session Initiation
Protocol (SIP) and the Media Gateway Control Protocol (MGCP). In order to show
its effectiveness, we have implemented a JCC Resource Adaptor for a JAIN
Service Logic Execution Environment (JSLEE), using the Mobicents application
server, which is the only existing open source JSLEE implementation.
Experimental results, obtained by implementing a complex VoIP service, show
both a significant simplification of service implementation and improved
performance over legacy solutions.
|
[
{
"version": "v1",
"created": "Wed, 31 Jul 2013 09:20:25 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Femminella",
"Mauro",
""
],
[
"Giacinti",
"Francesco",
""
],
[
"Reali",
"Gianluca",
""
]
] |
new_dataset
| 0.981426 |
1309.1333
|
Nikolaos Pappas
|
Nikolaos Pappas, Marios Kountouris, Anthony Ephremides
|
The Stability Region of the Two-User Interference Channel
|
Accepted for publication at IEEE Information Theory Workshop 2013
| null |
10.1109/ITW.2013.6691293
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The stable throughput region of the two-user interference channel is
investigated here. First, the stability region for the general case is
characterized. Second, we study the cases where the receivers treat
interference as noise or perform successive interference cancelation. Finally,
we provide conditions for the convexity/concavity of the stability region and
for which a certain interference management strategy leads to broader stability
region.
|
[
{
"version": "v1",
"created": "Thu, 5 Sep 2013 12:38:35 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Pappas",
"Nikolaos",
""
],
[
"Kountouris",
"Marios",
""
],
[
"Ephremides",
"Anthony",
""
]
] |
new_dataset
| 0.968185 |
1310.0557
|
Mahyar Shirvanimoghaddam
|
Mahyar Shirvanimoghaddam, Yonghui Li, and Branka Vucetic
|
Near-Capacity Adaptive Analog Fountain Codes for Wireless Channels
|
To appear in IEEE Communications Letters
| null |
10.1109/LCOMM.2013.101813.131972
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a capacity-approaching analog fountain code (AFC)
for wireless channels. In AFC, the number of generated coded symbols is
potentially limitless. In contrast to the conventional binary rateless codes,
each coded symbol in AFC is a real-valued symbol, generated as a weighted sum
of $d$ randomly selected information bits, where $d$ and the weight
coefficients are randomly selected from predefined probability mass functions.
The coded symbols are then directly transmitted through wireless channels. We
analyze the error probability of AFC and design the weight set to minimize the
error probability. Simulation results show that AFC achieves the capacity of
the Gaussian channel in a wide range of signal to noise ratio (SNR).
|
[
{
"version": "v1",
"created": "Wed, 2 Oct 2013 03:28:51 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Shirvanimoghaddam",
"Mahyar",
""
],
[
"Li",
"Yonghui",
""
],
[
"Vucetic",
"Branka",
""
]
] |
new_dataset
| 0.995302 |
1310.0744
|
Marco Baldi
|
Marco Baldi, Marco Bianchi, Franco Chiaraluce, Roberto Garello,
Ignacio Aguilar Sanchez, Stefano Cioni
|
Advanced channel coding for space mission telecommand links
|
5 pages, 7 figures, presented at IEEE VTC 2013 Fall, Las Vegas, USA,
Sep. 2013 Proc. IEEE Vehicular Technology Conference (VTC 2013 Fall), ISBN
978-1-6185-9, Las Vegas, USA, Sep. 2013
| null |
10.1109/VTCFall.2013.6692087
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate and compare different options for updating the error
correcting code currently used in space mission telecommand links. Taking as a
reference the solutions recently emerged as the most promising ones, based on
Low-Density Parity-Check codes, we explore the behavior of alternative schemes,
based on parallel concatenated turbo codes and soft-decision decoded BCH codes.
Our analysis shows that these further options can offer similar or even better
performance.
|
[
{
"version": "v1",
"created": "Wed, 2 Oct 2013 15:40:26 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Baldi",
"Marco",
""
],
[
"Bianchi",
"Marco",
""
],
[
"Chiaraluce",
"Franco",
""
],
[
"Garello",
"Roberto",
""
],
[
"Sanchez",
"Ignacio Aguilar",
""
],
[
"Cioni",
"Stefano",
""
]
] |
new_dataset
| 0.991426 |
1311.1363
|
Valerio Cambareri
|
Valerio Cambareri, Mauro Mangia, Fabio Pareschi, Riccardo Rovatti,
Gianluca Setti
|
On Known-Plaintext Attacks to a Compressed Sensing-based Encryption: A
Quantitative Analysis
|
IEEE Transactions on Information Forensics and Security, accepted for
publication. Article in press
| null |
10.1109/TIFS.2015.2450676
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Despite the linearity of its encoding, compressed sensing may be used to
provide a limited form of data protection when random encoding matrices are
used to produce sets of low-dimensional measurements (ciphertexts). In this
paper we quantify by theoretical means the resistance of the least complex form
of this kind of encoding against known-plaintext attacks. For both standard
compressed sensing with antipodal random matrices and recent multiclass
encryption schemes based on it, we show how the number of candidate encoding
matrices that match a typical plaintext-ciphertext pair is so large that the
search for the true encoding matrix inconclusive. Such results on the practical
ineffectiveness of known-plaintext attacks underlie the fact that even
closely-related signal recovery under encoding matrix uncertainty is doomed to
fail.
Practical attacks are then exemplified by applying compressed sensing with
antipodal random matrices as a multiclass encryption scheme to signals such as
images and electrocardiographic tracks, showing that the extracted information
on the true encoding matrix from a plaintext-ciphertext pair leads to no
significant signal recovery quality increase. This theoretical and empirical
evidence clarifies that, although not perfectly secure, both standard
compressed sensing and multiclass encryption schemes feature a noteworthy level
of security against known-plaintext attacks, therefore increasing its appeal as
a negligible-cost encryption method for resource-limited sensing applications.
|
[
{
"version": "v1",
"created": "Wed, 6 Nov 2013 12:04:25 GMT"
},
{
"version": "v2",
"created": "Thu, 25 Jun 2015 12:20:21 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Cambareri",
"Valerio",
""
],
[
"Mangia",
"Mauro",
""
],
[
"Pareschi",
"Fabio",
""
],
[
"Rovatti",
"Riccardo",
""
],
[
"Setti",
"Gianluca",
""
]
] |
new_dataset
| 0.998163 |
1311.2651
|
Ashish Khisti
|
Xiang He, Ashish Khisti, Aylin Yener
|
MIMO Broadcast Channel with an Unknown Eavesdropper: Secrecy Degrees of
Freedom
|
Accepted to IEEE Transactions on Communications
| null |
10.1109/TCOMM.2013.112213.130302
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study a multi-antenna broadcast channel with two legitimate receivers and
an external eavesdropper. We assume that the channel matrix of the eavesdropper
is unknown to the legitimate terminals but satisfies a maximum rank constraint.
As our main result we characterize the associated secrecy degrees of freedom
for the broadcast channel with common and private messages. We show that a
direct extension of the single-user wiretap codebook does not achieve the
secrecy degrees of freedom. Our proposed optimal scheme involves decomposing
the signal space into a common subspace, which can be observed by both
receivers, and private subspaces which can be observed by only one of the
receivers, and carefully transmitting a subset of messages in each subspace. We
also consider the case when each user's private message must additionally
remain confidential from the other legitimate receiver and characterize the
s.d.o.f.\ region in this case.
|
[
{
"version": "v1",
"created": "Tue, 12 Nov 2013 00:54:08 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"He",
"Xiang",
""
],
[
"Khisti",
"Ashish",
""
],
[
"Yener",
"Aylin",
""
]
] |
new_dataset
| 0.970661 |
1312.0499
|
Christoph Neumann
|
Nicolas Le Scouarnec, Christoph Neumann, Gilles Straub
|
Cache policies for cloud-based systems: To keep or not to keep
|
Proceedings of IEEE International Conference on Cloud Computing 2014
(CLOUD 14)
| null |
10.1109/CLOUD.2014.11
| null |
cs.NI cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we study cache policies for cloud-based caching. Cloud-based
caching uses cloud storage services such as Amazon S3 as a cache for data items
that would have been recomputed otherwise. Cloud-based caching departs from
classical caching: cloud resources are potentially infinite and only paid when
used, while classical caching relies on a fixed storage capacity and its main
monetary cost comes from the initial investment. To deal with this new context,
we design and evaluate a new caching policy that minimizes the overall cost of
a cloud-based system. The policy takes into account the frequency of
consumption of an item and the cloud cost model. We show that this policy is
easier to operate, that it scales with the demand and that it outperforms
classical policies managing a fixed capacity.
|
[
{
"version": "v1",
"created": "Mon, 2 Dec 2013 16:21:25 GMT"
},
{
"version": "v2",
"created": "Thu, 24 Apr 2014 08:05:14 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Scouarnec",
"Nicolas Le",
""
],
[
"Neumann",
"Christoph",
""
],
[
"Straub",
"Gilles",
""
]
] |
new_dataset
| 0.983087 |
1401.4753
|
Rodrigo de Lamare
|
K. Zu, R. C. de Lamare and M. Haardt
|
Multi-Branch Tomlinson-Harashima Precoding for MU-MIMO Systems: Theory
and Algorithms
|
13 figures, 12 pages. IEEE Transactions on Communications, 2014
| null |
10.1109/TCOMM.2014.012514.130241
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Tomlinson-Harashima precoding (THP) is a nonlinear processing technique
employed at the transmit side and is a dual to the successive interference
cancelation (SIC) detection at the receive side. Like SIC detection, the
performance of THP strongly depends on the ordering of the precoded symbols.
The optimal ordering algorithm, however, is impractical for multiuser MIMO
(MU-MIMO) systems with multiple receive antennas due to the fact that the users
are geographically distributed. In this paper, we propose a multi-branch THP
(MB-THP) scheme and algorithms that employ multiple transmit processing and
ordering strategies along with a selection scheme to mitigate interference in
MU-MIMO systems. Two types of multi-branch THP (MB-THP) structures are
proposed. The first one employs a decentralized strategy with diagonal weighted
filters at the receivers of the users and the second uses a diagonal weighted
filter at the transmitter. The MB-MMSE-THP algorithms are also derived based on
an extended system model with the aid of an LQ decomposition, which is much
simpler compared to the conventional MMSE-THP algorithms. Simulation results
show that a better bit error rate (BER) performance can be achieved by the
proposed MB-MMSE-THP precoder with a small computational complexity increase.
|
[
{
"version": "v1",
"created": "Sun, 19 Jan 2014 23:08:35 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Zu",
"K.",
""
],
[
"de Lamare",
"R. C.",
""
],
[
"Haardt",
"M.",
""
]
] |
new_dataset
| 0.996586 |
1401.6060
|
Marco Mondelli
|
Marco Mondelli, S. Hamed Hassani, Igal Sason, and R\"udiger Urbanke
|
Achieving Marton's Region for Broadcast Channels Using Polar Codes
|
26 pages, 11 figures, accepted to IEEE Trans. Inform. Theory and
presented in part at ISIT'14
| null |
10.1109/ISIT.2014.6874844
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents polar coding schemes for the 2-user discrete memoryless
broadcast channel (DM-BC) which achieve Marton's region with both common and
private messages. This is the best achievable rate region known to date, and it
is tight for all classes of 2-user DM-BCs whose capacity regions are known. To
accomplish this task, we first construct polar codes for both the superposition
as well as the binning strategy. By combining these two schemes, we obtain
Marton's region with private messages only. Finally, we show how to handle the
case of common information. The proposed coding schemes possess the usual
advantages of polar codes, i.e., they have low encoding and decoding complexity
and a super-polynomial decay rate of the error probability.
We follow the lead of Goela, Abbe, and Gastpar, who recently introduced polar
codes emulating the superposition and binning schemes. In order to align the
polar indices, for both schemes, their solution involves some degradedness
constraints that are assumed to hold between the auxiliary random variables and
the channel outputs. To remove these constraints, we consider the transmission
of $k$ blocks and employ a chaining construction that guarantees the proper
alignment of the polarized indices. The techniques described in this work are
quite general, and they can be adopted to many other multi-terminal scenarios
whenever there polar indices need to be aligned.
|
[
{
"version": "v1",
"created": "Thu, 23 Jan 2014 17:23:38 GMT"
},
{
"version": "v2",
"created": "Thu, 20 Feb 2014 17:09:15 GMT"
},
{
"version": "v3",
"created": "Fri, 10 Oct 2014 18:29:05 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Mondelli",
"Marco",
""
],
[
"Hassani",
"S. Hamed",
""
],
[
"Sason",
"Igal",
""
],
[
"Urbanke",
"Rüdiger",
""
]
] |
new_dataset
| 0.99893 |
1403.6982
|
Ahmed Benfarah
|
Ahmed Benfarah, Stefano Tomasin and Nicola Laurenti
|
Parallel BCC with One Common and Two Confidential Messages and Imperfect
CSIT
|
This paper is accepted for publication in IEEE Globecom second
Workshop on trusted Com. with Physical Layer Security (TCPLS 2014)
| null |
10.1109/GLOCOMW.2014.7063625
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider a broadcast communication system over parallel sub-channels where
the transmitter sends three messages: a common message to two users, and two
confidential messages to each user which need to be kept secret from the other
user. We assume partial channel state information at the transmitter (CSIT),
stemming from noisy channel estimation. The first contribution of this paper is
the characterization of the secrecy capacity region boundary as the solution of
weighted sum-rate problems, with suitable weights. Partial CSIT is addressed by
adding a margin to the estimated channel gains. The second paper contribution
is the solution of this problem in an almost closed-form, where only two single
real parameters must be optimized, e.g., through dichotomic searches. On the
one hand, the considered problem generalizes existing literature where only two
out of the three messages are transmitted. On the other hand, the solution
finds also practical applications into the resource allocation of orthogonal
frequency division multiplexing (OFDM) systems with both secrecy and fairness
constraints.
|
[
{
"version": "v1",
"created": "Thu, 27 Mar 2014 11:32:17 GMT"
},
{
"version": "v2",
"created": "Tue, 20 Jan 2015 10:34:21 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Benfarah",
"Ahmed",
""
],
[
"Tomasin",
"Stefano",
""
],
[
"Laurenti",
"Nicola",
""
]
] |
new_dataset
| 0.995791 |
1404.2864
|
Marco Baldi
|
Marco Baldi, Nicola Maturo, Giacomo Ricciutelli, Franco Chiaraluce
|
LDPC coded transmissions over the Gaussian broadcast channel with
confidential messages
|
5 pages, 5 figures, to be presented at IEEE ICT 2014
| null |
10.1109/ICT.2014.6845079
| null |
cs.IT cs.CR math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We design and assess some practical low-density parity-check (LDPC) coded
transmission schemes for the Gaussian broadcast channel with confidential
messages (BCC). This channel model is different from the classical wiretap
channel model as the unauthorized receiver (Eve) must be able to decode some
part of the information. Hence, the reliability and security targets are
different from those of the wiretap channel. In order to design and assess
practical coding schemes, we use the error rate as a metric of the performance
achieved by the authorized receiver (Bob) and the unauthorized receiver (Eve).
We study the system feasibility, and show that two different levels of
protection against noise are required on the public and the secret messages.
This can be achieved in two ways: i) by using LDPC codes with unequal error
protection (UEP) of the transmitted information bits or ii) by using two
classical non-UEP LDPC codes with different rates. We compare these two
approaches and show that, for the considered examples, the solution exploiting
UEP LDPC codes is more efficient than that using non-UEP LDPC codes.
|
[
{
"version": "v1",
"created": "Thu, 10 Apr 2014 16:10:05 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Baldi",
"Marco",
""
],
[
"Maturo",
"Nicola",
""
],
[
"Ricciutelli",
"Giacomo",
""
],
[
"Chiaraluce",
"Franco",
""
]
] |
new_dataset
| 0.997291 |
1404.5767
|
Hendrik Richter
|
Hendrik Richter
|
Codynamic Fitness Landscapes of Coevolutionary Minimal Substrates
| null |
In: Proc. IEEE Congress on Evolutionary Computation, IEEE CEC
2014, (Ed.: C. A. Coello, Coello), IEEE Press, Piscataway, NJ, 2014,
2692-2699
|
10.1109/CEC.2014.6900272
| null |
cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Coevolutionary minimal substrates are simple and abstract models that allow
studying the relationships and codynamics between objective and subjective
fitness. Using these models an approach is presented for defining and analyzing
fitness landscapes of coevolutionary problems. We devise similarity measures of
codynamic fitness landscapes and experimentally study minimal substrates of
test--based and compositional problems for both cooperative and competitive
interaction.
|
[
{
"version": "v1",
"created": "Wed, 23 Apr 2014 09:53:47 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Richter",
"Hendrik",
""
]
] |
new_dataset
| 0.995719 |
1405.4957
|
Chenrong Xiong
|
Chenrong Xiong, Jun Lin and Zhiyuan Yan
|
Symbol-Based Successive Cancellation List Decoder for Polar Codes
|
Accepted by 2014 IEEE Workshop on Signal Processing Systems (SiPS)
| null |
10.1109/SiPS.2014.6986086
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Polar codes is promising because they can provably achieve the channel
capacity while having an explicit construction method. Lots of work have been
done for the bit-based decoding algorithm for polar codes. In this paper,
generalized symbol-based successive cancellation (SC) and SC list decoding
algorithms are discussed. A symbol-based recursive channel combination
relationship is proposed to calculate the symbol-based channel transition
probability. This proposed method needs less additions than the
maximum-likelihood decoder used by the existing symbol-based polar decoding
algorithm. In addition, a two-stage list pruning network is proposed to
simplify the list pruning network for the symbol-based SC list decoding
algorithm.
|
[
{
"version": "v1",
"created": "Tue, 20 May 2014 05:48:50 GMT"
},
{
"version": "v2",
"created": "Tue, 14 Oct 2014 02:39:36 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Xiong",
"Chenrong",
""
],
[
"Lin",
"Jun",
""
],
[
"Yan",
"Zhiyuan",
""
]
] |
new_dataset
| 0.997983 |
1406.7092
|
Neri Merhav
|
Neri Merhav
|
On zero-rate error exponents of finite-state channels with
input-dependent states
|
22 pages; submitted to IEEE Transactions on Information Theory
| null |
10.1109/TIT.2014.2378259
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We derive a single-letter formula for the zero-rate reliability (error
exponent) of a finite-state channel whose state variable depends
deterministically (and recursively) on past channel inputs, where the code
complies with a given channel input constraint. Special attention is then
devoted to the important special case of the Gaussian channel with inter-symbol
interference (ISI), where more explicit results are obtained.
|
[
{
"version": "v1",
"created": "Fri, 27 Jun 2014 07:39:33 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Merhav",
"Neri",
""
]
] |
new_dataset
| 0.980557 |
1406.7098
|
Jalaluddin Qureshi
|
Jalaluddin Qureshi
|
Caching Piggyback Information for Efficient Index Code Transmission
|
This paper has been accepted for publication in the 39th IEEE
Conference on Local Computer Networks (LCN) to be held in Edmonton, Canada,
Sep. 8-11, 2014
| null |
10.1109/LCN.2014.6925757
| null |
cs.NI cs.IT math.IT
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
The index coding problem is a fundamental transmission problem arising in
content distribution and wireless networks. Traditional approach to solve this
problem is to find heuristic/ approximation minimum clique partition solution
on an appropriately mapped graph of the index coding problem. In this paper we
study index code for unicast data flow for which we propose updated clique
index coding (UCIC) scheme, UCIC piggybacks additional information in the coded
symbol such that an unsatisfied client can update its cache. We show that UCIC
has higher coding gain than previously proposed index coding schemes, and it is
optimal for those instances where index code of minimum length is known.
|
[
{
"version": "v1",
"created": "Fri, 27 Jun 2014 08:08:17 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Qureshi",
"Jalaluddin",
""
]
] |
new_dataset
| 0.995331 |
1407.4489
|
Urs Niesen
|
Urs Niesen, Mohammad Ali Maddah-Ali
|
Coded Caching for Delay-Sensitive Content
|
9 pages
|
IEEE International Conference on Communications (ICC), pp. 5559 -
5564, June 2015
|
10.1109/ICC.2015.7249208
| null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Coded caching is a recently proposed technique that achieves significant
performance gains for cache networks compared to uncoded caching schemes.
However, this substantial coding gain is attained at the cost of large delivery
delay, which is not tolerable in delay-sensitive applications such as video
streaming. In this paper, we identify and investigate the tradeoff between the
performance gain of coded caching and the delivery delay. We propose a
computationally efficient caching algorithm that provides the gains of coding
and respects delay constraints. The proposed algorithm achieves the optimum
performance for large delay, but still offers major gains for small delay.
These gains are demonstrated in a practical setting with a video-streaming
prototype.
|
[
{
"version": "v1",
"created": "Wed, 16 Jul 2014 20:28:25 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Niesen",
"Urs",
""
],
[
"Maddah-Ali",
"Mohammad Ali",
""
]
] |
new_dataset
| 0.98176 |
1407.6266
|
Kamal Rahimi Malekshan
|
K. Rahimi Malekshan, W. Zhuang, and Y. Lostanlen
|
An Energy Efficient MAC Protocol for Fully Connected Wireless Ad Hoc
Networks
|
Published in IEEE Transaction on Wireless Communications
| null |
10.1109/TWC.2014.2336801
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Energy efficiency is an important performance measure of wireless network
protocols, especially for battery-powered mobile devices such as smartphones.
This paper presents a new energy-efficient medium access control (MAC) scheme
for fully connected wireless ad hoc networks. The proposed scheme reduces
energy consumption by putting radio interfaces in the sleep state periodically
and by reducing transmission collisions, which results in high throughput and
low packet transmission delay. The proposed MAC scheme can also address the
energy saving in realtime traffics which require very low packet transmission
delay. An analytical model is established to evaluate the performance of the
proposed MAC scheme. Analytical and simulation results demonstrate that the
proposed scheme has a significantly lower power consumption, achieves
substantially higher throughput, and has lower packet transmission delay in
comparison with existing power saving MAC protocols.
|
[
{
"version": "v1",
"created": "Wed, 23 Jul 2014 15:37:08 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Malekshan",
"K. Rahimi",
""
],
[
"Zhuang",
"W.",
""
],
[
"Lostanlen",
"Y.",
""
]
] |
new_dataset
| 0.975411 |
1407.8510
|
Awais Khawar
|
Awais Khawar, Ahmed Abdelhadi, and T. Charles Clancy
|
QPSK Waveform for MIMO Radar with Spectrum Sharing Constraints
|
submitted to IEEE Transactions. Distribution Statement A: Approved
for public release; distribution is unlimited
| null |
10.1016/j.phycom.2015.08.001
| null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Multiple-input multiple-output (MIMO) radar is a relatively new concept in
the field of radar signal processing. Many novel MIMO radar waveforms have been
developed by considering various performance metrics and constraints. In this
paper, we show that finite alphabet constant-envelope (FACE) quadrature-pulse
shift keying (QPSK) waveforms can be designed to realize a given covariance
matrix by transforming a constrained nonlinear optimization problem into an
unconstrained nonlinear optimization problem. In addition, we design QPSK
waveforms in a way that they don't cause interference to a cellular system, by
steering nulls towards a selected base station (BS). The BS is selected
according to our algorithm which guarantees minimum degradation in radar
performance due to null space projection (NSP) of radar waveforms. We design
QPSK waveforms with spectrum sharing constraints for a stationary and moving
radar platform. We show that the waveform designed for stationary MIMO radar
matches the desired beampattern closely, when the number of BS antennas
$N^{\text{BS}}$ is considerably less than the number of radar antennas $M$, due
to quasi-static interference channel. However, for moving radar the difference
between designed and desired waveforms is larger than stationary radar, due to
rapidly changing channel.
|
[
{
"version": "v1",
"created": "Wed, 30 Jul 2014 18:13:17 GMT"
},
{
"version": "v2",
"created": "Sun, 3 Aug 2014 17:42:42 GMT"
},
{
"version": "v3",
"created": "Thu, 14 Aug 2014 19:30:05 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Khawar",
"Awais",
""
],
[
"Abdelhadi",
"Ahmed",
""
],
[
"Clancy",
"T. Charles",
""
]
] |
new_dataset
| 0.990199 |
1409.2153
|
Ankit Chaudhary
|
J. L. Raheja, Dhiraj, D. Gopinath, Ankit Chaudhary
|
GUI system for Elders/Patients in Intensive Care
|
In proceedings of the 4th IEEE International Conference on
International Technology Management Conference, Chicago, IL USA, 12-15 June,
2014
| null |
10.1109/ITMC.2014.6918605
| null |
cs.HC cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the old age, few people need special care if they are suffering from
specific diseases as they can get stroke while they are in normal life routine.
Also patients of any age, who are not able to walk, need to be taken care of
personally but for this, either they have to be in hospital or someone like
nurse should be with them for better care. This is costly in terms of money and
man power. A person is needed for 24x7 care of these people. To help in this
aspect we purposes a vision based system which will take input from the patient
and will provide information to the specified person, who is currently may not
in the patient room. This will reduce the need of man power, also a continuous
monitoring would not be needed. The system is using MS Kinect for gesture
detection for better accuracy and this system can be installed at home or
hospital easily. The system provides GUI for simple usage and gives visual and
audio feedback to user. This system work on natural hand interaction and need
no training before using and also no need to wear any glove or color strip.
|
[
{
"version": "v1",
"created": "Sun, 7 Sep 2014 19:02:32 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Raheja",
"J. L.",
""
],
[
"Dhiraj",
"",
""
],
[
"Gopinath",
"D.",
""
],
[
"Chaudhary",
"Ankit",
""
]
] |
new_dataset
| 0.997663 |
1409.6001
|
Ghaith Hattab
|
Amr El-Mougy, Mohamed Ibnkahla, Ghaith Hattab, and Waleed Ejaz
|
Reconfigurable Wireless Networks
|
28 pages, 26 figures; Submitted to the Proceedings of the IEEE (a
special issue on Reconfigurable Systems)
| null |
10.1109/JPROC.2014.2376812
| null |
cs.NI cs.IT math.IT
|
http://creativecommons.org/licenses/by/3.0/
|
Driven by the advent of sophisticated and ubiquitous applications, and the
ever-growing need for information, wireless networks are without a doubt
steadily evolving into profoundly more complex and dynamic systems. The user
demands are progressively rampant, while application requirements continue to
expand in both range and diversity. Future wireless networks, therefore, must
be equipped with the ability to handle numerous, albeit challenging
requirements. Network reconfiguration, considered as a prominent network
paradigm, is envisioned to play a key role in leveraging future network
performance and considerably advancing current user experiences. This paper
presents a comprehensive overview of reconfigurable wireless networks and an
in-depth analysis of reconfiguration at all layers of the protocol stack. Such
networks characteristically possess the ability to reconfigure and adapt their
hardware and software components and architectures, thus enabling flexible
delivery of broad services, as well as sustaining robust operation under highly
dynamic conditions. The paper offers a unifying framework for research in
reconfigurable wireless networks. This should provide the reader with a
holistic view of concepts, methods, and strategies in reconfigurable wireless
networks. Focus is given to reconfigurable systems in relatively new and
emerging research areas such as cognitive radio networks, cross-layer
reconfiguration and software-defined networks. In addition, modern networks
have to be intelligent and capable of self-organization. Thus, this paper
discusses the concept of network intelligence as a means to enable
reconfiguration in highly complex and dynamic networks. Finally, the paper is
supported with several examples and case studies showing the tremendous impact
of reconfiguration on wireless networks.
|
[
{
"version": "v1",
"created": "Sun, 21 Sep 2014 15:58:49 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"El-Mougy",
"Amr",
""
],
[
"Ibnkahla",
"Mohamed",
""
],
[
"Hattab",
"Ghaith",
""
],
[
"Ejaz",
"Waleed",
""
]
] |
new_dataset
| 0.989612 |
1411.0076
|
Juei-Chin Shen
|
Juei-Chin Shen, Jun Zhang, and Khaled Ben Letaief
|
User Capacity of Pilot-Contaminated TDD Massive MIMO Systems
|
Accepted by IEEE GLOBECOM 2014, 6 pages, 3 figures
| null |
10.1109/GLOCOM.2014.7037385
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Pilot contamination has been regarded as a main limiting factor of time
division duplexing (TDD) massive multiple-input-multiple-output (Massive MIMO)
systems, as it will make the signal-to-interference-plus-noise ratio (SINR)
saturated. However, how pilot contamination will limit the user capacity of
downlink Massive MIMO, i.e., the maximum number of admissible users, has not
been addressed. This paper provides an explicit expression of the Massive MIMO
user capacity in the pilot-contaminated regime where the number of users is
larger than the pilot sequence length. Furthermore, the scheme for achieving
the user capacity, i.e., the uplink pilot training sequence and downlink power
allocation, has been identified. By using this capacity-achieving scheme, the
SINR requirement of each user can be satisfied and energy-efficient
transmission is feasible in the large-antenna-size (LAS) regime. Comparison
with two non-capacity-achieving schemes highlights the superiority of our
proposed scheme in terms of achieving higher user capacity.
|
[
{
"version": "v1",
"created": "Sat, 1 Nov 2014 06:39:24 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Shen",
"Juei-Chin",
""
],
[
"Zhang",
"Jun",
""
],
[
"Letaief",
"Khaled Ben",
""
]
] |
new_dataset
| 0.989259 |
1411.1280
|
Gokce Gorbil
|
Gokce Gorbil, Omer H. Abdelrahman, Mihajlo Pavloski and Erol Gelenbe
|
Storms in Mobile Networks
|
Submitted to the IEEE TETC special issue on "Emerging topics in Cyber
Security"
| null |
10.1145/2642687.2642688
| null |
cs.NI cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mobile networks are vulnerable to signalling attacks and storms that are
caused by traffic patterns that overload the control plane, and differ from
distributed denial of service (DDoS) attacks in the Internet since they
directly attack the control plane, and also reserve wireless bandwidth without
actually using it. Such attacks can result from malware and mobile botnets, as
well as from poorly designed applications, and can cause service outages in 3G
and 4G networks which have been experienced by mobile operators. Since the
radio resource control (RRC) protocol in 3G and 4G networks is particularly
susceptible to such attacks, we analyze their effect with a mathematical model
that helps to predict the congestion that is caused by an attack. A detailed
simulation model of a mobile network is used to better understand the temporal
dynamics of user behavior and signalling in the network and to show how RRC
based signalling attacks and storms cause significant problems in the control
plane and the user plane of the network. Our analysis also serves to identify
how storms can be detected, and to propose how system parameters can be chosen
to mitigate their effect.
|
[
{
"version": "v1",
"created": "Wed, 5 Nov 2014 14:26:08 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Gorbil",
"Gokce",
""
],
[
"Abdelrahman",
"Omer H.",
""
],
[
"Pavloski",
"Mihajlo",
""
],
[
"Gelenbe",
"Erol",
""
]
] |
new_dataset
| 0.999326 |
1411.2928
|
Pawe{\l} Rz\k{a}\.zewski
|
Valentin E. Brimkov, Konstanty Junosza-Szaniawski, Sean Kafer, Jan
Kratochv\'il, Martin Pergel, Pawe{\l} Rz\k{a}\.zewski, Matthew
Szczepankiewicz, Joshua Terhaar
|
Homothetic Polygons and Beyond: Intersection Graphs, Recognition, and
Maximum Clique
| null | null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study the {\sc Clique} problem in classes of intersection graphs of convex
sets in the plane. The problem is known to be NP-complete in convex-set
intersection graphs and straight-line-segment intersection graphs, but solvable
in polynomial time in intersection graphs of homothetic triangles. We extend
the latter result by showing that for every convex polygon $P$ with sides
parallel to $k$ directions, every $n$-vertex graph which is an intersection
graph of homothetic copies of $P$ contains at most $n^{k}$ inclusion-wise
maximal cliques. We actually prove this result for a more general class of
graphs, the so called $k_{\text{DIR}}-\text{CONV}$, which are intersection
graphs of convex polygons whose sides are parallel to some fixed $k$
directions. Moreover, we provide some lower bounds on the numbers of maximal
cliques, discuss the complexity of recognizing these classes of graphs and
present a relationship with other classes of convex-set intersection graphs.
Finally, we generalize the upper bound on the number of maximal cliques to
intersection graphs of higher-dimensional convex polytopes in Euclidean space.
|
[
{
"version": "v1",
"created": "Tue, 11 Nov 2014 19:14:19 GMT"
},
{
"version": "v2",
"created": "Mon, 14 Nov 2016 12:19:12 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Brimkov",
"Valentin E.",
""
],
[
"Junosza-Szaniawski",
"Konstanty",
""
],
[
"Kafer",
"Sean",
""
],
[
"Kratochvíl",
"Jan",
""
],
[
"Pergel",
"Martin",
""
],
[
"Rzążewski",
"Paweł",
""
],
[
"Szczepankiewicz",
"Matthew",
""
],
[
"Terhaar",
"Joshua",
""
]
] |
new_dataset
| 0.99957 |
1411.3651
|
Irena Orovic Dr
|
Srdjan Stankovic, Irena Orovic, Ljubisa Stankovic
|
Polynomial Fourier Domain as a Domain of Signal Sparsity
|
submitted to IEEE Transactions of Signal Processing (10 pages, 11
Figures)
| null |
10.1016/j.sigpro.2016.07.015
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A compressive sensing (CS) reconstruction method for polynomial phase signals
is proposed in this paper. It relies on the Polynomial Fourier transform, which
is used to establish a relationship between the observation and sparsity
domain. Polynomial phase signals are not sparse in commonly used domains such
as Fourier or wavelet domain. Therefore, for polynomial phase signals standard
CS algorithms applied in these transformation domains cannot provide
satisfactory results. In that sense, the Polynomial Fourier transform is used
to ensure sparsity. The proposed approach is generalized using time-frequency
representations obtained by the Local Polynomial Fourier transform (LPFT). In
particular, the first-order LPFT can produce linear time-frequency
representation for chirps. It provides revealing signal local behavior, which
leads to sparse representation. The theory is illustrated on examples.
|
[
{
"version": "v1",
"created": "Fri, 24 Oct 2014 13:58:33 GMT"
},
{
"version": "v2",
"created": "Sun, 1 Mar 2015 16:17:40 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Stankovic",
"Srdjan",
""
],
[
"Orovic",
"Irena",
""
],
[
"Stankovic",
"Ljubisa",
""
]
] |
new_dataset
| 0.95998 |
1411.6784
|
Jing Jiang
|
Minquan Cheng, Hung-Lin Fu, Jing Jiang, Yuan-Hsun Lo and Ying Miao
|
Codes with the Identifiable Parent Property for Multimedia
Fingerprinting
|
7 pages, submitted to IEEE transction on information theory
| null |
10.1007/s10623-016-0203-x
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Let ${\cal C}$ be a $q$-ary code of length $n$ and size $M$, and ${\cal C}(i)
= \{{\bf c}(i) \ | \ {\bf c}=({\bf c}(1), {\bf c}(2), \ldots, {\bf c}(n))^{T}
\in {\cal C}\}$ be the set of $i$th coordinates of ${\cal C}$. The descendant
code of a sub-code ${\cal C}^{'} \subseteq {\cal C}$ is defined to be ${\cal
C}^{'}(1) \times {\cal C}^{'}(2) \times \cdots \times {\cal C}^{'}(n)$. In this
paper, we introduce a multimedia analogue of codes with the identifiable parent
property (IPP), called multimedia IPP codes or $t$-MIPPC$(n, M, q)$, so that
given the descendant code of any sub-code ${\cal C}^{'}$ of a multimedia
$t$-IPP code ${\cal C}$, one can always identify, as IPP codes do in the
generic digital scenario, at least one codeword in ${\cal C}^{'}$. We first
derive a general upper bound on the size $M$ of a multimedia $t$-IPP code, and
then investigate multimedia $3$-IPP codes in more detail. We characterize a
multimedia $3$-IPP code of length $2$ in terms of a bipartite graph and a
generalized packing, respectively. By means of these combinatorial
characterizations, we further derive a tight upper bound on the size of a
multimedia $3$-IPP code of length $2$, and construct several infinite families
of (asymptotically) optimal multimedia $3$-IPP codes of length $2$.
|
[
{
"version": "v1",
"created": "Tue, 25 Nov 2014 09:35:11 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Cheng",
"Minquan",
""
],
[
"Fu",
"Hung-Lin",
""
],
[
"Jiang",
"Jing",
""
],
[
"Lo",
"Yuan-Hsun",
""
],
[
"Miao",
"Ying",
""
]
] |
new_dataset
| 0.972415 |
1503.04254
|
Sheng Zhou
|
Sheng Zhou, Jie Gong, Zhenyu Zhou, Wei Chen, Zhisheng Niu
|
GreenDelivery: Proactive Content Caching and Push with
Energy-Harvesting-based Small Cells
|
15 pages, 5 figures, accepted by IEEE Communications Magazine
| null |
10.1109/MCOM.2015.7081087
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The explosive growth of mobile multimedia traffic calls for scalable wireless
access with high quality of service and low energy cost. Motivated by the
emerging energy harvesting communications, and the trend of caching multimedia
contents at the access edge and user terminals, we propose a paradigm-shift
framework, namely GreenDelivery, enabling efficient content delivery with
energy harvesting based small cells. To resolve the two-dimensional randomness
of energy harvesting and content request arrivals, proactive caching and push
are jointly optimized, with respect to the content popularity distribution and
battery states. We thus develop a novel way of understanding the interplay
between content and energy over time and space. Case studies are provided to
show the substantial reduction of macro BS activities, and thus the related
energy consumption from the power grid is reduced. Research issues of the
proposed GreenDelivery framework are also discussed.
|
[
{
"version": "v1",
"created": "Sat, 14 Mar 2015 01:30:52 GMT"
},
{
"version": "v2",
"created": "Sun, 22 Mar 2015 06:02:47 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Zhou",
"Sheng",
""
],
[
"Gong",
"Jie",
""
],
[
"Zhou",
"Zhenyu",
""
],
[
"Chen",
"Wei",
""
],
[
"Niu",
"Zhisheng",
""
]
] |
new_dataset
| 0.993749 |
1503.05365
|
Bhanukiran Perabathini
|
Bhanukiran Perabathini, Ejder Ba\c{s}tu\u{g}, Marios Kountouris,
M\'erouane Debbah and Alberto Conte
|
Caching at the Edge: a Green Perspective for 5G Networks
|
to be presented at IEEE International Conference on Communications
(ICC), London, UK, 2015
| null |
10.1109/ICCW.2015.7247608
| null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Endowed with context-awareness and proactive capabilities, caching users'
content locally at the edge of the network is able to cope with increasing data
traffic demand in 5G wireless networks. In this work, we focus on the energy
consumption aspects of cache-enabled wireless cellular networks, specifically
in terms of area power consumption (APC) and energy efficiency (EE). We assume
that both base stations (BSs) and mobile users are distributed according to
homogeneous Poisson point processes (PPPs) and we introduce a detailed power
model that takes into account caching. We study the conditions under which the
area power consumption is minimized with respect to BS transmit power, while
ensuring a certain quality of service (QoS) in terms of coverage probability.
Furthermore, we provide the optimal BS transmit power that maximizes the area
spectral efficiency per unit total power spent. The main takeaway of this paper
is that caching seems to be an energy efficient solution.
|
[
{
"version": "v1",
"created": "Wed, 18 Mar 2015 12:17:12 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Perabathini",
"Bhanukiran",
""
],
[
"Baştuğ",
"Ejder",
""
],
[
"Kountouris",
"Marios",
""
],
[
"Debbah",
"Mérouane",
""
],
[
"Conte",
"Alberto",
""
]
] |
new_dataset
| 0.994449 |
1503.07372
|
Martina Cardone
|
Martina Cardone, Daniela Tuninetti, Raymond Knopp
|
The Two-user Causal Cognitive Interference Channel: Novel Outer Bounds
and Constant Gap Result for the Symmetric Gaussian Noise Channel in Weak
Interference
|
Submitted to IEEE Transactions on Information Theory
| null |
10.1109/TIT.2016.2584619
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper studies the two-user Causal Cognitive Interference Channel (CCIC),
where two transmitters aim to communicate independent messages to two different
receivers via a common channel. One source, referred to as the cognitive, is
capable of overhearing the other source, referred to as the primary, through a
noisy in-band link and thus can assist in sending the primary's data. Two novel
outer bounds of the type $2R_p+R_c$ and $R_p+2R_c$ are derived for the class of
injective semi-deterministic CCICs where the noises at the different
source-destination pairs are independent. An achievable rate region is derived
based on Gelfand-Pinsker binning, superposition coding and simultaneous
decoding at the receivers.
The lower and outer bounds are then specialized to the practically relevant
Gaussian noise case. The authors of this paper recently characterized to within
a constant gap the capacity of the symmetric Gaussian CCIC in (a) the strong
interference regime, and (b) for a subset of the weak interference regime when
the cooperation link is larger than a given threshold. This work characterizes
to within a constant gap the capacity for the symmetric Gaussian CCIC in the
regime that was still open. In particular, it is shown that the novel outer
bounds are necessary to characterize the capacity to within a constant gap when
the cooperation link is weaker than the direct links, that is, in this regime
unilateral cooperation leaves some system resources underutilized.
|
[
{
"version": "v1",
"created": "Wed, 25 Mar 2015 13:42:45 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Cardone",
"Martina",
""
],
[
"Tuninetti",
"Daniela",
""
],
[
"Knopp",
"Raymond",
""
]
] |
new_dataset
| 0.974251 |
1503.08479
|
Lex Fridman
|
Lex Fridman, Steven Weber, Rachel Greenstadt, Moshe Kam
|
Active Authentication on Mobile Devices via Stylometry, Application
Usage, Web Browsing, and GPS Location
|
Accepted for Publication in the IEEE Systems Journal
| null |
10.1109/JSYST.2015.2472579
| null |
cs.CR stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Active authentication is the problem of continuously verifying the identity
of a person based on behavioral aspects of their interaction with a computing
device. In this study, we collect and analyze behavioral biometrics data from
200subjects, each using their personal Android mobile device for a period of at
least 30 days. This dataset is novel in the context of active authentication
due to its size, duration, number of modalities, and absence of restrictions on
tracked activity. The geographical colocation of the subjects in the study is
representative of a large closed-world environment such as an organization
where the unauthorized user of a device is likely to be an insider threat:
coming from within the organization. We consider four biometric modalities: (1)
text entered via soft keyboard, (2) applications used, (3) websites visited,
and (4) physical location of the device as determined from GPS (when outdoors)
or WiFi (when indoors). We implement and test a classifier for each modality
and organize the classifiers as a parallel binary decision fusion architecture.
We are able to characterize the performance of the system with respect to
intruder detection time and to quantify the contribution of each modality to
the overall performance.
|
[
{
"version": "v1",
"created": "Sun, 29 Mar 2015 18:59:23 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Fridman",
"Lex",
""
],
[
"Weber",
"Steven",
""
],
[
"Greenstadt",
"Rachel",
""
],
[
"Kam",
"Moshe",
""
]
] |
new_dataset
| 0.99962 |
1505.00080
|
Mohammadali Mohammadi
|
Mohammadali Mohammadi, Himal A. Suraweera, Gan Zheng, Caijun Zhong,
Ioannis Krikidis
|
Full-Duplex MIMO Relaying Powered by Wireless Energy Transfer
|
Accepted for IEEE International Workshop on Signal Processing
Advances in Wireless Communications (SPAWC 2015), Invited paper
| null |
10.1109/SPAWC.2015.7227047
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider a full-duplex decode-and-forward system, where the wirelessly
powered relay employs the time-switching protocol to receive power from the
source and then transmit information to the destination. It is assumed that the
relay node is equipped with two sets of antennas to enable full-duplex
communications. Three different interference mitigation schemes are studied,
namely, 1) optimal 2) zero-forcing and 3) maximum ratio combining/maximum ratio
transmission. We develop new outage probability expressions to investigate
delay-constrained transmission throughput of these schemes. Our analysis show
interesting performance comparisons of the considered precoding schemes for
different system and link parameters.
|
[
{
"version": "v1",
"created": "Fri, 1 May 2015 03:32:59 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Mohammadi",
"Mohammadali",
""
],
[
"Suraweera",
"Himal A.",
""
],
[
"Zheng",
"Gan",
""
],
[
"Zhong",
"Caijun",
""
],
[
"Krikidis",
"Ioannis",
""
]
] |
new_dataset
| 0.975092 |
1507.01053
|
KyungHyun Cho
|
Kyunghyun Cho, Aaron Courville, Yoshua Bengio
|
Describing Multimedia Content using Attention-based Encoder--Decoder
Networks
|
Submitted to IEEE Transactions on Multimedia Special Issue on Deep
Learning for Multimedia Computing
| null |
10.1109/TMM.2015.2477044
| null |
cs.NE cs.CL cs.CV cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Whereas deep neural networks were first mostly used for classification tasks,
they are rapidly expanding in the realm of structured output problems, where
the observed target is composed of multiple random variables that have a rich
joint distribution, given the input. We focus in this paper on the case where
the input also has a rich structure and the input and output structures are
somehow related. We describe systems that learn to attend to different places
in the input, for each element of the output, for a variety of tasks: machine
translation, image caption generation, video clip description and speech
recognition. All these systems are based on a shared set of building blocks:
gated recurrent neural networks and convolutional neural networks, along with
trained attention mechanisms. We report on experimental results with these
systems, showing impressively good performance and the advantage of the
attention mechanism.
|
[
{
"version": "v1",
"created": "Sat, 4 Jul 2015 01:06:16 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Cho",
"Kyunghyun",
""
],
[
"Courville",
"Aaron",
""
],
[
"Bengio",
"Yoshua",
""
]
] |
new_dataset
| 0.958189 |
1507.04204
|
Linglong Dai
|
Xudong Zhu, Zhaocheng Wang, Linglong Dai, and Chen Qian
|
Smart Pilot Assignment for Massive MIMO
|
4 pages, 3 figures
|
IEEE Communications Letters, vol. 19 , no. 8, Aug. 2015
|
10.1109/LCOMM.2015.2409176
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A massive multiple-input multiple-output (MIMO) system, which utilizes a
large number of antennas at the base station (BS) to serve multiple users,
suffers from pilot contamination due to inter-cell interference. A smart pilot
assignment (SPA) scheme is proposed in this letter to improve the performance
of users with severe pilot contamination. Specifically, by exploiting the
large-scale characteristics of fading channels, the BS firstly measures the
inter-cell interference of each pilot sequence caused by the users with the
same pilot sequence in other adjacent cells. Then, in contrast to the
conventional schemes which assign the pilot sequences to the users randomly,
the proposed SPA method assigns the pilot sequence with the smallest inter-cell
interference to the user having the worst channel quality in a sequential way
to improve its performance. Simulation results verify the performance gain of
the proposed scheme in typical massive MIMO systems.
|
[
{
"version": "v1",
"created": "Wed, 15 Jul 2015 13:21:09 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Zhu",
"Xudong",
""
],
[
"Wang",
"Zhaocheng",
""
],
[
"Dai",
"Linglong",
""
],
[
"Qian",
"Chen",
""
]
] |
new_dataset
| 0.976057 |
1508.06218
|
Mina Taheri
|
Nirwan Ansari, Tao Han, and Mina Taheri
|
GATE: Greening At The Edge
|
7 Pages, 12 Figures, Submitted to IEEE Wireless Communications
| null |
10.1109/MWC.2016.7462486
| null |
cs.NI
|
http://creativecommons.org/publicdomain/zero/1.0/
|
Dramatic data traffic growth, especially wireless data, is driving a
significant surge in energy consumption in the last mile access of the
telecommunications infrastructure. The growing energy consumption not only
escalates the operators' operational expenditures (OPEX) but also leads to a
significant rise of carbon footprints. Therefore, enhancing the energy
efficiency of broadband access networks is becoming a necessity to bolster
social, environmental, and economic sustainability. This article provides an
overview on the design and optimization of energy efficient broadband access
networks, analyzes the energy efficient design of passive optical networks,
discusses the enabling technologies for next generation broadband wireless
access networks, and elicits the emerging technologies for enhancing the energy
efficiency of the last mile access of the network infrastructure.
|
[
{
"version": "v1",
"created": "Mon, 24 Aug 2015 18:31:54 GMT"
},
{
"version": "v2",
"created": "Mon, 14 Sep 2015 17:23:48 GMT"
}
] | 2016-11-15T00:00:00 |
[
[
"Ansari",
"Nirwan",
""
],
[
"Han",
"Tao",
""
],
[
"Taheri",
"Mina",
""
]
] |
new_dataset
| 0.988617 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.