105 results about "Bit manipulation" patented technology

The invention discloses a resource allocation method and device based on bit map pre-calculation, and the method comprises the steps: generating a global resource state bitmap according to the CORESET configuration in a PDCCH, and carrying out the pre-calculation of each possible candidate PDCCH to form a candidate pre-allocation bit map set; extracting a corresponding pre-allocation bitmap from the candidate pre-allocation bitmap set as a candidate set bitmap; and comparing the candidate set bitmap with the global resource state bitmap, judging whether the resources are conflicted or not, and if the resources are not conflicted, determining that the resources are available and further occupying the resources. Complex function calculation at the scheduling moment is transferred to pre-calculation at the initialization stage, only simple bitmap retrieval and bit operation are needed during scheduling, the PDCCH resource allocation time consumption is greatly shortened, real-time intensive calculation is replaced with pre-stored bitmaps, the CPU load is remarkably reduced, a processor focuses on a core scheduling algorithm, resource redundancy consumption is reduced, and the scheduling efficiency is improved. And the overall capacity and the energy utilization efficiency of the communication system are effectively improved.

The invention provides an ML-DSA module reduction method and device based on improved Barrett reduction, and the method comprises the steps: dividing an input signal into a first preset bit signal and a second preset bit signal according to the bit width, and carrying out the shift addition operation of the first preset bit signal, so as to generate a middle quotient value; generating a first preset bit remainder based on the intermediate value; performing splicing processing on the first preset bit remainder and the second preset bit signal to generate an intermediate remainder; and performing a correction operation on the intermediate remainder to output a remainder result. According to the operation method, an input signal is processed in a high-order mode and a low-order mode, and the bit width participating in multiplication and shifting operation is reduced; according to the method, a precomputation constant is optimized, the number of times of addition is reduced, and wide bit operation in a critical path is eliminated by means of segmentation processing and register insertion, so that the critical path is shortened, and the maximum operation frequency of a system clock is improved; and through error analysis and range limitation, the correctness of a module reduction result is ensured.

The invention relates to the technical field of solid-state storage, and discloses an end-to-end data path protection method and system for a high-capacity solid-state hard disk, and the method comprises the steps: carrying out the real-time lightweight feature extraction of a data block; generating a dynamic feature matrix from the feature vectors, performing bit operation between the data blocks and the dynamic feature matrix, and performing LDPC coding on an intermediate data matrix; constructing mapping table entries for protecting the data blocks in the high-capacity solid state disk, and performing feature matrix nesting protection on the mapping table entries; and writing the protection data block and the protection mapping table item into the high-capacity solid state disk, and reading the protection data block and the protection mapping table item from the high-capacity solid state disk. According to the method, the dynamic matrix can be generated by fusing the data entropy value, the key mode and the physical state in real time, ECC strength self-adaption is achieved, user data features are embedded into a mapping table item, the same protection process is reused, a bidirectional verification chain is constructed, a feature matrix is bound from an NAND physical layer to a host interface in a full-link mode, and protection breakpoints are eliminated.

A data aggregation service is engineered to generate aggregated data values based on encrypted data received from a variety of providers, without being exposed to the underlying plaintext data. A homomorphic encryption scheme is used in a threshold cryptography scenario that allows aggregation of the encrypted data without requiring decryption. An independent decryption service can partially decrypt the aggregated result, which can ultimately be decrypted to plaintext for use by the provider. Bitwise operations can be defined to support aggregation with error tolerance, and the operations can be constrained to a smaller bit size to reduce circuit complexity.

To automatically test an OS incorporated in equipment or a control board.SOLUTION: An acquisition unit 51 that communicates with a repository via a network and acquires a source code of a target program from the repository, a build unit 52 that builds the target program using the acquired source code, a writing unit 53 that performs a process of writing the built target program to a storage unit of a target board, a reset unit 54 that performs a process of resetting the target board, a communication unit 55 that communicates with the target board, instructs a control unit of the target board to execute an automatic test, and receives a test result of the automatic test from the target board, and a determination unit 56 that performs a process of determining results of various tests executed on the target board based on the received test result.SELECTED DRAWING: Figure 6

The invention relates to an implementation method for applying linear subcomponents of a ZUC algorithm to multiple scenes. The method comprises the following steps: constructing a linear transformation matrix expression from an input bit sequence to an output bit sequence of a linear subcomponent according to the definition of the linear subcomponent in the ZUC algorithm; and carrying out structure division on the linear transformation matrix expression, and decomposing the original large-scale matrix operation into at least two independent small-scale matrix operations. And according to each small-scale matrix design, a logic gate level implementation scheme based on in-situ XOR operation is designed, and a bit operation sequence is generated. And mapping the logic gate-level implementation scheme into a plurality of physical circuit modules with a hierarchical connection relationship according to the data dependency relationship among the bit operation sequences, so that all the physical circuit modules jointly form a component structure suitable for multiple scenes. By adopting the method, the reliability and applicability of the communication system or equipment for executing the ZUC algorithm can be enhanced.

The invention discloses a storage and calculation integrated hardware accelerator and system based on high-density cache. In the accelerator, a storage unit array comprises a plurality of 2T eDRAM units, and a read word line decoder is used for selecting storage units storing operands to be operated from the storage unit array; the induction amplifier is used for reading an operand to be operated of the storage unit array as a digital signal according to a set reference voltage to obtain a corresponding logical operation result; the shifter is used for performing shifting operation on the logic operation result output by the induction amplifier as required; and the write bit line driving module is used for selecting an operation result from the output end of the induction amplifier or the output end of the shifter and storing the operation result to a corresponding storage unit of the storage unit array through write-back operation. According to the accelerator designed by the invention, an analog-to-digital converter is not needed, relatively high storage density can be achieved, large-scale logic parallel operation can be realized, addition and multiplication can also be realized, and an application scene is expanded.

The invention discloses a low-disturbance self-recovery operation method for a cross-point array ferroelectric memory, which is used for operating a cross-point array ferroelectric memory array, comprises four continuous pulse periods, and sequentially realizes selected memory unit activation, data reading, data recovery and reset operation. By using the low-disturbance self-recovery operation method provided by the invention, the voltage pulse disturbance suffered by unselected units in the operation process of the cross-point array ferroelectric capacitance memory can be reduced, and meanwhile, the function of automatically recovering the data of the ferroelectric capacitance memory is realized. According to the method, smaller read-write disturbance can be realized, the bit error rate is lower, and the access speed is higher.

A calculator for calculating a plurality of square roots includes a memory array, at least two registers, a bit subtractor, and a controller. The memory array is organized into columns and rows. The registers store a fixed value. The controller, operatively coupled to the other components, allocates a first set of rows to test variables and a second set to result variables, and initially stores each of a plurality of radicands in a separate column. For multiple iterations, the controller concurrently activates selections of rows to form current operands and current guesses for each column. The controller then instructs the bit subtractor to perform subtraction operations. For each column with a positive subtraction result, the controller selectively writes a new bit of the square root and selectively overwrites values with a new remainder derived from the subtraction result, without performing an explicit data-shifting operation.

A system and methods for determining compression performance of codebooks in resource-constrained computing environments using only integer operations. The system enables accurate prediction of compression performance without codebook generation on devices lacking floating-point units by utilizing bit manipulation techniques. Sourceblock occurrences are tracked using integer counters, with sum of squared probabilities calculated through integer multiplication. Logarithmic approximations are performed using most significant bit position analysis and bit-shifts replace division operations when sourceblock lengths are constrained to powers of 2. This approach requires minimal memory resources, just four integer registers beyond occurrence counters, making compression optimization viable on ultra-low-power 32-bit microcontrollers with less than 64 KB memory, such as those used in wearables and IoT devices, while maintaining accuracy within one bit of theoretical optimal performance.

