2,172 research outputs found
Query-based Deep Improvisation
In this paper we explore techniques for generating new music using a
Variational Autoencoder (VAE) neural network that was trained on a corpus of
specific style. Instead of randomly sampling the latent states of the network
to produce free improvisation, we generate new music by querying the network
with musical input in a style different from the training corpus. This allows
us to produce new musical output with longer-term structure that blends aspects
of the query to the style of the network. In order to control the level of this
blending we add a noisy channel between the VAE encoder and decoder using
bit-allocation algorithm from communication rate-distortion theory. Our
experiments provide new insight into relations between the representational and
structural information of latent states and the query signal, suggesting their
possible use for composition purposes
Finite-State Channels with Feedback and State Known at the Encoder
We consider finite state channels (FSCs) with feedback and state information
known causally at the encoder. This setting is quite general and includes: a
memoryless channel with i.i.d. state (the Shannon strategy), Markovian states
that include look-ahead (LA) access to the state and energy harvesting. We
characterize the feedback capacity of the general setting as the directed
information between auxiliary random variables with memory to the channel
outputs. We also propose two methods for computing the feedback capacity: (i)
formulating an infinite-horizon average-reward dynamic program; and (ii) a
single-letter lower bound based on auxiliary directed graphs called -graphs.
We demonstrate our computation methods on several examples. In the first
example, we introduce a channel with LA and derive a closed-form, analytic
lower bound on its feedback capacity. Furthermore, we show that the mentioned
methods achieve the feedback capacity of known unifilar FSCs such as the
trapdoor channel, the Ising channel and the input-constrained erasure channel.
Finally, we analyze the feedback capacity of a channel whose state is
stochastically dependent on the input.Comment: 39 pages, 10 figures. The material in this paper was presented in
part at the 56th Annual Allerton Conference on Communication, Control, and
Computing, Monticello, IL, USA, October 2018, and at the IEEE International
Symposium on Information Theory, Los Angeles, CA, USA, June 202
Self-concatenated code design and its application in power-efficient cooperative communications
In this tutorial, we have focused on the design of binary self-concatenated coding schemes with the help of EXtrinsic Information Transfer (EXIT) charts and Union bound analysis. The design methodology of future iteratively decoded self-concatenated aided cooperative communication schemes is presented. In doing so, we will identify the most important milestones in the area of channel coding, concatenated coding schemes and cooperative communication systems till date and suggest future research directions
- …