1219 results about "Coding block" patented technology

In embodiments of the present invention improved capabilities are described for the steps of identifying a functional code block that performs a particular function within executable code; transforming the functional code block into a generic code representation of its functionality by tokenizing, refactoring, or the like, the functional code block; comparing the generic code representation with a previously characterized malicious code representation; and in response to a positive correlation from the comparison, identifying the executable code as containing malicious code.

Techniques for multiplexing and transmitting multiple data streams are described. Transmission of the multiple data streams occurs in “super-frames”. Each super-frame has a predetermined time duration and is further divided into multiple (e.g., four) frames. Each data block for each data stream is outer encoded to generate a corresponding code block. Each code block is partitioned into multiple subblocks, and each data packet in each code block is inner encoded and modulated to generate modulation symbols for the packet. The multiple subblocks for each code block are transmitted in the multiple frames of the same super-frame, one subblock per frame. Each data stream is allocated a number of transmission units in each super-frame and is assigned specific transmission units to achieve efficient packing. A wireless device can select and receive individual data streams.

A method includes separating resource elements from multiple code blocks into different groups, and decoding the code bits of the resource elements within each group without waiting for a completed reception of a transport block to start decoding.

A method includes separating coded bits from multiple code blocks into different groups, and decoding the code blocks containing coded bits within each group. A first CRC is attached to the transport block and a second CRC is attached to at least one code block from the transport block.

An improved channel interleaver design method including mapping from coded bits of different code blocks to modulation symbols, and mapping from modulation symbols to time, frequency, and spatial resources, to make sure each code block to get roughly the same level of protection.

The invention discloses a channel-polarization-based encoder for a staggered structure duplication code, and an encoding method and decoding methods thereof. The encoder consists of a duplication bit buffer with a storage capacity of L bits, a bit position mapper with a length N and a channel polarization device with the length N which are connected in sequence. The encoding method based on the encoder comprises the following steps of: embedding duplicated encoding into a channel polarization process, and introducing a duplicated relationship between parts of the bits of code blocks transmitted in sequence during the channel polarization for encoding. In addition, the invention further provides two decoding methods, which comprise the following steps of: decoding by using a simple and rapid successive cancellation (SC) algorithm, and performing iterative decoding by using a Tanner-graph-based belief propagation algorithm with excellent performance. On the basis of the innovative structure encoder, the encoding and decoding methods provided by the invention are stronger in error correction capability under the condition of not increasing the decoding complexity, and the transmission performance is obviously improved. The encoding and decoding methods are particularly applicable to an actual communication engineering system and have a good popularization and application prospect.

Different scripting languages may reside side-by-side or nested within each other on the same web page. Thus, a new author may add code to the page, and he or she is not tied to any given subset of languages supported by the web server. Multiple scripting languages are supported by identifying a start and an end of each scripting language code block authored into the web page markup language. When the web page is later compiled into an XML Document Object Model (DOM) tree, the routine examines the DOM to identify any nodes that identify a given code block. Upon encountering a node that identifies a given code block, the DOM is adjusted to account for the script code within the given code block.

An encoding apparatus and a method of encoding a source block including different types of data payloads are provided. The method includes dividing the source block into a predetermined number M of sub blocks, generating a predetermined number P1 of base parity payloads that correspond to each of the predetermined number M of sub blocks by performing first Forward Error Correction (FEC) encoding on each of the predetermined number M of sub blocks, generating a predetermined number P2 of extended parity payloads that correspond to the source block by performing second FEC encoding on a particular type of data payloads among data payloads that make up the source block, and configuring a source coded block based on a predetermined number N of sub coded blocks including the predetermined number M of sub blocks and the predetermined number P1 of base parity payloads generated.

A dual, and possibly multiple, frame approach is used by the invention. Embodiments of the invention include making a decision to use a long term reference frame, which is a frame other than an immediate past reference frame, to conduct INTER coding, or to conduct INTRA frame coding. Other embodiments include use of long and short term reference blocks, and make a decision between two types of INTER coding blocks and INTRA coding. In accordance with embodiments of the invention, a long term frame is a high quality frame. The high quality frame may be used as a reference frame under particular conditions.

A hybrid intra-inter bi-predictive (or multi-predictive) coding mode allows both intraframe (intra) and interframe (inter) predictions to be combined together for hybrid-encoding a current macroblock or a subblock Bi-prediction may be used also in I-pictures, combining two intra predictions that use two different intra prediction directions. A video encoder processes data representing a two-dimensional video image which has been produced by a conventional commercially available video camera. The video encoder is adapted to select, for coding a current macroblock, between an intra encoding mode, an P-frame inter encoding mode, a B-frame bi-predictive inter mode, and a hybrid intra-inter bi-predictive encoding mode. A video decoder (800) receives and decodes a data stream that may contain a block/macroblock encoded in accordance with the hybrid intra-inter bi-predictive encoding mode.