The invention relates to a DAC digital calibration circuit and an implementation method thereof, and the circuit comprises a multiplier which is used for receiving DAC original conversion data and a slope calibration parameter for multiplication operation, and outputting a result bit width which comprises a DAC bit width and a calibration parameter bit width; the shift register is used for performing shift operation on the result output by the multiplier to obtain a decimal multiplication result to complete slope calibration; the adder is used for adding the decimal multiplication result output by the shift register with the zero calibration parameter and trimming the zero error; the selector is used for receiving an output result of the adder; if the high-order data is not 0, full-scale data of all 1 codes are selected to be output; otherwise, selecting the summator to output the result; and the data register is used for registering the result output by the selector. According to the invention, actual measurement analysis is carried out on the chip behind the flow sheet, then calibration and trimming parameters are determined, inherent errors of the chip are compensated, and higher precision is realized.

The embodiment of the invention provides a data transmission method, a shifter and an FPGA chip. The method comprises the following steps: setting a shift pointer; obtaining a valid data start pointer; according to the shift pointer and the valid data start pointer, shift operation information is determined, and the shift operation information is used for indicating a left shift number; performing a shift operation according to the shift operation information; updating the effective data length of the downstream module; under the condition that the effective data length of the downstream module is larger than or equal to the bit width of the downstream module, a target signal is generated, and the target signal is used for indicating the downstream module to take away data; after the downstream module takes away the data, the shift pointer is updated, and the valid data start pointer is updated. According to the technical scheme provided by the embodiment of the invention, under the condition that the effective data length of the downstream module is greater than or equal to the bit width of the downstream module, the downstream module is notified to take away the data in time, so that bit width adaptation is completed, an additional bit width adaptation module does not need to be arranged, and the logic resource consumption is reduced.

The invention discloses a binary MDS array code structure with high erasure correction performance and a decoding method, and the decoding method achieves the rapid calculation of a syndrome vector through an optimized scheduling algorithm, only needs the exclusive or and cyclic shift operation, reduces the calculation complexity to a linear level O (n), and remarkably improves the data recovery speed. Compared with a traditional RS code and an existing array code, high reliability is guaranteed, the technical problem that storage efficiency and calculation complexity are difficult to consider at the same time is solved, and the method is suitable for large-scale distributed storage scenes such as cloud computing and artificial intelligence training. According to the binary MDS array code structure with the high erasure performance and the decoding method, the fault-tolerant capability is improved to five-node failure, and the high-reliability storage requirement is met; the decoding calculation complexity is obviously reduced, and only xor and shift operations are needed; the storage efficiency reaches the upper bound of the MDS theory, and the storage cost is reduced; and efficient data recovery is realized under the configuration that the code length n is equal to 11 and the redundancy r is equal to 5.

A system and method for hardware-accelerated determination of hybrid codebook performance using FPGA implementation. The system transforms the mathematical operations of estimating combined performance of primary and secondary codebooks into dedicated hardware circuits on field-programmable gate arrays. By implementing specialized components for primary term calculation, secondary term calculation, and mismatch probability estimation directly in hardware, the system enables wire-speed performance estimation without generating test codebooks. The FPGA design comprises parallel processing paths, dedicated bit manipulation circuits for logarithmic approximation, and specialized memory structures for occurrence tracking. This hardware implementation enables real-time hybrid codebook optimization in high-throughput environments such as network appliances, storage controllers, and data processing systems, while providing a development pathway toward eventual ASIC implementation for mass-market deployment.

A method and apparatus for reducing computation time are disclosed herein which provides in at least one embodiment a computer-implemented method for reducing computation time, the computer-implemented method including the steps of: receiving one or more bits from a multiplier, generating a shift signal by using the one or more bits, performing a shift operation by n bits (where n is a natural number) based on the shift signal to obtain a partial product, and generating an output product by using the partial product and then outputting the output product.

