Thomson Licensing

Thomson Licensing S.a.

Thomas Licensing

Klaus Gaedke

Siegfried Schweidler

Malte Borsum

Gilles Straub

Meinolf Blawat

Sébastien Perrot

Ingo Huetter

Timothy Heighway

Axel Kochale

Thomas Brune

Friedrich Timmermann

Dieter Haupt

Herbert Schütze

Peter Jax

Sebastien Lasserre

Guillaume Bichot

Hui Li

Stefan Kubsch

Nicolas Le Scouarnec

Christophe Diot

Jean C Bolot

Michael Weber

Xiaoming Chen

Michael Drexler

Oliver Theis

Marten Kabutz

Christophe Vincent

Nicolas Burdin

Helmut Burklin

Jens Peter Wittenburg

Martin May

Marco Georgi

Brian Charles Eriksson

Xiao-Ming Chen

Ralf-Detlef Schaefer

Mark Crovella

Herbert Sch&uuml;tze

Meinolf Bilawat

Arend Streit

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.

Methods for storing and reading digital data on a set of DNA strands

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 () 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.

Code generation method, code generating apparatus and computer readable storage medium

A method () and an apparatus () 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 (), 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 () a sequence comprises: selecting (), from code words of a code, a next code word to be appended to the sequence; appending () 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 () selecting a corresponding next code word from a different code and repeating the appending.

Method and apparatus for encoding information units in code word sequences avoiding reverse complementarity

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.

Method and apparatus for prioritizing metadata

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.

Method and apparatus for archiving an image

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.

Method and device for generating an image data stream, method and device for reconstructing a current image from an image data stream, image data stream and storage medium carrying an image data stream

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.

Method and apparatus for generating/evaluating in a picture signal encoding/decoding one or more prediction information items

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. Each processing element has a plurality of local first registers for holding the reference image data: one of the first registers holds reference input data of a first search block, and some of the remaining first registers holding reference input data of further search blocks that have specified positions relative to the first search block.

Array of processing elements with local registers

Method for isochronous data packet transport over a wireless network, comprising the steps of:

Method for isochronous data transport over a wireless network

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.

Method for processing data packets received via a first interface and device for carrying out the method

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.

DSP-based data recovery

Method for reserving isochronous resources in a wireless network comprising at least a wireless source device and a wireless sink device, said wireless network being based on a TDMA frame transmission scheme, said method comprising the steps of:

Method for reserving isochronous resources in a wireless network

A wireless extension of the IEEE 1394 bus where two clusters of 1394 devices are linked by a wireless bridge. The device clusters communicate without being bridge-aware. The wireless bridge provides for a bus reset isolation. The wireless extension including a buffer memory for storing self-identification packets in the 1394 interfaces of both boxes of the wireless bridge. With these buffer memories the self-identification packets of the bus stations in the other cluster can be collected and they can be read out during the self-configuration phase of the network after a bus reset when the bus grant is assigned to the box of the wireless bridge that is also connected to the bus where the bus reset has occurred. The physical layer block of the 1394 interface transmits artificial self-identification packets for all bus stations of the other cluster.

Interface circuit connecting a device with a bridge portal function to a communication bus

Method for connecting an IEEE1394 remote device to a cluster of IEEE1394 devices through a wireless link comprising a first wireless device connected to the cluster and a second wireless device connected to the remote device, wherein the remote device and the first wireless device for a first wired bus and the device cluster and the second wireless device form a second wired bus. The method comprises the steps of, representing the remote device on the cluster through the first wireless device and representing the devices of the cluster to the remote device through the second wireless device, such that the remote device and the devices of the cluster function as if these devices were part of a single IEEE1394 bus.

Method for connecting an IEEE1394 remote device to a cluster of IEEE1394 devices through a wireless link

So-called LCH packets are defined in the Hiperlan Type 2 System for wire-free transmission of video and audio data streams. These LCH packets have a length of 54 data bytes. Furthermore, the Hiperlan/2 Standard provides for so-called ARQ messages to be sent back to the transmitter in an SCH packet in a QOS mode (Quality Of Service), in which all the LCH data packets must be confirmed by the receiver. Space for the LCH and SCH data packets must be provided in a buffer store in the Hiperlan/2 interface for each connection that is set up. When there is a possibility of several hundred connections having been set up, separate reservation of memory areas for LCH and SCH packets would involve considerable complexity for the memory organization. The invention proposes that only one common area be reserved for LCH and SCH packets in the buffer store. The section which is provided for each LCH package is of such a size that it corresponds to a value 2where n&#x3b5;[0, 1, 2, 3, . . . ], and this results in the hardware unit for the address calculation of these data section starts being greatly simplified. However, the area is chosen to be larger than actually required for the buffer storage of one LCH packet. The SCH packets, which likewise need to be buffer-stored, are entered in the unused part of such a section for an LCH packet. This considerably reduces the complexity for memory organization without having to leave a major proportion of the memory unused.

Growing community of inventors

Hannover, Germany

Klaus Gaedke