73results about How to "Speed ​​up the decoding process" patented technology

An optical scanner with plural scan beam generation. Scan angle stress is configured in the beam generation.

An OFDMA communication system includes a plurality of terminals, with at least one of the terminals including at least one type of multi-user decoder adapted to decode a signal intended for the at least one terminal received on a subchannel of the system and adapted to decode at least a portion of an interfering signal received on the subchannel. The system also includes a plurality of base stations. Each of the base stations may be in communication with others of the base stations for exchanging information about data throughput for particular terminals in cells of the system using particular subchannels in the cells. Each of the base stations assigns the subchannels to terminals in the cell of the base station so as to maximize data throughput in the entire system.

A computer implemented method and system for processing a low quality captured image of a barcode of any type having a large amount of data is provided. An image processing application on a computing device acquires the captured image of the barcode, determines the type, for example, format, shape, etc., of the barcode in the acquired image of the barcode, and creates a gray barcode image from the acquired image of the barcode by gray shading over an entirety of the acquired image of the barcode. The image processing application modularizes the created gray barcode image based on the type of the barcode and binarizes the created gray barcode image based on the type of the barcode by comparing an average gray level intensity of each of multiple grids of pixels or by comparing gray level intensities of individual pixels in the created gray barcode image, with a predetermined threshold.

The present invention relates generally to improving readability of machine-readable information, despite signal capture distortion. One claim recites a method including: obtaining input data; altering a digital watermark or a digital watermarking process to pre-distort a digital watermark signal, wherein the altering is intended to counteract or compensate for expected distortion enabling machine-based detection of an embedded, pre-distorted digital watermark signal despite the expected distortion, the expected distortion includes distortion associated with optical capture of the input data and embedding the pre-distorted digital watermark signal in the input data. Another claim recites a method including: obtaining input data, the input data representing imagery captured with at least an optical lens, the input data comprising test data and a machine-readable signal; evaluating characteristics associated with the test data to determine information regarding lens blurring of the input data associated with the optical lens; adjusting the input data to compensate for or to correct the lens blurring based at least in part on the information; analyzing the compensated for or corrected input data to obtain the machine-readable signal. Of course, other methods and combinations are provided as well.

Encoded symbols of a concatenated convolutional-encoded and block encoded signal are presented to a conventional first stage of a concatenated decoder, comprising in sequence a soft metric generator, a Viterbi decoder, a first de-interleaver and a first block decoder such as a Reed-Solomon decoder. The encoded symbols are also presented to a delay chain to produce progressively delayed encoded symbols. Where an output block of the conventional decoder is indicated as being a valid codeword by the first block decoder, the bytes in this block are marked as being correct. These bytes that are known to be correct are then used after interleaving and serialisation as known bits input to a second stage of the decoder process operating on the delayed encoded symbols and incorporating a modified soft metric generator constrained by the known bits. This process can be extended to further iterations as required. A modified Viterbi decoder, which is also constrained by the known bits, may also be used in the second and subsequent iterative stages.

A method and system of reducing the computation load of an MPEG decoder by changing the encoding algorithms in a video-processing system are provided. During an encoding mode, a stream of data blocks is received and at least one motion vector and one motion compensation prediction value for each macro-block are generated. The prediction value is transformed into a set of DCT coefficients. Prior to the quantizing step, the set of DCT coefficients are modified according to predetermined criteria. To this end, the total energy level of the DCT coefficients excluding the lowest 2×2 DCT coefficients is computed, and last column and last row of the DCT coefficients is discarded alternatively until the total energy level of the DCT coefficients reaches a predetermined energy level. Therafter, the discarded column or row is assigned to a predetermined value. The modified DCT coefficients are then quantized and encoded, thereby generating a bit stream of encoded macro-blocks, which are subsequently decoded according to a conventional decoding process.

The invention discloses a method for displaying extra-large-resolution pictures on a television, relates to a multimedia function of a television, and aims to provide a method for displaying extra-large-resolution pictures on a television with a limited memory. The method comprises the following steps: a. setting a maximum available memory threshold M when a picture is browsed according to the memory situation of the television; b, acquiring the format, width and height of a picture from picture information; and c, comparing the pixel per inch of the picture with the pixel per inch of a full screen UI (user interface), if the pixel per inch of the picture is less than or equal to the pixel per inch of the full screen UI, displaying the picture based on a conventional method, and if the pixel per inch of the picture is greater than the pixel per inch of the full screen UI, scaling the picture, and then displaying the picture. The method disclosed by the invention is mainly used for displaying pictures on the television, and ensures that the pictures can be scaled without completely decoding the pictures, thereby effectively saving the times for decoding and scaling the pictures.

