141 results about "Block code" patented technology

An electronic decoder for decoding of block coded wireless communications signals. The electronic decoder comprises at least two electrically interconnected analogue crossbar arrays (1110, 1120) of memristors. An electrical interconnection (1115) between a column (1111) of an analogue crossbar array of the at least two electrically 5 interconnected analogue crossbar arrays (1110, 1120) and a row (1121) of a following analogue crossbar array of the at least two electrically interconnected analogue crossbar arrays (1110, 1120) comprises a current-to-voltage converter (1101). A first analogue crossbar array (1110) of the at least two analogue crossbar arrays (1110, 1120) comprises at least a first row of memristors (1112a) with a single input and a 10 respective output for each column of memristors.

A video encoder and video decoder may determine to code a block of video data using a non-directional intra mode. The video encoder and video decoder may determine a secondary transform from a secondary transform set for the block, and perform a transform process on the block of video data using the secondary transform. For non-directional intra prediction modes, the secondary transform set has a first number of transform kernels that is less than a second number of transform kernels in the secondary transform set for other blocks coded using a directional intra mode.

A video coder may determine transform sets for blocks coded with combined inter-intra prediction (CIIP) mode and / or a geometric partitioning (GEO) inter mode. The video coder may determine the transform sets from intra prediction modes derived for the blocks coded with CIIP mode and GEO mode.

This disclosure provides a method of decoding a digital speech signal, a speech decoder, a handset or mobile radio, and a base station or console. The method includes receiving a voice bit stream including at least one frame of bits that includes block codes, determining least confident bits in a first block code, generating candidates for the first block code based on the least confident bits, determining a first distance between each candidate and the first block code, and demodulating at least one other block code to obtain at least one demodulated vector. For each demodulated vector, a second distance between the demodulated vector and possible transmitted vectors is determined, and from the possible transmitted vectors, a vector corresponding to a minimum second distance is selected as a corrected demodulated vector. A minimum total distance is determined, and a candidate is selected as a corrected first block code.

The invention discloses a block code determination method of a storage system and the storage system, and relates to the technical field of storage systems.The method comprises the steps that space distribution of a redundant array of the storage system is divided into a plurality of data sets with the total number of disks as the cycle period, and strip distribution modes of all the data sets in the cycle period are repeated; spatial distribution is strictly aligned on physical storage, spatial distribution optimization of the independent redundant array of the storage system is achieved, no matter whether the number of disks is an odd number or an even number, a uniform cycle period model is adopted, continuous read-write operation of the disk array is facilitated, a cache structure is queried according to a data group number, block numbers are returned if a cache is hit, and the cache structure is optimized. If not, the block number is dynamically calculated, and the calculation result is written into the corresponding position, so that the step of solving the block code is simplified. Through a cyclic period space distribution structure and a cache acceleration mechanism, the problem that block numbering calculation is complex and time-consuming in the prior art is solved, and the performance and universality of a storage system are remarkably improved.

The invention discloses a land cover classification model for multi-scale remote sensing images. The land cover classification model comprises a ViT encoder, a low-rank fine tuning module, a CNN encoder, a decoder, a scale encoder and a position encoder. A multi-resolution remote sensing image is processed by a ViT encoder block coding layer and then enters a Transform layer, interactive fusion is carried out on the multi-resolution remote sensing image and CNN features processed by a CNN encoder, fused visual features, scale codes and position codes are fused through an attention mechanism and then enter a decoder, the decoder obtains the category probability corresponding to each pixel through multi-step operation, and the category probability corresponding to each pixel is calculated through the corresponding category probability. And finally, determining a ground feature category through the semantic segmentation head. According to the method, single-model cross-resolution automatic interpretation is realized, and multi-element ground feature classification of remote sensing images with the resolution of 2-10m is supported. A visual pre-training large model is introduced to improve the interpretation stability; global context and local detail information are considered through ViT and CNN double branches; and semantic alignment up-sampling is introduced in the decoding process, so that the segmentation accuracy is improved.

The invention relates to the technical field of spacecraft satellite-ground communication, and provides a low-earth-orbit satellite communication time delay optimization method and system aiming at the defects that a traditional low-earth-orbit satellite communication satellite system and a satellite communication frame have high time delay and poor real-time communication function. The core of the invention comprises three parts: firstly, an efficient receiving and transmitting end coding and decoding technology: a transmitting end adopts a subblock coding technology of a Turbo code; and a receiving end uses an MAX-Log-MAP algorithm to carry out rapid iterative decoding on the word block code of the Turbo code. And secondly, compressing the user data: carrying out lossless compression on the user data and a satellite communication frame header by using Huffman coding, reducing the transmission data volume, improving the data processing speed, and thus reducing the processing time delay. And finally, simplifying the frame header design: optimizing the frame header of the communication frame so as to reduce the total length of each frame. The method is particularly suitable for communication satellites (the orbit height is less than or equal to 1500km) in a low earth orbit.

The present invention discloses a Gleason grading and scoring method, device, equipment and storage medium, including: collecting pathological images of prostate cancer patients to form an image data set; training a self-supervised learning model using the image data set to form a block coding feature data set; training a gland segmentation model using the block coding feature data set to obtain gland segmentation images; performing secondary segmentation on each single gland in the gland segmentation images to obtain a number of single gland images, forming a single gland data set; processing each single gland image in the single gland data set to obtain a number of gland fusion features, forming a fusion feature data set; training a gland scoring model using the fusion feature data set; screening the main grading area and the secondary grading area to obtain the final grading score; and applying the trained model. The present invention can realize the automatic Gleason grading and scoring of pathological images, greatly reducing the workload of pathologists and improving work efficiency and detection ability.

The application relates to the technical field of distributed applications, and discloses a document synchronization method for code change, which comprises the following steps: in response to a code deployment request, monitoring code change through a change capturing engine and obtaining a unified change set; performing document paragraph positioning on an interface definition file according to the unified change set, constructing a change-paragraph mapping list and a document synchronization task; performing acceptance review on the document synchronization task based on acceptance rules to obtain a review result; and making a decision based on a blocking condition and the unified change set, the change-paragraph mapping list and the review result to determine whether to block code deployment and complete document synchronization. The method can realize accurate positioning of abstract code change to technical document paragraphs, form a unified and feasible evidence chain to jointly drive a document synchronization process and decision-making. The application further discloses a document synchronization device for code change and electronic equipment.

The invention provides a low earth orbit satellite network video code rate determination method and device and electronic equipment. The method comprises the following steps: acquiring link state information of a low earth orbit satellite network link; predicting whether a link reconstruction event occurs at the next moment based on the link state information; and under the condition of predicting that a link reconstruction event occurs in the low earth orbit satellite network link at the next moment, dividing a time domain into independent control intervals, and independently determining the video block code rate at the next moment based on the network state of the independent control interval in each independent control interval. According to the method, the satellite network reconstruction event is predicted, and the video code rate is independently determined in the interval mode in the reconstruction event period, so that the video live broadcast experience quality in the low-orbit satellite network environment is improved.

A decoder obtains a selection indication for a current block coded using an intra-based coding mode. A histogram of intra prediction modes (IPMs) is updated based on a first block reconstructed using a non-angular mode and selected for the current block. In accordance with the obtained selection indication, the histogram is updated based on one or both of: a first set of one or more IPMs associated with the first block, or a second set of one or more IPMs associated with a second block that overlaps a reference block indicated by the non-angular mode for the first block. The decoder reconstructs the current block based on the updated histogram.

The invention discloses an aircraft shape high-precision aerodynamic design method and device based on a quantum discrete adiabatic algorithm, and relates to the technical field of quantum computing. The method comprises the following steps: constructing a linear system model according to target aerodynamic data based on a computational fluid mechanics method; based on the cyclic shift basis matrix, according to the sparse coefficient matrix and the source item vector, performing block coding by using a linear combination unitary operator technology to obtain a block coding unitary operator; based on a preset iteration operator, constructing a walking operator according to the block coding unitary operator; according to the walking operator, line preparation is carried out through a cyclic calling method, and a quantum solving line is obtained; executing a quantum solving line, and measuring flow field quantum state information; and based on the target aerodynamic data, according to the flow field quantum state information, carrying out high-precision aerodynamic optimization design on the shape of the aircraft by utilizing an aerodynamic integration method. The high-precision aerodynamic design method for the aircraft profile is efficient and accurate based on the quantum discrete adiabatic algorithm.