A system for executing instructions using a plurality of register file segments for a processor. The system includes a global front end scheduler for receiving an incoming instruction sequence, wherein the global front end scheduler partitions the incoming instruction sequence into a plurality of code blocks of instructions and generates a plurality of inheritance vectors describing interdependencies between instructions of the code blocks. The system further includes a plurality of virtual cores of the processor coupled to receive code blocks allocated by the global front end scheduler, wherein each virtual core comprises a respective subset of resources of a plurality of partitionable engines, wherein the code blocks are executed by using the partitionable engines in accordance with a virtual core mode and in accordance with the respective inheritance vectors. A plurality register file segments are coupled to the partitionable engines for providing data storage.

An encoded bitstream of entropy encoded video data is received by a video decoder. The encoded bitstream represents syntax elements of a sequence of coding blocks. The sequence of coding blocks is recovered by processing a bin sequences associated with each coding block in a processing pipeline, wherein a defined amount of time is allocated to process each coding block in the processing pipeline. The encoded bitstream is arithmetically decoded to produce each bin sequence. The arithmetic decoder is time-wise decoupled from the processing pipeline by storing a plurality of the bin sequences in a buffer memory.

The embodiment of the invention discloses a data transmission method, which comprises the following steps: dividing a transmission block into at least one group, wherein each group comprises at least one coding block; adding cyclic redundancy check CRC bits to each group; and sending the group after addition of the CRC bits. Meanwhile, the embodiment of the invention discloses a data transmission device and a communication system based on grouping concept; and groups corresponding to check errors are retransmitted, so that data retransmission is greatly reduced and simultaneously large throughput gain is acquired.

Executable software sent from an application service provider to a client computer can be arranged as a bundle of executable code blocks that are used during initialization of a group of applications (at least one initialization block from each application being included in the bundle). The bundle can include code for applications that are subscribed to by a user as well as for applications not subscribed to. As the subscribed applications are executed, usage data sent to a server may be monitored to determine unsubscribed applications that may be of interest to the user. Subscription offers may be automatically generated and sent to the user in response to processing of the usage data. Transmission efficiency of the code blocks may be improved by exchanging identification codes between the server and client to determine code blocks already present at the client.

A system and method for generating a second reduced size digital image from a first digital image, the method including iteratively compressing the first digital image to an extent determined by a quality measure comprising at least a blockiness measure quantifying added artifactual edges along coding block boundaries of the second image and/or use of a quantization matrix generated by computing a weighted average of the quantization matrix of the first digital image and a scaled second quantization matrix.

A video surveillance system is disclosed which addresses the issue of privacy rights and scrambles regions of interest in a scene in a video scene to protect the privacy of human faces and objects captured by the system. The video surveillance system is configured to identify persons and or objects captured in a region of interest of a video scene by various techniques, such as detecting changes in a scene or by face detection. In accordance with an important aspect of the invention regions of interest are automatically scrambled, for example, by way of a private encryption key, while the balance of the video scene is left in tact and is thus recognizable. Such region of interest scrambling provides distinct advantages over known code block scrambling techniques. The entire video scenes are then compressed, by one or more compression standards, such as JPEG 2000. In accordance with one aspect of the invention, the degree of scrambling can be controlled.

The embodiments of the invention provide a data processing method and apparatus. The method comprises: performing code block segment processing on a data block so as to obtain multiple first processing blocks, the difference of the bit numbers of any two of the multiple first processing blocks being not greater than one bit; according to a filling bit and the multiple first processing blocks, determining multiple second processing blocks, the value of the filling bit being a preset value; adding continuous N-K fixation bits for each of the multiple second processing blocks so as to obtain multiple third processing blocks, the values of the fixation bits being preset values, and (N-K)>=0; and according to the multiple third processing blocks, performing polar coding. In the embodiments of the invention, the data blocks are segmented as uniformly as possible and are subjected to filling bit processing and fixation bit processing so as to perform the polar coding and reduce performance differences among code blocks.

Methods and apparatus for communicating different size coded blocks of information in a wireless sectorized communications cell are described. Information may be categorized and formed into large, medium, and small coded blocks which may include error correction code bits based on the number of bits representing the information, time criticality of the information, and tolerable level of interference. Channels with full tone overlap between adjacent sectors, channels with no tone overlap between adjacent sectors, and channels with partial tone overlap between adjacent sectors are used for different size blocks. Some tones corresponding to a channel with less than full tone overlap are left unused in an adjacent sector thereby achieving less than full transmission tone overlap. Large transmission blocks are transmitted using full tone overlap channels; medium transmission blocks are transmitted using partial tone overlap channels; small transmission blocks are transmitted without using transmission tone overlap in adjacent sectors.