The embodiment of the invention provides a quantum computing measurement and control system and a quantum computer, and relates to the technical field of quantum computing, and the system comprises a central control board card, a routing board card and a functional board card; the central control board card is connected with the routing board card through a plurality of first channels based on an LVDS protocol; the central control board card is used for decomposing the trigger signal into a first sub-signal; sending to a routing board card through each first channel; the routing board card is used for receiving each first sub-signal, splicing the first sub-signals in combination with the target position operation of each first channel to obtain a trigger signal, and sending the trigger signal to the functional board card through a second channel; the target bit operation is used for shifting the data received by each first channel, so that each piece of data in the processing result for the same sending moment is aligned; and the function board card is used for receiving the trigger signal and sending an execution signal aiming at the quantum bit to the quantum chip, so that the quantum chip executes the quantum calculation task. Low delay of data transmission among modules can be realized, and the stability of data transmission is ensured.

The present application relates to the field of computer application technology, and provides a method and hardware architecture for obtaining the greatest common divisor of large number expansion, including a control module, a GCD calculation unit, a Bézouté coefficient calculation unit, a first multiplexer, a second multiplexer, a termination module, and an input_valid signal. The GCD calculation unit and the Bézouté coefficient calculation unit are used to iteratively update intermediate variables according to the control signal of the control module. By introducing the δ parameter, the comparison of the sizes of the intermediate variables a and b is avoided. Based on the k-ary algorithm, the calculation and redundant form of the Bézouté coefficient are introduced. In hardware implementation, only simple addition, subtraction, and shift operations are required, which greatly reduces the time required for addition operations, thereby achieving the purpose of increasing the clock frequency, reducing the iteration cycle, and shortening the total running time.

The present invention provides an FPGA multiplier optimization method, which detects the actual effective bit width of data at two input ends, generates a bit width control signal, and selects a small bit width parallel calculation mode or a full bit width calculation mode based on the bit width control signal; in the small bit width parallel calculation mode, multiple groups of input data with effective bits of small bit width are sign-bit extended to generate parallel calculation data including sign bits, and the generated parallel calculation data are shifted and spliced ​​before being sent to a multiplier for parallel calculation; in the full bit width calculation mode, the data directly enters the multiplier for calculation. The present invention also provides an FPGA multiplier optimization device.

A computing device (101), method and computer program product herein for replicating a three-dimensional label mask (20) for a three-dimensional volumetric data set (190) in a network (100) of computing devices. The device (101) receives, from a further computing device (102) of the network, a series of segmented input data (21) describing an edit (2-1) of a tag mask (20) on the further computing device (102). The segment input data includes current location data, size data, and a tag identifier associated with a spherical segment object (102-1) used by the second computing device (102) to interactively edit the tag mask. A replicator module (101-10) replicates an edited tag mask of the further computing device (102) associated with the series of segmented input data by: calculating a respective ellipsoid corresponding to the spherical segmented object (102-1) stretched inversely proportional to the shape of voxels in the tag mask; determining voxels (vi) of a label mask having positions inside the segmented object on the basis of the ratio of the distance between the respective voxel position and the center position of the ellipsoid divided by the respective semi-axis length of the ellipsoid in all three dimensions, wherein the division is performed using a bitwise operation on a graphics processing unit of the computing device (101) to invert an index of each denominator; and updating the determined voxels in the replicated tag mask (10) in accordance with the tag identifier of the segmented input data (21).

The invention provides a method and a device for solving a time error in 2038. The method comprises the following steps: aiming at the condition that a kernel version of an operating system is smaller than a first preset version, responding to a first operation of a user, setting 64-bit time to obtain system calling and 64-bit time setting system calling, so that an application program obtains and sets 64-bit time, the bit number of RTC time is modified into 64 bits, and kernel time of the operating system comprises 64-bit time; when the application program is in the running state, the application program processes 64-bit time through a preset 64-bit time processing function, and the preset 64-bit time processing function is set in a source code of the application program. According to the method and the device, the operation system can directly process the 64-bit time by using the original kernel version without upgrading the kernel version, the scheme is simple, and the difficulty of processing the 64-bit time by the operation system is reduced.