The invention belongs to the technical field of containers, and discloses a container log asynchronous streaming transmission method and system based on a thread pool and a queue, and the method comprises the steps: receiving and analyzing a hypertext transfer protocol request parameter which is initiated by a client and is used for obtaining a target container log, and processing the analyzed hypertext transfer protocol request parameter, generating a log production task; the method comprises the following steps: receiving a log production task based on a pre-configured thread pool, obtaining a log stream of the log production task through a container engine, preprocessing the log stream, and transmitting the preprocessed log stream to a thread security queue for storage; and transmitting the thread security queue to a pre-configured hypertext transfer protocol response header in a block coding format, refreshing to the client, and judging whether the hypertext transfer protocol response header detects a termination signal or a thread event signal. According to the invention, all resources which do not need to be used due to disconnection of the client can be timely and thoroughly released, resource leakage is avoided, and the system stability is improved.

The invention discloses a coal mine image segmentation model and method based on VMama and a multi-expert hybrid network and a construction method thereof. The coal mine image segmentation model is constructed, the image block coding layer output of an encoder, the input and output of the first coding layer of a first VSS network are 1-N, and the input and output of an output end feature learning module are 1-N; the multi-expert hybrid network determines N expert models with relatively high scores based on a gating mechanism to perform enhancement processing to obtain a result, and the result is obtained through feature fusion; and the input of the feature learning module at the input end of the decoder is obtained by fusing the output and the features, the output of the decoding layer is obtained by fusing the features, and the input and the output of the segmentation head are segmented images. The method can significantly improve the segmentation precision and calculation efficiency of the coal image.

A multi-stage decoding algorithm for improving the decoding performance of bits encoded with a linear error-correcting block code of small or medium block length is provided. The algorithm comprises an input stage, at least two intermediate stages and an output stage. For each of the stages (except for the last intermediate stage and the output stage), a certain number of bit positions is selected and set to a maximum possible absolute LLR value. The output data of each stage is used to compute the input data of the next stage. Each of the intermediate stages executes a specified number of parallel decoding runs, and the input data for each of the intermediate stages is generated based on the output data of the previous intermediate stage and initial LLRs obtained after demodulation. The bit positions set to the maximum possible absolute LLR value in the previous stage cannot be used again in the next stage. At the output stage, only one decoding run is executed, for which input data are formed based on the initial LLRs and the LLRs obtained at the last intermediate stage.

The application provides a short-distance communication method and device with anti-interference capability, which is used to improve the anti-interference capability of a communication device and relates to the technical field of wireless communication. In the method, a sending device and a receiving device determine the code rate of channel coding according to the interference intensity of the space where the wireless link is located, and negotiate the channel coding mode with the receiving device; wherein the channel coding mode can be a non-uniform segmented block code. The sending device adopts the non-uniform segmented block code and the code rate to perform channel coding on the data packet when sending the data packet to the receiving device. Based on the scheme, the code rate of channel coding can be selected according to the interference intensity of the space where the wireless link is located when the sending device and the receiving device transmit the data packet, and the negotiated channel coding mode and the determined code rate are used to code the data packet to be transmitted, so that the gain and anti-interference capability of the wireless link established based on the short-distance communication protocol can be improved.

The present invention discloses a method for dividing the space of a building park into multi-level rectangular grids and encoding, which relates to the technical field of spatial data processing. The present invention includes: S1. Strictly divide the entire building park according to the number of building floors in terms of elevation, and assign an interpretive 11-bit code, and record the 11-bit code as code A; S2. Sequentially divide the first floor from bottom to top, and there is no nesting relationship between the divided blocks, and the number of divisions is not strictly limited, and then assign it a 4-bit code, and record the 4-bit code as code B; S3. Project the building on a two-dimensional plane composed of the X and Y axes, and divide it with different non-overlapping rectangles; S4. The space block code inside the building = code A + code B + code C. The present invention divides the original space into multi-level space grids of different sizes and performs interpretive encoding on them, so as to finely describe the internal space of the building and accurately analyze its location in the space according to the code.

