74 results about "Block size" patented technology

A method of optimizing the size of blocks of coded data, intended to be subjected to iterative decoding, the method comprising a first step of evaluating a resource (T) available for the decoding of a block of normal size (N) and a second step of seeking, amongst a plurality of block sizes (N / k) which are submultiples of the normal size by an integer factor (k) greater than or equal to 1 and requiring on average a number of iterations ({overscore (n)}iterations(k)) compatible with the said available resource, the one which makes it possible to obtain the lowest error rate at the output of the iterative decoding.

A method, apparatus and system for improving block error rate performance of a receiver having an iterative decoder in a communication system, the method, apparatus and system includes receiving an encoded frame of data, the encoded frame of data includes a quantity of code blocks where each code block has a corresponding code block size, determining a first maximum number of iterations for each of the code blocks of the encoded frame of data iteratively performing a decoding operation on a first code block until the occurrence of one of (a) the first maximum number of iterations has been reached and (b) the first code block has converged, and determining a second maximum number of iterations for the remaining code blocks of the encoded frame of data based on the number of actual iterations used to decode the first code block.

Techniques are disclosed for securing data in a cloud storage. Plaintext files are stored as secured, encrypted files in the cloud. The ciphering scheme employs per-block authenticated encryption and decryption. A unique file-key is used to encrypt each file. The file-key is wrapped by authenticated encryption in a wrapping-key that may be shared between files. A centralized security policy contains policy definitions which determine which files will share the wrapping-key. Wrapping-keys are stored in a KMIP compliant key manager which may be backed by a hardware security module (HSM). File metadata is protected by a keyed-hash message authentication code (HMAC). A policy engine along with administrative tools enforce the security policy which also remains encrypted in the system. Various embodiments support blocks of fixed as well as variable sizes read / written from / to the cloud storage.

Each time data, in the form of data blocks protected by code checks, must be reformatted, the original data is broken into new data blocks and a new code check is calculated from, and combined with, each new data block, but the new data blocks and new code checks are both reconstituted versions of the original data blocks and the original code checks. Consequently, the data is never left without protection. In one embodiment, an ingress encoder recomputes an ingress code check from an original data block and its associated header. An egress encoder computes an egress code check from the egress header for an outgoing data block reformatted from the original data block and the ingress code check. The outgoing information is then assembled from the egress header, the outgoing data block and the newly computed egress code check.

The embodiment of the invention discloses a method and device for determining the size of a transmission block, relates to the field of communication, and solves the problem of how to determine a TBSbased on non-time slot repetition. According to the specific scheme, a sending device determines a TBS according to the number of REs included in M first time units and a modulation and coding mode, and sends data borne on symbols corresponding to the first time units for S times. And the receiving device receives the data borne on the symbols corresponding to the first time units for S times, determines the TBS according to the RE number and modulation and coding modes included in the M first time units, and decodes the data on the symbols corresponding to the first time units according to the TBS, wherein M is an integer greater than or equal to 1 and less than or equal to K, K is an integer greater than or equal to 2, K represents the number of times of pre-configured repeated sending of the data carried on the symbol corresponding to the first time unit, S is an integer, and S is greater than or equal to 1 and less than or equal to K. The embodiments of the present application areused in a process of determining a transport block size.

Aspects of the disclosure relate to techniques for mitigating the decoding errors observed at the receiver as a result of puncturing symbols between consecutive subframes having the same transmission direction. To reduce the decoding errors, a plurality of transmission options, each including a number of resource blocks and a modulation and coding scheme (MCS), may be identified. In addition, each transmission option may be associated with one or more puncturing patterns that hinder decoding of a codeword at the receiver. The base station or user equipment (UE) may then select or modify at least one aspect of a scheduling decision involving the communication of the codeword in a given subframe of at least two consecutive subframes to minimize decoding errors. For example, a selected puncturing pattern or a transport block size associated with a selected transmission option may be modified.

The invention relates to a blind reconstructing method of a block sparse signal with unknown block size, relating to the technical field of compressed sensing and solving the problem that the traditional reconstructing method of the block sparse signal needs take the block size and block sparsity as priori knowledge. The blind reconstructing method comprises the following steps of: carrying out block sparsity self-adaptation iteration of an algorithm for each block size to find a reconstructed signal which corresponds to each block size by initializing the block sparsity and the block size; continuously iterate the algorithm and enlarging the block size accordingly, and finishing the algorithm till the 0-norm of the reconstructed signal obtained through the algorithm is less than the line number of a measurement matrix, outputting the reconstructed signal used as algorithm; if the condition is not met, operating the algorithm till: when block size is smaller than or equal to haft of the length of the reconstructed signal, the product of the block size and the block sparsity is larger than or equal to the length of the reconstructed signal, the iteration is completed, and a series of reconstructed signals are obtained; and finally screening the sparsest reconstructed signal as final algorithm output by utilizing 0-norm sparsity measurement criteria. The invention can be used for the technical field of compressed sensing of the block sparse signal.

A method of optimizing the size of blocks of coded data intended to be subjected to an iterative decoding process, a maximum error rate of the iterative decoding process being fixed in advance, in which there are sought, among a plurality of block sizes (N / k) which are submultiples of the normal block size by an integer factor (k) greater than or equal to 1 and a plurality of integers giving the maximum number of iterations that can be effected by the said iterative decoding on a block, (1) a submultiple size, and (2) a maximum number of iterations such that they are compatible with the maximum error rate, and such that the mean number of iterations that will be applied by the iterative decoding process on a block of submultiple size is minimized.