A resource allocation method and device based on bitmap precalculation, the method comprising: generating a global resource state bitmap according to CORESET configuration in a PDCCH, precalculating a candidate pre-allocation bitmap set for each possible candidate PDCCH; extracting a corresponding pre-allocation bitmap from the candidate pre-allocation bitmap set as a candidate set bitmap; comparing the candidate set bitmap with the global resource state bitmap to determine whether the resources conflict, if the resources do not conflict, the resources are available, and then the resources are occupied. The present application transfers the complex function calculation at the scheduling time to the precalculation in the initialization stage, only needs simple bitmap retrieval and bit operation at the scheduling time, greatly shortens the PDCCH resource allocation time consumption, replaces the real-time intensive calculation by pre-storing the bitmap, significantly reduces the CPU load, focuses the processor on the core scheduling algorithm, reduces the resource redundancy consumption, and effectively improves the overall capacity and energy utilization efficiency of the communication system.

The application relates to an improved ABSPD clock recovery method under single baud rate sampling, clock synchronization of transceiving end signals is realized through a full-digital type clock recovery loop, a timing error detector is used to replace numerical multiplication operation with symbol judgment and shift operation when calculating timing error e; after the timing error e is calculated by the timing error detector, the timing error e is input into a loop filter to remove noise and control words W are obtained; then the control words W are used to control a digital controlled oscillator, fractional interval mu k is calculated from the output NCO of the digital controlled oscillator and the control words W k The integer mark m k of the symbol and the calculated fractional interval mu k The received signal is interpolated in an interpolation filter, so that timing correct data are calculated. The application realizes ABSPD clock recovery under single baud rate sampling without multiplication operation, and significantly reduces the complexity of the whole clock recovery loop.

This disclosure provides a data shifting operation method, apparatus, electronic device, and storage medium, relating to the field of data operation technology. The method includes: splitting a source operand into multiple sub-operands according to its bit width, determining the shift direction based on the shift type, and determining the segmented shift processing method based on the target shift amount, so that multiple shifting operation units perform shift operations on each sub-operand respectively; further, combining and concatenating the shift results across segments to obtain the target shift result. This technical solution, by transforming the shifting of high-bit-width data into a collaborative processing process of multiple low-bit-width data, and employing differentiated processing paths under different shift ranges, can reduce circuit implementation complexity, reduce hardware resource consumption, improve the reusability of shifting operation units, and enhance the flexibility and adaptability of the system structure while ensuring the consistency of shift semantics.

The invention provides a cyclic shift register, a data cyclic shift method and a storage medium, the cyclic shift register comprises a data input port, a data output port, a control port and a multi-stage processing network, and the multi-stage processing network is constructed by mixing basic units of 2 * 2 switching units or 2 * 1 multiplexers. Each stage of processing unit comprises a plurality of basic units, the plurality of basic units of each stage of processing unit are of the same type, at least two stages of processing units in the whole network adopt different types of basic units, and the plurality of basic units of each stage of processing unit are independently controlled by a common shift control word generation stage control signal. The cyclic shift operation can be quickly realized; according to the cyclic shift register, by means of a multi-stage parallel processing architecture, the data processing efficiency is greatly improved, the fan-out load and global connection pressure of a control signal are relieved while ultralow delay and high parallelism are kept, and key path delay and dynamic power consumption are remarkably reduced.

The invention discloses a short character string monotonic order-preserving materialized compression coding method, which comprises the following steps of: performing a series of bit operations such as byte inversion, length information embedding, logic right shift and high-order mask shielding on an original variable-length character string with a limited length, and losslessly mapping the original variable-length character string into a fixed-length integer value; the lexicographical order of the character string before and after mapping is completely consistent with the numerical order of the integer; according to the method, the fixed-length integer code is used for directly replacing an original character string to participate in sequencing, aggregation and comparison operation of the database, so that the problems of branch prediction failure, discontinuous memory access, vectorization difficulty and the like caused by processing variable-length data in a traditional scheme are greatly avoided, the memory occupancy is greatly reduced, and meanwhile, the vectorization efficiency is improved. And the CPU execution efficiency and the cache utilization rate are greatly improved.