This invention discloses a multidimensional coupled chain code encoding method based on generalized integrated interleaving codes. It selects d-dimensional chain codes from s-dimensional chain codes for generalized integrated interleaving encoding, resulting in the l-th... i The code length of the wiry chain code is [value], and the information bit length is [value]. The remaining (s-d) wiry chain code is encoded, and the l′ [value] is [value]. i' Wirachain codes use linear block codes with a code length of and an information bit length of as the basic code, and the sequence c... (t) Initialize to an all-zero sequence; set the information sequence u Divide into sL groups. For the l-th dimensional zip code, divide into groups of length k. t,l -m t,l sequence u (t,l) With a length of m t,l sequence w (t,l) The data is fed into a multiplexer to obtain a length of k. t,l sequence a (t,l) The sequence is fed into a basic code encoder for encoding to obtain a codeword sequence. Simultaneously, the sequence is fed into a generalized integrated interleaved code encoder for encoding to obtain another codeword sequence. c (t,0) , c (t,1) ,…, c (t,s‑1) The encoded output sequence c at time t is obtained by feeding it into the multiplexer. (t) This invention has the advantages of simple coding, ease of implementation, and good performance.

The present invention discloses a DNA storage method for rapidly reading out short fragments by nanopore sequencing. This method encodes the information sequence using block codes, superimposes the sparse codeword fragments with a known pseudo-random sequence, maps the combined equal-length encoded bit sequences into a data DNA sequence after combination, and constructs a labeled DNA sequence using a pseudo-random sequence accompanied by a short block error-correcting code. For nanopore sequencing, primer recognition and label recognition are used to achieve fast clustering of sequencing reads, a hidden Markov model is constructed, and the forward-backward algorithm is used to infer the maximum symbol probability. The reads within the cluster are subjected to upper-layer bit sequence merging, insertion and deletion errors are corrected, a consistent upper-layer bit sequence is obtained, and the lower-layer bit sequences within the cluster are corrected. The likelihood probability of the consistent sequence is calculated, and soft decision error-correcting decoding is performed to restore the original data. The present invention can effectively utilize nanopore sequencing to rapidly read out short fragment DNA, and its advantage lies in using a probability-based multi-sequence merging method to correct the high insertion and deletion errors of nanopore sequencing.

This invention provides a high-sensitivity satellite navigation signal acquisition method. It utilizes an improved acquisition algorithm based on FFT coefficient compensation and block code Doppler compensation to acquire satellite navigation signals, obtaining the acquisition result. This invention effectively reduces the impact of Doppler frequency offset during long coherent acquisition times through coefficient-compensated FFT operations and the block code Doppler compensation algorithm. When calculating the FFT spectrum, only the spectral lines at specified positions need to be calculated, effectively shortening the calculation time, improving acquisition efficiency, and achieving high-sensitivity acquisition of weak signals.

Aspects of the present disclosure provide techniques for block code based constellation shaping. An example method includes generating a first set of bits for transmission; generating a plurality of cyclic redundancy check bits and appending them in the first set to obtain a second set of bits; generating a set of log-likelihood ratios (LLRs) corresponding to the second set of bits, wherein a size of the LLR set depends on a number of physical resource blocks configured for transmitting the second set of bits and a modulation and coding scheme; decoding the LLR set by using a block code according to a shaping code rate to obtain a shaping bit sequence; generating a sequence of shaped symbols based at least in part on the sequence of shaped bits and the second set of bits; and transmitting the shaped symbol sequence to a receiving device.

Affine multi-HMVPs are described. In an example aspect, a method for video processing includes deriving, for a conversion between a current block of a video and a bitstream representation of the current block, an affine model of the current block based on affine-related information stored in at least one of a plurality of history motion vector prediction (HMVP) buffers storing affine-related information of blocks coded before the current block in different categories, and performing the conversion by using the derived affine model.

