39results about How to "Suitable for realization" patented technology

The invention belongs to the technical field of wireless communication and relates to an iterative decoding device of an RS (Reed-solomon) cascading grid modulation code and a decoding method thereof. The device comprises a quantification unit, a ping-pong soft value read-write cache unit, a soft input Viterbi decoder, a state record unit, a deinterleaver, an RS decoder, a decoding state treatment unit, an interleaver and a soft value modification unit, wherein the ping-pong soft value read-write cache unit comprises a ping chamber soft value read-write cache subunit and a pong chamber soft value read-write cache subunit, receives a symbol soft value sent by the quantification unit, carries out Viterbi decoding on the symbol soft value and carries out deinterleave and RS decoding on the symbol soft value after decoding; and when part of decoding has errors, decoding information and mark information are fed back to the soft value modification unit after interleave, a soft value is modified based on the size of the corresponding symbol soft value, and next iteration is carried out until decoding is right. The invention has the advantages of little hardware resource consumption, low method complexity and high iteration gain and is more suitable for realizing hardware.

The invention discloses a decoding early termination method for low-density parity check codes. The method is characterized in that for a decoder utilizing belief propagation decoding algorithms, every time an iterative computation of side information which variable nodes transmit to check nodes is performed, firstly computed coding hard decision bits of every variable node is carried to the front of the most significant bit or the back of the least significant bit of the side information transmitted from the variable nodes to the check nodes which are connected with the variable nodes on bipartite graphs, accordingly combined information is formed and transmitted to the check nodes; and while information transmitted from the check nodes to the variable nodes is computed, every check node extracts the coding hard decision bits from the combined information transmitted from the variable nodes which are connected with the check nodes on the bipartite graphs and performs syndrome computation: if all syndromes are zero, the iterative decoding is terminated early. The decoding early termination method for the low-density parity check codes can guarantee the accuracy of decoding and simultaneously reduce the working time delay of the decoder as much as possible, thereby improving the working efficiency.

The invention discloses a transition coder applicable to HEVC ( high efficiency video coding) standards and mainly solves the problems of multiple use of multipliers and a complicated circuit in the prior art. The transition coder comprises a one-dimensional DCT (discrete cosine transformation) module (1), a transposition buffer module (2) and a top layer control module (3), wherein the one-dimensional DCT module (1) adopts a plurality of butterfly computing units and a plurality of odd coefficient processing units for completing each DCT in the HEVC standards, the odd coefficient processing units resolve the complicated multiply operation into multistage circuits and adopt a shifter, an adding device and a subtracter, i.e. the multistage shifter, the adding device and the subtracter are used for replacing a matrix multiplier, and the circuit structure is simplified. The transition coder has the advantages that the structure is simple and regular, the reusability is high, the key route is short, the lock frequency is high, and the integration is easy. The transition coding on video residual data is efficiently realized under the condition of not using the multipliers.

In the stack chain constituted by exchange chips, the normal forwarding flow of the data frames received by exchange chips passing through is as follows. (A) Data frames are received. (B) The protocol process of the frame and looking up the forwarding target port of the frame. (C) Determining whether the target port is the local port. If yes, the frame is sent to the target port through the flow (D). The characters are that before the flow (B), the stack process branch is setup to determine whether the source port is the stack port. At least for the data frame, whose source port is the stack port, the determination of whether the current chip is the end of the stack chain is carried out. If the current chip is not at the end of the stack chain, the data is sent to next stack port quickly.

The equipment part of this system includes at least a data sending net point, a data receiving net, a net link, RAIN device and a transferring net communicating between them. The RAIN device consists of 2/4/8 pieces of PPP physical link I/O ports, the processing branch, the stack branch, the exchanging part and the low cost redundancy net array comm. protocol. The method part of this system discloses practical steps to increase the bandwidth. It can be applied in numerous nets. Without the support of the accessing end, it piles efficiently up the bandwidth, manages the link and possesses efficient toleration ability. On the basis of the protocol, this system suits various business requirements and adds functions, such as the abnormal processing, authentication, encryption and QOS. Its practicability and reliability are good and it costs low.

The invention discloses a video image rotation method. In allusion to the video image rotation methods solely using forward rotation mapping or reverse rotation mapping in the prior art, the defects are improved; and the video image rotation method comprises the steps of carrying out forward rotation mapping at first to obtain two mapping segments on a display after caching two lines of original video images, obtaining coordinates of pixel points between the two mapping segments, carrying out reverse rotation mapping on the obtained coordinates of pixel points between the two mapping segments on the display, calculating the pixel value of each coordinate after the reverse rotation mapping, and assigning the obtained pixel values to corresponding pixel point coordinates on the display for displaying. According to the method, rotation can be carried out on the video images with rotation angles between 45 DEG and -45 DEG, so that the null points generated by solely using forward rotation are effectively avoided, the cache space is saved and the real-time performance of the video displaying is improved.

The invention discloses a single-emission tri-reception antenna radar anti-multipath scattering detection method. The method includes four steps of firstly selecting erect height of three antennas, secondly calculating the examination statistical magnitude according to the signals received by three reception antennas, thirdly calculating a detection threshold, and fourthly determining the existence of a target. A space diversity theory is used, a radar employs a means of single-emission tri-reception antennas to obtain observation signals under multipath conditions, and the target detection is realized with the maximum value of the absolute value of the difference of reception antenna echo power in pairs as the examination statistical magnitude to improve the radar target detection performance under anti-multipath conditions. The radar target detection performance under anti-multipath conditions is improved substantially. No modification for a radar transmitter is required, and only two reception antennas and two-path reception channels are additionally installed. Realization is easy, and the engineering applicability is high.

