A method compares text strings having Unicode encoding. The method receives a first string S=s.sub.1 s.sub.2 . . . s.sub.n and a second string T=t.sub.1 t.sub.2 . . . t.sub.m, where s.sub.1, s.sub.2, . . . , s.sub.n and t.sub.1, t.sub.2, . . . , t.sub.m are Unicode characters. The method computes a first string weight for the first string S according to a weight function . When S consists of ASCII characters, (S)=S. When S consists of ASCII characters and some accented ASCII characters that are replaceable by ASCII characters, (S)=g(s.sub.1) g(s.sub.2) . . . g(s.sub.n), where g(s.sub.i)=s.sub.i when s.sub.i is an ASCII character and g(s.sub.i)=s.sub.i when s.sub.i is an accented ASCII character that is replaceable by the corresponding ASCII character s.sub.i. When S includes one or more non-replaceable non-ASCII characters, the first string weight concatenates an ASCII weight prefix .sub.A (S) and a Unicode weight suffix .sub.U(S). The method also computes a second string weight for the second text string T. Equality of the strings is tested using the string weights.

One example includes a VID signal decoder circuit. The circuit includes a coarse resolution decoder that receives a VID signal. The VID signal can be encoded with a digital value of an output voltage. The coarse resolution decoder can decode the VID signal to generate a first digital signal. The circuit also includes a fine resolution decoder that receives the VID signal and to decode the VID signal to generate a second digital signal. The circuit further includes a multiplexer to provide the first digital signal as an output signal responsive to a first state of a selection signal and to provide the second digital signal as the output signal responsive to a second state of the selection signal. The first and second states of the selection signal can be based on a relative amplitude of the first and second digital signals.

One example includes a VID signal decoder circuit. The circuit includes a coarse resolution decoder that receives a VID signal. The VID signal can be encoded with a digital value of an output voltage. The coarse resolution decoder can decode the VID signal to generate a first digital signal. The circuit also includes a fine resolution decoder that receives the VID signal and to decode the VID signal to generate a second digital signal. The circuit further includes a multiplexer to provide the first digital signal as an output signal responsive to a first state of a selection signal and to provide the second digital signal as the output signal responsive to a second state of the selection signal. The first and second states of the selection signal can be based on a relative amplitude of the first and second digital signals.

This application discloses a decoding method, a decoding device, and a readable storage medium. The decoding method can perform a simple logic operation on the corresponding specified bits in the first bitstream, and generate the corresponding fourth bitstream accordingly to obtain information before encoding. The logic design of this decoding method is simple, which can reduce the complexity of logic circuit design and improve the reliability of decoding.

Compressed domain processors configured to perform operations on data compressed in a format that preserves order. The Compressed domain processors may include operations such as addition, subtraction, multiplication, division, sorting, and searching. In some cases, compression engines for compressing the data into the desired formats are provided.

Compressed domain processors configured to perform operations on data compressed in a format that preserves order. The Compressed domain processors may include operations such as addition, subtraction, multiplication, division, sorting, and searching. In some cases, compression engines for compressing the data into the desired formats are provided.

Described is an apparatus for converting binary data to ternary and back such that the apparatus comprises: a first look-up table (LUT) having a mapping of 19 binary bits to 12 ternary trits; and a first logic to receive a binary input and to convert the binary input to a ternary output according to the first LUT.

Described is an apparatus for converting binary data to ternary and back such that the apparatus comprises: a first look-up table (LUT) having a mapping of 19 binary bits to 12 ternary trits; and a first logic to receive a binary input and to convert the binary input to a ternary output according to the first LUT.

A method compares text strings having Unicode encoding. The method receives a first string S=s.sub.1 s.sub.2 . . . s.sub.n and a second string T=t.sub.1 t.sub.2 . . . t.sub.m, where s.sub.1, s.sub.2, . . . , s.sub.n and t.sub.1, t.sub.2, . . . , t.sub.m are Unicode characters. The method computes a first string weight for the first string S according to a weight function . When S consists of ASCII characters, (S)=S. When S consists of ASCII characters and some accented ASCII characters that are replaceable by ASCII characters, (S)=g(s.sub.1) g(s.sub.2) . . . g(s.sub.n), where g(s.sub.i)=s.sub.i when s.sub.i is an ASCII character and g(s.sub.i)=s.sub.i when s.sub.i is an accented ASCII character that is replaceable by the corresponding ASCII character s.sub.i. When S includes one or more non-replaceable non-ASCII characters, the first string weight concatenates an ASCII weight prefix .sub.A (S) and a Unicode weight suffix .sub.U(S). The method also computes a second string weight for the second text string T. Equality of the strings is tested using the string weights.

A method compares text strings having Unicode encoding. The method receives a first string S=s.sub.1 s.sub.2 . . . s.sub.n and a second string T=t.sub.1 t.sub.2 . . . t.sub.m, where s.sub.1, s.sub.2, . . . , s.sub.n and t.sub.1, t.sub.2, . . . , t.sub.m are Unicode characters. The method computes a first string weight for the first string S according to a weight function . When S consists of ASCII characters, (S)=S. When S consists of ASCII characters and some accented ASCII characters that are replaceable by ASCII characters, (S)=g(s.sub.1) g(s.sub.2) . . . g(s.sub.n), where g(s.sub.i)=s.sub.i when s.sub.i is an ASCII character and g(s.sub.i)=s.sub.i when s.sub.i is an accented ASCII character that is replaceable by the corresponding ASCII character s.sub.i. When S includes one or more non-replaceable non-ASCII characters, the first string weight concatenates an ASCII weight prefix .sub.A (S) and a Unicode weight suffix .sub.U(S). The method also computes a second string weight for the second text string T. Equality of the strings is tested using the string weights.