CN106576298B

CN106576298B - Data transmission method and related communication equipment

Info

Publication number: CN106576298B
Application number: CN201580042568.2A
Authority: CN
Inventors: 杜振国; 罗毅; 于健
Original assignee: Huawei Technologies Co Ltd
Current assignee: Huawei Technologies Co Ltd
Priority date: 2015-06-27
Filing date: 2015-06-27
Publication date: 2020-02-14
Anticipated expiration: 2035-06-27
Also published as: CN106576298A; WO2017000098A1

Abstract

The invention provides a data transmission method, which comprises the following steps: carrying out BCC coding on data to be transmitted by using a binary convolutional code to form a coded original data sequence; the data to be transmitted comprises N bits of identification information and K bits of tail bits, the tail bits are located at the tail of the data to be transmitted, N1 bits of the identification information are located before the tail bits and are adjacent to the tail bits, wherein N, K, N1 are positive integers not less than 1, and N1 is not more than N; cutting off M bits at the tail part of the coded original data sequence, wherein the M bits are irrelevant to data before the N1 bits of the identification information in the data to be transmitted; wherein M is a positive integer not less than 1; and transmitting the encoded data sequence.

Description

Data transmission method and related communication equipment

Technical Field

The present invention relates to communications technologies, and in particular, to a data transmission method and related communications devices.

Background

With the evolution of the WLAN (Wireless Local Area Network) standard, the current IEEE (Institute of Electrical and Electronics Engineers) 802.11 working group has begun the research and development work of the next-generation WiFi (Wireless Fidelity) standard. The next-generation WiFi standard is HEW (High Efficiency WLAN), item code 802.11ax, and aims to increase system capacity to more than 10Gbps, and especially focuses on two scenarios of WiFi equipment outdoor deployment and High-density deployment.

For a high-density distribution scenario, a contention Access mechanism of the conventional WiFi may not work well due to its low efficiency, and a new medium Access mechanism is urgently needed to be introduced, so that it has been proved that a multi-user transmission technology with high performance and advantages is very likely to be introduced into 802.11ax in other networks, such as OFDMA (Orthogonal Frequency division multiplexing) and UL MU-MIMO (Uplink Multiple Input Multiple Output), DL MU-MIMO (Downlink Multiple Input Multiple Output) are introduced into 802.11 ac. Both OFDMA and UL MU-MIMO require an AP (Access Point) to allocate and schedule transmission resources of multiple STAs (STATIONs), and the scheduling information is placed in a Trigger (Trigger) frame sent by the AP.

For Trigger frames carrying multi-user scheduling information, one possible way is to utilize the physical header part of the frame sent by the AP, such as HE-SIG-B in the frame structure shown in fig. 1. The scheduling information carried by the HE-SIG-B may adopt a mode that each user equipment independently allocates a Cyclic Redundancy Code (CRC) and independently encodes, that is, adds a CRC to the scheduling information of each user equipment and performs channel coding, so that each user equipment can independently solve its own data regardless of whether the scheduling information of other user equipment is received correctly. If the BCC (Binary Convolutional Code) most commonly used in the current standard is still used for channel coding of the scheduling information, Tail bits (Tail) of 6bits all 0 need to be added at the Tail of the scheduling information of each STA. When multiple user equipments are scheduled, multiple tails will occur in HE-SIG-B, resulting in a significant waste. HE-SIG-B belongs to the physical header where each bit is precious, and too much Tail will cause the physical header to be longer, affecting the transmission efficiency. The scheduling information of each user equipment may include:

STA ID (Station Identification): an Identifier of the scheduled STA, such as an AID (Association Identifier) or PAID (Partial Association Identifier);

MCS (Modulation and Coding Scheme, Modulation Coding Scheme): MCS used for data transmission;

STBC (Space-time Block Coding): whether STBC is used;

coding: what channel coding is used for data transmission;

beam-forming: whether to transmit data using beamforming; and

frequency domain resource allocation or Nsts (Number of Space and Time Stream, Number of Space-Time streams): in an OFDMA system, the width of the frequency domain resources allocated by a scheduled STA is represented; the number or position of the space-time streams in the MIMO system indicates which space-time streams the STA is allocated for data transmission.

Based on the above analysis, it can be seen that when the scheduling information of the multi-user device is transmitted by independently allocating CRC to each piece of user device information and independently encoding, using BCC encoding will cause a great waste of resources.

One way to solve the above problem is to use Tail-biting convolutional codes. By Tail-biting convolutional code, it is meant that no Tail is added at the end of the data before encoding, but the last 6bits of the sequence to be encoded are used to set the initial state of the encoder. Then, the receiving end decodes by using the characteristic that the initial state of the encoder is the same as the last 6bits of the sequence to be coded. This method saves the 6-bit Tail at the end of the data. The initial state of the Tail-biting encoder is the same as the Tail of the last 6bits of the sequence to be encoded, but its value is unknown. The Tail-biting code has less known initial states than the BCC, so the performance of the Tail-biting code is worse than the BCC.

In order to solve the problem that the performance of the Tail-biting encoder is worse than the BCC, one solution is to put the STA ID at the Tail of the to-be-coded sequence by using the characteristics that each user equipment schedule contains the STA ID and the STA knows the STA ID of itself, and set the initial state of the Tail-biting encoder by using the last 6bits of the STA ID. This corresponds to the user equipment knowing the initial state of the encoder and having the last 6bits of its STA ID, and thus the performance can be improved so that the decoding performance is comparable to the original BCC. However, this method requires the introduction of new channel coding techniques, necessitating major modifications to the physical layer.

Disclosure of Invention

The invention provides a method, a system and a device for transmitting signals, which can reduce the resource waste caused by Tail under the condition of not introducing a new channel coding mode.

A method of data transmission, comprising: carrying out BCC coding on data to be transmitted by using a binary convolutional code to form a coded original data sequence; the data to be transmitted comprises N bits of identification information and K bits of tail bits, the tail bits are located at the tail of the data to be transmitted, N1 bits of the identification information are located before the tail bits and are adjacent to the tail bits, wherein N, K, N1 are positive integers not less than 1, and N1 is not more than N; truncating M bits at the tail of the encoded original data sequence to form an encoded data sequence, wherein each of the M bits is only related to the N1 bits of the identification information or only related to the N1 bits and tail bits of the identification information, and M is a positive integer not less than 1; and transmitting the encoded data sequence.

A method of data transmission, comprising: and sending data to be transmitted, wherein the data to be transmitted comprises identification information, the identification information at least comprises two parts, and any two parts of the at least two parts of the identification information are at least spaced by 1 bit.

A method of data transmission, comprising: carrying out BCC coding on data to be transmitted by using a binary convolutional code to form a coded original data sequence; the data to be transmitted comprises N bits of identification information and K bits of tail bits, the tail bits are positioned at the tail part of the data to be transmitted, and the N1 bits of the identification information are positioned at the head part of the data to be transmitted; the coded original data sequence comprises N2 bits corresponding to the N1 bit identification information of the header of the data to be transmitted; wherein N, K, N1 and N2 are positive integers not less than 1, N1 is not more than N, and N2 is more than N1; cutting off M bits of the head of the encoded original data sequence to form an encoded data sequence, wherein each bit of the M bits is only related to the N1 bits of the identification information, M is a natural number, and M is more than or equal to 1 and less than or equal to N2; and transmitting the encoded data sequence.

A method of data transmission, comprising: a receiving end pre-calculates a pre-coding sequence of first identification information; the receiving end receives an encoded data sequence which is sent by a transmitting end and has M truncated bits at the tail part, the encoded data sequence is data which is sent by the transmitting end and is obtained by BCC encoding of data to be transmitted by the transmitting end and truncation of M truncated bits at the tail part of the encoded data, the data to be transmitted comprises N bits of second identification information and K bits of tail bits, the tail bits are positioned at the tail part of the data to be transmitted, N1 bits of the second identification information are positioned before the tail bits and are adjacent to the tail bits, wherein N, K, N1 is positive integers which are not less than 1, N1 is not more than N, and M is an integer which is not less than 1; adding the pre-coding sequence of the first identification information to the tail of the received coded data sequence to form a data sequence added with the pre-coding sequence; and carrying out BCC decoding on the data sequence added with the pre-coding sequence to obtain a decoded data sequence.

A method of data transmission, comprising: a receiving end pre-calculates a pre-coding sequence of first identification information; the receiving end receives an encoded data sequence which is sent by a transmitting end and has M truncated bits at the head, the encoded data sequence is data which is sent by the transmitting end and is obtained by BCC encoding of data to be transmitted by the transmitting end and truncation of M truncated bits at the tail of the encoded data, the data to be transmitted comprises N bits of second identification information and K bits of tail bits, the tail bits are located at the tail of the data to be transmitted, N1 bits of the second identification information are located at the head of the data to be transmitted, wherein N, K, N1 is positive integers which are not less than 1, N1 is not more than N, and M is an integer which is not less than 1; adding the pre-coding sequence of the first identification information to the head of the received coded data sequence to form a data sequence added with the pre-coding sequence; and carrying out BCC decoding on the data sequence added with the pre-coding sequence to obtain a decoded data sequence.

A communication device, comprising:

the processor is used for carrying out BCC coding on data to be transmitted to form a coded original data sequence; the data to be transmitted comprises N bits of identification information and K bits of tail bits, the tail bits are located at the tail of the data to be transmitted, N1 bits of the identification information are located before the tail bits and are adjacent to the tail bits, wherein N, K, N1 are positive integers not less than 1, and N1 is not more than N;

the processor is further configured to truncate M bits at the tail of the encoded original data sequence to form an encoded data sequence, where each of the M bits is related to only the N1 bits of the identification information or only the N1 bits and tail bits of the identification information, where M is a positive integer not less than 1; and

a transmitter for transmitting the encoded data sequence.

A communication device, comprising:

the processor is used for carrying out BCC coding on data to be transmitted to form a coded original data sequence; the data to be transmitted comprises N bits of identification information and K bits of tail bits, the tail bits are positioned at the tail part of the data to be transmitted, and the N1 bits of the identification information are positioned at the head part of the data to be transmitted; the coded original data sequence comprises N2 bits corresponding to the N1 bit identification information of the header of the data to be transmitted; wherein N, K, N1 and N2 are positive integers not less than 1, N1 is not more than N, and N2 is more than N1;

the processor is further configured to truncate M bits of a header of the encoded original data sequence to form an encoded data sequence, where each bit of the M bits is only related to the N1 bits of the identification information, where M is a natural number, and M is greater than or equal to 1 and less than or equal to N2; and

a transmitter for transmitting the encoded data sequence.

A communication device, comprising:

a processor for pre-computing a pre-coding sequence of the first identification information;

the receiver is configured to receive an encoded data sequence sent by a sending end, where M bits of a tail portion of the encoded data sequence are truncated, the encoded data sequence is data obtained by a sending end performing BCC encoding on data to be transmitted and truncating M bits of the tail portion of the encoded data, the data to be transmitted includes N bits of second identification information and K bits of tail bits, the tail bits are located at the tail portion of the data to be transmitted, N1 bits of the second identification information are located before and adjacent to the tail bits, where N, K, N1 is positive integers not less than 1, N1 is not greater than N, and M is an integer not less than 1;

the processor is further configured to:

adding the pre-coding sequence of the first identification information to the tail of the received coded data sequence to form a data sequence added with the pre-coding sequence;

and carrying out BCC decoding on the data sequence added with the pre-coding sequence to obtain a decoded data sequence.

A communication device, comprising:

the receiver is configured to receive an encoded data sequence sent by a sending end, where M bits of a header of the encoded data sequence are truncated, the encoded data sequence is data obtained by a sending end performing BCC encoding on data to be transmitted and truncating M bits of a tail of the encoded data, the data to be transmitted includes N bits of second identification information and K bits of tail bits, the tail bits are located at the tail of the data to be transmitted, N1 bits of the second identification information are located at the header of the data to be transmitted, where N, K, N1 is positive integers not less than 1, N1 is not greater than N, and M is an integer not less than 1;

the processor is further configured to:

adding the pre-coding sequence of the first identification information to the head of the received coded data sequence to form a data sequence added with the pre-coding sequence;

The data transmission method and the communication equipment cut off M bits related to the identification information or the identification information and the Tail bits during signal coding, and can reduce resource waste caused by Tail without introducing a new channel coding mode.

Drawings

FIG. 1 is a diagram of a frame structure in the prior art;

fig. 2 is a schematic diagram of signal encoding at a transmitting end according to a first embodiment of the present invention;

fig. 3 is a schematic diagram of a receiving end generating a precoding sequence according to a first embodiment of the present invention;

fig. 4 is a schematic diagram of signal decoding at a receiving end according to a first embodiment of the present invention;

fig. 5 is a schematic diagram of signal encoding at a transmitting end according to a second embodiment of the present invention;

fig. 6 is a schematic diagram of a receiving end generating a precoding sequence in the second embodiment of the present invention;

fig. 7 is a schematic diagram of signal decoding at a receiving end according to a second embodiment of the present invention;

FIG. 8 is an exemplary diagram of XOR processing of PAID and CRC in a third embodiment of the present invention;

FIGS. 9 a-9 c are schematic diagrams of four encoding methods with three different encoding rates according to the present invention;

fig. 10 is a signal structure diagram employed in the fifth embodiment of the present invention.

Fig. 11 to 13 are signal structure diagrams of different AID setting modes in the sixth embodiment of the present invention.

Fig. 14 is a flowchart of a signal transmission method in a seventh embodiment of the present invention;

fig. 15 is a flowchart of a signal transmission method according to an eighth embodiment of the present invention;

fig. 16 is a flowchart of a signal transmission method according to a ninth embodiment of the present invention;

fig. 17 is a flowchart of a signal transmission method in a tenth embodiment of the present invention;

fig. 18 is a composition diagram of a communication apparatus in an eleventh embodiment of the present invention;

fig. 19 is a block diagram of a communication apparatus according to a twelfth embodiment of the present invention;

fig. 20 is a composition diagram of a communication apparatus in a thirteenth embodiment of the present invention;

fig. 21 is a block diagram of a communication apparatus in a fourteenth embodiment of the present invention.

Detailed Description

The first embodiment is as follows:

assuming that R-1/2 encoding is used, the STA ID is an AID of 11bits, and the total pre-encoding data sequence length is Lbits (including CRC and Tail).

Referring to fig. 2, the process of the sender (e.g., AP) is as follows:

step (Step) 1: placing AID at the head of the scheduling information block, adding 6bits of Tail at the Tail of the scheduling information block, and then performing BCC coding;

step 2: cutting off N-22 bits positioned at the head of the coded data sequence; the header 22bits of the encoded data is only relevant to the AID and is irrelevant to other fields after the AID;

step 3: and transmitting the rest part of the coded data after 22bits are cut.

In the embodiment shown in fig. 2, the total length of data to be transmitted at the transmitting end is L, the data length obtained by BCC coding the data to be transmitted at the rate of R-1/2 is 2L, and after 22bits of the coded data header are truncated, the length of the actually transmitted data sequence is 2L-22, which is equivalent to reducing the transmission of 11 bits.

Referring to fig. 3 and 4, the processing procedure of the receiving end (e.g., STA) corresponding to the transmitting end is as follows:

step 1: and calculating and storing an AID code sequence of the user in advance. The specific calculation method may be: the BCC encoder initial state is set to all 0, 11-bit AIDs as input, and the first 22bits in the output sequence are the AID code sequence of the AID (see fig. 3).

Step 2: the STA adds the AID code sequence to the header of the received data sequence for each received data sequence (e.g., the data sequence of length 2L-22 transmitted by the transmitting end as described above), and performs BCC decoding.

Step 3: and judging whether the received data sequence is sent to the receiving end or not according to the CRC in the decoded data.

In the embodiments shown in fig. 3 and fig. 4, the decoding process at the receiving end is just opposite to the encoding process at the transmitting end, the length of the data sequence received by the receiving end is 2L-22, after the AID code sequence of 22bits is added, the length of the data sequence becomes 2L, and then BCC decoding is performed on the data sequence with the length of 2L, so as to obtain the data sequence with the length of L.

It should be noted that, in order to reduce the probability of false alarm (false alarm) occurring at the receiving end, the transmitting end may truncate only a part of the sequence corresponding to the STA ID after encoding. For example, when the AID is 11bits, only the first 12bits of the coded sequence may be truncated, which corresponds to truncation of only the coded sequence corresponding to the first 6bits of the AID. In short, the length of the truncated encoded sequence does not exceed the encoded length corresponding to the STA ID, and for example, when the AID is 11bits, 22bits of the encoded data sequence correspond to the AID, and the length of the truncated bits cannot be greater than 22 bits. Correspondingly, when the receiving end calculates the AID code sequence, only the first bits output by the BCC encoder are taken as the AID code sequence. For example, the transmitting end truncates the first 12bits of the encoded sequence, and the receiving end only takes the first 12bits output by the BCC encoder when calculating the ID code sequence.

The second embodiment is as follows:

this embodiment is the same as the purpose of the embodiment, but the STA ID is not placed at the head of the scheduling information, but at the tail. Correspondingly, the transmitting end needs to cut off a plurality of bits at the tail of the coded sequence, and the receiving end needs to add the ID coding sequence of the receiving end at the tail of the received data sequence.

Referring to fig. 5, under the other assumption that the conditions are the same as those in the first embodiment, the sender processing is as follows:

step 1: placing AID at the Tail part of the scheduling information block, adding 6bits of Tail at the Tail part, and then executing BCC coding;

step 2: and cutting off the N-22 bits positioned at the tail part of the coded data sequence. Since the BCC encoder used in 802.11 is a 6-register structure, the output generated by one bit into the encoder is also related to the first 6 bits. Therefore, when AID + Tail is located at the end of the schedule information, the output generated by the first 6bits of the AID entering the encoder is also related to the data before the AID, and the output generated by the 5bits of the AID entering the encoder from the 7 th bit is related to only the first 6bits of the AID. Similarly, the bits in Tail into the encoder produce an output that is only related to AID and Tail. In short, the encoder outputs corresponding to the last 5bits of the AID and the Tail of 6bits (i.e. the Tail 22bits in the encoded data sequence) are only related to the AID and the Tail, and are not related to other data before the AID;

step 3: and the transmission of the coded data cuts off the rest part of the tail part 22 bits.

For the data sequence after BCC coding, 22bits at the tail are cut off, and the length of the actually transmitted data sequence is 2L-22, which is equivalent to reducing the transmission by 11 bits. Since the AID is placed before Tail, the CRC can only be shifted forward (typically the CRC is immediately adjacent to Tail).

Referring to fig. 6 and 7, the processing procedure of the receiving end corresponding to the transmitting end is as follows:

step 1: and calculating and storing an AID code sequence of the user in advance. The specific calculation method may be: the BCC encoder initial state is set to all 0, 11-bit AID +6-bit Tail as input, and the last 22bits in the 34-bit output data sequence are the AID code sequence of the AID (see FIG. 6).

Step 2: for each received scheduling information block before decoding, the receiving end (e.g. station STA) adds its AID code sequence (e.g. the last 22bits in the 34-bit output data sequence) to the end of the scheduling information block, and then performs BCC decoding.

Step 3: and judging whether the scheduling information block is sent to the receiving end or not according to the CRC in the decoded data.

Similar to the first embodiment, in order to reduce the probability of false alarm (false alarm) occurring at the receiving end, the transmitting end may only cut off a partial sequence of the corresponding sequence after the STA ID coding, which is not described in detail again.

The third implementation: STA ID partial code sequence truncation

As described above, when the encoded data sequence is truncated, only a partial sequence of the STA ID encoding sequence may be truncated instead of the entire sequence. In some cases, truncation of only a partial sequence of the STA ID coding sequence is allowed.

For example, one method to reduce the length of the transmission of the scheduling information block may be to xor the CRC onto the STA ID for transmission (as shown in fig. 8). Correspondingly, after receiving the data, the receiving end firstly uses the STA ID of the receiving end to perform exclusive OR with the received data so as to obtain CRC, and then performs CRC check.

In the case shown in fig. 8, a partial sequence of STA IDs is "contaminated" with CRC, and its corresponding encoded output is not only correlated with STA ID but also with CRC. In this case, when the encoded data sequence is truncated, it is obvious that the sequence corresponding to the entire STA ID cannot be truncated, but at most, only the encoded sequence corresponding to the "clean" part of the STA ID can be truncated.

Assuming that R-1/2 encoding is used, the STA ID is an AID of 11bits, and the CRC length is 4 bits. For the two cases of the first embodiment (AID located at the head of the scheduling information block) and the second embodiment (AID located at the tail of the scheduling information block), the length of the encoded sequence truncated at the transmitting end and the ID code sequence generation rule added at the receiving end need to be modified as follows:

for the case of the first embodiment (AID is located at the head of the scheduling information block), in this embodiment, the sending end performs exclusive or between CRC and the last 4bits of the AID, and truncates the first (11-4) × 2 ═ 14bits after encoding; and the receiving end takes the first 14bits in the output sequence as the ID coding sequence of the receiving end through a BCC coder.

For the case of the second embodiment (AID is located at the tail of the scheduling information block), in this embodiment, the sending end performs exclusive or between the CRC and the first 4bits of the AID, and cuts off the tail (11-4) × 2 ═ 14bits after encoding; and the receiving end takes the last 14bits in the output sequence as the ID coding sequence of the receiving end through a BCC coder by AID + Tail.

For the two cases of the first embodiment (AID is located at the head of the scheduling information block) and the second embodiment (AID is located at the tail of the scheduling information block), in this embodiment, 14bits is the maximum value that can be truncated, and a sequence smaller than 14bits may also be directly truncated. For example, truncation of the 8bits sequence corresponds to truncation of the coding sequence corresponding to the first 4bits of AID, or truncation of the coding sequence corresponding to the last 4bits of Tail.

The following four steps are implemented:

the foregoing discussion has been discussed with the scheduling information block encoded with R-1/2 as an example. In fact, other encoding schemes may be used for the scheduling information block. For example, if HE-SIG-B is used to carry the scheduling information block, the MCS of the scheduling information block may be indicated in the common part of HE-SIG-a or HE-SIG-B; if the MAC frame is used to carry the scheduling information block, the MCS of the scheduling information block may be indicated in the physical header. The maximum information length that can be truncated is different for different coding rates.

In 802.11, another coding rate is generated by Puncturing (punting) the output of the R-1/2 coding. In light of the foregoing discussion, the truncated portion of the encoded data sequence should be related only to the STA ID (and Tail), and its corresponding pre-encoded sequence is referred to as the "clean" portion of the STA ID. Assuming that the length of the "clean" part of the STA ID is l, the definition of the "clean" part of the STA ID in the first and second embodiments is as follows:

the first embodiment is as follows: refers to the first l-bit of the STA ID, which is 1/2 encoded and then only related to the AID. For example, AID ═ 11bits, then l ═ 11 bits; if 4bits after AID are XOR-ed, l is 7bits

Example two: the last (l-6) bits + Tail, referred to as STA ID, is 1/2 encoded to be only related to AID and Tail. l comprises Tail. For example, if the AID is 11bits, the "clean" part refers to the 5bits and 6bits Tail after the AID, and l is 11 bits; if the AID is 11bits and the first 4bits are exclusive-or-ed with CRC, the 'clean' part refers to the last 1bit and the 6bit Tail of the AID, and l is 7 bits; if the AID is 11bits and the first 8bits are xored with the CRC, the "clean" part is the last 3bits of the 6bits Tail, and l is 3 bits;

assume that the total pre-coding data sequence length is L bits (including CRC and Tail). If the scheduling information block is encoded using R-2/3, the last bit is cut out every 4 coded bits generated by the 1/2 BCC encoder from the 2 pre-coded bits (see fig. 9 a). At this time, for the two cases of the first and second embodiments, the rule that the sender can truncate the length of the encoded sequence and the receiver calculates the ID code sequence is as follows:

situation one

A sending end: if l is an even number, cutting off 2/3 the first h of the coded sequence is 2l × 3/4 is 3l/2 bits; if l is an odd number, the 2/3 encoded sequence is truncated to have the first h-2 (l-1) × 3/4+2 (3l +1)/2bits

Receiving end: the STA ID is encoded by 2/3 encoder, and the first h bits in the output sequence is taken as ID coding sequence

Situation two

Transmitting terminal

(L-L) is an even number: if l is an even number, cutting off the h 1-2 l × 3/4-3 l/2bits of the encoded sequence of 2/3; if l is an odd number, the encoded sequence of 2/3 is truncated to h1 ═ 2(l-1) × 3/4+2 ═ 3l +1)/2bits

(L-L) is an odd number: if l is an even number, cutting off the h 2-2 l × 3/4-3 l/2bits of the encoded sequence of 2/3; if l is an odd number, the encoded sequence of 2/3 is truncated to h2 ═ 2(l-1) × 3/4+1 ═ 3l-1)/2bits

Receiving end

(L-L) is an even number: passing pure (STA ID) through 2/3 encoder, taking h 1bits in output sequence as ID coding sequence

(L-L) is an odd number: passing X + pure (STA ID) through 2/3 encoder, taking post h 2bits in output sequence as ID coding sequence

Note that in the above description, X is 0 or 1, which may be arbitrarily selected; pure (STA ID) is the lbits "clear" portion of STA ID, defined as above, which contains Tail.

If the scheduling information block is encoded using R-3/4, 2bits are cut out of the 6 encoded bits generated by the 1/2 BCC encoder for each 3 pre-encoded bits (see fig. 9 b). At this time, for the two cases of the first and second embodiments, the rule that the sender can truncate the length of the encoded sequence and the receiver calculates the ID code sequence is as follows:

situation one

Transmitting terminal

l mod 3 ═ 0: the pre-h of the 3/4-encoded sequence is truncated by 2l × 2/3 by 4l/3bits

l mod 3 ═ 1: the sequence obtained by cutting 3/4 to remove h, 2(l-1) × 2/3+2, (4l +2)/3bits

l mod 3 ═ 2: the sequence obtained by cutting 3/4 to remove h-2 (l-2) × 2/3+3 (4l +1)/3bits

Receiving end: the STA ID is encoded by 3/4 encoder, and the first h bits in the output sequence is taken as ID coding sequence

Situation two

(L-l)mod 3＝0

A sending end: if l mod 3 is 0, truncating 3/4 to obtain h 2l × 2/3 to 4l/3 bits; l mod 3 ═ 1, h ═ 2(l-1) × 2/3+2 ═ 4l +2)/3 bits; l mod 3 ═ 2, h ═ 2(l-2) × 2/3+3 ═ 4l +1)/3bits

Receiving end: passing pure (STA ID) through 3/4 encoder, taking last h bits in output sequence as ID pre-coding sequence

(L-l)mod 3＝1

A sending end: if l mod 3 is 0, h is 2l × 2/3 is 4l/3 bits; l mod 3 ═ 1, h ═ 2(l-1) × 2/3+1 ═ 4l-1)/3 bits; l mod 3 ═ 2, h ═ 2(l-2) × 2/3+2 ═ 4l-2)/3bits

Receiving end: passing X + pure (STA ID) through 3/4 encoder, taking last h bits in output sequence as ID coding sequence

(L-l)mod 3＝2

A sending end: if l mod 3 is 0, h is 2l × 2/3 is 4l/3 bits; l mod 3 ═ 1, h ═ 2(l-1) × 2/3+1 ═ 4l-1)/3 bits; l mod 3 ═ 2, h ═ 2(l-2) × 2/3+3 ═ 4l +1)/3bits

Receiving end: passing XX + pure (STA ID) through 3/4 encoder, taking last h bits in output sequence as ID coding sequence

If the scheduling information block is encoded using R-5/6, 4bits are cut out of 10 encoded bits generated by the 1/2 BCC encoder every 5 pre-encoded bits (see fig. 9 c). At this time, for the two cases of the first and second embodiments, the rule that the sender can truncate the length of the encoded sequence and the receiver calculates the ID code sequence is as follows:

situation one

A sending end: when l mod 5 is 0, the front h of the encoded sequence of 5/6 is truncated to 2l × 3/5 to 6l/5 bits; l mod 5 ═ 1, h ═ 2(l-1) × 3/5+2 ═ 6l +4)/5 bits; l mod 5 ═ 2, h ═ 2(l-2) × 3/5+3 ═ 5l +3)/5 bits; l mod 5 ═ 3, h ═ 2(l-3) × 3/5+4 ═ 6l +2)/5 bits; l mod 5 ═ 4, h ═ 2(l-4) × 3/5+5 ═ 6l +1)/5bits

Receiving end: the STA ID is encoded by 5/6 encoder, and the first h bits in the output sequence is taken as ID coding sequence

Situation two

(L-l)mod 5＝0

A sending end: truncating the h bits of the 3/4 encoded sequence. h is calculated as in the first embodiment

Receiving end: passing pure (STA ID) through 5/6 encoder, taking last h bits in output sequence as ID coding sequence

(L-l)mod 5＝1

A sending end: l mod 5 is 0, h 2l × 3/5 is 6l/5 bits; l mod 5 ═ 1, h ═ 2(l-1) × 3/5+1 ═ 6l-1)/5 bits; l mod 5 ═ 2, h ═ 2(l-2) × 3/5+2 ═ 6l-2)/5 bits; l mod 5 ═ 3, h ═ 2(l-3) × 3/5+3 ═ 6l-3)/5 bits; l mod 5 ═ 4, h ═ 2(l-4) × 3/5+4 ═ 6l-4)/5bits

Receiving end: passing X + pure (STA ID) through 5/6 encoder, taking last h bits in output sequence as ID coding sequence

(L-l)mod 5＝2

A sending end: l mod 5 is 0, h 2l × 3/5 is 6l/5 bits; l mod 5 ═ 1, h ═ 2(l-1) × 3/5+1 ═ 6l-1)/5 bits; l mod 5 ═ 2, h ═ 2(l-2) × 3/5+2 ═ 6l-2)/5 bits; l mod 5 ═ 3, h ═ 2(l-3) × 3/5+3 ═ 6l-3)/5 bits; l mod 5 ═ 4, h ═ 2(l-4) × 3/5+5 ═ 6l +1)/5bits

Receiving end: passing XX + pure (STA ID) through 5/6 encoder, taking last h bits in output sequence as ID coding sequence

(L-l)mod 5＝3

A sending end: l mod 5 is 0, h 2l × 3/5 is 6l/5 bits; l mod 5 ═ 1, h ═ 2(l-1) × 3/5+1 ═ 6l-1)/5 bits; l mod 5 ═ 2, h ═ 2(l-2) × 3/5+2 ═ 6l-2)/5 bits; l mod 5 ═ 3, h ═ 2(l-3) × 3/5+4 ═ 6l +2)/5 bits; l mod 5 ═ 4, h ═ 2(l-4) × 3/5+5 ═ 6l +1)/5bits

Receiving end: passing XXX + pure (STA ID) through 5/6 encoder, taking last h bits in output sequence as ID coding sequence

(L-l)mod 5＝4

A sending end: l mod 5 is 0, h 2l × 3/5 is 6l/5 bits; l mod 5 ═ 1, h ═ 2(l-1) × 3/5+1 ═ 6l-1)/5 bits; l mod 5 ═ 2, h ═ 2(l-2) × 3/5+3 ═ 6l +3)/5 bits; l mod 5 ═ 3, h ═ 2(l-3) × 3/5+4 ═ 6l +2)/5 bits; l mod 5 ═ 4, h ═ 2(l-4) × 3/5+5 ═ 6l +1)/5bits

Receiving end: XXXXXX + pure (STA ID) is passed through 5/6 encoder, and the last h bits in the output sequence is taken as ID coding sequence.

The following five steps are carried out:

referring to fig. 10, the foregoing embodiment can be used in a scenario where predefined data exists between other transceivers. For example:

the HE-SIG-A comprises a Color as a rough identifier of the BSS;

common part of HE-SIG-B contains BSSID or PBSSID for specifically identifying BSS;

in the two cases, the scheme of the invention can be used for transmitting Common part of the HE-SIG-A and the HE-SIG-B, thereby achieving the purpose of saving transmission overhead. In the specific processing, Color/BSSID/PBSSID may be treated as the STA ID in the present invention.

The following six steps:

for any of the above embodiments, when the sender truncates a portion, but not all, of the entire pure (STA ID) encoded sequence, a portion of the STA ID may be moved elsewhere before encoding. For example, in the embodiments shown in FIGS. 11-13, the AID before encoding is divided into two segments, one segment is located at the head or tail, and the other segment is located at other positions. The method can further reduce the false alarm probability.

Assume that R-1/2 encoding is used and AID is 11 bits.

For the first embodiment, if the first 14bits (the first 7bits corresponding to the AID before encoding) are truncated after encoding, the AID can be divided into two sections, i.e., AID _1(7bits) and AID _2(4bits), before encoding, and the two sections are separately placed in the scheduling information block (as shown in fig. 11), and the interval between the two sections is at least one 1 bit. When the receiving end generates the AID code sequence, the first 14bits of the sequence is output after the AID is coded by the R-1/2 BCC coder. In this case, the pure (sta id) AID _1 has a length of 7.

For the second embodiment, if the tail 14bits (corresponding to the last 1bit +6bits tail of the AID before encoding) is to be truncated after encoding, the AID can be divided into two sections (as shown in fig. 12) of AID _1(4bits) and AID _2(7bits) before encoding, where the two sections are divided into scheduling information blocks and the interval between the two sections is at least one 1 bit. When the receiving end generates the AID code sequence, the last 14bits of the output sequence is obtained after the AID + Tail passes through the R-1/2 BCC encoder. In this case, the pure (staid) is the corresponding pre-coded bits of the truncated sequence, i.e. the last 1bit +6bit Tail of AID _2, and the length is 7.

For the second embodiment, a special case is to truncate only the coded sequence corresponding to Tail (i.e. the last 12bits of the coded sequence). In this case, the AID should be divided into two sections, AID _1(5bits) and AID _2(6bits) (as shown in fig. 6). When the receiving end generates the AID code sequence, 6bits Tail (all 0) are passed through an R-1/2 BCC encoder, and then the 12bits of the sequence are output. In this case, pure (STA ID) is Tail, and the length is 6.

EXAMPLE seven

Referring to fig. 14, in combination with the above embodiments, the seventh embodiment provides a data transmission method, including:

s01: carrying out BCC coding on data to be transmitted by using a binary convolutional code to form a coded original data sequence; the data to be transmitted comprises N bits of identification information and K bits of tail bits, the tail bits are located at the tail of the data to be transmitted, N1 bits of the identification information are located before the tail bits and are adjacent to the tail bits, wherein N, K, N1 are positive integers not less than 1, and N1 is not more than N;

s02: truncating M bits at the tail of the encoded original data sequence to form an encoded data sequence, wherein each of the M bits is only related to the N1 bits of the identification information or only related to the N1 bits and tail bits of the identification information, and M is a positive integer not less than 1; and

s03: and transmitting the coded data sequence.

The initial state of the BCC-encoded encoder is the same as the K tail bits, and the K tail bits are a predefined sequence of K bits.

The identification information is the identification information of the sending end of the data to be transmitted, or the identification information of the receiving end, or the identification information of the network where the sending end and the receiving end are located.

The N1 bits of the identification information include a first segment and a second segment arranged in series; the first segment of the identification information is located before the second segment of the identification information; the first section of the identification information is M1 bit data, the second section of the identification information is M2 bit data, wherein M1+ M2 is N1, and M1 is more than or equal to K.

If the BCC encoding of the data to be transmitted uses 1/2-rate convolutional coding, M is ≦ 2 XN 1.

If the BCC coding of the data to be transmitted uses a convolutional coding of rate 1/2, then M is 2 × K.

The value of M is related to the coding rate at which the BCC encoding of the data to be transmitted is performed.

The identification information comprises a first part and a second part, the length of the first part of the identification information is N1 bits, the first part is positioned before the tail bits of the data to be transmitted and is next to the tail bits, the length of the second part of the identification information is N-N1 bits, the second part is positioned before the first part of the identification information and is at least 1bit apart from the first part of the identification information.

Example eight

Referring to fig. 15, with reference to the foregoing embodiments, an eighth embodiment provides a data transmission method, including:

s11: carrying out BCC coding on data to be transmitted by using a binary convolutional code to form a coded original data sequence; the data to be transmitted comprises N bits of identification information and K bits of tail bits, the tail bits are positioned at the tail part of the data to be transmitted, and the N1 bits of the identification information are positioned at the head part of the data to be transmitted; the coded original data sequence comprises N2 bits corresponding to the N1 bit identification information of the header of the data to be transmitted; wherein N, K, N1 and N2 are positive integers not less than 1, N1 is not more than N, and N2 is more than N1;

s12: cutting off M bits of the head of the encoded original data sequence to form an encoded data sequence, wherein each bit of the M bits is only related to the N1 bits of the identification information, M is a natural number, and M is more than or equal to 1 and less than or equal to N2; and

s13: and transmitting the coded data sequence.

The identification information comprises a first section and a second section which are arranged in series; a first section of the identification information is related to data preceding the identification information, and a second section of the identification information is related to only the identification information; the first section of the identification information is positioned at the front side of the second section of the identification information; the first section of the identification information is M1 bit data, the second section of the identification information is M2 bit data, wherein M1+ M2 is N1, and M1 is more than or equal to K.

If the BCC coding of the data to be transmitted adopts 1/2-rate convolutional coding, M is less than or equal to 2 XN 1, and M is less than or equal to 2M 2.

The value of M is related to the coding rate at which the BCC coding of the data to be transmitted is performed.

The identification information comprises a first part and a second part, the length of the first part of the identification information is N1 bits and is positioned at the head of the data to be transmitted, and the length of the second part of the identification information is N-N1 bits and is positioned behind the first part of the identification information and is at least 1bit away from the first part of the identification information.

Example nine

Referring to fig. 16, in combination with the above embodiments, the ninth embodiment provides a data transmission method, including:

s21: a receiving end pre-calculates a pre-coding sequence of first identification information;

the receiving end receives an encoded data sequence which is sent by a transmitting end and has M truncated bits at the tail part, the encoded data sequence is data which is sent by the transmitting end and is obtained by BCC encoding of data to be transmitted by the transmitting end and truncation of M truncated bits at the tail part of the encoded data, the data to be transmitted comprises N bits of second identification information and K bits of tail bits, the tail bits are positioned at the tail part of the data to be transmitted, N1 bits of the second identification information are positioned before the tail bits and are adjacent to the tail bits, wherein N, K, N1 is positive integers which are not less than 1, N1 is not more than N, and M is an integer which is not less than 1;

s22: adding the pre-coding sequence of the first identification information to the tail of the received coded data sequence to form a data sequence added with the pre-coding sequence;

s23: and carrying out BCC decoding on the data sequence added with the pre-coding sequence to obtain a decoded data sequence.

The first identification information is identification information stored by the receiving end; the second identification information is the identification information of the sending end, or the identification information of the receiving end, or the identification information of the network where the sending end and the receiving end are located of the data to be sent.

The pre-calculating, by the receiving end, the pre-coding sequence of the first identification information specifically includes:

encoding a sequence consisting of an X-bit prefix sequence, the N1 bits of the first identification information and a K-bit tail bit by using a BCC encoder to form an encoded sequence, wherein the prefix sequence is a predefined sequence or a random sequence or a sequence generated according to a predefined rule, the length X of the prefix sequence depends on the BCC encoding coding rate, the total length of the data to be transmitted and the value of N1+ K, and X is an integer greater than or equal to zero;

and taking the last M bits of the coded sequence as a pre-coding sequence of the first identification information.

The initial state of the BCC encoder is the same as the K tail bits, and the K tail bits are a predefined sequence of K bits.

The second identification information includes a first part and a second part, the first part has a length of N1 bits and is located before and immediately adjacent to the tail bits of the data to be transmitted, and the second part has a length of N-N1 bits and is located before the first part and at least separated from the first part by 1 bit.

After performing Binary Convolutional Coding (BCC) decoding on the data sequence added with the pre-coding sequence to obtain a decoded data sequence, the method includes: the receiving end obtains third identification information from the decoded data sequence and judges whether the third identification information is the same as the first identification information, wherein the third identification information is a result of the second identification information after being transmitted by a channel and received by the receiving end.

Example ten

Referring to fig. 17, with reference to the foregoing embodiment, a tenth embodiment provides a data transmission method, including:

s31: a receiving end pre-calculates a pre-coding sequence of first identification information;

the receiving end receives an encoded data sequence which is sent by a transmitting end and has M truncated bits at the head, the encoded data sequence is data which is sent by the transmitting end and is obtained by BCC encoding of data to be transmitted by the transmitting end and truncation of M truncated bits at the tail of the encoded data, the data to be transmitted comprises N bits of second identification information and K bits of tail bits, the tail bits are located at the tail of the data to be transmitted, N1 bits of the second identification information are located at the head of the data to be transmitted, wherein N, K, N1 is positive integers which are not less than 1, N1 is not more than N, and M is an integer which is not less than 1;

s32: adding the pre-coding sequence of the first identification information to the head of the received coded data sequence to form a data sequence added with the pre-coding sequence;

s33: and carrying out BCC decoding on the data sequence added with the pre-coding sequence to obtain a decoded data sequence.

The pre-coding sequence for pre-calculating the first identification information by the receiving end specifically includes: encoding the X-bit prefix sequence and the N1 bits of the first identification information by a BCC encoder to form an encoded sequence, wherein X is an integer greater than or equal to zero; and taking the first M bits in the sequence as a pre-coding sequence.

EXAMPLE eleven

Referring to fig. 18, in combination with the above embodiments, an eleventh embodiment provides a communication device, including:

a processor 101, configured to perform BCC coding on data to be transmitted to form a coded original data sequence; the data to be transmitted comprises N bits of identification information and K bits of tail bits, the tail bits are located at the tail of the data to be transmitted, N1 bits of the identification information are located before the tail bits and are adjacent to the tail bits, wherein N, K, N1 are positive integers not less than 1, and N1 is not more than N;

the processor 101 is further configured to truncate M bits at the tail of the encoded original data sequence to form an encoded data sequence, where each of the M bits is only related to the N1 bits of the identification information or only related to the N1 bits and tail bits of the identification information, where M is a positive integer not less than 1; and

a transmitter 102 for transmitting the encoded data sequence.

If the processor BCC codes the data to be transmitted by adopting 1/2 rate convolutional coding, M is less than or equal to 2 multiplied by N1.

If the processor BCC codes the data to be transmitted with 1/2 rate convolutional coding, then M is 2 × K.

Example twelve

Referring to fig. 19, with reference to the foregoing embodiments, a twelfth embodiment provides a communication device, including:

a processor 111, configured to perform BCC coding on data to be transmitted to form a coded original data sequence; the data to be transmitted comprises N bits of identification information and K bits of tail bits, the tail bits are positioned at the tail part of the data to be transmitted, and the N1 bits of the identification information are positioned at the head part of the data to be transmitted; the coded original data sequence comprises N2 bits corresponding to the N1 bit identification information of the header of the data to be transmitted; wherein N, K, N1 and N2 are positive integers not less than 1, N1 is not more than N, and N2 is more than N1;

the processor 111 is further configured to truncate M bits of a header of the encoded original data sequence to form an encoded data sequence, where each bit of the M bits is only related to the N1 bits of the identification information, where M is a natural number and is greater than or equal to 1 and less than or equal to N2; and

a transmitter 112 for transmitting the encoded data sequence.

If the processor BCC codes the data to be transmitted by adopting 1/2 rate convolutional coding, M is less than or equal to 2 multiplied by N1, and M is less than or equal to 2M 2.

EXAMPLE thirteen

Referring to fig. 20, with reference to the foregoing embodiments, a thirteenth embodiment provides a communication device, including:

a processor 121, configured to pre-calculate a pre-coding sequence of the first identification information;

a receiver 122, configured to receive an encoded data sequence sent by a transmitting end and having M truncated bits at a tail, where the encoded data sequence is data obtained by a sending end performing BCC encoding on data to be transmitted and truncating M truncated bits at the tail of the encoded data, the data to be transmitted includes N-bit second identification information and K-bit tail bits, the tail bits are located at the tail of the data to be transmitted, N1 bits of the second identification information are located before and next to the tail bits, where N, K, N1 is positive integers not less than 1, N1 is not less than N, and M is an integer not less than 1;

the processor 121 is further configured to:

The first identification information is identification information stored by the communication device; the second identification information is the identification information of the sending end, or the identification information of the receiving end, or the identification information of the network where the sending end and the receiving end are located of the data to be sent.

The processor 121 is further specifically configured to:

The processor 121 is further specifically configured to: and obtaining third identification information from the decoded data sequence, and judging whether the third identification information is the same as the first identification information, wherein the third identification information is a result of the second identification information after being transmitted through a channel and received by the communication equipment.

If the processor 121 BCC codes the data to be transmitted by using 1/2-rate convolutional coding, M is less than or equal to 2 XN 1.

If the processor 121 BCC codes the data to be transmitted with 1/2 rate convolutional coding, then M is 2 × K.

Example fourteen

Referring to fig. 21, in combination with the above embodiments, the fourteenth embodiment provides a communication device, including:

a processor 131, configured to pre-calculate a pre-coding sequence of the first identification information;

a receiver 132, configured to receive an encoded data sequence sent by a transmitting end and having M truncated bits at a head, where the encoded data sequence is data obtained by a transmitting end performing BCC encoding on data to be transmitted and truncating M truncated bits at a tail of the encoded data, the data to be transmitted includes N-bit second identification information and K-bit tail bits, the tail bits are located at the tail of the data to be transmitted, N1 bits of the second identification information are located at the head of the data to be transmitted, where N, K, N1 is positive integers not less than 1, N1 is not greater than N, and M is an integer not less than 1;

the processor 131 is further configured to:

The processor 131 is further specifically configured to: encoding the X-bit prefix sequence and the N1 bits of the first identification information by a BCC encoder to form an encoded sequence, wherein X is an integer greater than or equal to zero; and taking the first M bits in the sequence as a pre-coding sequence.

Those of ordinary skill in the art will understand that: all or a portion of the steps of implementing the above-described method embodiments may be performed by hardware associated with program instructions. The program may be stored in a computer-readable storage medium. When executed, the program performs steps comprising the method embodiments described above; and the aforementioned storage medium includes: various media that can store program codes, such as ROM, RAM, magnetic or optical disks.

Claims

1. A method of data transmission, comprising:

carrying out BCC coding on data to be transmitted by using a binary convolutional code to form a coded original data sequence; the data to be transmitted comprises N bits of identification information and K bits of tail bits, the tail bits are located at the tail of the data to be transmitted, N1 bits of the identification information are located before the tail bits and are adjacent to the tail bits, wherein N, K, N1 are positive integers not less than 1, and N1 is not more than N;

cutting off M bits at the tail part of the coded original data sequence, wherein the M bits are irrelevant to data before the N1 bits of the identification information in the data to be transmitted; wherein M is a positive integer not less than 1; and

and transmitting the coded data sequence.

2. The data transmission method according to claim 1, wherein an initial state of the BCC encoded encoder is the same as the K tail bits, and the K tail bits are a predefined sequence of K bits.

3. The data transmission method according to claim 1, wherein the identification information is identification information of a transmitting end, identification information of a receiving end, or identification information of a network where the transmitting end and the receiving end are located of the data to be transmitted.

4. The data transmission method according to any one of claims 1 to 3, wherein the N1 bits of the identification information include a first segment and a second segment arranged in series; the first segment of the identification information is located before the second segment of the identification information; the first section of the identification information is M1 bit data, the second section of the identification information is M2 bit data, wherein M1+ M2 is N1, and M1 is more than or equal to K.

5. A data transmission method as claimed in any one of claims 1 to 3, characterized in that M ≦ 2 × N1 if the BCC coding for the data to be transmitted employs 1/2 rate convolutional coding.

6. A data transmission method according to any one of claims 1-3, wherein M-2 × K if BCC coding of the data to be transmitted employs 1/2 rate convolutional coding.

7. A method as claimed in any one of claims 1 to 3, characterized in that the value of M is related to the coding rate at which the BCC coding of the data to be transmitted is performed.

8. The data transmission method according to claim 1, wherein the identification information comprises a first part and a second part, the first part of the identification information has a length of N1 bits and is located before and immediately adjacent to the tail bits of the data to be transmitted, and the second part of the identification information has a length of N-N1 bits and is located before and at least 1bit apart from the first part of the identification information.

9. The data transmission method according to claim 4, wherein the value of M is related to the coding rate at which the BCC coding is performed on the data to be transmitted.

10. A data transmission method, characterized in that it has all the features of the method of any one of claims 5 or 6, and in that the value of M is related to the coding rate at which the BCC coding of the data to be transmitted is performed.

11. A method of data transmission, comprising:

carrying out BCC coding on data to be transmitted by using a binary convolutional code to form a coded original data sequence; the data to be transmitted comprises N bits of identification information and K bits of tail bits, the tail bits are positioned at the tail part of the data to be transmitted, and the N1 bits of the identification information are positioned at the head part of the data to be transmitted; the coded original data sequence comprises N2 bits corresponding to the N1 bit identification information of the header of the data to be transmitted; wherein N, K, N1 and N2 are positive integers not less than 1, N1 is not more than N, and N2 is more than N1;

cutting off M bits of the head of the encoded original data sequence to form an encoded data sequence, wherein each bit of the M bits is only related to the N1 bits of the identification information, M is a natural number, and M is more than or equal to 1 and less than or equal to N2; and

and transmitting the coded data sequence.

12. The data transmission method according to claim 11, wherein the identification information is identification information of a transmitting end, identification information of a receiving end, or identification information of a network where the transmitting end and the receiving end are located of the data to be transmitted.

13. The data transmission method according to any one of claims 11 to 12, wherein the identification information includes a first section and a second section arranged in series; a first section of the identification information is related to data preceding the identification information, and a second section of the identification information is related to only the identification information; the first section of the identification information is positioned at the front side of the second section of the identification information; the first section of the identification information is M1 bit data, the second section of the identification information is M2 bit data, wherein M1+ M2 is N1, and M1 is more than or equal to K.

14. The data transmission method of claim 13, wherein M.ltoreq.2XN 1, M.ltoreq.2M 2 if BCC coding of the data to be transmitted uses 1/2-rate convolutional coding.

15. The data transmission method according to claim 11, wherein the identification information comprises a first part and a second part, the first part of the identification information has a length of N1 bits and is located at the head of the data to be transmitted, and the second part of the identification information has a length of N-N1 bits and is located after the first part of the identification information and is spaced from the first part of the identification information by at least 1 bit.

16. A data transmission method, characterized in that it has all the features of any one of claims 11 to 14, and in that the value of M is related to the coding rate at which the BCC coding of the data to be transmitted is performed.

17. A method of data transmission, comprising:

a receiving end pre-calculates a pre-coding sequence of first identification information;

18. The data transmission method according to claim 17, wherein the first identification information is identification information stored by the receiving end; the second identification information is identification information of a sending end of the data to be sent, or identification information of a receiving end, or identification information of a network where the sending end and the receiving end are located.

19. The data transmission method according to claim 17, wherein the pre-calculating, by the receiving end, the pre-coding sequence of the first identification information specifically includes:

encoding a sequence consisting of an X-bit prefix sequence, N1 bits of the first identification information and K tail bits of the first identification information by using a BCC encoder to form an encoded sequence, wherein the prefix sequence is a predefined sequence or a random sequence or a sequence generated according to a predefined rule, the length X of the prefix sequence depends on the BCC encoded encoding rate, the total length of the data to be transmitted and the value of N1+ K, and X is an integer greater than or equal to zero;

20. The data transmission method of claim 17, wherein an initial state of the BCC encoder is the same as the K tail bits, and wherein the K tail bits are a predefined sequence of K bits.

21. The data transmission method of claim 17, wherein the second identification information comprises a first portion and a second portion, the first portion has a length of N1 bits and is located before and immediately adjacent to the tail bits of the data to be transmitted, and the second portion has a length of N-N1 bits and is located before and at least 1bit apart from the first portion.

22. The data transmission method according to claim 21, wherein after performing BCC decoding on the data sequence added with the precoding sequence to obtain a decoded data sequence, the method comprises: and the receiving terminal acquires third identification information from the decoded data sequence and judges whether the third identification information is the same as the first identification information or not, wherein the third identification information is a result of the second identification information after being transmitted by a channel and received by the receiving terminal.

23. The data transmission method of claim 17, wherein M ≦ 2 xN 1 if BCC coding for the data to be transmitted employs 1/2-rate convolutional coding.

24. The data transmission method according to claim 17, wherein M-2 × K if the BCC coding of the data to be transmitted employs 1/2-rate convolutional coding.

25. A method of data transmission, comprising:

26. The data transmission method according to claim 25, wherein the first identification information is identification information stored by the receiving end; the second identification information is identification information of a sending end of the data to be sent, or identification information of a receiving end, or identification information of a network where the sending end and the receiving end are located.

27. The data transmission method according to claim 25, wherein the pre-calculating, by the receiving end, the pre-coding sequence of the first identification information specifically includes: encoding the X-bit prefix sequence and the N1 bits of the first identification information by a BCC encoder to form an encoded sequence, wherein X is an integer greater than or equal to zero; and taking the first M bits in the sequence as a pre-coding sequence.

28. A communication device, comprising:

a transmitter for transmitting the encoded data sequence.

29. A communication device according to claim 28, wherein an initial state of said BCC encoder is the same as said K tail bits, and wherein said K tail bits are a predefined sequence of K bits.

30. The apparatus according to claim 28, wherein the identification information is identification information of a transmitting end, identification information of a receiving end, or identification information of a network where the transmitting end and the receiving end are located of the data to be transmitted.

31. The communication device according to any one of claims 28 to 30, wherein the N1 bits of the identification information include a first segment and a second segment arranged in series; the first segment of the identification information is located before the second segment of the identification information; the first section of the identification information is M1 bit data, the second section of the identification information is M2 bit data, wherein M1+ M2 is N1, and M1 is more than or equal to K.

32. The communications device of claim 28, wherein M ≦ 2 xn 1 if the processor BCC encodes the data for transmission using 1/2 rate convolutional encoding.

33. The communications device of claim 28, wherein M-2 x K if the BCC encoding of the data to be transmitted by the processor is a 1/2 rate convolutional encoding.

34. The communications device of claim 28, wherein the identification information comprises a first portion and a second portion, wherein the first portion of the identification information has a length of N1 bits and is located immediately before and immediately after the tail bits of the data to be transmitted, and wherein the second portion of the identification information has a length of N-N1 bits and is located before and at least 1bit apart from the first portion of the identification information.

35. A communication device, characterized in that it has all the features of any of claims 28-33, and in that the value of M is related to the coding rate at which the BCC coding of the data to be transmitted is performed.

36. A communication device, comprising:

a transmitter for transmitting the encoded data sequence.

37. The apparatus according to claim 36, wherein the identification information is identification information of a transmitting end, identification information of a receiving end, or identification information of a network where the transmitting end and the receiving end are located of the data to be transmitted.

38. The communication device according to any of claims 36-37, wherein the identification information comprises a first segment and a second segment arranged in series; a first section of the identification information is related to data preceding the identification information, and a second section of the identification information is related to only the identification information; the first section of the identification information is positioned at the front side of the second section of the identification information; the first section of the identification information is M1 bit data, the second section of the identification information is M2 bit data, wherein M1+ M2 is N1, and M1 is more than or equal to K.

39. The communications device of claim 36, wherein M ≦ 2 XN 1 and M ≦ 2M2 if the processor BCC encodes the data for transmission using 1/2 rate convolutional encoding.

40. The apparatus of claim 36, wherein the identification information comprises a first portion and a second portion, the first portion of the identification information has a length of N1 bits and is located at the head of the data to be transmitted, and the second portion of the identification information has a length of N-N1 bits and is located after the first portion of the identification information and is separated from the first portion of the identification information by at least 1 bit.

41. A communication device having all the features of any of claims 36 to 39, wherein the value of M is related to the coding rate at which the BCC coding of the data to be transmitted is performed.

42. A communication device, comprising:

the processor is further configured to:

43. The communication device of claim 42, wherein the first identification information is identification information stored by the communication device; the second identification information is identification information of a sending end of the data to be sent, or identification information of a receiving end, or identification information of a network where the sending end and the receiving end are located.

44. The communications device of claim 42, wherein the processor is further specifically configured to:

45. The communication device of claim 42, wherein an initial state of the BCC encoder is the same as the K tail bits, and wherein the K tail bits are a predefined sequence of K bits.

46. The communications device of claim 42, wherein said second identification information comprises a first portion and a second portion, said first portion having a length of N1 bits and being located immediately before and immediately adjacent to said tail bits of said data to be transmitted, said second portion having a length of N-N1 bits and being located before and at least 1bit apart from said first portion.

47. The communications device of claim 42, wherein the processor is further specifically configured to: and acquiring third identification information from the decoded data sequence, and judging whether the third identification information is the same as the first identification information, wherein the third identification information is a result of the second identification information after being transmitted through a channel and received by the communication equipment.

48. The communications device of claim 42, wherein M ≦ 2 xN 1 if the processor BCC encodes the data for transmission using 1/2 rate convolutional encoding.

49. The communications device of claim 42, wherein M-2 xK if the BCC coding of the data to be transmitted by the processor is 1/2 rate convolutional coding.

50. A communication device, comprising:

the processor is further configured to:

51. The apparatus according to claim 50, wherein the first identification information is identification information stored by the receiving end; the second identification information is identification information of a sending end of the data to be sent, or identification information of a receiving end, or identification information of a network where the sending end and the receiving end are located.

52. The communications device of claim 50, wherein the processor is further specifically configured to: encoding the X-bit prefix sequence and the N1 bits of the first identification information by a BCC encoder to form an encoded sequence, wherein X is an integer greater than or equal to zero; and taking the first M bits in the sequence as a pre-coding sequence.

53. A computer-readable storage medium, storing a computer program which, when executed by hardware, is capable of implementing the method of any one of claims 1 to 27.