Abstract: Data segments derived from stored oligonucleotides or oligos are decoded, each oligo comprising nucleotides representing information units distributed within segment addresses and payloads, the addresses enabling to order the payloads. The addresses are extracted and the payloads are ordered in function of those addresses. The segments are further clustered into segment clusters in function of edit distances between reference addresses and the extracted addresses, each of those clusters being associated with one of the reference addresses. Cluster payloads associated respectively with at least part of the clusters are determined, and those cluster payloads are ordered in function of the reference addresses of the clusters associated with the cluster payloads.

Abstract: In one embodiment of the disclosure, it is proposed a method for encoding of at least one picture, said at least one picture being decomposed into a set of blocks. Such method comprises an encoding of at least one block of said set of blocks using intra prediction, and said at least one block comprises pixel values corresponding to either the luma component (L) or chroma components (Cb or Cr). The encoding of said at least one block comprises: obtaining (1301) a set of local minimum and local maximum pixel values within said at least one block; encoding (1302) at least one position information of said pixels corresponding to local minima and local maxima within said at least one block; encoding (1303) pixel values of said set of local minimum and local maximum pixel values.

Abstract: In one embodiment, it is proposed a method for storing input data on a set of DNA strands, said input data being represented in a numeral system. This method is remarkable in that it comprises: formatting said input data into a set of blocks of data, each block of data having a size inferior to a size of one DNA strand; applying a first encoding with an erasure code on said set of blocks of data, defining a first set of modified blocks of data, each modified block of data having a size inferior to a size of one DNA strand; applying a second encoding using an error correcting code on each modified block of data of said first set, defining a second set of modified blocks of data, each modified block having a size inferior to a size of one DNA strand; encoding each modified block of data of said second set into a nucleotides block sequence; generating a set of DNA strands, each DNA strand comprising a nucleotides block sequence obtained through said encoding.

Abstract: A code is generated for mapping source to target code words which allows encoding source data at reduced probability of incorrect decoding, e.g. for DNA storage. The target code words are grouped into subsets and comprise identifying and remaining portions. The identifying portions of target code words corresponding to a same subset are identical. A first code symbol set of source code words is selected for addressing the subsets. For the subsets, neighboring subsets are determined. The identifying portions of the target code words of neighboring subsets differ from those of the corresponding subset by up to a predetermined amount of symbols. Source code words are assigned where the corresponding first code symbols address the same subset to said subset such that an amount of target code words of said subset having their remaining portions identical to their neighboring subsets corresponds to an optimization criterion.

Abstract: A code book is generated for mapping source to target code words which allows encoding source data at reduced probability of incorrect decoding, e.g. for DNA storage. The target code words are grouped (102) into subsets and comprise identifying and remaining portions. The identifying portions of target code words corresponding to a same subset are identical. A first code symbol set of source code words is selected (103) for addressing the subsets. For the subsets, neighboring subsets are determined (104). The identifying portions of the target code words of neighboring subsets differ from those of the corresponding subset by up to a predetermined amount of symbols. Source code words are assigned (105) where the corresponding first code symbols address the same subset to said subset such that an amount of target code words of said subset having their remaining portions identical to their neighboring subsets corresponds to an optimization criterion.

Abstract: A method (100) and an apparatus (200) for encoding information in codeword sequences are described which help avoid synthesizing reverse complementary nucleotide sequences, making them suitable for synthesizing nucleic acid strands. Multiple codes are provided (102), consisting of a same amount of corresponding code words. No word belongs to more than one code. Each code could completely encode all information units which are encoded using code word sequences generated from the codes. Generating (105) a sequence comprises: selecting (106), from code words of a code, a next code word to be appended to the sequence; appending (108) the next code word if a concatenation of the sequence and the next code word does not contain a reverse complementary of any code symbol sequence that at least partly contains the next code word; and otherwise (109) selecting a corresponding next code word from a different code and repeating the appending.

Abstract: A method and an apparatus for prioritizing a metadata item associated to audio or video data are described. A metadata item is retrieved from a metadata repository or via an input. An analyzing unit determines a priority value of the metadata item using one of a plurality of prioritization methods. A storing unit then stores the priority value in a priority table and references the priority table in a metadata table.

Abstract: In one embodiment, it is proposed a method for storing input data on a set of DNA strands, said input data being represented in a numeral system. This method is remarkable in that it comprises: formatting said input data into a set of blocks of data, each block of data having a size inferior to a size of one DNA strand; applying a first encoding with an erasure code on said set of blocks of data, defining a first set of modified blocks of data, each modified block of data having a size inferior to a size of one DNA strand; applying a second encoding using an error correcting code on each modified block of data of said first set, defining a second set of modified blocks of data, each modified block having a size inferior to a size of one DNA strand; encoding each modified block of data of said second set into a nucleotides block sequence; generating a set of DNA strands, each DNA strand comprising a nucleotides block sequence obtained through said encoding.

Abstract: A method (100) and an apparatus (200) for encoding information in codeword sequences are described which help avoid synthesizing reverse complementary nucleotide sequences, making them suitable for synthesizing nucleic acid strands. Multiple codes are provided (102), consisting of a same amount of corresponding code words. No word belongs to more than one code. Each code could completely encode all information units which are encoded using code word sequences generated from the codes. Generating (105) a sequence comprises: selecting (106), from code words of a code, a next code word to be appended to the sequence; appending (108) the next code word if a concatenation of the sequence and the next code word does not contain a reverse complementary of any code symbol sequence that at least partly contains the next code word; and otherwise (109) selecting a corresponding next code word from a different code and repeating the appending.

