Image transmission over the polya channel via channel-optimized quantization

Behnamfar, F.; Alajaji, Fady; Linder, Tamás

doi:10.1109/tsp.2004.840713

Cited by 6 publications

(5 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…REMARK 1. CHANNEL-CORRELATION 9 & CORRELA-TION AMONG THE CHANNEL/SOURCE-CODEBOOKS [32], [33], [34], [35]. (i) About the channel-correlation e.g.…”

Section: Notation Definition Notation Definitionmentioning

confidence: 99%

“…in multi-input multi-output control-networked-systems, we emphatically express that, generally speaking, this clearly momentous issue is considered in the context of parameteruncertainties − for which the second algorithm is proposed. In other words, for the case of channel-correlation, a Z−channel as a binary asymmetric channel is widely used [32] for which the sources and the received vectors are classified into two groups. Consequently, it is required to find two classes of PMFs over which the effect of the correlation appears.…”

Section: Notation Definition Notation Definitionmentioning

confidence: 99%

See 1 more Smart Citation

A Novelty in Blahut-Arimoto Type Algorithms: Optimal Control Over Noisy Communication Channels

Zamanipour

2020

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

A probability-theoretic problem under information constraints for the concept of optimal control over a noisymemoryless channel is considered. For our Observer-Controller block, i.e., the lossy joint-source-channel-coding (JSCC) scheme, after providing the relative mathematical expressions, we propose a Blahut-Arimoto-type algorithm − which is, to the best of our knowledge, for the first time. The algorithm efficiently finds the probability-mass-functions (PMFs) required for min. This problem is an N P−hard and non-convex multi-objective optimisation (MOO) one, were the objective functions are respectively the distortion function dim Null I( Ŝ; S → ∞ and the memorylesschannel capacity dim Null I(X; X → 0. Our novel algorithm applies an Alternating optimisation method. Subsequently, a robust version of the algorithm is discussed with regard to the perturbed PMFs − parameter uncertainties in general.The aforementioned robustness is actualised by exploiting the simultaneous-perturbation-stochastic-approximation (SPSA). The principles of detectability-and-stabilisability as well as synchronisability are explored, in addition to providing the simulationsby which the efficiency of our work is shown. We also calculate the total complexity of our proposed algorithms respectively as O T K M 0 K log K and O T K M 0 K log K + 0.33K . Our methodology is generic which can be applied to other fields of studies which are optimisation-driven.

show abstract

“…REMARK 1. CHANNEL-CORRELATION 9 & CORRELA-TION AMONG THE CHANNEL/SOURCE-CODEBOOKS [32], [33], [34], [35]. (i) About the channel-correlation e.g.…”

Section: Notation Definition Notation Definitionmentioning

confidence: 99%

Section: Notation Definition Notation Definitionmentioning

confidence: 99%

A Novelty in Blahut-Arimoto Type Algorithms: Optimal Control Over Noisy Communication Channels

Zamanipour

2020

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

show abstract

“…REMARK 1. CHANNEL-CORRELATION 9 & CORRELA-TION AMONG THE CHANNEL/SOURCE-CODEBOOKS [32], [33], [34], [35]. (i) About the channel-correlation e.g.…”

Section: Notation Definition Notation Definitionmentioning

confidence: 99%

A Novelty in Blahut-Arimoto T ype Algorithms: Optimal Control over Noisy Commu nication Channels

Zamanipour¹

2020

Preprint

View full text Add to dashboard Cite

A probability-theoretic problem under information constraints for the concept of optimal control over a noisy-memoryless channel is considered. For our \textit{Observer-Controller} block, i.e., the lossy joint-source-channel-coding (JSCC) scheme, after providing the relative mathematical expressions, we propose a \textit{Blahut-Arimoto}-type algorithm $-$ which is, to the best of our knowledge, for the first time. The algorithm efficiently finds the probability-mass-functions (PMFs) required for .......................................

show abstract

“…Z(•; θ) is the partition-function or Boltzmann (Gibbs) distribution. [32], [33], [34], [35]. (i) About the channel-correlation e.g.…”

Section: General Notation and Preliminariesmentioning

confidence: 99%

A Novelty in Blahut-Arimoto T ype Algorithms: Optimal Control over Noisy Commu nication Channels

Zamanipour¹

2020

Preprint

View full text Add to dashboard Cite

show abstract

Image transmission over the polya channel via channel-optimized quantization

Cited by 6 publications

References 32 publications

A Novelty in Blahut-Arimoto Type Algorithms: Optimal Control Over Noisy Communication Channels

A Novelty in Blahut-Arimoto Type Algorithms: Optimal Control Over Noisy Communication Channels

A Novelty in Blahut-Arimoto T ype Algorithms: Optimal Control over Noisy Commu nication Channels

A Novelty in Blahut-Arimoto T ype Algorithms: Optimal Control over Noisy Commu nication Channels

Contact Info

Product

Resources

About