Units of forward error correction (FEC) encoded bits each represent a one-bit data value and include correctness bits that together reflect a probability that the one-bit data value represented by the unit is correct. The units of FEC encoded bits are decoded by using the correctness bits to perform soft-decision convolution decoding on the units of FEC bits. Subsequences of units that are prone to erroneous soft-decision convolution decoding are detected by determining, whether the distribution of quality bits indicate the units are below a threshold level of correctness, and by comparing characteristics of that distribution to a given set of characteristics predetermined to be prone to result in incorrect decoding. Among the symbols produced for block decoding, symbols that correspond to units that were in detected subsequences are flagged or tagged for erasure during subsequent soft-decision block decoding.

A method and device for decoding a sequence of physical signals. A Viterbi algorithm is carried out a first time for all physical signals, resulting in a maximum likelihood path, wherein there is one signal value for each physical signal and which has been determined along the entire trellis according to the Viterbi algorithm. A reliability value is determined for each signal value of the maximum likelihood path. The Viterbi algorithm is then carried out a second time with the following steps: selecting one subregion of the trellis, the subregion having a partial initial signal value and a partial end signal value on the maximum likelihood path; determining one further path in that subregion of the trellis which ends at the partial end signal value of the maximum likelihood path; determining each signal value on the further path and comparing same with the corresponding signal value on the maximum likelihood path relating to the same time; depending on the comparison result, the signal value of the maximum likelihood path is allocated the reliability value determined in the previous iteration step or the minimum of this and the reliability value of the partial end signal value; shifting the subregion of the trellis by at least one time unit; and using, storing and / or outputting the determined signal values and selected reliability values associated with the signal values as the decoded sequence.

Aspects of a method and system for an improved cellular interference cancelling diversity receiver are described. Aspects of the system may include one or more circuits that enable reception of a plurality of individual path signals associated with a multipath cluster for each of a plurality of mobile terminals. The one or more circuits may enable selection of at least a portion of the plurality of individual path signals for at least one of the plurality of mobile terminals. The one or more circuits may also enable generation of one or more intermediate decoded bit sequences based on the selection. At least one decoded output bit sequence may be generated by a frame process based on the one or more intermediate decoded bit sequences and / or a combined version of the selected at least a portion of the plurality of individual path signals.

A multi-stage decoder decodes a block of symbols, received via a noisy channel, to a codeword. The decoder includes multiple sub-decoders connected sequentially, and wherein a next sub-decoder has a slower processing time and better word error rate than a previous sub-decoder, and wherein the next sub-decoder is only executed if the previous decoder fails to decode the block sequence of symbols, and a last sub-decoder is executed until a termination condition is reached.

An OFDMA communication system includes a plurality of terminals, with at least one of the terminals including at least one type of multi-user decoder adapted to decode a signal intended for the at least one terminal received on a subchannel of the system and adapted to decode at least a portion of an interfering signal received on the subchannel. The system also includes a plurality of base stations. Each of the base stations may be in communication with others of the base stations for exchanging information about data throughput for particular terminals in cells of the system using particular subchannels in the cells. Each of the base stations assigns the subchannels to terminals in the cell of the base station so as to maximize data throughput in the entire system.

A computer-implemented method for correcting transmission errors. According to the method, a transmitted vector corrupted by error can be recovered solving a linear program. The method has applications in the transmission of Internet media, Internet telephony, and speech transmission. In addition, error correction is embedded as a key building block in numerous algorithms, and data-structures, where corruption is possible; corruption of digital data stored on a hard-drive, CD, DVD or similar media is a good example. In short, progress in error correction has potential to impact several storage and communication systems.

The invention proposes a character and word hybrid language model-based Chinese speech keyword retrieval method and system. The method comprises the steps of 101), distinguishing non-common words and common words in a training corpus according to part of speech, adding mark information for characters forming the non-common words, and partitioning the original training corpus into a new corpus composed of the common words and symbols marked with non-common words information; building a language model of the words according to the new corpus and re-training a language model by individual characters according to the original training corpus to obtain a language model of the characters; and 102), establishing a primary decoding network and a secondary decoding network, and performing keyword retrieval based on the primary decoding network and the secondary decoding network, wherein the language model of the words determines whether a node marked with the non-common words information is accessed or not during decoding, the node marked with the non-common words information is connected with the secondary decoding network composed of all the individual characters, and the language model of the characters limits a search range after the secondary decoding network is accessed.

Efficient operations in image or video decoding. For example, a tool such as an image or video decoder receives and decodes encoded data for a picture in a bitstream. As part of the decoding, the tool adapts a multi-symbol lookup table to use in decoding of symbols then decodes the symbols using the multi-symbol lookup table, producing exactly correct results. The tool can also perform selectively truncated inverse frequency transforms. For a given block, the tool identifies upper horizontal and vertical frequencies among non-zero coefficients for the block and, based on the upper frequency values, selectively applies a simplified inverse frequency transform to transform coefficients for the block without hurting decoding quality. Using restart markers in the bitstream, the tool can organize multiple blocks of the picture as partitions. The tool decodes at least some of the partitions in parallel on a partition-by-partition basis using multiple processing cores.

Techniques of channel correction and demodulation for orthogonal frequency division multiplexing (OFDM) systems are enhanced so that higher effective data rates and / or lower error rates can be achieved with a minimal processing load. Pilots are adaptively moved and / or removed, and their positions are changed, to enhance the channel estimation, decoding, and demodulation processes at the receiver. Reception is also enhanced by adding, removing, or changing the positions, of information-carrying data bits.

The present disclosure relates generally to managing models representing different expected distortions associated with a plurality of data captures. One claim recites a method comprising: obtaining a plurality of models each representing a different expected distortion associated with a plurality of data captures, the plurality of data captures each resulting in distortion of a machine-readable signal; indexing the plurality of models; upon receiving a request, selecting a model associated with the request; and providing the selected model. Of course, other methods and combinations are provided as well.

A method is proposed for decoding read bits including information bits from memory cells of a solid state drive. The method comprises determining a reliability indication indicative of a reliability of the read bits, and iterating the following sequence of steps:soft decoding the read bits based on said reliability indication in order to obtain said information bits,determining at least one among a time indication indicative of a time elapsed since a last writing of the memory cells and a temperature indication indicative of a temperature of the memory cells, andapplying at least one among said time indication and said temperature indication to said reliability indication.A corresponding solid state drive is also proposed.

The invention discloses an ultra-high-definition video layered coding and decoding method supporting efficient editing. The method comprises the following steps: S11, carrying out image scaling reversible transformation on an original code rate video to separate detail components; S12, coding the component A to generate a basic layer code stream; S13, decoding the basic layer code stream generated in the step S12, and performing subtraction on the basic layer code stream and the component A before coding frame by frame and pixel by pixel to obtain residual data of the component A; S14, carrying out quantization processing on the residual data of the component A in the S13 and the detail components decomposed in the S11, and then carrying out entropy coding; S15, packaging the basic layer code stream generated in the step S12 and the enhancement layer code stream spliced in the step S14 into a mov format file and the like; and S16, decoding, wherein the step comprises a basic layer code stream decoding process, a source picture video decoding process and the like. The method is oriented to ultra-high-definition videos, and the problem that performance is insufficient due to original code rate editing and proxy code rate editing under a common encoding and decoding method is solved.

A method for decoding forward error correction (FEC) encoded data. A stream of units of FEC encoded bits are received, where the units are derived from a transmitted signal, where each unit represents a one-bit data value, and where each unit includes correctness bits. Preferably, the stream of units of FEC encoded bits are decoded by using the quality level of bits to perform soft-decision convolution decoding on the stream of units of FEC bits, where the soft-decision convolution decoding produces, for block decoding, a stream of symbols made up of bits. Subsequences of units that are prone to erroneous soft-decision convolution decoding are detected by determining, for the sub-sequences whether the distribution of quality bits indicate the units are below a threshold level of correctness, and by comparing characteristics of that distribution to a given set of characteristics predetermined to be prone to result in incorrect decoding.

A solid state storage device comprises a non-volatile memory controller configured to store data in a non-volatile memory, wherein the stored data is encoded using a first error-correcting code and a second Low Density Parity Check (LDPC) code. The non-volatile memory controller includes a hard-decision LDPC decoder to decode encoded data received from the non-volatile memory and provide a decoded data output. The hard-decision LDPC decoder selects a voting scheme at each iteration in a sequence of iterations of decoding to determine when to implement bit flipping at a variable node amongst a plurality of check nodes, each of the plurality of check nodes connected to a plurality of variable nodes.

The invention provides a decoding accelerator for variable length codes. The decoding accelerator for the variable length codes comprises a code word distinguishing unit which is configured to judge whether a code word to be decoded in an input code segment is a short code word, and a short code word decoding accelerating unit which is configured to calculate code segment request information for requesting a next input code segment after the code word distinguishing unit determines that the code word to be decoded in the input code segment is the short code word so that the code segment request information is acquired to request the next input code segment before the decoding of the code word to be decoded is finished. The decoding accelerator for the variable length codes can be applied to a decoding device of the variable length codes to increase the decoding speed of the whole decoding device of the variable length codes by accelerating the decoding short code words with higher frequency of occurrences.