The invention discloses a JPEG2000 self-adapting rate control system and a method based on pre-assignment of code rate, mainly solving the problem of large calculation amount and large memory size of JPEG2000 encoding method. The code block of the original image after pretreatment, wavelet transformation and quantification is output by two lines, one line directly enters the bit plane and MQ coder; for the other line, the entropy of each code block is estimated by the entropy estimate module, sent to the code rate assignment module to assign code rate, and the code rate of each code block is feed back to the bit plane and MQ coder through the encoding depth control module, after the code blocks are encoded by the bit plane, further feed back to the encoding depth control module to determine the output code stream of each encoded code block, and the output code stream is under optimal interception and code stream organization to output the ultimate code stream. At the same time, the invention can change the threshold value of the encoding depth control coefficient as required, to flexibly control the encoding depth in order to improve the image compression quality. The invention has the advantages of low complexity and easiness for hardware implementation, and is suitable for various JPEG2000 image real-time compression systems.

The invention relates to a block chain account book distributed storage technology based on erasure code, and belongs to the block chain technology field. The technology comprises the following steps:a) the block delay coding strategy allows to delay the coding of a certain number of new blocks to meet the synchronization requirements of other block chain consensus nodes for blocks; B) accordingto the set block coding algorithm, the blocks satisfying the coding condition are cut into k data blocks, each data block having a size of about 1/k of the original block, and further the cut k datablocks are encoded into n (n) k encoded blocks by the erasure coding technology; (c) each block chain node reserves a part of that coding block, and finally the whole block chain network store the coding blocks decentrally; D) when the original block needs to be recovered from the encoded block, the current node collects the remaining encoded block corresponding to the block from the remaining nodes, and then recovers the original block according to the corresponding decoding algorithm. The method reduces the requirement of the block chain for storage resources and improves the utilization rate of storage space.

An MPEG-4 system with error concealment is provided for video service under the network with packet loss. The MPEG-4 system includes an encoder and a decoder. The encoder uses an intra-refreshment technique is used to make coded bitstream more robust against noise in order to stop error propagation. The rate-distortion optimization criterion is also introduced to adaptively update in synchronization with intra-coded blocks adaptively based on the true network condition with minimal overhead. The Lagrange multiplier is modified to achieve the best rate-distortion balance. In addition, a decoder loop is used in the encoder and is synchronized with the true decoder to achieve the best performance and avoid mismatch with the decoder used in the MPEG-4 system. The decoder is able to achieve resilient decoding from any kind of noise and enhance the reconstructed image quality with spatial and temporal hybrid concealment method. The result shows that a 3.65-9.71 dB further improvement on peak-signal-to-noise-ratio (PSNR) can be achieved in comparison with the existing methods that adopt spatial copy and zero motion concealment in decoding.

The present invention is a method and system which extracts, manipulates and embeds data from a compressed and standard compliant video bitstream which may be used for digital rights management, e.g. controlling access to a bitstream or for authenticating a video bitstream.

The method embeds binary data bits into compressed and standard compliant video bitstream with minimal visual artifacts. The method first parses the compressed video bitstream and locates coded blocks. The codeword C for the last triplet in the original block(RUN_c,LEVEL_c, LAST_c=1) is replaced by the VLC code word C′ for the last triplet (RUN_C,LEVEL_C, LAST_C′=0). A codeword corresponding to a triplet with LAST=1 is placed after C′ whose sign bit “s” can be either 0 or 1 and is an embedded data bit, and can be used for authentication.

The invention provides an intra-frame coding method based on a rolling hush and block-level intra-frame prediction of the technical field of image processing. A hash function with a rolling type calculation characteristic and a corresponding rolling type algorithm are selected and utilized to set up an image block lookup table about positional information contained in an image coded area of various image blocks with different pixel contents and hash values of the pixel contents of the image blocks, the image block lookup table is used for judging whether a current image block to be coded is a stored image block in the image block lookup table or not, and two-tuples further serve as coding information of the current image block to be coded or adding is carried out on the image block lookup table. According to the intra-frame coding method, a number of repeated image blocks existing in screen images are fully utilized to further improve intra-frame compressibility, on the premise that calculation expenditures at worst are guaranteed, little calculation expenditures are used for determining whether a prediction block the same as the current image block to be coded exists in the image coded area or not, and when a number of repeated image blocks exist in the screen images, the intra-frame coding method can obtain higher compressibility compared with an existing method.

