Robust signal compression using joint fixed- and variable-length coding

A transmitted signal is decomposed into two parts which are then encoded using fixed- and variable-length coding, respectively. Compared to conventional variable-length codewords with synchronisation-symbols or fixed-length coding strategies, the proposed method enjoys a better distortion-rate performance on particular channels.


Robust Priority Assignments for Extending Existing Controller Area Network Applications
Schmidt, Klaus Verner (Institute of Electrical and Electronics Engineers (IEEE), 2014-02-01)
The usage of the controller area network (CAN) as an in-vehicle communication bus requires finding feasible and robust priority orders such that each message transmitted on the bus meets its specified deadline and tolerates potential transmission errors. Although such priority orders can be determined by available algorithms whenever they exist, it is always assumed that a CAN priority order is computed from scratch. In practical applications, it is frequently necessary to extend an existing message set by ...
Synchronization of linear oscillators coupled through a dynamic network with interior nodes
Tuna, Sezai Emre (Elsevier BV, 2020-07-01)
Synchronization is studied in an array of identical linear oscillators of arbitrary order, coupled through a dynamic network comprising dissipative connectors (e.g., dampers) and restorative connectors (e.g., springs). The coupling network is allowed to contain interior nodes, i.e., those that are not directly connected to an oscillator. It is shown that the oscillators asymptotically synchronize if and only if the Schur complement (with respect to the boundary nodes) of the complex-valued Laplacian matrix ...
Analysis of the performance of network coding using the sampling property of Q-function Ǎg Kodlama için q-fonksiyonun örnek alma özellǐginden yararlanarak başarim analizi
Aktaş, Tǔgcan; Yılmaz, Ali Özgür; Aktaş, Emre (2013-08-05)
In the area of cooperative and network coded communication that naturally arises from cooperation, which become increasingly important in wireless communications, the expected end-to-end bit error rate (BER) values are frequently required to compare the proposed coding, relaying, and decoding techniques. Instead of obtaining these values through time consuming Monte Carlo simulations, deriving the closed form expressions via approximations is also crucial. In this work, we make use of the sampling property ...
Synchronization under matrix-weighted Laplacian
Tuna, Sezai Emre (Elsevier BV, 2016-11-01)
Synchronization in a group of linear time-invariant systems is studied where the coupling between each pair of systems is characterized by a different output matrix. Simple methods are proposed to generate a (separate) linear coupling gain for each pair of systems, which ensures that all the solutions converge to a common trajectory.
Cooperative Multiple-Access in Fading Relay Channels
Yılmaz, Ayşen (2006-06-15)
Virtual antenna arrays can be constructed via relaying even in the case that there is insufficient physical space or other resources for multiple antennae on wireless nodes. When there is a multiple access scenario, relaying offers a variety of ways to establish communication between source and destination nodes. We will compare a scheme based on space division multiple access to previously studied time division based ones. We observe that space division improves especially the ergodic capacity.
Citation Formats
A. A. Alatan, “Robust signal compression using joint fixed- and variable-length coding,” 2000, Accessed: 00, 2020. [Online]. Available: