WO2012079358A1 - Data processing method, apparatus and system - Google Patents

Data processing method, apparatus and system Download PDF

Info

Publication number
WO2012079358A1
WO2012079358A1 PCT/CN2011/076327 CN2011076327W WO2012079358A1 WO 2012079358 A1 WO2012079358 A1 WO 2012079358A1 CN 2011076327 W CN2011076327 W CN 2011076327W WO 2012079358 A1 WO2012079358 A1 WO 2012079358A1
Authority
WO
WIPO (PCT)
Prior art keywords
bit
data sequence
scrambling code
seed
scrambling
Prior art date
Application number
PCT/CN2011/076327
Other languages
French (fr)
Chinese (zh)
Inventor
段灿
许进
徐俊
Original Assignee
中兴通讯股份有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2012079358A1 publication Critical patent/WO2012079358A1/en

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/06Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
    • H04L9/065Encryption by serially and continuously modifying data stream elements, e.g. stream cipher systems, RC4, SEAL or A5/3
    • H04L9/0656Pseudorandom key sequence combined element-for-element with data sequence, e.g. one-time-pad [OTP] or Vernam's cipher
    • H04L9/0662Pseudorandom key sequence combined element-for-element with data sequence, e.g. one-time-pad [OTP] or Vernam's cipher with particular pseudorandom sequence generator
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/09Error detection only, e.g. using cyclic redundancy check [CRC] codes or single parity bit
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L2209/00Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
    • H04L2209/34Encoding or coding, e.g. Huffman coding or error correction

Definitions

  • WLANs Wireless Local Area Networks
  • IEEE802.il is one of the mainstream technologies of wireless LAN. This protocol mainly specifies the physical layer (PHY) and media access control (MAC) layer specifications.
  • the channel coding process is as follows: The data information is scrambled by a sequence of random codes and then modulated into OFDM symbols by coding, spatial shunting, modulation, mapping, OFDM modulation, etc., and then transmitted.
  • the scrambling code seed is the initial state of the scrambling code generator.
  • the scrambling code seed at the transmitting end obtains the scrambling code sequence through the scrambling code generator, and then adds 4 to the data information.
  • the scrambling code sequence is obtained by the same 4 semaphore seed and 4 sigma generator as the transmitting end, and the decoding information is used to implement descrambling.
  • the receiving end scrambling code seed is notified by the transmitting end, and if the scrambling code seed has an error during the transmission, the data error after descrambling is caused.
  • the main object of the present invention is to provide a data processing method, device and system. To solve the above problem.
  • a data processing method comprises: scrambling a data sequence using a scrambling code seed, wherein the data sequence carries a parity bit, the parity bit is used to verify the scrambling code seed; and the scrambled data sequence is transmitted.
  • the check bits are used to verify a portion of the bits in the scrambling code seed.
  • the partial bits are bits out of the bits in the 4 sigma seed except for the bits corresponding to the tap position of the 4 sigma generator.
  • Scrambling the data sequence using the scrambling code seed includes: generating a random scrambling code sequence using the scrambling code seed; scrambling the data sequence using the random scrambling code sequence. ⁇ Verify the scrambling seed by parity.
  • the data processing method according to the present invention comprises: receiving a scrambled data sequence, wherein the scrambled data sequence uses a scrambling code seed to scramble the data sequence, the data sequence carries a check digit, and the check digit is used. Checking the scrambling code seed; determining that the check digit is correct; using the scrambling code seed to solve the scrambled data sequence.
  • the check digit When the check digit is used to check a part of the bits in the scrambling code seed, it is determined that the check digit is correctly included: using all the bits in the bits in the 4 sigma seed to determine that the school-risk is correct , wherein some of the bits are bits other than the bits corresponding to the 4th code generator tap position in the 4th code seed.
  • determining the check bit correctly comprises: using a part of the bits in the scrambling code seed to determine that the check bit is correct, wherein The partial bits are bits out of the bits in the 4 sigma seed except for the bits corresponding to the tap position of the 4 sigma generator.
  • a data processing apparatus includes: a scrambling module configured to scramble a data sequence using a scrambling code seed, wherein the data sequence carries a parity bit, the parity bit is used to verify the scrambling code seed; the transmitting module, setting To send a scrambled data sequence.
  • a data processing apparatus is also provided.
  • the data processing apparatus comprises: a receiving module configured to receive the scrambled data sequence 'J, wherein the scrambled data sequence scrambles the data sequence using the scrambling code seed, and the data sequence carries the school
  • the check bit is used to check the scrambling code seed; the determining module is set to determine that the check bit is correct; the descrambling module is set to descramble the scrambled data sequence using the scrambling code seed.
  • a data processing system includes a transmitting end and a receiving end, wherein the transmitting end includes: a scrambling module configured to scramble the data sequence using the scrambling code seed, wherein the data sequence carries a check digit, and the check bit is used for The scrambling code seed is sent; the sending module is configured to send the scrambled data sequence; the receiving end comprises: a receiving module, configured to receive the scrambled data sequence; a determining module, configured to determine that the check digit is correct; the descrambling module , set to descramble the scrambled data sequence using the scrambling code seed.
  • the invention solves the error in the transmission process of the scrambling code seed in the related art by carrying the check digit in the data sequence by the transmitting end and verifying the scrambling code seed by using the check bit by the receiving end, thereby causing the descrambling error
  • the problem of data error can ensure the correctness of the scrambling code seed and avoid the data error.
  • FIG. 1 is a flow chart 1 of a data processing method according to an embodiment of the present invention.
  • FIG. 2 is a second flowchart of a data processing method according to an embodiment of the present invention
  • Figure 4 is a flow chart of a data processing method according to a preferred embodiment of the present invention
  • Figure 5 is a flow chart of a data processing method according to a preferred embodiment 2 of the present invention
  • Figure 6 is a flowchart of a preferred embodiment of the present invention.
  • 7 is a flowchart of a data processing method according to a preferred embodiment 4 of the present invention
  • FIG. 8 is a block diagram showing the structure of a data processing apparatus according to an embodiment of the present invention
  • FIG. 9 is a block diagram showing the structure of a data processing apparatus according to an embodiment of the present invention.
  • FIG. 10 is a block diagram showing the structure of a data processing system according to an embodiment of the present invention.
  • DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS It should be noted that the embodiments in the present application and the features in the embodiments may be combined with each other without conflict. The invention will be described in detail below with reference to the drawings in conjunction with the embodiments.
  • the embodiment of the invention provides a data processing method.
  • 1 is a flow chart 1 of a data processing method according to an embodiment of the present invention. As shown in FIG. 1, the following steps include a step S1 to a step S4.
  • Step S102 Scrambling the data sequence by using the scrambling code seed, wherein the data sequence carries a check digit, wherein the school-risk is used for the school-risk 4 special code seed.
  • Step S104 Send the scrambled data sequence.
  • the scrambling code seed may have an error during transmission, thereby causing data error after descrambling.
  • the check bit can be used to check whether the scrambling code seed is correctly transmitted. Therefore, the transmitting end carries the school-risk position in the data sequence and uses the school-risk position to pass the risk through the receiving end. You code seed, can guarantee the correctness of the 4 special code seeds, thus avoiding the solution of the 4 special data.
  • the check bits are used to verify a portion of the bits in the scrambling code seed.
  • the effect of adding 4 especially to the school-risk position is such that when the school-risk is used for a part of the bits in the school-risk 4 special code seed, the scrambled check bit is used. Is the verification of all bits.
  • the partial bits are the bits of the bits in the scrambling code seed that are removed from the bits corresponding to the tap position of the scrambling code generator.
  • scrambling the data sequence using the scrambling code seed comprises: generating a random scrambling code sequence using the scrambling code seed; scrambling the data sequence using the random scrambling code sequence.
  • the odd-school-risk method is used to remedy the 4 yards seed.
  • the scrambling code seed is verified by means of parity, and the implementation manner is simple and reliable.
  • the embodiment of the invention provides a data processing method. 2 is a second flowchart of a data processing method according to an embodiment of the present invention. As shown in FIG. 2, the following steps include step S202 to step 4: S206. Step S202, receiving the scrambled data sequence, wherein the scrambled data sequence uses a scrambling code seed to scramble the data sequence, where the data sequence carries the scrambling code seed and the check digit, and the check digit is used for Verify the scrambling code seed.
  • step S204 it is determined that the school-risk position is correct.
  • step S206 using the scrambling code seed to descramble the scrambled data sequence.
  • determining the parity bit correctly comprises: determining the parity bit using all of the bits in the scrambling code seed Correctly, some of the bits are bits in the bits in the scrambling code seed except for the bits corresponding to the tap position of the scrambling code generator.
  • determining the check digit correctly comprises: using a part of the bits in the scrambling code seed to determine the school The bit is correctly verified, and some of the bits are bits other than the bit corresponding to the bit position of the scrambling code generator in the bit in the scrambling code seed.
  • 4 is a flowchart of a data processing method according to a preferred embodiment of the present invention. As shown in FIG. 4, the transmitting end needs to transmit data with a length of 108 bits, wherein the first 7 bits plus 4 especially the front 0 are used to save 4
  • the code generator seed is 1001001 and the information bit is 100 bits.
  • FIG. 5 is a flowchart of a data processing method according to a preferred embodiment 2 of the present invention. As shown in FIG.
  • the transmitting end needs to transmit data with a length of 3080 bits, wherein the first 7 bits plus 4 are especially used for 0.
  • FIG. 6 is a flowchart of a data processing method according to a preferred embodiment 3 of the present invention. As shown in FIG. 6, the transmitting end needs to transmit data with a length of 10016 bits, wherein the first 7 bits plus 4 are especially used for 0.
  • FIG. 7 is a flowchart of a data processing method according to a preferred embodiment 4 of the present invention.
  • the transmitting end needs to transmit data with a length of 25201 bits, wherein the first seven bits are 4 ⁇ seeds, and the information bits 25193 bit, then set the seven-bit scrambling code seed to 1100001 when scrambling.
  • FIG. 8 is a block diagram showing the structure of a data processing apparatus according to an embodiment of the present invention. As shown in FIG. 8, a scrambling module 82 and a transmitting module 84 are included. This will be described in detail below.
  • the scrambling module 82 is configured to scramble the data sequence by using the scrambling code seed, wherein the scrambled data sequence carries a check digit, where the check digit is used to check the scrambling code seed; the sending module 84 is connected to the adding The scrambling module 82 is configured to send the scrambled data sequence by the scrambling module 82.
  • the embodiment of the invention provides a data processing device, which can be used to implement the above data processing method.
  • 9 is a structural block diagram 2 of a data processing apparatus according to an embodiment of the present invention, such as As shown in FIG. 9, the receiving module 92, the determining module 94 and the descrambling module 96 are included. This will be described in detail below.
  • the receiving module 92 is configured to receive the scrambled data sequence, wherein the scrambled data sequence uses a scrambling code seed to scramble the data sequence, where the data sequence carries a check digit, and the check digit is used for verifying a scrambling seed; a determining module 94, coupled to the receiving module 92, configured to determine that the school-risk bit received by the receiving module 92 is correct; a solution 4 module 96, coupled to the determining module 94, configured to be used after the determining module 94 determines The scrambling seed descrambles the scrambled data sequence.
  • the embodiment of the invention provides a data processing system, which can be used to implement the above data processing method. FIG.
  • the sending end 1002 includes: a 4 special module 10022, configured to scramble the data sequence by using 4 special code seeds, wherein the scrambled data sequence carries the scrambling code seed and the check digit, wherein the check digit is used for verifying
  • the receiving module 10024 is configured to send the scrambled data sequence that carries the scrambling code seed and the check bit of the carrying module 10022.
  • the receiving end 1004 includes: a receiving module 10042, configured to receive the scrambling The subsequent data sequence; the determining module 10044 is connected to the receiving module 10042, and is configured to determine that the school-risk bit received by the receiving module 10042 is correct; the solution 4 module 10046 is connected to the determining module 10044, and is set to be determined by the determining module 10044, The scrambled data sequence is descrambled using the scrambling code seed.
  • the transmitting end carries the check digit in the data sequence and uses the check bit to check the scrambling code seed by the receiving end, which solves the error in the transmission process of the scrambling code seed in the related art, thereby causing data error after descrambling.
  • the problem is that the correctness of the scrambling code seed can be guaranteed, thereby avoiding descrambling data errors.
  • modules or steps of the present invention can be implemented by a general-purpose computing device, which can be concentrated on a single computing device or distributed over a network composed of multiple computing devices. Alternatively, they may be implemented by program code executable by the computing device, such that they may be stored in the storage device by the computing device, or they may be Each of the integrated circuit modules is fabricated separately, or a plurality of modules or steps thereof are fabricated into a single integrated circuit module. Thus, the invention is not limited to any specific combination of hardware and software.
  • the above is only the preferred embodiment of the present invention, and is not intended to limit the present invention, and various modifications and changes can be made to the present invention. Any modifications, equivalent substitutions, improvements, etc. made within the scope of the present invention are intended to be included within the scope of the present invention.

