Back to results
US 11,456,819 B2Granted
Partial pseudo-randomization processing method, and corresponding apparatus and device, and storage medium
AssigneeZte Corporation
InventorsYuzhou Hu, Zhifeng Yuan, Weimin Li, Jianqiang Dai, Li Tian, Hong Tang
Life of this patent
Estimating the term…
Abstract
Provided are a partial pseudo-randomization processing method, a corresponding apparatus, a device and a storage medium. The method includes performing pseudo-randomization processing on part of N bits b1, b2, . . . , bN to generate new N bits d1, d2, . . . , dN; and encoding the d1, d2, . . . , dN.
Claims20
A partial pseudo-randomization processing method, applied to a transmitting side, comprising:
- performing, by the transmitting side, pseudo-randomization processing on part of N bits b1, b2, . . . , bN to generate new N bits d1, d2, . . . , dN;
- encoding, by the transmitting side, the d1, d2, . . . , dN to obtain encoded N bits;
- and
- sending, by the transmitting side, the encoded N bits to a receiving side,
- wherein the performing, by the transmitting side, pseudo-randomization processing on part of N bits b1, b2, . . . , bN to generate new N bits d1, d2, . . . , dN comprises:
- assuming that the b1, b2, . . . , bN comprises K bits b1R, b2R, . . . , bKR and other (N−K) bits d1U, d2U, . . . , dN−KU;
- assuming that the d1, d2, . . . , dN comprises K bits d1R, d2R, . . . , dNR and other (N−K) bits d1U, d2U, . . . , dN−KU;
- generating, by a scrambling code generator, a pseudo-random sequence c1, c2, . . . cK of length K;
- performing scrambling processing on the b1R, b2R, . . . , bKR by using the pseudo-random sequence c1, c2, . . . , cK of length K to generate the d1R, d2R, . . . , dKR;
- and
- taking the b1U, b2U, . . . , bN−KU as the d1U, d2U, . . . , dN−KU;
- wherein generation of the pseudo-random sequence c1, c2, . . . , cK of length K is determined by the b1U, b2U, . . . , bN−KU, or jointly determined by the b1U, b2U, . . . , bN−KU and information S agreed with the receiving side, or jointly determined by the b1U, b2U, . . . , bN−KU and a bit sequence M agreed with the receiving side;
- wherein K is greater than 0 and less than or equal to N.
10 more elements
A partial pseudo-randomization processing method, applied to a receiving side, comprising:
- receiving, by the receiving side, encoded N bits sent by a transmitting side;
- decoding, by the receiving side, the encoded N bits;
- and
- performing, by the receiving side, pseudo-randomization removing processing on K bits among the decoded N bits, to recover N bits before pseudo-randomization processing is performed on a transmitting side;
- wherein K is greater than 0 and less than or equal to N,
- wherein the performing, by the receiving side, pseudo-randomization removing processing on K bits among the decoded N bits comprises:
- generating, by a scrambling code generator, a pseudo-random sequence of length K;
- performing descrambling processing on the K bits by using the pseudo-random sequence of length K,
- wherein generation of the pseudo-random sequence of length K is determined by other (N−K) bits among the decoded N bits, or jointly determined according to other (N−K) bits among the decoded N bits and information S agreed between the transmitting side and the receiving side;
- or jointly determined according to other (N−K) bits among the decoded N bits and a bit sequence M agreed between the transmitting side and the receiving side.
7 more elements
Dependencies are inferred from the claim text.