Re-synchronization of permutation codes with Viterbi-like decoding

Ling Cheng, Theo G. Swart, Hendrik C. Ferreira

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

7 Citations (Scopus)

Abstract

In this paper, we present a fast re-synchronization algorithm for permutation coded sequences. The new algorithm combines the dynamic algorithm and a Viterbi-like decoding algorithm for trellis codes. The new algorithm has a polynomial time complexity O(N), where N denotes the length of the sequence. A possible application to M-ary FSK for the CENELEC A band power-line communications (PLC) is considered.

Original languageEnglish
Title of host publication2009 IEEE International Symposium on Power Line Communications and its Applications, ISPLC 2009
Pages36-40
Number of pages5
DOIs
Publication statusPublished - 2009
Event2009 IEEE International Symposium on Power Line Communications and its Applications, ISPLC 2009 - Dresden, Germany
Duration: 29 Mar 20091 Apr 2009

Publication series

Name2009 IEEE International Symposium on Power Line Communications and its Applications, ISPLC 2009

Conference

Conference2009 IEEE International Symposium on Power Line Communications and its Applications, ISPLC 2009
Country/TerritoryGermany
CityDresden
Period29/03/091/04/09

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Re-synchronization of permutation codes with Viterbi-like decoding'. Together they form a unique fingerprint.

Cite this