Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

Joint iterative decoding and estimation for side-informed data hiding

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Balado, F. ; Dept. of Comput. Sci., Univ. Coll. Dublin, Ireland ; Whelan, K.M. ; Silvestre, G.C.M. ; Hurley, N.J.

We present a previously unavailable study on a general procedure for joint iterative decoding and estimation of attack parameters in side-informed data hiding. This type of approach, which exploits iteratively decodable codes for channel identification purposes, has recently become a relevant research trend in many digital communications problems. An advantage is that estimation pilots are not strictly required, thus affording in principle the implementation of blind methods that are able to work close to the theoretically maximum achievable rate. Such a target naturally requires the use of both near-optimum side-informed data hiding methods (e.g., DC-DM) and near-optimum iteratively decodable channel codes (e.g., turbo codes). The attack channels considered in this study are additive independent random noise, amplitude scaling, and a particular case of fine desynchronization of the sampling grid, whose parameters are estimated by maximum likelihood at the decoder. The complexity of this task is tackled by means of the Expectation-Maximization (EM) algorithm, relying on the use of a priori probabilities produced by the iterative decoding process.

Published in:

Signal Processing, IEEE Transactions on  (Volume:53 ,  Issue: 10 )