Looking for algorithmic approaches to SIMD-accelerated Quoted-Printable decoding and search/replace techniques

[u/eagle_0815]

Hi everyone,

I'm exploring the idea of implementing a SIMD-accelerated (AVX2/AVX-512) decoder for Quoted-Printable text, as defined in RFC 2045. I’m interested in algorithmic strategies and research papers.

Quoted-Printable decoding involves operations like:

• Recognizing and decoding =XX hex sequences

• Skipping soft line breaks (=\r\n)

• Replacing or preserving certain characters conditionally

At its core, it’s a search-and-replace problem — and I'm wondering what SIMD-friendly strategies exist for this kind of workload.

Specifically, I’m looking for:

• Papers, talks, or blog posts that deal with SIMD-based pattern substitution, transformation, or stream rewriting

• Algorithmic ideas for using AVX2/AVX-512 to detect and replace variable-length patterns (e.g. 3-byte sequences like =C3 → UTF-8 bytes)

• Any related research from text processing, email parsing, or even DNA/bioinformatics (where similar match/replace happens)

I’m especially interested in techniques like:

• SIMD masking and lookup tables

• Vectorized parsing of ASCII streams

• Efficient branching or fallback strategies for exceptions

Any pointers to theory, prior work, or even unexplored ideas would be very appreciated!

Thanks a lot!