SwePub
Sök i LIBRIS databas

  Utökad sökning

id:"swepub:oai:research.chalmers.se:fb247c15-a048-4877-adaf-bbe322df28df"
 

Sökning: id:"swepub:oai:research.chalmers.se:fb247c15-a048-4877-adaf-bbe322df28df" > Concatenated Codes ...

Concatenated Codes for Multiple Reads of a DNA Sequence

Maarouf, Issam (författare)
Simula UiB
Lenz, Andreas (författare)
Technische Universität München (TUM),Technical University of Munich (TUM)
Welter, Lorenz (författare)
Technische Universität München (TUM),Technical University of Munich (TUM)
visa fler...
Wachter-Zeh, Antonia (författare)
Technische Universität München (TUM),Technical University of Munich (TUM)
Rosnes, Eirik (författare)
Simula UiB
Graell I Amat, Alexandre, 1976 (författare)
Chalmers tekniska högskola,Chalmers University of Technology,Simula UiB
visa färre...
 (creator_code:org_t)
2023
2023
Engelska.
Ingår i: IEEE Transactions on Information Theory. - 0018-9448 .- 1557-9654. ; 69:2, s. 910-927
  • Tidskriftsartikel (refereegranskat)
Abstract Ämnesord
Stäng  
  • Decoding sequences that stem from multiple transmissions of a codeword over an insertion, deletion, and substitution channel is a critical component of efficient deoxyribonucleic acid (DNA) data storage systems. In this paper, we consider a concatenated coding scheme with an outer nonbinary low-density parity-check code or a polar code and either an inner convolutional code or a time-varying block code. We propose two novel decoding algorithms for inference from multiple received sequences, both combining the inner code and channel to a joint hidden Markov model to infer symbolwise a posteriori probabilities (APPs). The first decoder computes the exact APPs by jointly decoding the received sequences, whereas the second decoder approximates the APPs by combining the results of separately decoded received sequences and has a complexity that is linear with the number of sequences. Using the proposed algorithms, we evaluate the performance of decoding multiple received sequences by means of achievable information rates and Monte-Carlo simulations. We show significant performance gains compared to a single received sequence. In addition, we succeed in improving the performance of the aforementioned coding scheme by optimizing both the inner and outer codes.

Ämnesord

TEKNIK OCH TEKNOLOGIER  -- Elektroteknik och elektronik -- Telekommunikation (hsv//swe)
ENGINEERING AND TECHNOLOGY  -- Electrical Engineering, Electronic Engineering, Information Engineering -- Telecommunications (hsv//eng)
TEKNIK OCH TEKNOLOGIER  -- Elektroteknik och elektronik -- Kommunikationssystem (hsv//swe)
ENGINEERING AND TECHNOLOGY  -- Electrical Engineering, Electronic Engineering, Information Engineering -- Communication Systems (hsv//eng)
TEKNIK OCH TEKNOLOGIER  -- Elektroteknik och elektronik -- Signalbehandling (hsv//swe)
ENGINEERING AND TECHNOLOGY  -- Electrical Engineering, Electronic Engineering, Information Engineering -- Signal Processing (hsv//eng)

Nyckelord

concatenated codes
DNA storage
polar code
low-density parity-check (LDPC) code
Achievable information rates
synchronization codes
insertion/deletion/substitution (IDS) channel

Publikations- och innehållstyp

art (ämneskategori)
ref (ämneskategori)

Hitta via bibliotek

Till lärosätets databas

Sök utanför SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy