Open Access. Powered by Scholars. Published by Universities.®

Social and Behavioral Sciences Commons

Open Access. Powered by Scholars. Published by Universities.®

Technological University Dublin

Articles

Communication

Chirp Coding

Publication Year

Articles 1 - 2 of 2

Full-Text Articles in Social and Behavioral Sciences

Audio Data Verification And Authentication Using Frequency Modulation Based Watermarking, Jonathan Blackledge, Omar Farooq Jan 2008

Audio Data Verification And Authentication Using Frequency Modulation Based Watermarking, Jonathan Blackledge, Omar Farooq

Articles

An approach to watermarking digital signals using frequency modulation - ‘Chirp Coding’ - is considered. The principles underlying this approach are based on the use of a matched filter to reconstruct a ‘chirp stream’ code that is uniquely robust. The method is generic in the sense that it can, in principle, be used for a variety of different signal (the authentication of speech and biomedical signals, for example). Further, by generating a bit stream that is signal dependent, chirp coding provides a method of self-authentication, which has a wide range of applications including copyright protection and digital rights management. However, …


Digital Watermarking And Self-Authentication Using Chirp Coding, Jonathan Blackledge Jan 2007

Digital Watermarking And Self-Authentication Using Chirp Coding, Jonathan Blackledge

Articles

This paper discusses a new approach to ‘watermarking’ digital signals using linear frequency modulated or ‘chirp’ coding. The principles underlying this approach are based on the use of a matched filter to provide a reconstruction of a chirped code that is uniquely robust, i.e. in the case of very low signal-to-noise ratios.

Chirp coding for authenticating data is generic in the sense that it can be used for a range of data types and applications (the authentication of speech and audio signals, for example). The theoretical and computational aspects of the matched filter and the properties of a chirp are …