Abstract: Code word sequences obtained from data transmission/storage channels, e.g. nucleic acid storage systems, encounter code symbol insertion and deletion errors. A data processing device recovers valid code words from corrupted code word sequences. The valid code words belong to at least one code book of channel modulated code words of identical length. A code word sequence is obtained, presumed code word boundaries for the sequence are determined depending on the identical length, code words corresponding with the boundaries are compared with the code book to identify valid code words, and a section of the sequence is identified as not containing a valid code word. Then shifted code word boundaries are determined for the section assuming at least one insertion or deletion error, and code words corresponding with the shifted boundaries are compared with the code book to identify recovered valid code words.

Abstract: The invention relates to an apparatus and method for detecting a symbol from a set of readout values from a local neighborhood of a two-dimensional storage medium, comprising: evaluating a joint probability distribution for a given observation and a complete set of data patterns in the local neighborhood; and choosing as detection output a weighted average of the center values of the data patterns, using the values of the associated joint probability distribution as weights; wherein the joint probability distribution is a multi variant Gaussian probability distribution which employs vectorial observations, vectorial averages, and covariance matrixes.

Abstract: A method and an apparatus for encoding data as a two-dimensional array of pixels, as well as a method and an apparatus for decoding such data are described. Data bits for encoding are received via an input. An encoder determines blocks of pixels corresponding to the received data bits from an alphabet of allowed blocks of pixels. Each allowed block of pixels represents two or more data bits. Values of the pixels within each block of pixels in said alphabet are selected from three or more allowed values and increase continuously from a lowest value of a first pixel to a highest value of a last pixel when considering the pixels along a spiral or represent a plane having an orientation and an inclination. The blocks of pixels determined for the data bits are combined into a two-dimensional array of pixels. For decoding a pixel analyzer determines properties of pixel values of each retrieved block of pixels.

Abstract: A method and an apparatus for archiving an image on a photographic medium are described. The image consists of an array of pixels, where a color depth of the pixels is n bits. In addition to recording the array of pixels on the photographic medium also a subset of the n bits describing the color of the pixel is recorded on the photographic medium for each pixel.

Abstract: A method and an apparatus for prioritizing a metadata item associated to audio or video data are described. A metadata item is retrieved from a metadata repository or via an input. An analyzing unit determines a priority value of the metadata item using one of a plurality of prioritization methods. A storing unit then stores the priority value in a priority table and references the priority table in a metadata table.

Abstract: The invention is related to the generation of an image data stream and the reconstruction of an image from an image data stream. The method for generating an image data stream comprises the steps of (a) assigning search regions in a reference image to source macro blocks of a current image; (b) determining in the search regions best matches and corresponding residuals and (c) encoding the determined residuals in a data stream. A further feature of the method is related to the fact that the processing order in at least one of the steps (b) and (c) depends on positions of the assigned search regions in the reference image. The variation in the processing order allows for more efficient determination of best matches at encoder side and/or reduced processing requirements at decoder side.

Abstract: Advanced Video Coding uses intra prediction for 4*4 pixel blocks whereby reconstructed samples from adjacent pixel blocks are used to predict a current block. Nine different intra prediction modes are available in AVC. In order to save bits for signalling the prediction modes, a flag and a 3-bit parameter are used. If this flag is set the most probable prediction mode, which is calculated from previous predictions, is used by the encoder and the decoder to reconstruct the actual prediction mode. If the flag is cleared, the 3-bit parameter is sent to select the prediction mode independently. According to the invention, the flag is applied more frequently, based on a prediction error threshold, instead of applying the optimum prediction mode for a current pixel block.

Abstract: Specialized image processing circuitry is usually implemented in hardware in a massively parallel way as a single instruction multiple data (SIMD) architecture. The invention prevents long and complicated connection paths between a processing element and the memory subsystem, and improves maximum operating frequency. An optimized architecture for image processing has processing elements that are arranged in a two-dimensional structure, and each processing element has a local storage containing a plurality of reference pixels that are not neighbors in the reference image. Instead, the reference pixels belong to different blocks of the reference image, which may vary for different encoding schemes.

Abstract: Method for isochronous data packet transport over a wireless network, comprising the steps of: collecting a plurality of isochronous data packets at a service specific convergence sub-layer of a wireless source device; posting said plurality of isochronous data packets as a whole to a common part convergence sub-layer of the wireless source device, wherein said plurality of isochronous data packets posted to the common part convergence sub-layer corresponds to the amount of isochronous data packets generated by a transmitter over a 2 ms period.

Abstract: During the transmission of data packets received on a wired connection via a first interface via a second interface designed for the wireless transmission of data, the problem exists that between receiving the data and transmitting the data via the second interface a relatively large delay time can arise which must be bridged by means of a suitably dimensioned buffer memory. To enable the maximum delay time to be further reduced, the necessary processing of the received IEEE 1394 bus packets is already performed section by section immediately after a received data packet has arrived. After the complete number of bus packets falling within a transmission frame has been received, there is therefore no longer any lengthy processing time required and the probability of missing the time slots reserved in the next transmission frame is significantly reduced. The buffer memory for bridging the delay time period can therefore be correspondingly smaller.

Abstract: A bit clock recovery apparatus for digital storage readout employing sync frames, where an oversampled readout signal is stored in memory, sync patterns are located in the signal using DSP means, distances of consecutive sync pattern locations are calculated, and bit clock is recovered from these distances and the knowledge about the data framing structure.