Skip to main navigation Skip to search Skip to main content

Comparative analysis of CTCSS decoding algorithms

  • Xiaowei Liu*
  • , Yi Zhao
  • , Feihao Song
  • *Corresponding author for this work
  • Harbin Institute of Technology Shenzhen
  • Neolink Communication Technology Co. Ltd.

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Three typical algorithms, which are the radix-2 Fast Fourier Transformation (FFT) Algorithm, improved Discrete Fourier Transformation (DFT) algorithm, and Goertzel algorithm, are employed to decode the sub-audio signal of CTCSS. The practical consideration of implementation of the three algorithms with reasonable modification is discussed in this paper. We illustrate the decoding performance of these three approaches with experimental simulation. Finally, we summarize their technical specifications and highlight their respective advantages for the practical application.

Original languageEnglish
Title of host publicationProceedings - 2010 3rd International Congress on Image and Signal Processing, CISP 2010
Pages3268-3271
Number of pages4
DOIs
StatePublished - 2010
Externally publishedYes
Event2010 3rd International Congress on Image and Signal Processing, CISP 2010 - Yantai, China
Duration: 16 Oct 201018 Oct 2010

Publication series

NameProceedings - 2010 3rd International Congress on Image and Signal Processing, CISP 2010
Volume7

Conference

Conference2010 3rd International Congress on Image and Signal Processing, CISP 2010
Country/TerritoryChina
CityYantai
Period16/10/1018/10/10

Keywords

  • Decoding algorithm
  • Fast fourier transformation
  • Sub-audio

Fingerprint

Dive into the research topics of 'Comparative analysis of CTCSS decoding algorithms'. Together they form a unique fingerprint.

Cite this