The invention discloses a blind identification method of the circulation code grouping length. When the grouping length n of (n, k) circulation codes with the message length k is identified, firstly, the frame length of circulation codes is determined to be fl, in addition, a factor i is taken from [3, fl] to be used as the grouping length to be grouped, Ni code characters can be obtained after the circulation codes are grouped, then, the proportion of effective code characters in the obtained Ni code characters is judged and counted, and the effective code characters refer to the code characters meeting the judging rules, wherein the maximum i value of the proportion of the effective code characters is identified into the grouping length n. The identification method of the invention has the advantages of simple principle, wide application range and the like. No matter the codes are system codes or non-system codes, are binary codes or multilevel codes, the grouping length can be identified by the method only if the codes are circulation codes meeting the circulation features and the frame length is known. At the same time, the method has a simple identification flow process, is very suitable for hardware realization, and is suitable for engineering application.

The invention discloses an image absolute ambiguity estimation method based on multi-scale reorganized DCT coefficients. DCT in 8*8 blocks is carried out on an interested image, and sixty-four coefficients of 8*8 blocks are divided into three scales and comprise ten coefficient sub-blocks. The coefficient sub-blocks of the same 8*8 DCT blocks are combined together and placed at the corresponding positions, and then a reorganized three-level multi-scale DCT coefficient image is obtained. An energy image of each level is built, the edge points in the energy images are found, all roof edge point, step edge points and fuzzy edge points are found, and the absolute ambiguity of the images is calculated according to the number of the roof edge point, the step edge points and the fuzzy edge points. The absolute ambiguity is calculated through the three-level multi-scale reorganized DCT coefficients, the accuracy is high, calculation is easy, the calculated amount is small, and the method is applicable to hardware implementation.

The invention discloses a pair of trousers having a knee protecting function and a making process of the trousers. The pair of trousers comprises an upper front sheet and a lower front sheet, whereinthe lower front sheet comprises a left lower front sheet and a right lower front sheet; the upper front sheet comprises a bottom edge dividing line, a left side stitch and a right side stitch; the bottom edge dividing line is composed of a left lower bottom edge dividing line and a right lower bottom edge dividing line; the left lower front sheet and the right lower front sheet comprise top edge dividing lines, inner dividing lines and outer side stitches; the top edge dividing lines of the left lower front sheet and the right lower front sheet are perpendicular to the corresponding inner dividing lines and the outer side stitches; the top edge dividing line of the left lower front sheet is connected to the left lower bottom edge dividing line of the upper front sheet in an overlapped mode; the top edge dividing line of the right lower front sheet is connected to the right lower bottom edge dividing line of the upper front sheet in an overlapped mode; the inner dividing line of the left lower front sheet is connected to the inner dividing line of the right lower front sheet in an overlapped mode; and an intersection point of the left lower bottom edge dividing line and the right lower bottom edge dividing line corresponds to the vertex of a knee of a human body. With the application of the trousers provided by the invention, effects of knee protecting and keeping knees warm canbe achieved; and the pair of trousers is convenient to take off and take on and is suitable for wearing outside.

The invention provides an arithmetic encoder sequence renormalization method used for image compression in a joint photographic experts group (JPEG) 2000 image compression standard. The method is characterized in that: an independent total shift step number prediction rule is added to obtain a total shift step number of a probability interval A, probability interval lower boundary C is shifted successively under three conditions of without byte output, single byte output and double bytes output, thus parameter calculation can be completed sequentially in one time after reading each pair of a context CX and a code value D, and iteration loop calculation is not needed. The arithmetic encoder renormalization process method of the present invention can substitute an original part seamlessly, and other links of an arithmetic coding algorithm are not needed to be changed; no interweaving determination exists between logic branches; computation burden is reduced, data reading efficiency is effectively raised, and hardware realization is facilitated.

The invention provides a method and device for removing impulse noise, and the method and device are applicable to the field of image noise reduction. The method comprises the steps that a to-be-filtered image is obtained; the image is subjected to filtering processing by means of a first class median filter, and a first filtering result obtained after the image is subjected to first median filtering is generated; according to original input data of the image and the first filtering result, one noise level coefficient is given to each pixel point of the image; the image is subjected to filtering by means of a second class median filter, and a second filtering result obtained after the image is subjected to second median filtering is generated; according to a pre-built mixed model and the noise level coefficients, the original input data is mixed with the second filtering result, and a mixed filtering result is output so as to remove the impulse noise in the image. The method and device is suitable for hardware implementation, and on the premise that the filtering result is kept to be not mutated, the image definition can be taken into consideration, and the impulse noise in the image can also be effectively removed.

The invention discloses a voice signal enhancement method, which can improve the accuracy of voice existence judgment so as to improve the accuracy of noise estimation and effectively eliminate music noise in a voice signal. The method comprises the following steps of: acquiring a noisy voice signal which comprises additive noise, converting a time domain signal into a frequency domain signal by adopting a weighted splicing addition filter bank, updating a power spectrum estimation value of the additive noise signal by adopting a noise estimation algorithm provided by the invention, and performing spectral subtraction of a power spectrum on noisy voice by adopting a multi-sub-band spectral subtraction algorithm to obtain a power spectrum estimation value of pure voice, and restoring the frequency domain signal of the pure voice by using the phase of the noisy speech and the estimated value of the amplitude spectrum of the pure voice, and converting the frequency domain signal into a time domain signal again by using a weighted lap joint addition filter bank to obtain the pure voice after voice enhancement.