Parallel processing of encoded bit strings

DOI10.1016/0031-3203(88)90029-5MaRDI QIDQ1114407zbMATH OpenOpenAlexFDO

Authors Angela Y. Wu, Azriel Rosenfeld

Publication date 1988

Published in Pattern Recognition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0031-3203(88)90029-5

zbMATH Keywords

binary image processingbit stringsparallel processingrun length code

Mathematics Subject Classification ID

Theory of operating systems (68N25) Searching and sorting (68P10)

Review text

Many operations on strings of length n can be speeded up by a factor of p using p processors. String operations can also be speeded up, even when a single processor is used, by compactly encoding the strings, e.g., using run length code. This paper shows how to combine these two approaches by using p processors to process compactly encoded strings.

Recommendations

• Parallel algorithms for encoding and decoding Blob code
• ARITHMETIC CODING IN PARALLEL
• scientific article; zbMATH DE number 4205980
• scientific article; zbMATH DE number 3860373
• Improvements on binary coding using parallel computing
• Parallel coding of binary images
• scientific article; zbMATH DE number 975424
• Parallel comparison of run-length-encoded strings on a linear systolic array
• Computing the Burrows-Wheeler transform of a string and its reverse in parallel

Cites work

• Fast Pattern Matching in Strings
• scientific article; zbMATH DE number 3900666 (Why is no real title available?)

Cited in

(3)

• High performance word level sequential and parallel coding methods and architectures for bit plane coding
• Data-parallel string-manipulating programs
• scientific article; zbMATH DE number 3860373 (Why is no real title available?)

This page was built for publication: Parallel processing of encoded bit strings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1114407)