A decoding device, including circuitry configured to decode a bit stream and generate a quantized value, and inversely quantize the generated quantized value by using a flat scaling list, in a case where a block size of a transform block to which a transform skip is applied is larger than a 4 by 4 block size.

Conventional block ciphers that traffic in 128-bit block sizes are ill-suited for operating in small domains like credit card numbers. Some embodiments relate to techniques for constructing and speeding up practical and provably secure schemes for deterministically enciphering data from a small domain like credit card numbers using a conventional block cipher or other pseudorandom function.

Systems and methods for constellation shaping using low rate loss bit-level distribution matchers include receiving blocks of input bits and, for each input block of a predetermined size, assigning a respective codeword of a predetermined output block size. The number of bits of a given bit value in the codeword is dependent on a predetermined target probability distribution. A one-to-one mapping exists between each possible combination of input bits and a codeword for input blocks containing the combination. Some codewords include a number of bits having the given bit value that is different than the predetermined target probability distribution, but an average number of bits having the given bit value in the available codewords meets the predetermined target probability distribution. The disclosed methods result in more available codewords and a lower rate loss than in bit-level distribution matchers with a constant modulus, while achieving similar shaping.

A combination of a block-oriented encoder and decoder with a modified dataset identifier that is associated with an encoded block size are used to perform block-based encoding and decoding operations. The encoding process may generate optional metadata that includes an array of encoded block sizes to support random access into the stream or group of encoded blocks during the decoding process. The modified dataset identifier associates the original dataset identifier with the block size used by the encoder.

The invention discloses a white box block cipher construction method and system based on a FeistelBox structure. The method comprises: inputting n-bit plaintext, setting a block size n a , the number of iterative processing rounds r of the FeistelBox structure, use the T function to perform bit conversion, and convert the input n a bit bit to n b bit bit output, where n a +n b =n; add affine transformation between the rounds of the iterative processing rounds, and perform chain connection, the operation of each round is closely connected with the operation of the previous round and the next round, by converting the affine of the previous round The inverse transformation of the transformation is embedded in the lookup table operation of this round, and then the affine transformation of the previous round is applied to the result of the lookup table, and the affine transformation layer adopts the reversible affine transformation matrix; the encryption operation of S1-S2 is performed to obtain Encryption result; the system includes a bit conversion module, an affine transformation module and an execution operation module. The invention makes it impossible for the attacker to obtain the information of the ciphertext, increases the difficulty for the attacker to crack the password, and strengthens the security of key storage.

The embodiment of the invention discloses a block data verification method, device, equipment and storage medium. Wherein, the method includes: receiving the block data sent by the block generation node in the block chain system; verifying the block data according to the transaction attribute information associated with the block data, and sending the block data to the block generation node Send verification feedback. The technical solution of the embodiment of the present invention realizes the authenticity verification of the block data through the transaction attribute information associated with the block data in the node, increases the diversity of the block data verification in the block chain system, and reduces the The possibility of generation nodes maliciously generating transaction records in block data improves the authenticity of block data recorded in the blockchain.

A method and system for providing encryption resistant watermarking of data is described. The method and system comprises encoding a string of symbols, each having a respective symbol value, as a sequence of vectors where each vector includes a respective number of repetitions of a sub-vector of a predefined length, such that the respective number of the repetitions in each vector in the sequence is indicative of the respective symbol value of a corresponding symbol in the string. This sequence of vectors is then inserted into the item of content including digital data to apply a watermark to the item of content. This insertion process may involve interleaving the vectors with gaps of known lengths containing arbitrary data and may involve insertion prior to the vector sequence a marker comprising a concatenation of a number of copies of a marker vector. The length of the sub-vector may be chosen to be an integer divisor of a block size of a block cipher that is to be applied to the item of content after application of the watermark thereto.

The present disclosure provides a method and device for preventing blockchain forks. The method includes: selecting s consecutive blocks B n to B n+s ; created by block B n Node A n Generate for block B n key pair; node A n Continuously generate block B in the blockchain n+1 to B n+s remain active during the process until block B in consecutive s blocks n+s Become an immutable block; in response to block B in consecutive s blocks n+s Become an immutable block, use the private key PK' n for block B n+s Signing; Response to block chain subsequent generation of block B m , put the signature in block B m in; by creating s blocks B n to B n+s The nodes of each block in the block perform the above steps, thereby forming multiple backward links related to the block size of the blockchain; the newly added nodes used to create new blocks judge the area according to the number of backward links Whether the block chain is forked.

Embodiments of the present invention provide a method and device for determining the size of a bit block. The TBS index is determined by querying the first index table according to the MCS index, and the target bit block size is determined by querying the second index table according to the TBS index and the number of PRBs. In this process, since the TBS index corresponding to each MCS index in the first index table increases, the bit block size corresponding to the newly added TBS index is expanded in the second index table, and the larger the TBS index, the corresponding bit block bigger. Therefore, the first index table and the second index table are adapted to the uplink 256AQM. In the process of sending uplink data, the available REs in the RB can be used as much as possible to increase the uplink code rate and reduce the loss caused by the uplink peak rate, thereby improving the uplink data rate. Peak throughput and spectral efficiency.