421 research outputs found
Concurrent Cyber Physical Systems:Tensor State Space Representation
In this research paper, state space representation of concurrent, linearly
coupled dynamical systems is discussed. It is reasoned that the Tensor State
Space Representation (TSSR) proposed in [Rama1] is directly applicable in such
a problem. Also some discussion on linearly coupled, concurrent systems
evolving on multiple time scales is included. Briefly new ideas related to
distributed signal processing in cyber physical systems are included
Optimal Organizational Hierarchies: Source Coding: Disaster Relief
ulticasting is an important communication paradigm for enabling the
dissemination of information selectively. This paper considers the problem of
optimal secure multicasting in a communication network captured through a graph
(optimal is in an interesting sense) and provides a doubly optimal solution
using results from source coding. It is realized that the solution leads to
optimal design (in a well defined optimality sense) of organizational
hierarchies captured through a graph. In this effort two novel concepts :
prefix free path, graph entropy are introduced. Some results of graph entropy
are provided. Also some results on Kraft inequality are discussed. As an
application Hierarchical Hybrid Communication Network is utilized as a model of
structured Mobile Adhoc network for utility in Disaster Management. Several new
research problems that naturally emanate from this research are summarized
Arithmetical Functions : Infinite Products
In this technical report, certain interesting classification of arithmetical
functions is proposed. The notion of additively decomposable and
multiplicatively decomposable arithmetical functions is proposed. The concepts
of arithmetical polynomials and arithmetical power series are introduced. Using
these concepts, an interesting Theorem relating arithmetical power series and
infinite products has been proved. Also arithmetical polynomials are related to
probabilistic number theory. Furthermore some results related to the Waring
problem are discussed
Graphs: Associated Markov Chains
In this research paper, weighted / unweighted, directed / undirected graphs
are associated with interesting Discrete Time Markov Chains (DTMCs) as well as
Continuous Time Markov Chains (CTMCs). The equilibrium / transient behaviour of
such Markov chains is studied. Also entropy dynamics (Shannon entropy) of
certain structured Markov chains is investigated. Finally certain structured
graphs and the associated Markov chains are studied
Towards a Resolution of P = NP Conjecture
In this research paper, the problem of optimization of a quadratic form over
the convex hull generated by the corners of hypercube is attempted and solved.
It is reasoned that under some conditions, the optimum occurs at the corners of
hypercube. Results related to the computation of global optimum stable state
(an NP hard problem) are discussed. An algorithm is proposed. It is hoped that
the results shed light on resolving the P not equal to NP problem.Comment: 15 pages. arXiv admin note: substantial text overlap with
arXiv:1207.063
Optimization of Quadratic Forms: NP Hard Problems : Neural Networks
In this research paper, the problem of optimization of a quadratic form over
the convex hull generated by the corners of hypercube is attempted and solved.
Some results related to stable states/vectors, anti-stable states/vectors (over
the hypercube) are discussed. Some results related to the computation of global
optimum stable state (an NP hard problem) are discussed. It is hoped that the
results shed light on resolving the P \neq NP problem
Gibbs-Shannon Entropy and Related Measures: Tsallis Entropy
In this research paper, it is proved that an approximation to Gibbs-Shannon
entropy measure naturally leads to Tsallis entropy for the real parameter q =2
. Several interesting measures based on the input as well as output of a
discrete memoryless channel are provided and some of the properties of those
measures are discussed. It is expected that these results will be of utility in
Information Theoretic research
Full-Duplex Transceiver for Future Cellular Network: A Smart Antenna Approach
In this paper, we propose a transceiver architecture for full-duplex (FD)
eNodeB (eNB) and FD user equipment (UE) transceiver. For FD
communication,.i.e., simultaneous in-band uplink and downlink operation, same
subcarriers can be allocated to UE in both uplink and downlink. Hence, contrary
to traditional LTE, we propose using single-carrier frequency division multiple
accesses (SC-FDMA) for downlink along with the conventional method of using it
for uplink. The use of multiple antennas at eNB and singular value
decomposition (SVD) in the downlink allows multiple users (MU) to operate on
the same set of ubcarriers. In the uplink, successive interference cancellation
with optimal ordering (SSIC-OO) algorithm is used to decouple signals of UEs
operating in the same set of subcarriers. A smart antenna approach is adopted
which prevents interference, in downlink of a UE, from uplink signals of other
UEs sharing same subcarriers. The approach includes using multiple antennas at
UEs to form directed beams towards eNode and nulls towards other UEs. The
proposed architecture results in significant improvement of the overall
spectrum efficiency per cell of the cellular network.Comment: arXiv admin note: text overlap with arXiv:1506.0213
Grid-based Network Architecture for Distributed Computation in Wireless Sensor Networks
Wireless Sensor Networks (WSNs) are used to perform distributed sensing in
various fields, such as health, military, home etc. In WSNs, sensor nodes
should communicate among themselves and do distributed computation over the
sensed values to identify the occurrence of an event. This paper assumes the no
memory computation model for sensor nodes, i.e. the sensor nodes only have two
registers. This paper presents an optimal architecture for the distributed
computation in WSN and also claims that this architecture is the optimal for
the described computation model
Analysis of Path Loss mitigation through Dynamic Spectrum Access: Software Defined Radio
In this paper, an analysis is carried out for a method to mitigate the path
loss through the dynamic spectrum access (DSA) method. The path loss is a major
component which determines the QoS of a wireless link. Its effect is
complemented by the presence of obstruction between the transmitter and
receiver. The future cellular network (5G) focuses on operating with the
millimeter-wave (mmW). In higher frequency, path loss can play a significant
role in degrading the link quality due to higher attenuation. In a scenario,
where the operating environment is changing dynamically, sudden degradation of
operating conditions or arrival of obstruction between transmitter and receiver
may result in link failure. The method analyzed here includes dynamically
allocating spectrum at a lower frequency band for a link suffering from high
path loss. For the analysis, a wireless link was set up using Universal
Software Radio Peripherals (USRPs). The received power is observed to increase
by dynamically changing the operating frequency from 1.9 GHz to 830 MHz.
Finally the utility of software defined radio (SDR) in the RF front end, to
combat the path loss in the future cellular networks, is studied.Comment: Accepted in ICMOCE-2015 (IIT Bhubaneswar, India
- …