Abstract

The present invention discloses a data processing method, apparatus and system. The method includes: scrambling a data sequence by using a scrambling seed, wherein the data sequence carries a check bit which is used to check the scrambling seed (S102); and transmitting the scrambled data sequence (S104). The present invention can ensure the validity of scrambling seeds, thus avoiding mistakenly descrambling data.

Description

数据处理方法、 装置及系统 技术领域 本发明涉及通信领域, 具体而言, 涉及一种数据处理方法、 装置及系统。 背景技术 无线局 i或网络 ( Wireless Local Area Networks , 简称为 WLAN ) 是应用无 线通信技术将计算机设备互联起来, 构成可以互相通信和实现资源共享的网络 体系。 无线局域网本质的特点是不再使用通信电缆将计算机与网络连接起来, 而是通过无线的方式连接, 从而使网络的构建和终端的移动更加灵活。 IEEE802. il是目前无线局域网的主流技术之一,此协议主要规定物理层( PHY ) 和媒体访问控制 (MAC ) 层规范。 随着移动通信技术的发展以及人们对无线网络的需求的提高, 物理层技术 规范向着速率越来越高的方向不断发展, 经历了 802.11 到 802.11b 再到 802. Ha/g, 然后 802.11η, 最后到 802. llac的发展历程。 信道编码流程如下: 数据信息经一序列随机码加扰后再经过编码、空间分流、调制、映射、 OFDM 调制等操作调制为 OFDM符号从而发送出去。 扰码种子即扰码发生器初始态, 在发送端扰码种子通过扰码生成器得到扰 码序列, 再对数据信息进行加 4尤。 在接收端则由和发送端相同的 4尤码种子和 4尤 码发生器得到扰码序列, 作用于译码信息实现解扰。 相关技术中, 接收端扰码种子是由发送端通知的, 如果扰码种子在传输过 程中出现错误, 则会引起解扰后的数据错误。 发明内容 针对相关技术中扰码种子在传输过程中出现错误, 从而引起解扰后的数据 错误的问题而提出本发明, 为此, 本发明的主要目的在于提供一种数据处理方 法、 装置及系统, 以解决上述问题。 为了实现上述目的, 根据本发明的一个方面, 提供了一种数据处理方法。 根据本发明的数据处理方法包括: 使用扰码种子对数据序列进行加扰, 其 中数据序列中携带校验位,校验位用于校验扰码种子;发送加扰后的数据序列。 校验位用于校验扰码种子中的比特位中的部分比特位。 部分比特位为 4尤码种子中的比特位中的除去 4尤码发生器抽头位置所对应 比特位之外的比特位。 使用扰码种子对数据序列进行加扰包括: 使用扰码种子生成随机扰码序 列; 使用随机扰码序列对数据序列进行加扰。 釆用奇偶校验的方式校验扰码种子。 为了实现上述目的,根据本发明的一个方面,还提供了一种数据处理方法。 根据本发明的数据处理方法包括: 接收到加扰后的数据序列, 其中加扰后 的数据序列是使用扰码种子对数据序列进行加扰的, 数据序列中携带校验位, 校验位用于校验扰码种子; 确定校验位正确; 使用扰码种子对加扰后的数据序 列进行解 4尤。 当校验位用于校验扰码种子中的比特位中的部分比特位时, 确定校验位正 确包括: 使用 4尤码种子中的比特位中的全部比特位, 确定校 -险位正确, 其中部 分比特位为 4尤码种子中的比特位中的除去 4尤码发生器抽头位置所对应比特位 之外的比特位。 当校验位用于校验扰码种子中的比特位中的全部比特位时, 确定校验位正 确包括: 使用扰码种子中的比特位中的部分比特位, 确定校验位正确, 其中部 分比特位为 4尤码种子中的比特位中的除去 4尤码发生器抽头位置所对应比特位 之外的比特位。 为了实现上述目的 ,根据本发明的另一个方面,提供了一种数据处理装置。 根据本发明的数据处理装置包括: 加扰模块, 设置为使用扰码种子对数据 序列进行加扰, 其中数据序列中携带校验位, 校验位用于校验扰码种子; 发送 模块, 设置为发送加扰后的数据序列。 为了实现上述目的, 根据本发明的另一个方面, 还提供了一种数据处理装 置。 根据本发明的数据处理装置包括: 接收模块, 设置为接收加扰后的数据序 歹' J , 其中加扰后的数据序列是使用扰码种子对数据序列进行加扰的, 数据序列 中携带校验位, 校验位用于校验扰码种子; 确定模块,设置为确定校验位正确; 解扰模块, 设置为使用扰码种子对加扰后的数据序列进行解扰。 为了实现上述目的, 居本发明的又一个方面,提供了一种数据处理系统。 根据本发明的数据处理系统包括发送端和接收端, 其中发送端包括: 加扰 模块,设置为使用扰码种子对数据序列进行加扰,其中数据序列中携带校验位, 校验位用于校验扰码种子; 发送模块, 设置为发送加扰后的数据序列; 接收端 包括: 接收模块, 设置为接收加扰后的数据序列; 确定模块, 设置为确定校验 位正确; 解扰模块, 设置为使用扰码种子对加扰后的数据序列进行解扰。 本发明通过发送端在数据序列中携带校验位并通过接收端使用该校验位 校验该扰码种子, 解决了相关技术中扰码种子在传输过程中出现错误, 从而引 起解扰后的数据错误的问题, 从而可以保证该扰码种子的正确性, 进而避免解 扰数据错误。 附图说明 此处所说明的附图用来提供对本发明的进一步理解, 构成本申请的一部 分, 本发明的示意性实施例及其说明用于解释本发明, 并不构成对本发明的不 当限定。 在附图中: 图 1是根据本发明实施例的数据处理方法的流程图一; 图 2是根据本发明实施例的数据处理方法的流程图二; 图 3是根据本发明优选实施例一的扰码生成式的示意图; 图 4是根据本发明优选实施例一的数据处理方法的流程图; 图 5根据本发明优选实施例二的数据处理方法的流程图; 图 6根据本发明优选实施例三的数据处理方法的流程图; 图 7根据本发明优选实施例四的数据处理方法的流程图; 图 8是根据本发明实施例的数据处理装置的结构框图一; 图 9是根据本发明实施例的数据处理装置的结构框图二; 图 10是才艮据本发明实施例的数据处理系统的结构框图。 具体实施方式 需要说明的是, 在不冲突的情况下, 本申请中的实施例及实施例中的特征 可以相互组合。 下面将参考附图并结合实施例来详细说明本发明。 本发明实施例提供了一种数据处理方法。 图 1是根据本发明实施例的数据 处理方法的流程图一, 如图 1所示, 包括如下的步 4聚 S 102至步 4聚 S 104。 步骤 S 102 , 使用扰码种子对数据序列进行加扰, 其中数据序列中携带校验 位, 其中校-险位用于校-险 4尤码种子。 步骤 S 104 , 发送加扰后的数据序列。 相关技术中, 扰码种子在传输过程中可能出现错误, 从而引起解扰后的数 据错误。 本发明实施例中, 校验位可以用于校验扰码种子是否传输正确, 因此, 通过发送端在数据序列中携带校-险位并通过接收端使用该校-险位校 -险该 4尤码 种子, 可以保证该 4尤码种子的正确性, 从而避免解 4尤数据错误。 优选地, 校验位用于校验扰码种子中的比特位中的部分比特位。 本优选实施例中, 利用加 4尤对校 -险位的影响, 使得当校-险位用于校-险 4尤码 种子中的比特位中的部分比特位时, 加扰后的校验位是对全部比特的校验。 优选地, 部分比特位为扰码种子中的比特位中的除去扰码发生器抽头位置 所对应比特位之夕卜的比特位。 优选地, 使用扰码种子对数据序列进行加扰包括: 使用扰码种子生成随机 扰码序列; 使用随机扰码序列对数据序列进行加扰。 优选地, 釆用奇偶校 -险的方式校-险 4尤码种子。 本优选实施例中, 釆用奇偶校验的方式校验扰码种子, 其实现方式简单、 可靠。 本发明实施例提供了一种数据处理方法。 图 2是根据本发明实施例的数据 处理方法的流程图二, 如图 2所示, 包括如下的步 4聚 S202至步 4聚 S206。 步骤 S202 ,接收到加扰后的数据序列, 其中加扰后的数据序列是使用扰码 种子对数据序列进行加扰的, 该数据序列中携带扰码种子和校验位, 校验位用 于校验扰码种子。 步骤 S204 , 确定校 -险位正确。 步骤 S206 , 使用扰码种子对加扰后的数据序列进行解扰。 优选地, 当校验位用于校验扰码种子中的比特位中的部分比特位时, 确定 校验位正确包括:使用扰码种子中的比特位中的全部比特位,确定校验位正确, 其中部分比特位为扰码种子中的比特位中的除去扰码发生器抽头位置所对应 比特位之外的比特位。 优选地, 当校-险位用于校-险 4尤码种子中的比特位中的全部比特位时, 确定 校验位正确包括:使用扰码种子中的比特位中的部分比特位,确定校验位正确, 其中部分比特位为扰码种子中的比特位中的除去扰码发生器抽头位置所对应 比特位之外的比特位。 下面将结合实例对本发明实施例的实现过程进行详细描述。 需要说明的是, 下述优选实施例都可以基于 IEEE802.11 系统。 优选实施例一 图 3是根据本发明优选实施例一的扰码生成式的示意图, 如图 3所示, 扰 码生成式为: S(x) = x7 + x4 + l。 图 4是根据本发明优选实施例一的数据处理方法的流程图, 如图 4所示, 发送端需要传送长为 108比特的数据, 其中前 7位加 4尤前置 0用以保存 4尤码发 生器种子为 1001001 , 信息比特 100位。 设 4尤码生成式为: S(x) = x7 + x4 + l (如图 3所示)。 设置数据序列第 8位为奇校验位且为全部比特校验, 则数据序列第 8位为 Β70λ23456+\ = 1+0+0+ 1+0+0+1+0=0 , 由随机 4尤码种子生成 扰码序列并对数据加扰。 加扰后数据序列第 8位校验位 S7 =B7+ s7 =0+1+1=0, 若在接收端译码后 未解 4尤数据序列前七位 4尤码种子为 1001011, 第 8位为 0, 由 4尤码种子得到 4尤 码序列第 8位为 0, 不满足部分比特奇校验, 则扰码种子传输出错, 需重传。 优选实施例二 图 5根据本发明优选实施例二的数据处理方法的流程图, 如图 5所示, 发 送端需要传送长为 3080比特的数据, 其中前 7位加 4尤前置 0用以保存 4尤码发 生器种子, 信息比特 3054位, 第 9位到 16位为保留位全部置 1, 则加扰时设 置七位 4尤码种子为 0101010。 设 4尤码生成式为: S(x) = x7+x4 + l (如图 3所示)。 设置数据序列第 8位为奇校验且为部分比特校验, 则数据序列第 8位为除 与 4尤 码 发 生 器 对 应 位 的 4尤 码 种 子 其 余 位 的 异 或 : Β7λ2456+\ =1+0+0+ 1+0+ 1=1, 再由随机 4尤码种子生成 4尤码序列 并对数据加 4尤。 加扰后数据序列第 8位校验位 S7 =B7+ s7 =1+0+1=0, 若在接收端译码后 未解 4尤数据序列前七位 4尤码种子为 0101010, 第 8位校-险位为 0, 则不需解 4尤 可判断满足奇校验, 则扰码种子传输正确。 优选实施例三 图 6根据本发明优选实施例三的数据处理方法的流程图, 如图 6所示, 发 送端需要传送长为 10016比特的数据, 其中前 7位加 4尤前置 0用以保存 4尤码发 生器种子, 信息比特 10000位, 第 9位到 16位为保留位全部置 1, 前 16位统 称服务域, 则加扰时设置七位扰码种子为 0100111。 设 4尤码生成式为: S(x) = x7+x4 + l (如图 3所示)。 设置数据序列第 8位为偶校验且为部分比特校验, 则数据序列第 8位为除 与 4尤 码 发 生 器 对 应 位 的 4尤 码 种 子 其 余 位 的 异 或 : Β7λ2456 = 1+0+1+1+1=0,再由随机 4尤码种子生成 4尤码序列并对数 据加 4尤。 加扰后数据序列第 8位校验位为 ^ = + ^ =0+0+0=0 , 若在接收端译码后 未解 4尤数据序列前七位 4尤码种子为 0100011, 第 8位校-险位为 0, 则不需解 4尤 可判断不满足偶校验, 则扰码种子传输错误。 优选实施例四 图 7根据本发明优选实施例四的数据处理方法的流程图, 如图 7所示, 发 送端需要传送长为 25201比特的数据,其中前七位为 4尤码种子,信息比特 25193 位, 则加扰时设置七位扰码种子为 1100001。 设 4尤码生成式为: S(x) = x7+x4 + l (如图 3所示)。 设置数据序列第 8位为偶校验且为全部比特校验, 则数据序列第 8位扰码 种子全部位的异或: 7 = + 2+ 4+ 5 + 6 = 1+1+0+0+0+0 +1=1, 再由随机 4尤 码种子生成扰码序列并对数据加扰。 加扰后数据序列第 8位校验位加扰后为 ^ =37 + ^ =1+1+0=0, 若在接收端 译码后未解 4尤数据序列前七位 4尤码种子为 1100001, 第 8位为 0, 则可判断满 足部分比特偶校验, 则扰码种子传输正确。 需要说明的是, 在附图的流程图示出的步骤可以在诸如一组计算机可执行 指令的计算机系统中执行, 并且, 虽然在流程图中示出了逻辑顺序, 但是在某 些情况下, 可以以不同于此处的顺序执行所示出或描述的步 4聚。 本发明实施例提供了一种数据处理装置, 该数据处理装置可以用于实现上 述数据处理方法。 图 8是根据本发明实施例的数据处理装置的结构框图一, 如 图 8所示, 包括加扰模块 82和发送模块 84。 下面对其进行详细描述。 加扰模块 82, 设置为使用扰码种子对数据序列进行加扰, 其中加扰后的数 据序列中携带校验位, 其中校验位用于校验扰码种子; 发送模块 84, 连接至加 扰模块 82, 设置为发送加扰模块 82加扰后的数据序列。 本发明实施例提供了一种数据处理装置, 该数据处理装置可以用于实现上 述数据处理方法。 图 9是根据本发明实施例的数据处理装置的结构框图二, 如 图 9所示, 包括接收模块 92 , 确定模块 94和解扰模块 96。 下面对其进行详细 描述。 接收模块 92 , 设置为接收加扰后的数据序列, 其中加扰后的数据序列是使 用扰码种子对数据序列进行加扰的, 该数据序列中携带校验位, 校验位用于校 验扰码种子; 确定模块 94 , 连接至接收模块 92 , 设置为确定接收模块 92接收 的校 -险位正确; 解 4尤模块 96 , 连接至确定模块 94 , 设置为在确定模块 94确定 之后, 使用扰码种子对加扰后的数据序列进行解扰。 本发明实施例提供了一种数据处理系统, 该数据处理系统可以用于实现上 述数据处理方法。 图 10 是根据本发明实施例的数据处理系统的结构框图, 如 图 10所示, 包括发送端 1002和接收端 1004 , 下面对其进行详细描述。 发送端 1002包括: 加 4尤模块 10022 , 设置为使用 4尤码种子对数据序列进行 加扰, 其中加扰后的数据序列中携带扰码种子和校验位, 其中校验位用于校验 扰码种子;发送模块 10024 ,连接至携带模块 10022 ,设置为发送携带模块 10022 携带扰码种子和校验位的加扰后的数据序列; 接收端 1004包括: 接收模块 10042 , 设置为接收加扰后的数据序列; 确定 模块 10044 , 连接至接收模块 10042 , 设置为确定接收模块 10042接收的校-险 位正确; 解 4尤模块 10046 , 连接至确定模块 10044 , 设置为在确定模块 10044 确定之后, 使用扰码种子对加扰后的数据序列进行解扰。 综上所述, 根据本发明的上述实施例, 提供了一种数据处理方法、 装置及 系统。 通过发送端在数据序列中携带校验位并通过接收端使用该校验位校验该 扰码种子, 解决了相关技术中扰码种子在传输过程中出现错误, 从而引起解扰 后的数据错误的问题, 从而可以保证该扰码种子的正确性, 进而避免解扰数据 错误。 需要说明的是, 装置实施例中描述的数据处理系统对应于上述的方法实施 例, 其具体的实现过程在方法实施例中已经进行过详细说明, 在此不再赞述。 显然, 本领域的技术人员应该明白, 上述的本发明的各模块或各步骤可以 用通用的计算装置来实现, 它们可以集中在单个的计算装置上, 或者分布在多 个计算装置所组成的网络上, 可选地, 它们可以用计算装置可执行的程序代码 来实现, 从而, 可以将它们存储在存储装置中由计算装置来执行, 或者将它们 分别制作成各个集成电路模块, 或者将它们中的多个模块或步骤制作成单个集 成电路模块来实现。 这样, 本发明不限制于任何特定的硬件和软件结合。 以上所述仅为本发明的优选实施例而已, 并不用于限制本发明, 对于本领 域的技术人员来说, 本发明可以有各种更改和变化。 凡在本发明的 ^"神和原则 之内, 所作的任何修改、 等同替换、 改进等, 均应包含在本发明的保护范围之 内。 TECHNICAL FIELD The present invention relates to the field of communications, and in particular to a data processing method, apparatus, and system. BACKGROUND OF THE INVENTION Wireless Local Area Networks (WLANs) are wireless network technologies that interconnect computer devices to form a network system that can communicate with each other and share resources. The essence of WLAN is that the communication cable is no longer used to connect the computer to the network, but is connected wirelessly, so that the construction of the network and the movement of the terminal are more flexible. IEEE802.il is one of the mainstream technologies of wireless LAN. This protocol mainly specifies the physical layer (PHY) and media access control (MAC) layer specifications. With the development of mobile communication technology and the increasing demand for wireless networks, the physical layer specification has been moving toward higher and higher speeds, going from 802.11 to 802.11b to 802. Ha/g, then 802.11n, Finally, the development of 802. llac. The channel coding process is as follows: The data information is scrambled by a sequence of random codes and then modulated into OFDM symbols by coding, spatial shunting, modulation, mapping, OFDM modulation, etc., and then transmitted. The scrambling code seed is the initial state of the scrambling code generator. The scrambling code seed at the transmitting end obtains the scrambling code sequence through the scrambling code generator, and then adds 4 to the data information. At the receiving end, the scrambling code sequence is obtained by the same 4 semaphore seed and 4 sigma generator as the transmitting end, and the decoding information is used to implement descrambling. In the related art, the receiving end scrambling code seed is notified by the transmitting end, and if the scrambling code seed has an error during the transmission, the data error after descrambling is caused. SUMMARY OF THE INVENTION The present invention has been made in view of the problems in the prior art that a scrambling code seed has an error during transmission, thereby causing data error after descrambling. To this end, the main object of the present invention is to provide a data processing method, device and system. To solve the above problem. In order to achieve the above object, according to an aspect of the present invention, a data processing method is provided. The data processing method according to the present invention comprises: scrambling a data sequence using a scrambling code seed, wherein the data sequence carries a parity bit, the parity bit is used to verify the scrambling code seed; and the scrambled data sequence is transmitted. The check bits are used to verify a portion of the bits in the scrambling code seed. The partial bits are bits out of the bits in the 4 sigma seed except for the bits corresponding to the tap position of the 4 sigma generator. Scrambling the data sequence using the scrambling code seed includes: generating a random scrambling code sequence using the scrambling code seed; scrambling the data sequence using the random scrambling code sequence.校验 Verify the scrambling seed by parity. In order to achieve the above object, according to an aspect of the present invention, a data processing method is also provided. The data processing method according to the present invention comprises: receiving a scrambled data sequence, wherein the scrambled data sequence uses a scrambling code seed to scramble the data sequence, the data sequence carries a check digit, and the check digit is used. Checking the scrambling code seed; determining that the check digit is correct; using the scrambling code seed to solve the scrambled data sequence. When the check digit is used to check a part of the bits in the scrambling code seed, it is determined that the check digit is correctly included: using all the bits in the bits in the 4 sigma seed to determine that the school-risk is correct , wherein some of the bits are bits other than the bits corresponding to the 4th code generator tap position in the 4th code seed. When the check bit is used to check all the bits in the bit in the scrambling code seed, determining the check bit correctly comprises: using a part of the bits in the scrambling code seed to determine that the check bit is correct, wherein The partial bits are bits out of the bits in the 4 sigma seed except for the bits corresponding to the tap position of the 4 sigma generator. In order to achieve the above object, according to another aspect of the present invention, a data processing apparatus is provided. A data processing apparatus according to the present invention includes: a scrambling module configured to scramble a data sequence using a scrambling code seed, wherein the data sequence carries a parity bit, the parity bit is used to verify the scrambling code seed; the transmitting module, setting To send a scrambled data sequence. In order to achieve the above object, according to another aspect of the present invention, a data processing apparatus is also provided. The data processing apparatus according to the present invention comprises: a receiving module configured to receive the scrambled data sequence 'J, wherein the scrambled data sequence scrambles the data sequence using the scrambling code seed, and the data sequence carries the school The check bit is used to check the scrambling code seed; the determining module is set to determine that the check bit is correct; the descrambling module is set to descramble the scrambled data sequence using the scrambling code seed. In order to achieve the above object, in a further aspect of the invention, a data processing system is provided. A data processing system according to the present invention includes a transmitting end and a receiving end, wherein the transmitting end includes: a scrambling module configured to scramble the data sequence using the scrambling code seed, wherein the data sequence carries a check digit, and the check bit is used for The scrambling code seed is sent; the sending module is configured to send the scrambled data sequence; the receiving end comprises: a receiving module, configured to receive the scrambled data sequence; a determining module, configured to determine that the check digit is correct; the descrambling module , set to descramble the scrambled data sequence using the scrambling code seed. The invention solves the error in the transmission process of the scrambling code seed in the related art by carrying the check digit in the data sequence by the transmitting end and verifying the scrambling code seed by using the check bit by the receiving end, thereby causing the descrambling error The problem of data error can ensure the correctness of the scrambling code seed and avoid the data error. BRIEF DESCRIPTION OF THE DRAWINGS The accompanying drawings, which are set to illustrate,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,, 1 is a flow chart 1 of a data processing method according to an embodiment of the present invention; FIG. 2 is a second flowchart of a data processing method according to an embodiment of the present invention; Figure 4 is a flow chart of a data processing method according to a preferred embodiment of the present invention; Figure 5 is a flow chart of a data processing method according to a preferred embodiment 2 of the present invention; Figure 6 is a flowchart of a preferred embodiment of the present invention. a flow chart of three data processing methods; 7 is a flowchart of a data processing method according to a preferred embodiment 4 of the present invention; FIG. 8 is a block diagram showing the structure of a data processing apparatus according to an embodiment of the present invention; FIG. 9 is a block diagram showing the structure of a data processing apparatus according to an embodiment of the present invention. FIG. 10 is a block diagram showing the structure of a data processing system according to an embodiment of the present invention. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS It should be noted that the embodiments in the present application and the features in the embodiments may be combined with each other without conflict. The invention will be described in detail below with reference to the drawings in conjunction with the embodiments. The embodiment of the invention provides a data processing method. 1 is a flow chart 1 of a data processing method according to an embodiment of the present invention. As shown in FIG. 1, the following steps include a step S1 to a step S4. Step S102: Scrambling the data sequence by using the scrambling code seed, wherein the data sequence carries a check digit, wherein the school-risk is used for the school-risk 4 special code seed. Step S104: Send the scrambled data sequence. In the related art, the scrambling code seed may have an error during transmission, thereby causing data error after descrambling. In the embodiment of the present invention, the check bit can be used to check whether the scrambling code seed is correctly transmitted. Therefore, the transmitting end carries the school-risk position in the data sequence and uses the school-risk position to pass the risk through the receiving end. You code seed, can guarantee the correctness of the 4 special code seeds, thus avoiding the solution of the 4 special data. Preferably, the check bits are used to verify a portion of the bits in the scrambling code seed. In the preferred embodiment, the effect of adding 4 especially to the school-risk position is such that when the school-risk is used for a part of the bits in the school-risk 4 special code seed, the scrambled check bit is used. Is the verification of all bits. Preferably, the partial bits are the bits of the bits in the scrambling code seed that are removed from the bits corresponding to the tap position of the scrambling code generator. Preferably, scrambling the data sequence using the scrambling code seed comprises: generating a random scrambling code sequence using the scrambling code seed; scrambling the data sequence using the random scrambling code sequence. Preferably, the odd-school-risk method is used to remedy the 4 yards seed. In the preferred embodiment, the scrambling code seed is verified by means of parity, and the implementation manner is simple and reliable. The embodiment of the invention provides a data processing method. 2 is a second flowchart of a data processing method according to an embodiment of the present invention. As shown in FIG. 2, the following steps include step S202 to step 4: S206. Step S202, receiving the scrambled data sequence, wherein the scrambled data sequence uses a scrambling code seed to scramble the data sequence, where the data sequence carries the scrambling code seed and the check digit, and the check digit is used for Verify the scrambling code seed. In step S204, it is determined that the school-risk position is correct. Step S206, using the scrambling code seed to descramble the scrambled data sequence. Preferably, when the parity bit is used to check a part of the bits in the scrambling code seed, determining the parity bit correctly comprises: determining the parity bit using all of the bits in the scrambling code seed Correctly, some of the bits are bits in the bits in the scrambling code seed except for the bits corresponding to the tap position of the scrambling code generator. Preferably, when the school-risk bit is used for all the bits in the bit in the school-risk 4 semaphore seed, determining the check digit correctly comprises: using a part of the bits in the scrambling code seed to determine the school The bit is correctly verified, and some of the bits are bits other than the bit corresponding to the bit position of the scrambling code generator in the bit in the scrambling code seed. The implementation process of the embodiment of the present invention will be described in detail below with reference to examples. It should be noted that the following preferred embodiments may all be based on an IEEE 802.11 system. Preferred Embodiment 1 FIG. 3 is a schematic diagram of a scrambling code generation formula according to a preferred embodiment of the present invention. As shown in FIG. 3, the scrambling code generation formula is: S(x) = x 7 + x 4 + l. 4 is a flowchart of a data processing method according to a preferred embodiment of the present invention. As shown in FIG. 4, the transmitting end needs to transmit data with a length of 108 bits, wherein the first 7 bits plus 4 especially the front 0 are used to save 4 The code generator seed is 1001001 and the information bit is 100 bits. Let 4 special code generation be: S(x) = x 7 + x 4 + l (as shown in Figure 3). Set the 8th bit of the data sequence to the odd parity bit and check all the bits, then the 8th bit of the data sequence is Β 70λ23456 +\ = 1+0+0+ 1+0+0+1+0=0, the scrambling code sequence is generated from the random 4 semaphore seed and the data is scrambled. After the scrambling, the 8th parity bit of the data sequence S 7 =B 7 + s 7 =0+1+1=0, if the decoding is not decoded after the decoding of the receiving end, the first 7 digits of the 4th special code sequence is 1001011 The 8th bit is 0, and the 8th bit of the 4th code sequence is 0 from the 4th code seed. If the partial bit odd check is not satisfied, the scrambling code seed transmission error occurs and needs to be retransmitted. Preferred Embodiment 2 FIG. 5 is a flowchart of a data processing method according to a preferred embodiment 2 of the present invention. As shown in FIG. 5, the transmitting end needs to transmit data with a length of 3080 bits, wherein the first 7 bits plus 4 are especially used for 0. Save 4 special code generator seeds, information bits 3054 bits, the 9th to 16th bits are all reserved bits, then set the 7-bit 4 special code seed to 0101010 when scrambling. Let 4 special code generation be: S(x) = x 7 + x 4 + l (as shown in Figure 3). Setting the 8th bit of the data sequence to odd parity and partial bit check, the 8th bit of the data sequence is the exclusive OR of the remaining bits of the 4th code seed corresponding to the 4th code generator: Β 7λ + Β 2456 +\ =1+0+0+ 1+0+ 1=1, then generate 4 special code sequences from random 4 special code seeds and add 4 to the data. After the scrambling, the 8th parity bit of the data sequence S 7 =B 7 + s 7 =1+0+1=0, if the decoding is not decoded after the decoding of the receiving end, the first 7 digits of the 4th special code sequence is 0101010 The 8th school-risk is 0, then there is no need to solve 4, especially if the odd parity is satisfied, then the scrambling seed is transmitted correctly. Preferred Embodiment 3 FIG. 6 is a flowchart of a data processing method according to a preferred embodiment 3 of the present invention. As shown in FIG. 6, the transmitting end needs to transmit data with a length of 10016 bits, wherein the first 7 bits plus 4 are especially used for 0. Save 4 special code generator seeds, information bits 10000 bits, the 9th to 16th bits are all reserved bits, the first 16 bits are collectively referred to as the service domain, then the seven-bit scrambling code seed is set to 0100111 during scrambling. Let 4 special code generation be: S(x) = x 7 + x 4 + l (as shown in Figure 3). Setting the 8th bit of the data sequence to even parity and partial bit check, the 8th bit of the data sequence is the exclusive OR of the remaining bits of the 4th code seed corresponding to the 4th code generator: Β 7λ2456 = 1+0+1+1+1=0, then generate a 4 y code sequence from the random 4 yum seed and add 4 to the data. After the scrambling, the 8th parity bit of the data sequence is ^ = + ^ =0+0+0=0. If the decoding is not decoded after receiving the data, the first 7 digits of the data sequence are 0100011, 8th. If the position-risk is 0, then there is no need to solve the problem. In particular, it is judged that the even parity is not satisfied, and the scrambling code is transmitted incorrectly. Preferred Embodiment 4 FIG. 7 is a flowchart of a data processing method according to a preferred embodiment 4 of the present invention. As shown in FIG. 7, the transmitting end needs to transmit data with a length of 25201 bits, wherein the first seven bits are 4 尤码 seeds, and the information bits 25193 bit, then set the seven-bit scrambling code seed to 1100001 when scrambling. Let 4 special code generation be: S(x) = x 7 + x 4 + l (as shown in Figure 3). Set the 8th bit of the data sequence to even parity and check all bits, then the XOR of all bits of the 8th bit of the data sequence: 7 = + 2 + 4 + 5 + 6 = 1+1+0+0 +0+0 +1=1, then a random 4 special code seed generates a scrambling code sequence and scrambles the data. After scrambling, the 8th parity bit of the data sequence is scrambled as ^ =3 7 + ^ =1+1+0=0. If the decoder is decoded at the receiving end, the first 7 digits of the data sequence are not solved. If it is 1100001 and the 8th bit is 0, it can be judged that part of the bit parity is satisfied, and the scrambling code seed transmission is correct. It should be noted that the steps shown in the flowchart of the accompanying drawings may be performed in a computer system such as a set of computer executable instructions, and, although the logical order is shown in the flowchart, in some cases, The steps shown or described may be performed in an order different from that herein. The embodiment of the invention provides a data processing device, which can be used to implement the above data processing method. FIG. 8 is a block diagram showing the structure of a data processing apparatus according to an embodiment of the present invention. As shown in FIG. 8, a scrambling module 82 and a transmitting module 84 are included. This will be described in detail below. The scrambling module 82 is configured to scramble the data sequence by using the scrambling code seed, wherein the scrambled data sequence carries a check digit, where the check digit is used to check the scrambling code seed; the sending module 84 is connected to the adding The scrambling module 82 is configured to send the scrambled data sequence by the scrambling module 82. The embodiment of the invention provides a data processing device, which can be used to implement the above data processing method. 9 is a structural block diagram 2 of a data processing apparatus according to an embodiment of the present invention, such as As shown in FIG. 9, the receiving module 92, the determining module 94 and the descrambling module 96 are included. This will be described in detail below. The receiving module 92 is configured to receive the scrambled data sequence, wherein the scrambled data sequence uses a scrambling code seed to scramble the data sequence, where the data sequence carries a check digit, and the check digit is used for verifying a scrambling seed; a determining module 94, coupled to the receiving module 92, configured to determine that the school-risk bit received by the receiving module 92 is correct; a solution 4 module 96, coupled to the determining module 94, configured to be used after the determining module 94 determines The scrambling seed descrambles the scrambled data sequence. The embodiment of the invention provides a data processing system, which can be used to implement the above data processing method. FIG. 10 is a structural block diagram of a data processing system according to an embodiment of the present invention. As shown in FIG. 10, a transmitting end 1002 and a receiving end 1004 are provided, which are described in detail below. The sending end 1002 includes: a 4 special module 10022, configured to scramble the data sequence by using 4 special code seeds, wherein the scrambled data sequence carries the scrambling code seed and the check digit, wherein the check digit is used for verifying The receiving module 10024 is configured to send the scrambled data sequence that carries the scrambling code seed and the check bit of the carrying module 10022. The receiving end 1004 includes: a receiving module 10042, configured to receive the scrambling The subsequent data sequence; the determining module 10044 is connected to the receiving module 10042, and is configured to determine that the school-risk bit received by the receiving module 10042 is correct; the solution 4 module 10046 is connected to the determining module 10044, and is set to be determined by the determining module 10044, The scrambled data sequence is descrambled using the scrambling code seed. In summary, according to the above embodiments of the present invention, a data processing method, apparatus and system are provided. The transmitting end carries the check digit in the data sequence and uses the check bit to check the scrambling code seed by the receiving end, which solves the error in the transmission process of the scrambling code seed in the related art, thereby causing data error after descrambling. The problem is that the correctness of the scrambling code seed can be guaranteed, thereby avoiding descrambling data errors. It should be noted that the data processing system described in the device embodiment corresponds to the foregoing method embodiment, and the specific implementation process has been described in detail in the method embodiment, and is not described herein. Obviously, those skilled in the art should understand that the above modules or steps of the present invention can be implemented by a general-purpose computing device, which can be concentrated on a single computing device or distributed over a network composed of multiple computing devices. Alternatively, they may be implemented by program code executable by the computing device, such that they may be stored in the storage device by the computing device, or they may be Each of the integrated circuit modules is fabricated separately, or a plurality of modules or steps thereof are fabricated into a single integrated circuit module. Thus, the invention is not limited to any specific combination of hardware and software. The above is only the preferred embodiment of the present invention, and is not intended to limit the present invention, and various modifications and changes can be made to the present invention. Any modifications, equivalent substitutions, improvements, etc. made within the scope of the present invention are intended to be included within the scope of the present invention.

Claims

权 利 要 求 书 Claim
1. 一种数据处理方法, 包括: 1. A data processing method, comprising:
使用扰码种子对数据序列进行加扰, 其中所述数据序列中携带校验 位, 所述校-险位用于校-险所述 4尤码种子;  The data sequence is scrambled using a scrambling code seed, wherein the data sequence carries a check digit, and the school-risk bit is used to calibrate the 4th code seed;
发送所述加 4尤后的数据序列。  Send the data sequence after the addition.
2. 根据权利要求 1所述的方法, 其中, 所述校验位用于校验所述扰码种子 中的比特位中的部分比特位。 2. The method of claim 1, wherein the check bits are used to verify a portion of the bits in the scrambling code seed.
3. 根据权利要求 2所述的方法, 其中, 所述部分比特位为所述扰码种子中 的比特位中的除去 4尤码发生器抽头位置所对应比特位之外的比特位。 3. The method according to claim 2, wherein the partial bit is a bit other than a bit corresponding to a bit position of a 4-bit code generator tap position in a bit in the scrambling code seed.
4. 根据权利要求 1至 3中任一项所述的方法, 其中, 使用扰码种子对数据 序列进行加扰包括: The method according to any one of claims 1 to 3, wherein scrambling the data sequence using the scrambling code seed comprises:
使用 4尤码种子生成随机 4尤码序列;  Generate a random 4 special code sequence using 4 尤码 seeds;
使用所述随机扰码序列对所述数据序列进行加扰。  The data sequence is scrambled using the random scrambling code sequence.
5. 根据权利要求 1至 3中任一项所述的方法, 其中, 釆用奇偶校验的方式 校验所述扰码种子。 The method according to any one of claims 1 to 3, wherein the scrambling code seed is verified by means of parity.
6. —种数据处理方法, 其中, 包括: 6. A data processing method, wherein:
接收到加扰后的数据序列, 其中所述加扰后的数据序列是使用扰码 种子对数据序列进行加扰的, 所述数据序列中携带校验位, 所述校验位 用于校验所述扰码种子;  Receiving the scrambled data sequence, wherein the scrambled data sequence is scrambling the data sequence by using a scrambling code seed, where the data sequence carries a check digit, and the check digit is used for verifying The scrambling code seed;
确定所述校-险位正确;  Determining that the school-risk position is correct;
使用所述扰码种子对所述加扰后的数据序列进行解扰。  The scrambled data sequence is descrambled using the scrambling code seed.
7. 根据权利要求 6所述的方法, 其中, 当所述校验位用于校验所述扰码种 子中的比特位中的部分比特位时, 确定所述校验位正确包括: 使用所述 4尤码种子中的比特位中的全部比特位, 确定所述校 -险位正确, 其中所述 部分比特位为所述扰码种子中的比特位中的除去扰码发生器抽头位置所 对应比特位之夕卜的比特位。 7. The method according to claim 6, wherein, when the check bit is used to check a part of bits in a bit in the scrambling code seed, determining that the check bit is correct comprises: Determining that the calibrated bit is correct, wherein the partial bit is the punctured position of the scrambling code generator in the bit in the scrambling code seed The bit corresponding to the bit.
8. 根据权利要求 6所述的方法, 其中, 当所述校验位用于校验所述扰码种 子中的比特位中的全部比特位时, 确定所述校验位正确包括: 使用所述 扰码种子中的比特位中的部分比特位, 确定所述校验位正确, 其中所述 部分比特位为所述扰码种子中的比特位中的除去扰码发生器抽头位置所 对应比特位之夕卜的比特位。 8. The method according to claim 6, wherein, when the check bit is used to check all bits in a bit in the scrambling code seed, determining that the check bit is correct comprises: Determining a portion of the bits in the scrambling code seed to determine that the parity bit is correct, wherein the partial bit is a bit corresponding to a tap location of the scrambling code generator in the bit in the scrambling code seed The bit of the bit.
9. 一种数据处理装置, 包括: 9. A data processing apparatus, comprising:
加扰模块, 设置为使用扰码种子对数据序列进行加扰, 其中所述数 据序列中携带校-险位, 所述校-险位用于校-险所述 4尤码种子;  a scrambling module, configured to scramble the data sequence using a scrambling code seed, wherein the data sequence carries a school-risk position, and the school-risk position is used to calibrate the 4th yard seed;
发送模块, 设置为发送所述加扰后的数据序列。  The sending module is configured to send the scrambled data sequence.
10. —种数据处理装置, 包括: 10. A data processing device comprising:
接收模块, 设置为接收加扰后的数据序列, 其中所述加扰后的数据 序列是使用扰码种子对数据序列进行加扰的, 所述数据序列中携带校验 位, 所述校-险位用于校-险所述 4尤码种子;  a receiving module, configured to receive the scrambled data sequence, wherein the scrambled data sequence uses a scrambling code seed to scramble the data sequence, where the data sequence carries a check digit, and the school-risk The position is used for school-risk 4 yam seeds;
确定模块, 设置为确定所述校 -险位正确;  Determining a module, setting to determine that the school-risk position is correct;
解扰模块, 设置为使用所述扰码种子对所述加扰后的数据序列进行 解扰。  A descrambling module is arranged to descramble the scrambled data sequence using the scrambling code seed.
11. 一种数据处理系统, 包括发送端和接收端, 其中 11. A data processing system comprising a transmitting end and a receiving end, wherein
所述发送端包括:  The sending end includes:
加扰模块, 设置为使用扰码种子对数据序列进行加扰, 其中所述数 据序列中携带校-险位, 所述校-险位用于校-险所述 4尤码种子;  a scrambling module, configured to scramble the data sequence using a scrambling code seed, wherein the data sequence carries a school-risk position, and the school-risk position is used to calibrate the 4th yard seed;
发送模块, 设置为发送所述加扰后的数据序列;  a sending module, configured to send the scrambled data sequence;
所述接收端包括:  The receiving end includes:
接收模块, 设置为接收所述加扰后的数据序列;  a receiving module, configured to receive the scrambled data sequence;
确定模块, 设置为确定所述校 -险位正确;  Determining a module, setting to determine that the school-risk position is correct;
解扰模块, 设置为使用所述扰码种子对所述加扰后的数据序列进行 解扰。  A descrambling module is arranged to descramble the scrambled data sequence using the scrambling code seed.
PCT/CN2011/076327 2010-12-17 2011-06-24 Data processing method, apparatus and system WO2012079358A1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201010594723.0A CN102546079B (en) 2010-12-17 2010-12-17 Data processing method, Apparatus and system
CN201010594723.0 2010-12-17