A method for executing instructions using a plurality of virtual cores for a processor. The method includes receiving an incoming instruction sequence using a global front end scheduler, and partitioning the incoming instruction sequence into a plurality of code blocks of instructions. The method further includes generating a plurality of inheritance vectors describing interdependencies between instructions of the code blocks, and allocating the code blocks to a plurality of virtual cores of the processor, wherein each virtual core comprises a respective subset of resources of a plurality of partitionable engines. The code blocks are executed by using the partitionable engines in accordance with a virtual core mode and in accordance with the respective inheritance vectors.

The invention discloses a hybrid retransmission method. The method comprises the following steps: transmitting data comprising all code blocks (CB) by adopting a transmission block (TB) retransmission way; during data retransmission, dividing retransmission data into L groups according to a packet length M, and putting the CBs left after grouping into a last group, wherein the M is greater than or equal to 1, and is smaller than or equal to a preset maximum value; and determining a TB retransmission way or a CB packet retransmission way according to the L. After application of the hybrid retransmission method, the system overhead can be reduced on the premise of ensuring system throughput, and system resources are fully utilized.

A system and associated method for asynchronous code testing in an Integrated Development Environment (IDE). The IDE has components of a source code editor, an impact analyzer, a test case launcher, a graphical user interface (GUI), and a database. All components run concurrently for asynchronous and real-time code editing. Upon modification of a code block of an input code, a test case is automatically generated and a launching priority is calculated based on the relationship between the modified code block and each code block affected by the modification. Generated test cases are automatically run by the test case launcher or manually selected by the user to produce a test run result.

A dynamic compiler analyzes the frequency of execution of selective code paths within a program procedure, and selectively compiles code paths to different memory locations based on the observed frequency of execution. Preferably, code is dynamically compiled in two stages. In a first compilation stage, the compiler instruments selective code paths to count the number of times each path is taken. A second stage compilation is thereafter triggered when the procedure has been called some threshold number of times. In the second stage, the compiler selectively re-compiles the more frequently executed code paths to a primary location, and re-compiles the remaining code paths to an alternate location. Placing infrequently executed code in an alternate location reduces the size of the primary code area, improving execution efficiency.

The invention is concerned with the data transmission method and the system, it is: the user's terminal or the base station as the sending side, the corresponding base station or the user's terminal as the receiving side, the sending side process code for the information bit in order to get the code block number equal with the biggest resend time, the sending side divides the code block number into at least two groups, and at least the first group includes two code block; sets the transmission time slot of each code block in the group, and sends to the receiving side; the receiving side receives code block and decode, after receiving a group of code block, if the decode is still incorrect, feedbacks once NACK. The invention can reduce the feedback signaling overhead effectively, improve the utilance of the channel resource.

A system for optimizing computing code containing procedures identifies code blocks as hot blocks or cold blocks in each procedure based on the local block weights of the code blocks in the procedure. The hot blocks are grouped into an intraprocedure hot section and an intraprocedure cold section for each procedure to optimize the procedure. The intraprocedure hot sections in the procedures are selectively grouped into an interprocedure hot section and the intraprocedure cold sections are selectively grouped into an interprocedure cold section, based on global block weights of the code blocks, to optimize the computing code. Additionally, code sections from called procedures can be duplicated into calling procedures to further optimize the computing code.

A method and a mechanism for securely storing and executing a program in a computer system processing unit, including a storage unit for storing an encrypted version of the program and a loader/decryption mechanism responsive to a request and a decryption key for decrypting the encrypted version of the program, writing the un-encrypted version into a memory for execution, and deleting the un-encrypted version from the memory when execution is completed. The encrypted version is constructed as encrypted code blocks that are decrypted and loaded into the memory only as required, and the encrypted version of the program includes a clear text header identifying the encrypted version as an encrypted program. The processor unit includes a context store for storing the context of a process in which the program is being executed, and a context switching mechanism for performing context switching operations wherein the context switching mechanism is responsive to a context switch of the process in which the program is being executed for storing the clear text header in the context store when the process is suspended in a context switch and returning the clear text header to the memory when the process is resumed.

Techniques and tools for code table selection and joint coding/decoding of macroblock mode information for macroblocks of interlaced forward-predicted frames are described. For example, a video decoder decodes a variable length code that jointly signals macroblock mode information for a motion-compensated macroblock. The jointly signaled information includes a macroblock type, whether a coded block pattern is present or absent, and whether motion vector data is present or absent for the motion-compensated macroblock. A video encoder performs corresponding encoding.

A method and apparatus for encoding a transport block are provided. The method for encoding the transport block includes: determining, by a transmitter, a size of transport block; dividing, by the transmitter, the transport block into at least one code block based on the size of transport block; interleaving, by the transmitter, the at least one code block by an interleaver; and performing, by the transmitter, a turbo coding for the interleaved at least one code block, wherein the size of transport block is determined based on the number of the divided code blocks.