Encoded symbols of a concatenated convolutional-encoded and block encoded signal are presented to a conventional first stage of a concatenated decoder, comprising in sequence a soft metric generator, a Viterbi decoder, a first de-interleaver and a first block decoder such as a Reed-Solomon decoder. The encoded symbols are also presented to a delay chain to produce progressively delayed encoded symbols. Where an output block of the conventional decoder is indicated as being a valid codeword by the first block decoder, the bytes in this block are marked as being correct. These bytes that are known to be correct are then used after interleaving and serialization as known bits input to a second stage of the decoder process operating on the delayed encoded symbols and incorporating a modified soft metric generator constrained by the known bits. This process can be extended to further iterations as required. A modified Viterbi decoder, which is also constrained by the known bits, may also be used in the second and subsequent iterative stages.

The invention discloses a method for encoding and decoding videos of a red green and blue (RGB) space. The method comprises the following steps: arranging red component R1, green component G1 and blue component B1 of a video sequence according to an order of R1 G1 B1 with a resolution ratio of M*N; carrying out M*N-M / 2 * N / 2 downsampling to the red component R1 and the blue component B1, and obtaining the red component R1' and the blue component B1' with the resolution ratio of M / 2 * N / 2; carrying out first linear treatment on the red component R1' and the blue component B1' to obtain red component R1'' and blue component B1''; rearranging the video sequence in an RGB color mode in accordance with a G1R1''B1'' sequence; and carrying out video encoding on the rearranged G1R1''B1'' video sequence. In the method, higher encoding of definition is carried out on the green component of a video signal, and lower encoding of definition is carried out on the blue component and the red component, thus slightly reducing the cost of picture encoding quality, acquiring preferable vision encoding effect, and improving decoding and echo speeds of equipment at a decoding terminal. The method is especially suitable for low-end handheld devices.

Aspects of a method and system for an improved cellular diversity receiver are described. Aspects of the system may include circuitry that enables generation of an initially decoded output bit sequence by a first frame process for a received bit sequence for a plurality of received multipath signals. The first frame process may utilize redundancy based decoding, which imposes at least one physical constraint during the decoding, which may be performed by a decoding algorithm.

A method for transmitting, by a terminal, a message destined for a receiver station of a wireless communication system. The message being transmitted on a shared channel on which the transmission of messages is performed at the start of predetermined time intervals, termed slots. Data to be included in the message to be transmitted is encoded. The encoded data is distributed between Nb sub-messages of the message to be transmitted, Nb being an integer number greater than or equal to two. A slot is selected for transmitting the message. Nb transmission frequencies are selected, each respectively associated with the Nb sub-messages of the message. The message is transmitted at the start of the selected slot, by successively transmitting the sub-messages on their respective associated transmission frequencies.

A coding packet adaptive retransmission mechanism combining compensation and foresight comprises the following steps: (1) network coding operation is separately placed in an independent network coding layer, i.e, an NC layer; (2) a sending terminal performs compensation retransmission and foresight retransmission redundancy adjustment by taking the time for receiving ACKs sent by ten receiving terminal NC layers as one adjustment / compensation period, wherein Gap value information is added into the information included in a response packet fed back by receiving terminals, the Gap value is a difference value between First_Byte_Uninvolved and First_Byte_Unseen in the decoding matrix of a decoding terminal NC layer, and the sending terminal performs retransmission of a compensation packet and adjustment of foresight retransmission redundancy R in every compensation / adjustment period according to the Gap value and the change rules of the Gap value. The coding packet adaptive retransmission mechanism combining the compensation and the foresight has the advantages of simple principles, effectively improved data throughput and the like, and can solve problems of coupling of a retransmission sending strategy degree and a link error rate.

The invention relates to a method for real-time decompression display of multiple paths of H.265 videos, and belongs to the field of image processing. According to the invention, a Hisilicon Hi3559x series media processing chip is adopted to receive and decode an H.265 video code stream; a VxWorks operating system is operated on the Intel I7 processor, and video transcoding and display output are completed; and data is transmitted between the Hisilicon Hi3559x chip and the Intel I7 processor through a DMA channel of a PCIe bus. When multiple paths of H.265 code streams are processed, the time of the whole receiver from receiving the Ethernet compressed video to decompressing and transcoding to complete video display output does not exceed 30ms, and the processing efficiency of the receiver is optimized. According to the invention, the working pressure of a single chip can be effectively reduced when multiple paths of video streams are input, and the video decoding, transcoding and displaying efficiency is improved, so that the processing time of the link is reduced.