The application discloses an elevator risk early warning method and system based on time sequence block and dynamic and static fusion, comprising: acquiring dynamic time sequence data and static attribute characteristics of an elevator and performing normalization processing; utilizing a block coding mechanism to divide the dynamic time sequence characteristics into time sequence blocks, extracting local semantic representations and long-range time sequence dependencies of each block through a channel-independent deep neural network backbone; eliminating a reverse normalization step at an output end of the backbone network, and directly retaining a normalized distribution representation of the dynamic characteristics; splicing and fusing the retained dynamic characteristic vector and the normalized static attribute characteristics to construct a multivariate joint interaction feature space; utilizing a flattening fusion mechanism to perform full-dimensional space-time feature interaction mapping; and finally outputting an elevator fault probability in a future preset period. The application can effectively solve the problem of missing cross-variable interaction in long time sequence data, and significantly improve the accuracy and robustness of elevator fault prediction under non-stationary data flow.

The application discloses a decoding method, device and readable storage medium, and belongs to the technical field of communication. The method comprises the following steps: a decoding end determines a coding coefficient vector according to a received signal and a new space-time block code (NSTBC) codebook; the decoding end determines the power sum of the sending symbols on the sending antenna in the first two symbol periods according to the received signal; and the decoding end decodes original coding input symbols in a current symbol period according to the coding coefficient vector, a differential space-time block code (DSTBC) coding mode, the NSTBC codebook and the power sum of the sending symbols on the sending antenna in the first two symbol periods, wherein the first two symbol periods are two adjacent symbol periods before the current symbol period.

Provided is a transmission device comprising: a polarization time block coding unit that performs space-time coding with respect to a transmission signal, thereby generating a polarization phase modulation signal; a quadrature phase signal generation unit that generates, for each polarized wave, a quadrature phase signal of a dual polarization phase modulation signal generated by the polarization time block coding unit; and a transmission unit that alternately transmits the dual polarization phase modulation signal and the quadrature phase signal of each polarized wave on the time axis.　

The invention provides a flash memory data processing method and system based on filling position variability. The method comprises the following steps: determining one or more coding groups according to a plurality of data block codes and a plurality of first redundant block codes of a first flash memory page; determining second data of the data partitions indicated by the data block codes in the at least one coding group; creating a check code of the second data according to the second data and the corresponding coding group; and filling the first redundant partition indicated by the first redundant block code of the coding group with a check code. The data cracking risk can be reduced, and the safety and the error detection capability of the flash memory device are improved.

For a transform block of a frame of a video encoded with conventional residual coding, if an inferred sub-block of a transform block of an sb codeflag is not present is a DC sub-block and / or the last one of transform blocks containing a non-zero coefficient level, the decoder inferes that the sb codeflag of that sub-block is 1. And otherwise, inferring that the sb coded flag is 0. If a transform block is encoded using transform skip residual encoding, the sb coded flag of a sub-block in which no sb coded flag exists is estimated to be 1. The decoder determines an initial context value of an entropy coding model based on the sub-block flag of the inferred sub-block, and determines a sub-block flag of the encoded sub-block using the entropy coding model.

The invention belongs to the technical field of communication signal processing and code identification, and solves the problem of channel code identification when a non-cooperative communication system lacks coding parameter prior information and training data with labels. According to the technical scheme, the method is characterized in that a unified recognition framework is constructed based on five features, namely, a rank fluctuation feature is used for distinguishing convolutional codes and linear block codes, a continuous zero spectrum feature is used for recognizing BCH codes, a multi-dimensional structure feature is used for detecting Turbo product codes, a bit distribution deviation feature is used for recognizing polarization codes, and an average absolute column correlation feature is used for distinguishing LDPC codes and non-LDPC codes; blind recognition of five types of channel codes including BCH codes, LDPC codes, convolutional codes, Turbo product codes and polarization codes is achieved. The method does not depend on coding parameter prior information, does not need training, is high in recognition rate under a low signal-to-noise ratio, is high in generalization capability, and is suitable for real-time and resource-limited scenes.

The present disclosure discloses a block code service apparatus. The block code service apparatus according to the present disclosure comprises: a command analysis unit that generates at least one embedding vector on the basis of a user command; a database management unit that manages a database of a plurality of block codes each configured in a block code format; a block selection unit that selects, from among the plurality of block codes, at least one block code corresponding to the at least one embedding vector; and a block connection unit that connects the selected block codes to generate an artificial intelligence model.