Publications (1)

Publication Number Publication Date
WO2012079358A1 true WO2012079358A1 (en) 2012-06-21

Family

ID=46244039

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2011/076327 WO2012079358A1 (en) 2010-12-17 2011-06-24 Data processing method, apparatus and system

Country Status (2)

Country Link
CN (1) CN102546079B (en)
WO (1) WO2012079358A1 (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP5648440B2 (en) * 2010-11-22 2015-01-07 ソニー株式会社 Data processing apparatus and data processing method
CN108255464B (en) * 2016-12-28 2021-09-28 北京忆恒创源科技股份有限公司 Data scrambling method, descrambling method and device thereof
CN107885459B (en) * 2017-09-30 2020-12-18 记忆科技(深圳)有限公司 Method for scrambling write-in data of solid state disk by software

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1675883A (en) * 2002-07-04 2005-09-28 因芬尼昂技术股份公司 WLAN error control
US7158058B1 (en) * 2002-12-09 2007-01-02 Marvell International Ltd. Method and apparatus for generating a seed set in a data dependent seed selector
US7234097B1 (en) * 2003-01-27 2007-06-19 Marvell International Ltd. Methods of supporting host CRC in data storage systems without RLL coding
US7269778B1 (en) * 2002-10-15 2007-09-11 Marvell International Ltd. Data coding for enforcing constraints on ones and zeros in a communications channel

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1675883A (en) * 2002-07-04 2005-09-28 因芬尼昂技术股份公司 WLAN error control
US7269778B1 (en) * 2002-10-15 2007-09-11 Marvell International Ltd. Data coding for enforcing constraints on ones and zeros in a communications channel
US7158058B1 (en) * 2002-12-09 2007-01-02 Marvell International Ltd. Method and apparatus for generating a seed set in a data dependent seed selector
US7234097B1 (en) * 2003-01-27 2007-06-19 Marvell International Ltd. Methods of supporting host CRC in data storage systems without RLL coding

Also Published As

Publication number Publication date
CN102546079A (en) 2012-07-04
CN102546079B (en) 2016-04-13

Similar Documents

Publication Publication Date Title
ES2847801T3 (en) Transmission device and transmission method for aggregate physical layer protocol data unit
EP2543168B1 (en) Techniques to reduce false detection of control channel messages in a wireless network
ES2748401T3 (en) Wireless communication apparatus and wireless communication procedure
TWI524800B (en) Request to send (rts) and clear to send (cts) for multichannel operations
US8824441B2 (en) Method for transmitting data frame in wireless local area network and apparatus for the same
ES2642513T3 (en) Management of confirmation messages from various destinations for MIMO multi-user transmissions
CN103069762B (en) Structure is used for reducing high throughput signal (VHT-SIG) field of peak-to-average power ratio (PAPR)
ES2684558T3 (en) Method, device and coding and decoding system
US9294316B2 (en) Scrambling sequences for wireless networks
KR20190002692A (en) Method and apparatus for indicating control information in a radio frame
WO2015032259A1 (en) Data processing method and device
CN102132619A (en) Multichannel tdma mechanism
WO2012079358A1 (en) Data processing method, apparatus and system
CN107547171B (en) Method and device for transmitting frame
CN108631977A (en) A kind of sending method and sending device of broadcast message instruction
TWI681655B (en) Method for performing bit level management in a wireless local area network system, transmitter and receiver
WO2016101364A1 (en) Data packet transmission method and apparatus in wireless local area network
CN111065112B (en) Method for bit-level management, transmitter and receiver
Harley et al. Capacity Estimation for Error Correction Code-based Embedding in Adaptive Rate Wireless Communication Systems.
CN117730617A (en) Error protection for data unit service field in WLAN transmissions
CN115766047A (en) Data transmission method, data transmission equipment, readable storage medium and chip system
CN115766046A (en) Data transmission method, device, readable storage medium and chip system

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 11849089

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 11849089

Country of ref document: EP

Kind code of ref document: A1