The invention discloses a note positioning method and device, electronic equipment and a storage medium, and relates to the technical field of computers, in particular to the field of artificial intelligence such as natural language processing and intelligent documents. According to the specific implementation scheme, in response to detection of a backtracking positioning operation for a target note displayed in a first page, source positioning information of the target note is obtained; determining a target source of the target note according to the source positioning information; loading and displaying the target source in a second page; and controlling a display window of the second page to roll to a corresponding position of the target note in the target source according to the source positioning information.

This invention discloses a native parallel data packing method for 64-bit CPUs, belonging to the field of computer data representation and processing technology. This method packs eight 8-bit raw data columns into a standard 64-bit register, with each data column including 6 data bits and 2 carry bits. The raw data is expanded into a 64-bit data column through a bit extension step, and then packed into the 64-bit register using bit manipulation instructions to form 64-bit packed data. Inline functions are used to achieve zero function call overhead. The compiler automatically optimizes and generates efficient machine code, requiring no SIMD instruction set support. A lookup table method is used to achieve zero computational overhead packing; the lookup table contains 4096 entries. 64-byte cache row alignment is used to improve cache hit rate. Compared to traditional methods, packing and unpacking overhead is reduced by 6.6 times, from 11.3 ms to 1.7 ms. L1 cache hit rate is increased from 65% to 95%, memory access latency is reduced from 45 cycles to 12 cycles, and memory performance is improved by 3.75 times.

The invention discloses a computer data line connector capable of rotating by 360 degrees, relates to the technical field of computer data lines, and aims to solve the technical problem that the signal transmission stability of a data line is relatively weak. According to the invention, the performance and applicability are improved through multiple designs; the threading universal ball realizes omni-directional rotation and is matched with the inserting and fixing mechanism to lock the optimal angle, so that signal loss caused by bending is reduced, and stable data transmission is ensured; the elastic metal inserting arc and the latex wave-shaped elastic pulling section form double buffering, pulling force is absorbed, a circuit and a welding spot are protected, and the service life is prolonged; an integrated sliding sleeve linkage structure simplifies positioning operation, and convenience and stability are taken into consideration by utilizing the lever principle and mechanical locking; due to the convex rhombus twisting design of the screwing jacket, excessive bending is prevented, and the structural stability of the core wire is guaranteed; a twisted channel formed by the adjacent convex rhombus repels mice through a physical structure, and adapts to an outdoor complex environment; the overall design gives consideration to signal stability, durability and environmental adaptability, and meets the scene requirements of industrial control and the like.

This application provides a method, circuit, apparatus, electronic device, and readable storage medium for constructing a shuffle logic circuit, comprising: arranging an input conversion interface according to the bit width information of the data to be processed; designing a selector architecture according to the bit width information, the selector architecture including a decoder and a multi-level selection unit, the decoder being used to uniformly decode and generate control signals which are then input to the multi-level selection unit; the selector architecture being used to select and shift data bit groups to obtain shuffled recombined data; and constructing a shuffle logic circuit based on the input conversion interface and the selector architecture. Compared with related technologies, this application significantly reduces the circuit physical area and power consumption.

The invention provides a data processing method and device for in-network calculation, and the method comprises the steps: carrying out the format analysis of first data and second data based on a first preset bit width, unifying the bit width standard of the input data, solving the compatibility problem of a heterogeneous data source, enabling the adaptive first update data and second update data to be directly connected with a hardware acceleration unit, and enabling the data to be more uniform. And additional conversion overhead caused by bit width mismatching is avoided. The first updating data and the second updating data are split according to the second preset bit width, the precision range of an intermediate calculation result can be controlled, the overflow risk caused by direct multiplication of high-bit-width data is avoided, data partitioning processing is achieved, multiplication operation can be executed in parallel, the data size of single-time processing is reduced, the memory bandwidth pressure is reduced, and the data processing efficiency is improved. And the throughput of output processing is greatly improved. Product term accumulation is realized through a shift summation mode, and in combination with a hardware-friendly bit operation, multiplier resource occupation can be reduced, calculation delay can be reduced, and a pipeline calculation architecture can be adapted.