CN111464260B - Signal transmitting and receiving method and device - Google Patents

Signal transmitting and receiving method and device Download PDF

Info

Publication number
CN111464260B
CN111464260B CN201910054822.0A CN201910054822A CN111464260B CN 111464260 B CN111464260 B CN 111464260B CN 201910054822 A CN201910054822 A CN 201910054822A CN 111464260 B CN111464260 B CN 111464260B
Authority
CN
China
Prior art keywords
codeword
elements
code word
coding
encoding
Prior art date
Legal status (The legal status 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 status listed.)
Active
Application number
CN201910054822.0A
Other languages
Chinese (zh)
Other versions
CN111464260A (en
Inventor
曲秉玉
龚名新
周永行
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
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 Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to CN201910054822.0A priority Critical patent/CN111464260B/en
Priority to PCT/CN2020/071532 priority patent/WO2020151505A1/en
Publication of CN111464260A publication Critical patent/CN111464260A/en
Application granted granted Critical
Publication of CN111464260B publication Critical patent/CN111464260B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/0001Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0009Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the channel coding
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056Systems characterized by the type of code used
    • H04L1/0057Block codes

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Quality & Reliability (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)

Abstract

A signal transmitting and receiving method and device are used for improving the performance of channel coding. According to the method and the device, channel coding can be carried out on the first code word to obtain the second code word, in the process of obtaining 2/N elements and the remaining 2/N elements of the second code word, a first coding mode and a second coding mode are respectively used, at least one of the first coding mode and the second coding mode is a nonlinear coding mode, and the performance of channel coding can be improved by adopting the nonlinear coding mode.

Description

Signal transmitting and receiving method and device
Technical Field
The present disclosure relates to the field of communications technologies, and in particular, to a method and apparatus for sending and receiving a signal.
Background
In a communication system, channel coding is generally used to correct and detect errors of transmitted information, and scrambling is used to ensure interference randomization. In the enhanced mobile broadband (enhanced mobile broadband, emmbb) scenario of the new radio, NR, system, the control channel is encoded by means of a polar code, and the encoded bits are scrambled with a Gold sequence (sequence).
The polarization code is a linear code based on the theory of channel polarization, in which way the coding process can be accomplished by generating a matrix. Theory proves that under certain conditions, the polarization code can reach the channel capacity.
However, although polarization codes have more sophisticated decoding algorithms and lower complexity, the performance is not good enough in the case of limited code length.
Disclosure of Invention
The embodiment of the application provides a signal sending method and device, which are used for improving the performance of channel coding.
In a first aspect, there is provided a first signal transmission method, the method comprising: channel coding is carried out on a first codeword with K elements to obtain a second codeword with N elements, wherein N/2 elements of the second codeword are third codewords, the third codewords are obtained by a first coding mode from a first part of the first codewords, the remaining N/2 elements of the second codewords are fourth codewords, the fourth codewords are obtained by carrying out modulo A processing on codewords obtained by a second coding mode from a second part of the first codewords and the third codewords, the first part is M elements of the first codewords, the second part is the remaining K-M elements of the first codewords except the M elements, at least one of the first coding mode and the second coding mode is a nonlinear coding mode, N and K are positive integers, and N > K, A is an integer greater than 1; generating a first signal using the second codeword; and transmitting the first signal.
The method may be performed by a first communication device, which may be a first apparatus or a communication device capable of supporting the first apparatus to perform the functions required for the method, but may of course also be other communication devices, such as a system on a chip. Here, the first communication apparatus is exemplified as a first device. The first device may be a terminal device or a network device. The network device is illustratively an access network device, such as a base station.
According to the method and the device, channel coding can be carried out on the first code word to obtain the second code word, in the process of obtaining 2/N elements and the remaining 2/N elements of the second code word, a first coding mode and a second coding mode are respectively used, at least one of the first coding mode and the second coding mode is a nonlinear coding mode, and the performance of channel coding can be improved by adopting the nonlinear coding mode.
With reference to the first aspect, in a possible implementation manner of the first aspect, the first codeword is a part of an information element to be transmitted.
The first codeword may be part of the information element to be transmitted, e.g. the first codeword may be all of the information element to be transmitted, or may also be part of the information element to be transmitted. If the first codeword is only a part of the information element to be transmitted, the other codewords in the information element to be transmitted, except for the first codeword, may also be processed in the same channel coding manner as the first codeword, for example, the information element to be transmitted, except for the first codeword, may also be processed in the same channel coding manner as the first codeword, or the other codewords in the information element to be transmitted, except for the first codeword, may also be processed in a different channel coding manner as the first codeword, which is not limited in particular.
With reference to the first aspect, in a possible implementation manner of the first aspect, the third codeword is a first N/2 elements of the second codeword, and the fourth codeword is a last N/2 elements of the second codeword.
In this embodiment of the present application, the third codeword may be the first N/2 elements of the second codeword, and the fourth codeword may be the last N/2 elements of the second codeword. Further, the first portion may be the first M elements of the first codeword, and the second portion may be the remaining K-M elements of the first codeword other than the first M elements. For another example, the first portion of the first codeword may be the last M elements, or may be any M elements, and the first portion of the first codeword may be M consecutive or M discontinuous elements, and the second portion of the first codeword is the remaining K-M elements of the first codeword other than the first portion of the first codeword. Similarly, the third codeword may be the last N/2 elements of the second codeword, or may be any N/2 elements of the second codeword, and the third codeword may be consecutive N/2 elements, or may be discontinuous N/2 elements, and the fourth codeword is the remaining N/2 elements of the second codeword except for the third codeword. The specific one is not limited.
In a second aspect, there is provided a second signal transmission method, the method comprising: code word for K elements
Figure GDA0003841386120000021
Performing channel coding to obtain N-element code words +.>
Figure GDA0003841386120000022
Wherein said channel coding is such that said +.>
Figure GDA0003841386120000023
And->
Figure GDA0003841386120000024
Satisfy (S)>
Figure GDA0003841386120000025
Figure GDA0003841386120000026
Figure GDA0003841386120000027
Wherein [ y ] 1 ,y 2 ,…,y N/2 ]For code word->
Figure GDA0003841386120000028
N/2 elements of (a)>
Figure GDA0003841386120000029
For code word->
Figure GDA00038413861200000210
The remaining N/2 elements of +.>
Figure GDA00038413861200000211
Representing modulo A addition, ++>
Figure GDA00038413861200000212
Is composed of
Figure GDA00038413861200000213
Code words obtained by the third coding mode, are encoded>
Figure GDA00038413861200000214
Is composed of
Figure GDA00038413861200000215
Code word obtained by the fourth coding mode, < >>
Figure GDA00038413861200000216
Is composed of
Figure GDA00038413861200000217
A codeword obtained by encoding in a fifth encoding mode, wherein at least one of the third encoding mode and the fifth encoding mode is a nonlinear encoding mode, and the codeword ∈ ->
Figure GDA00038413861200000218
For the code word->
Figure GDA00038413861200000219
Is the code word +.>
Figure GDA00038413861200000220
For the code word->
Figure GDA00038413861200000221
The rest K-B elements in the formula (I) are B, wherein B is an integer greater than 0 and less than K, N and K are positive integers, N>K, A is an integer greater than 1; use the code word->
Figure GDA00038413861200000222
Generating a first signal; and transmitting the first signal.
The method may be performed by a second communication device, which may be the first apparatus or a communication device capable of supporting the functions required by the first apparatus to implement the method, but may of course also be other communication devices, such as a system on a chip. Here, the second communication apparatus is exemplified as the first device. The first device may be a terminal device or a network device. The network device is illustratively an access network device, such as a base station.
Embodiments of the present application may be directed to codewords
Figure GDA00038413861200000223
Channel coding to obtain code word->
Figure GDA00038413861200000224
In obtaining code word->
Figure GDA00038413861200000225
In the process of 2/N elements and the rest 2/N elements, a third coding mode and a fifth coding mode are respectively used, at least one of the third coding mode and the fifth coding mode is a nonlinear coding mode, and the nonlinear coding mode is adopted to help to improve the channel codingIs a performance of the (c).
With reference to the second aspect, in a possible implementation manner of the second aspect, the codeword
Figure GDA0003841386120000031
Is part of the information element to be transmitted.
Code word
Figure GDA0003841386120000032
May be part of an information element to be transmitted, e.g. codeword +>
Figure GDA0003841386120000033
May be all or part of the information element to be transmitted. If codeword->
Figure GDA0003841386120000034
Only the part of the information element to be transmitted, except the code word +.>
Figure GDA0003841386120000035
Other code words than code word +.>
Figure GDA0003841386120000036
The same channel coding is used for processing, e.g. the information elements to be transmitted are apart from the code words +.>
Figure GDA0003841386120000037
A code word is included, for which channel coding can also be carried out in the same way, or for which the information element to be transmitted is other than the code word +. >
Figure GDA0003841386120000038
Other code words than code word +.>
Figure GDA0003841386120000039
The different channel coding modes are processed, and the method is not particularly limited.
With reference to the first aspect, in a possible implementation manner of the first aspect, or with reference to the second aspect, in a possible implementation manner of the second aspect, the pre-coding codeword corresponding to the nonlinear coding manner is
Figure GDA00038413861200000310
The code word after the code word corresponding to the nonlinear coding mode is +.>
Figure GDA00038413861200000311
E>D, said nonlinear coding is such that said ++>
Figure GDA00038413861200000312
And said->
Figure GDA00038413861200000313
The method can be used for solving the problems that,
Figure GDA00038413861200000314
Figure GDA00038413861200000315
wherein->
Figure GDA00038413861200000316
Representing modulo A addition, ++>
Figure GDA00038413861200000317
Is composed of
Figure GDA00038413861200000318
Coding the obtained code word by eighteenth coding mode, < >>
Figure GDA00038413861200000319
Is composed of
Figure GDA00038413861200000320
Coding the resulting code word by nineteenth coding means, a code word>
Figure GDA00038413861200000321
Is composed of->
Figure GDA00038413861200000322
Encoded codeword by twentieth encoding scheme, [ h ] 1 ,h 2 ,…,h E/2 ]For the code word->
Figure GDA00038413861200000323
E/2 elements of (E),. About.>
Figure GDA00038413861200000324
For code word->
Figure GDA00038413861200000325
The remaining E/2 elements of said codeword +.>
Figure GDA00038413861200000326
For the code word->
Figure GDA00038413861200000327
Is said codeword +.>
Figure GDA00038413861200000328
For the code word->
Figure GDA00038413861200000329
Z is an integer greater than 0 and less than D, and A is an integer greater than 1.
This is an example of a nonlinear encoding scheme, and is not particularly limited thereto.
With reference to the first aspect, in a possible implementation manner of the first aspect, or with reference to the second aspect, in a possible implementation manner of the second aspect, the first coding mode is a Delsarte-golthans code, and the second coding mode is a first-order Reed-Muller code.
This is just one example, and the specific one is not limited thereto.
In a third aspect, there is provided a first signal receiving method, the method comprising: receiving a first signal; the first signal is generated by a second codeword of N elements, the second codeword is satisfied, N/2 elements of the second codeword are third codewords, the third codewords are obtained by a first portion of the first codewords through a first coding mode, the remaining N/2 elements of the second codewords are fourth codewords, the fourth codewords are obtained by a second portion of the first codewords through a second coding mode and the third codewords through modulo a processing, the first portion is M elements of the first codewords, the second portion is the remaining K-M elements of the first codewords except the M elements, at least one of the first coding mode and the second coding mode is a nonlinear coding mode, and a is an integer greater than 1; and carrying out channel decoding on the first signal to obtain a first codeword with K elements, wherein N and K are positive integers, and N is greater than K.
The method may be performed by a third communication device, which may be the second apparatus or a communication device capable of supporting the second apparatus to perform the functions required for the method, but may of course also be other communication devices, such as a system on a chip. Here, the third communication means is exemplified as the second device. Wherein the first device is a terminal device and the second device is a network device, or the first device is a network device and the second device is a terminal device. The network device is illustratively an access network device, such as a base station.
With reference to the third aspect, in a possible implementation manner of the third aspect, the first codeword is part of a received information element.
With reference to the third aspect, in a possible implementation manner of the third aspect, the third codeword is a first N/2 elements of the second codeword, and the fourth codeword is a last N/2 elements of the second codeword.
In a fourth aspect, there is provided a second signal receiving method, the method comprising: receiving a first signal; the first signal is a codeword of N elements
Figure GDA0003841386120000041
Generating, codeword->
Figure GDA0003841386120000042
Satisfy (S)>
Figure GDA0003841386120000043
Figure GDA0003841386120000044
Wherein->
Figure GDA0003841386120000045
Representing modulo A addition, ++>
Figure GDA0003841386120000046
Is composed of->
Figure GDA0003841386120000047
The resulting codeword is encoded by the third encoding scheme,
Figure GDA0003841386120000048
is composed of->
Figure GDA0003841386120000049
The resulting codeword is encoded by the fourth encoding scheme,
Figure GDA00038413861200000410
is composed of->
Figure GDA00038413861200000411
The code word obtained by the fifth coding mode is coded, wherein at least one of the third coding mode and the fifth coding mode is a nonlinear coding mode, [ y ] 1 ,y 2 ,…,y N/2 ]For code words
Figure GDA00038413861200000412
N/2 elements of (a)>
Figure GDA00038413861200000413
For code word->
Figure GDA00038413861200000414
The remaining N/2 elements of (3); channel decoding the first signal to obtain K element code words +.>
Figure GDA00038413861200000415
Wherein the code word->
Figure GDA00038413861200000416
For the code word->
Figure GDA00038413861200000417
Is the code word +.>
Figure GDA00038413861200000418
For the code word->
Figure GDA00038413861200000419
The rest K-B elements in the formula (I) are B, wherein B is an integer greater than 0 and less than K, N and K are positive integers, N >K, A is an integer greater than 1.
The method may be performed by a fourth communication device, which may be the second apparatus or a communication device capable of supporting the second apparatus to perform the functions required for the method, but may also be other communication devices, such as a system on a chip. Here, the fourth communication means is exemplified as the second device. Wherein the first device is a terminal device and the second device is a network device, or the first device is a network device and the second device is a terminal device. The network device is illustratively an access network device, such as a base station.
With reference to the fourth aspect, in a possible implementation manner of the fourth aspect, the codeword
Figure GDA00038413861200000420
Is part of the received information element.
In a fifth aspect, there is provided a third signal receiving method, the method comprising: receiving a first signal; the first signal is generated by a second codeword of N elements, the second codeword is satisfied, N/2 elements of the second codeword are third codewords, the third codewords are obtained by a first portion of the first codewords through a first coding mode, the remaining N/2 elements of the second codewords are fourth codewords, the fourth codewords are obtained by a second portion of the first codewords through a second coding mode and the third codewords through modulo a processing, the first portion is M elements of the first codewords, the second portion is the remaining K-M elements of the first codewords except the M elements, at least one of the first coding mode and the second coding mode is a nonlinear coding mode, and a is an integer greater than 1; performing channel decoding on a fourth codeword in the second codewords of the N elements to obtain a first channel decoding result; performing channel decoding on a third codeword in the second codeword of the N elements according to the first decoding result to obtain a second channel decoding result; and obtaining a first codeword of K elements according to the first channel decoding result and the second channel decoding result, wherein N and K are positive integers, and N is greater than K.
The method may be performed by a fifth communication device, which may be the second apparatus or a communication device capable of supporting the second apparatus to perform the functions required for the method, but may of course also be other communication devices, such as a system on a chip. Here, the fifth communication means is exemplified as the second device. Wherein the first device is a terminal device and the second device is a network device, or the first device is a network device and the second device is a terminal device. The network device is illustratively an access network device, such as a base station.
With reference to the fifth aspect, in a possible implementation manner of the fifth aspect, the first codeword is part of a received information element.
With reference to the fifth aspect, in a possible implementation manner of the fifth aspect, the third codeword is a first N/2 elements of the second codeword, and the fourth codeword is a last N/2 elements of the second codeword.
With reference to the third aspect in combination with the third aspect,in a possible implementation manner of the third aspect, or in combination with the fourth aspect, in a possible implementation manner of the fourth aspect, or in combination with the fifth aspect, in a possible implementation manner of the fifth aspect, the pre-coding codeword corresponding to the nonlinear coding manner is
Figure GDA0003841386120000051
The code word after the code word corresponding to the nonlinear coding mode is
Figure GDA0003841386120000052
E>D, said nonlinear coding is such that said ++>
Figure GDA0003841386120000053
And said->
Figure GDA0003841386120000054
Satisfy (S)>
Figure GDA0003841386120000055
Figure GDA0003841386120000056
Figure GDA0003841386120000057
Wherein->
Figure GDA0003841386120000058
Representing modulo A addition, ++>
Figure GDA0003841386120000059
Is composed of->
Figure GDA00038413861200000510
Coding the obtained code word by eighteenth coding mode, < >>
Figure GDA00038413861200000511
Is composed of->
Figure GDA00038413861200000512
Coding the resulting code word by nineteenth coding means, a code word>
Figure GDA00038413861200000513
Is composed of->
Figure GDA00038413861200000514
Encoded codeword by twentieth encoding scheme, [ h ] 1 ,h 2 ,…,h E/2 ]For the code word->
Figure GDA00038413861200000515
E/2 elements of (E),. About.>
Figure GDA00038413861200000516
For code word->
Figure GDA00038413861200000517
The remaining E/2 elements of said codeword +.>
Figure GDA00038413861200000518
For the code word->
Figure GDA00038413861200000519
Is said codeword +.>
Figure GDA00038413861200000520
For the code word->
Figure GDA00038413861200000521
Z is an integer greater than 0 and less than D, and A is an integer greater than 1.
With reference to the third aspect, in a possible implementation manner of the third aspect, or with reference to the fourth aspect, in a possible implementation manner of the fourth aspect, or with reference to the fifth aspect, in a possible implementation manner of the fifth aspect, the first coding mode is a Delsarte-golthanals code, and the second coding mode is a first order Reed-Muller code.
Regarding the technical effects of the third aspect or the various possible embodiments of the third aspect, reference may be made to the description of the technical effects of the first aspect or the various possible embodiments of the first aspect. Regarding the technical effects of the fourth aspect or the various possible embodiments of the fourth aspect, reference may be made to the description of the technical effects of the second aspect or the various possible embodiments of the second aspect. Regarding the technical effects of the fifth aspect or the various possible embodiments of the fifth aspect, reference may be made to the description of the technical effects of the first aspect or the various possible embodiments of the first aspect.
In a sixth aspect, a first communication apparatus is provided, which may be a first device or a chip in the first device. The communication device may include a processing module and a transceiver module. For example, the processing module may be a processor and the transceiver module may be a transceiver. Optionally, the communication device may further comprise a storage module, which may be a memory. The storage module is used for storing instructions, and the processing module executes the instructions stored by the storage module so as to enable the communication device to execute the corresponding functions in the first aspect. When the communication device is a chip in the first apparatus, the processing module may be a processor, and the transceiver module may be an input/output interface, a pin, or a circuit, etc.; the processing module executes instructions stored by the storage module to cause the first device to perform the corresponding functions in the first aspect, where the storage module may be a storage unit (e.g., a register, a cache, etc.) in the chip, or may be a storage unit (e.g., a read-only memory, a random access memory, etc.) in the first device that is located outside the chip.
In a seventh aspect, a second communication apparatus is provided, where the communication apparatus may be the first device or may be a chip in the first device. The communication device may include a processing module and a transceiver module. For example, the processing module may be a processor and the transceiver module may be a transceiver. Optionally, the communication device may further comprise a storage module, which may be a memory. The storage module is used for storing instructions, and the processing module executes the instructions stored by the storage module so as to enable the communication device to execute the corresponding functions in the first aspect. When the communication device is a chip in the first apparatus, the processing module may be a processor, and the transceiver module may be an input/output interface, a pin, or a circuit, etc.; the processing module executes instructions stored by a storage module, which may be a storage unit (e.g., a register, a cache, etc.) within the chip, or a storage unit (e.g., a read-only memory, a random access memory, etc.) within the first device that is external to the chip, to cause the first device to perform the corresponding functions in the second aspect.
In an eighth aspect, a third communication apparatus is provided, where the communication apparatus may be the second device or may be a chip in the second device. The communication device may include a processing module and a transceiver module. For example, the processing module may be a processor and the transceiver module may be a transceiver. Optionally, the communication device may further comprise a storage module, which may be a memory. The storage module is configured to store instructions, and the processing module executes the instructions stored in the storage module, so that the communication device performs the corresponding function in the third aspect. When the communication device is a chip in the second apparatus, the processing module may be a processor, and the transceiver module may be an input/output interface, a pin, or a circuit, etc.; the processing module executes instructions stored by the storage module to cause the second device to perform the functions corresponding to the third aspect, where the storage module may be a storage unit (e.g., a register, a cache, etc.) in the chip, or may be a storage unit (e.g., a read-only memory, a random access memory, etc.) in the second device that is located outside the chip.
In a ninth aspect, a fourth communication apparatus is provided, where the communication apparatus may be the second device or may be a chip in the second device. The communication device may include a processing module and a transceiver module. For example, the processing module may be a processor and the transceiver module may be a transceiver. Optionally, the communication device may further comprise a storage module, which may be a memory. The storage module is configured to store instructions, and the processing module executes the instructions stored in the storage module, so that the communication device performs the corresponding function in the fourth aspect. When the communication device is a chip in the second apparatus, the processing module may be a processor, and the transceiver module may be an input/output interface, a pin, or a circuit, etc.; the processing module executes instructions stored in the storage module to cause the second device to perform the corresponding functions in the fourth aspect, where the storage module may be a storage unit (e.g., a register, a cache, etc.) in the chip, or may be a storage unit (e.g., a read-only memory, a random access memory, etc.) in the second device that is located outside the chip.
In a tenth aspect, a fifth communication apparatus is provided, where the communication apparatus may be the second device or may be a chip in the second device. The communication device may include a processing module and a transceiver module. For example, the processing module may be a processor and the transceiver module may be a transceiver. Optionally, the communication device may further comprise a storage module, which may be a memory. The storage module is configured to store instructions, and the processing module executes the instructions stored in the storage module, so that the communication device performs the corresponding function in the fifth aspect. When the communication device is a chip in the second apparatus, the processing module may be a processor, and the transceiver module may be an input/output interface, a pin, or a circuit, etc.; the processing module executes instructions stored in the storage module to cause the second device to perform the corresponding functions in the fifth aspect, where the storage module may be a storage unit (e.g., a register, a cache, etc.) in the chip, or may be a storage unit (e.g., a read-only memory, a random access memory, etc.) in the second device that is located outside the chip.
In an eleventh aspect, there is provided a first communication system that may include the first communication device of the sixth aspect and the third communication device of the eighth aspect.
In a twelfth aspect, there is provided a second communication system that may include the first communication device of the sixth aspect and the fifth communication device of the tenth aspect.
In a thirteenth aspect, there is provided a third communication system that may include the second communication device of the seventh aspect and the fourth communication device of the ninth aspect.
The first communication system, the second communication system, and the third communication system may be the same communication system, or may be different communication systems, respectively, or it is possible that any two of them are the same communication system, and the remaining one is a different communication system.
In a fourteenth aspect, there is provided a computer storage medium having instructions stored therein which, when run on a computer, cause the computer to perform the method described in any one of the possible designs of the first aspect or the first aspect.
In a fifteenth aspect, there is provided a computer storage medium having instructions stored therein which, when run on a computer, cause the computer to perform the method described in any one of the possible designs of the second aspect or the second aspect described above.
In a sixteenth aspect, there is provided a computer storage medium having instructions stored therein which, when run on a computer, cause the computer to perform the method described in any one of the possible designs of the third aspect or the third aspect described above.
In a seventeenth aspect, there is provided a computer storage medium having instructions stored therein which, when run on a computer, cause the computer to perform the method described in any one of the possible designs of the fourth or fourth aspect above.
In an eighteenth aspect, there is provided a computer storage medium having instructions stored therein which, when run on a computer, cause the computer to perform the method described in any one of the above fifth or any one of the possible designs of the fifth aspect.
In a nineteenth aspect, there is provided a computer program product comprising instructions stored therein which, when run on a computer, cause the computer to perform the method described in the first aspect or any one of the possible designs of the first aspect.
In a twentieth aspect, there is provided a computer program product comprising instructions stored therein, which when run on a computer, cause the computer to perform the method as described in the second aspect or any one of the possible designs of the second aspect.
In a twenty-first aspect, there is provided a computer program product comprising instructions stored therein, which when run on a computer, cause the computer to perform the method as described in any one of the possible designs of the above third aspect or third aspect.
In a twenty-second aspect, there is provided a computer program product comprising instructions stored therein, which when run on a computer, cause the computer to perform the method as described in any one of the possible designs of the fourth or fourth aspect above.
In a twenty-third aspect, there is provided a computer program product comprising instructions stored therein, which when run on a computer, cause the computer to perform the method as described in any one of the above fifth or any one of the possible designs of the fifth aspect.
According to the method and the device, channel coding can be carried out on the first code word to obtain the second code word, in the process of obtaining 2/N elements and the remaining 2/N elements of the second code word, a first coding mode and a second coding mode are respectively used, at least one of the first coding mode and the second coding mode is a nonlinear coding mode, and the performance of channel coding can be improved by adopting the nonlinear coding mode.
Drawings
FIG. 1 is a schematic illustration of communication between a wireless device and a wireless communication system;
fig. 2 is a schematic structural diagram of an access network device in an embodiment of the present application;
fig. 3 is a schematic structural diagram of a terminal device in an embodiment of the present application;
fig. 4 is a flowchart of a signal sending and receiving method provided in an embodiment of the present application;
FIG. 5 is a schematic diagram of a process of generating a first signal by a first device according to an embodiment of the present application;
fig. 6 is a schematic diagram of a process of processing a first signal by a second device according to an embodiment of the present application;
FIG. 7 is a schematic diagram of performance comparison between the result of channel coding and polarization codes according to the method provided in the embodiment shown in FIG. 4;
fig. 8 is a flowchart of another signal transmitting and receiving method according to an embodiment of the present application;
fig. 9 is a schematic diagram of a process for obtaining a codeword y according to a codeword x according to the method provided in the embodiment shown in fig. 8 in the embodiment of the present application;
fig. 10 is a schematic diagram of performance comparison between the result of channel coding and the polarization code according to the method provided in the embodiment shown in fig. 8 in the embodiment of the present application;
fig. 11 is a schematic diagram of a communication device capable of implementing functions of a terminal device according to an embodiment of the present application;
Fig. 12 is a schematic diagram of a communication apparatus capable of implementing functions of a network device according to an embodiment of the present application;
fig. 13 is a schematic diagram of a communication device capable of implementing functions of a terminal device according to an embodiment of the present application;
fig. 14 is a schematic diagram of a communication apparatus capable of implementing functions of a network device according to an embodiment of the present application;
fig. 15 is a schematic diagram of a communication device according to an embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present application more apparent, the embodiments of the present application will be described in further detail with reference to the accompanying drawings.
In the following, some terms in the embodiments of the present application are explained for easy understanding by those skilled in the art.
1) Terminal devices, including devices that provide voice and/or data connectivity to a user, may include, for example, a handheld device having wireless connectivity, or a processing device connected to a wireless modem. The terminal device may communicate with the core network via a radio access network (radio access network, RAN), exchanging voice and/or data with the RAN. The terminal device may include a User Equipment (UE), a wireless terminal device, a mobile terminal device, a subscriber unit (subscriber unit), a subscriber station (subscriber station), a mobile station (mobile), a remote station (remote station), an Access Point (AP), a remote terminal device (remote terminal), an access terminal device (access terminal), a user terminal device (user terminal), a user agent (user agent), or a user equipment (user device), etc. For example, mobile telephones (or "cellular" telephones) computers with mobile terminal devices, portable, pocket, hand-held, computer-built-in or vehicle-mounted mobile devices, smart wearable devices, and the like may be included. Such as personal communication services (personal communication service, PCS) phones, cordless phones, session initiation protocol (session initiation protocol, SIP) phones, wireless local loop (wireless local loop, WLL) stations, personal digital assistants (personal digital assistant, PDAs), and the like. But also limited devices such as devices with lower power consumption, or devices with limited memory capabilities, or devices with limited computing capabilities, etc. Examples include bar codes, radio frequency identification (radio frequency identification, RFID), sensors, global positioning systems (global positioning system, GPS), laser scanners, and other information sensing devices.
By way of example, and not limitation, in embodiments of the present application, the terminal device may also be a wearable device. The wearable device can also be called as a wearable intelligent device, and is a generic name for intelligently designing daily wear by applying wearable technology and developing wearable devices, such as glasses, gloves, watches, clothes, shoes and the like. The wearable device is a portable device that is worn directly on the body or integrated into the clothing or accessories of the user. The wearable device is not only a hardware device, but also can realize a powerful function through software support, data interaction and cloud interaction. The generalized wearable intelligent device includes full functionality, large size, and may not rely on the smart phone to implement complete or partial functionality, such as: smart watches or smart glasses, etc., and focus on only certain types of application functions, and need to be used in combination with other devices, such as smart phones, for example, various smart bracelets, smart helmets, smart jewelry, etc. for physical sign monitoring.
2) A network device, for example comprising AN Access Network (AN) device, such as a base station (e.g., AN access point), may refer to a device in AN access network that communicates over the air-interface with wireless terminal devices through one or more cells. The network device may be operable to inter-convert the received air frames with internet protocol (internet protocol, IP) packets as a router between the terminal device and the rest of the access network, which may include an IP network. The network device may also coordinate attribute management for the air interface. For example, the network device may include an evolved node B (NodeB or eNB or e-NodeB, evolutional Node B) in a long term evolution (long term evolution, LTE) system or an evolved LTE system (LTE-Advanced, LTE-a), or may also include a next generation node B (next generation node B, gNB) in a fifth generation mobile communication technology (5G) New Radio (NR) system, or may also include a Centralized Unit (CU) and a Distributed Unit (DU) in a cloud access network (cloud radio access netowrk, cloudRAN) system, which embodiments of the present application are not limited.
The network device described herein is not limited to include an access network device, but may also include a core network device. Or it is understood that the network device described herein is not limited to the serving cell or serving base station of the terminal device, but may be any network device that may store capability information of the terminal device, such as a mobility management entity (mobility management entity, MME).
3) The terms "system" and "network" in embodiments of the present application may be used interchangeably. "at least one" means one or more, and "a plurality" means two or more. "and/or", describes an association relationship of an association object, and indicates that there may be three relationships, for example, a and/or B, and may indicate: a alone, a and B together, and B alone, wherein a, B may be singular or plural. The character "/" generally indicates that the context-dependent object is an "or" relationship. "at least one of" or the like means any combination of these items, including any combination of single item(s) or plural items(s). For example, at least one (one) of a, b, or c may represent: a, b, c, a-b, a-c, b-c, or a-b-c, wherein a, b, c may be single or plural.
4) The term "a" in the embodiments of the present application means a single individual, and does not represent only one individual, but cannot be applied to other individuals. For example, in the embodiment of the present application, "one terminal device" refers to a specific terminal device, and does not mean that the present invention can be applied to only one specific terminal device.
Reference in the present application to "one embodiment" (or "one implementation") or "an embodiment" (or "implementation") means that a particular feature, structure, characteristic, etc., described in connection with the embodiment is included in at least one embodiment.
In addition, in order to clearly describe the technical solutions of the embodiments of the present application, in the embodiments of the present application, the words "first", "second", and the like are used to distinguish the same item or similar items having substantially the same function and effect. It will be appreciated by those of skill in the art that the words "first," "second," and the like do not limit the amount and order of execution, and that the words "first," "second," and the like do not necessarily differ. Furthermore, the terms "comprising" and "having" in the embodiments and claims of the present application and in the drawings are not exclusive. For example, a process, method, system, article, or apparatus that comprises a list of steps or modules is not limited to only those steps or modules but may include other steps or modules not listed.
The technical scheme provided by the embodiment of the application can be applied to an LTE system and a fourth generation mobile communication technology (the 4) th generation, 4G) system, 4.5G system, fifth generation mobile communication technology (the 5) th generation, 5G) system, NR system, or NR-like system may also be applied to future communication systems, or may also be applied to other like communication systems.
Fig. 1 shows a schematic communication diagram of a wireless device with a wireless communication system. The wireless communication system may be a system employing various radio access technologies (radio access technology, RATs), such as orthogonal frequency division multiple access (orthogonal frequency-division multiple access, OFDMA), or single carrier frequency division multiple access (SC-FDMA), among other systems. For example, the wireless communication system may be a long term evolution (long term evolution, LTE) system, a wireless local area network (wireless local area network, WLAN) system, a New Radio (NR) system, various evolved or converged systems, and future-oriented communication technology systems. The system architecture and the service scenario described in the embodiments of the present application are for more clearly describing the technical solution of the embodiments of the present application, and do not constitute a limitation on the technical solution provided in the embodiments of the present application, and those skilled in the art can know that, with the evolution of the network architecture and the appearance of the new service scenario, the technical solution provided in the embodiments of the present application is also applicable to similar technical problems.
For simplicity, communications are shown in fig. 1 for one network device 102 (e.g., an access network device) and one wireless device 104 (e.g., a terminal device). In general, a wireless communication system may include any number of network devices as well as terminal devices. The wireless communication system may also include one or more core network devices or devices for carrying virtualized network functions, etc. The access network device 102 may provide services to wireless devices via one or more carriers. The access network device and the terminal device may be collectively referred to as a communication device in this application.
In this application, the access network device 102 may be a network device as described above. For convenience of description, in this application, the access network device is simply referred to as an access network device, and sometimes referred to as a base station.
The wireless device referred to in the embodiments of the present application may be the terminal device described above. A wireless device may support one or more wireless technologies for wireless communication, such as 5g, lte, wcdma, cdma,1x, time division-synchronous code division multiple access (TS-SCDMA), GSM,802.11, and so on. Wireless devices may also support carrier aggregation techniques.
Multiple wireless devices may perform the same or different services. For example, mobile broadband services, enhanced mobile broadband (enhanced mobile broadband, emmbb) services, ultra-reliable and low-latency communication (URLLC) services, etc. are provided for the terminal.
Further, one possible structural schematic of the access network device 102 may be shown in fig. 2. The access network device 102 is capable of performing the methods provided by the embodiments of the present application. Wherein the access network device 102 may comprise: a controller or processor 201 (hereinafter processor 201 is illustrated as an example) and a transceiver 202. The controller/processor 201 is sometimes referred to as a modem processor (modem processor). The controller/processor 201 may include a baseband processor (baseband processor, BBP) (not shown) that processes the digitized received signal to extract the information or data bits conveyed in the signal. As such, the BBP is typically implemented in one or more digital signal processors (digital signal processor, DSP) within the controller/processor 201 or as separate integrated circuits (integrated circuit, IC) as needed or desired.
The transceiver 202 may be used to support the transceiving of information between the access network device 102 and the terminal device, as well as to support the radio communication between the terminal devices. The processor 201 may also be used to perform the functions of various terminal devices communicating with other network devices. On the uplink, uplink signals from the terminal device are received via the antenna, mediated by the transceiver 202, and further processed by the processor 201 to recover traffic data and/or signaling information transmitted by the terminal device. On the downlink, traffic data and/or signaling messages are processed by the terminal device and modulated by transceiver 202 to generate a downlink signal, which is transmitted via an antenna to the terminal device. The access network device 102 may also include a memory 203 that may be used to store program code and/or data for the access network device 102. The transceiver 202 may include separate receiver and transmitter circuits, or may be the same circuit to perform the transceiving functions. The access network device 102 may further comprise a communication unit 204 for supporting the access network device 102 to communicate with other network entities. For example, for supporting the access network device 102 to communicate with network devices of a core network, etc.
Optionally, the access network device may further comprise a bus. The transceiver 202, the memory 203, and the communication unit 204 may be connected to the processor 201 through a bus. For example, the bus may be a peripheral component interconnect standard (peripheral component interconnect, PCI) bus or an extended industry standard architecture (extended industry standard architecture, EISA) bus, or the like. The buses may include an address bus, a data bus, a control bus, and the like.
Fig. 3 is a schematic diagram of a possible structure of a terminal device in the above wireless communication system. The terminal equipment can execute the method provided by the embodiment of the application. The terminal device may be either of the two terminal devices 104. The terminal device comprises a transceiver 301, an application processor (application processor) 302, a memory 303 and a modem processor (modem processor) 304.
Transceiver 301 may condition (e.g., analog convert, filter, amplify, upconvert, etc.) the output samples and generate an uplink signal, which is transmitted via an antenna to a base station as described in the above embodiments. On the downlink, an antenna receives downlink signals transmitted by the access network device. Transceiver 301 may condition (e.g., filter, amplify, downconvert, digitize, etc.) the received signal from the antenna and provide input samples.
Modem processor 304, also sometimes referred to as a controller or processor, may include a baseband processor (baseband processor, BBP) (not shown) that processes the digitized received signal to extract the information or data bits conveyed in the signal. BBP is typically implemented in one or more digits within modem processor 304 or as a separate Integrated Circuit (IC) as needed or desired.
In one design, a modem processor 304 may include an encoder 3041, a modulator 3042, a decoder 3043, and a demodulator 3044. The encoder 3041 is used for encoding a signal to be transmitted. For example, the encoder 3041 may be configured to receive traffic data and/or signaling messages to be transmitted on the uplink and process (e.g., format, encode, interleave, etc.) the traffic data and signaling messages. The modulator 3042 is used to modulate the output signal of the encoder 3041. For example, the modulator may perform symbol mapping and/or modulation, etc., on the output signal (data and/or signaling) of the encoder and provide output samples. The demodulator 3044 is configured to perform demodulation processing on an input signal. For example, a demodulator 3044 processes the input samples and provides symbol estimates. The decoder 3043 is used for decoding the demodulated input signal. For example, the decoder 3043 deinterleaves, decodes, and/or the like the demodulated input signal, and outputs a decoded signal (data and/or signaling). The encoder 3041, modulator 3042, demodulator 3044, and decoder 3043 may be implemented by a composite modem processor 304. These units are handled according to the radio access technology employed by the radio access network.
Modem processor 304 receives digitized data, which may represent voice, data, or control information, from application processor 302 and processes the digitized data for transmission. The modem processor may support one or more of a variety of wireless communication protocols for a variety of communication systems, such as LTE, new air interface, universal mobile telecommunications system (universal mobile telecommunications system, UMTS), high speed packet access (high speed packet access, HSPA), and so forth. Optionally, one or more memories may be included in modem processor 304.
Alternatively, the modem processor 304 and the application processor 302 may be integrated in one processor chip.
The memory 303 is used to store program code (sometimes also referred to as programs, instructions, software, etc.) and/or data for supporting communication with the terminal device.
It should be noted that the memory 203 or the memory 303 may include one or more storage units, for example, may be a storage unit inside the processor 201 or the modem processor 304 or the application processor 302 for storing program codes, or may be an external storage unit independent of the processor 201 or the modem processor 304 or the application processor 302, or may also be a component including a storage unit inside the processor 201 or the modem processor 304 or the application processor 302 and an external storage unit independent of the processor 201 or the modem processor 304 or the application processor 302.
The processor 201 and modem processor 304 may be the same type of processor or may be different types of processors. For example, the logic may be implemented in a central processing unit (central processing unit, CPU), general purpose processor, digital signal processor (digital signal processor, DSP), application-specific integrated circuit (ASIC), field programmable gate array (field programmable gate array, FPGA) or other programmable logic device, transistor logic device, hardware component, other integrated circuit, or any combination thereof. The processor 201 and modem processor 304 may implement or execute the various exemplary logic blocks, modules and circuits described in connection with the present application's embodiment disclosure. The processor may also be a combination of devices implementing computing functions, e.g., comprising one or more microprocessor combinations, a combination of a DSP and a microprocessor, or a system-on-a-chip (SOC), etc.
Those of skill in the art will appreciate that the various illustrative logical blocks, modules, circuits, and algorithms described in connection with the aspects disclosed herein may be implemented as electronic hardware, instructions stored in memory or in another computer readable medium and executed by a processor or other processing device, or combinations of both. As an example, the apparatus described herein may be used in any circuit, hardware component, IC, or IC chip. The memory disclosed herein may be any type and size of memory and may be configured to store any type of information as desired. To clearly illustrate this interchangeability, various illustrative components, blocks, modules, circuits, and steps have been described above generally in terms of their functionality. How such functionality is implemented depends upon the particular application, design choice, and/or design constraints imposed on the overall system. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
The following describes the technical scheme provided by the embodiment of the application with reference to the accompanying drawings.
The embodiment of the application provides a signal sending and receiving method, and a flow chart of the method is shown in fig. 4. The method may be applied to the scenario shown in fig. 1, and in the following description, the method provided in the embodiment of the present application is taken as an example applied to the application scenario shown in fig. 1. In addition, the method may be performed by two communication means, such as a first communication means and a second communication means, wherein the first communication means may be a network device or a communication means (e.g. a chip system) capable of supporting the network device to implement the functions required for the method, or the first communication means may be a terminal device or a communication means (e.g. a chip system) capable of supporting the terminal device to implement the functions required for the method. The same applies to the second communication apparatus, which may be a network device or a communication apparatus (e.g., a chip system) capable of supporting functions required by the network device to implement the method, or the second communication apparatus may be a terminal device or a communication apparatus (e.g., a chip system) capable of supporting functions required by the terminal device to implement the method. And the implementation manner of the first communication apparatus and the second communication apparatus is not limited, for example, the first communication apparatus may be a terminal device, the second communication apparatus may be a network device, or the first communication apparatus and the second communication apparatus may be network devices, or the first communication apparatus and the second communication apparatus may be terminal devices, or the first communication apparatus may be a terminal device, the second communication apparatus may be a communication apparatus capable of supporting functions required by the network device to implement the method, and so on. Wherein the network device is, for example, a base station.
For convenience of description, hereinafter, the method is exemplified by the first apparatus and the second apparatus, and specifically, the first communication device is exemplified by the first apparatus and the second communication device is exemplified by the second apparatus. The first device is, for example, a network device, the second device is, for example, a terminal device, then the first signal described herein may be a downstream signal, or the first device is, for example, a terminal device, and the second device is, for example, a network device, then the first signal described herein may be an upstream signal.
S41, performing channel coding on a first codeword of K elements by first equipment to obtain a second codeword of N elements, wherein N/2 elements of the second codeword are third codewords, the third codewords are obtained by a first coding mode of a first part of the first codeword, the remaining N/2 elements of the second codeword are fourth codewords, the fourth codewords are obtained by performing modulo A processing on codewords obtained by a second coding mode of a second part of the first codeword and the third codewords, the first part is M elements of the first codeword, the second part is the remaining K-M elements of the first codeword except the M elements, at least one of the first coding mode and the second coding mode is a nonlinear coding mode, N and K are positive integers, N > K, and A is an integer greater than 1;
S42, the first device generates a first signal by using the second code word;
s43, the first device sends the first signal, and the second device receives the first signal from the first device;
s44, the second device obtains the first code word according to the first signal.
In the embodiment of the application, the third codeword may be the first N/2 elements of the second codeword, and the fourth codeword may be the last N/2 elements of the second codeword. Further, the first portion of the first codeword may be the first M elements of the first codeword, and the second portion of the first codeword may be the remaining K-M elements of the first codeword other than the first M elements.
For another example, the first portion of the first codeword may be the last M elements, or may be any M elements, and the first portion of the first codeword may be M consecutive or M discontinuous elements, and the second portion of the first codeword is the remaining K-M elements of the first codeword other than the first portion of the first codeword. Similarly, the third codeword may be the last N/2 elements of the second codeword, or may be any N/2 elements of the second codeword, and the third codeword may be consecutive N/2 elements, or may be discontinuous N/2 elements, and the fourth codeword is the remaining N/2 elements of the second codeword except for the third codeword. The embodiment of the present application will be described by taking the first M elements of the first codeword in which the first portion of the first codeword is the first codeword, and taking the first N/2 elements of the second codeword in which the third codeword is the third codeword as an example.
The first device needs to perform channel coding on the first codeword to send the first codeword, and can obtain a second codeword after performing channel coding. Wherein the first codeword may be referred to as a pre-encoding codeword and the second codeword may be referred to as a post-encoding codeword.
For example, the first codeword is
Figure GDA0003841386120000131
The second codeword is +.>
Figure GDA0003841386120000132
Wherein (1)>
Figure GDA0003841386120000133
Alternatively, the first codeword is +>
Figure GDA0003841386120000134
The second codeword is +.>
Figure GDA0003841386120000135
Here, the first code word is->
Figure GDA0003841386120000137
The second codeword is +.>
Figure GDA0003841386120000136
As an example. Where the channel code described herein is an a-ary code, a is an integer greater than 1, e.g., the value of a may be 2 or 4, where if a is 2, the value range of each element of the corresponding codeword may be {0,1}, and if a is 4, the value range of each element of the corresponding codeword may be {0,1,2,3}. Generally 2, is described herein by taking a=2 as an example, that is, unless otherwise specified, the a-ary codes each refer to a binary code, that is, the element x of the first codeword i And element y of the second codeword i The value of (2) is 0 or 1./>
Figure GDA0003841386120000141
Representing a second codeword->
Figure GDA0003841386120000142
Is formed by splicing two parts, wherein the front half part, namely the front N/2 elements, is +.>
Figure GDA0003841386120000143
The latter half, i.e. the latter N/2 elements, is +.>
Figure GDA0003841386120000144
The first N/2 elements of the second codeword may be referred to as a third codeword, e.g., represented as
Figure GDA0003841386120000145
Figure GDA0003841386120000146
Is a codeword of a first set of codewords, the first set of codewords being a set of codewords obtainable by a first coding scheme, or the first set of codewords corresponding to the first coding scheme, that is, the third codeword being obtained from a first portion of the first codeword by the first coding scheme>
Figure GDA0003841386120000147
A first portion of the first codeword is represented and M is an integer greater than or equal to 1 and less than or equal to K. In the implementation of the method of this embodiment, the first device does not necessarily need to actually generate the first codeword set, but is +.>
Figure GDA0003841386120000148
Such a feature is satisfied. The last N/2 elements of the second codeword may be referred to as fourth codeword, e.g. denoted +.>
Figure GDA0003841386120000149
Figure GDA00038413861200001410
Is a codeword in a second codeword set, which is a set of codewords obtainable by a second coding scheme, or which corresponds to the second coding scheme, that is, the fourth codeword is obtained by modulo A processing of a codeword obtained by the second coding scheme of the second part of the first codeword and a third codeword, and vice versa>
Figure GDA00038413861200001411
A second portion of the first codeword is represented. Similarly, when implementing the method of this embodiment, the first device does not necessarily need to actually generate the second codeword set, but is +. >
Figure GDA00038413861200001412
Such a feature is satisfied. The codeword sets described herein are not necessarily actually present when implementing the embodiments of the present application, but are merely used to illustrate the features that the codewords satisfy. In this context, other words, except for the pre-code word and the post-code word, are not necessarily actually present when implementing the embodiments of the present application, but are merely used to illustrate the characteristics satisfied by the code, or are merely used to illustrate the characteristics satisfied by the pre-code word and the post-code word.
Wherein, the liquid crystal display device comprises a liquid crystal display device,
Figure GDA00038413861200001413
representing modulo A addition, in the various embodiments of the present application for +.>
Figure GDA00038413861200001414
(or modulo A addition) can be defined as, < >>
Figure GDA00038413861200001415
"+" is a normal arithmetic addition (arithmetic addition), mod represents a modulo operation.
In this embodiment, at least one of the first encoding scheme and the second encoding scheme is a nonlinear encoding scheme. Alternatively, other coding modes than the at least one coding mode may be linear coding or may be nonlinear coding.
If one coding scheme satisfies that the linear combination of any two or more coded codewords is still a codeword of its codeword space, then the coding is linear, otherwise nonlinear. Codeword space refers to the set of codewords that can be obtained after encoding. Since the binary code is described herein as an example of an a-ary code, the linear combination described herein is described as an example of a linear operation in the binary domain. When the A-ary code is the element of other values, the domain is the corresponding A-ary domain.
The nonlinear encoding in the embodiments of the present application is nonlinear encoding on the a-ary domain. The coding scheme may be linear coding over other metadomains.
Further, the nonlinear code in this embodiment may be a Kerdock code or a Delsarte-golthanals code, or may be other code. The Kerdock code and the Delsarte-Goethane code are two common nonlinear codes, and have better minimum code distance and code distance distribution, so that the Kerdock code and the Delsarte-Goethane code have better channel coding performance. The Kerdock code and Delsarte-Goethane code are Z 4 The linear code of the code matrix can be generated to obtain the encoded quaternary code word, wherein Z 4 And the quaternary is a meaning, all refer to a codeThe value of an element of a word may be 0,1,2 or 3. The generator matrix of the Kerdock code and the Delsarte-golthans code may be derived from primitive substantially irreducible polynomials (primitive basic irreducible polynomial). The quaternary code word is mapped by Gray to obtain the binary code. Gray mapping is a quaternary to binary mapping, and can be expressed as: two mappings beta (c) and gamma (c) are defined,
Figure GDA0003841386120000151
the Gray map can be expressed as +.>
Figure GDA0003841386120000152
For example, for c=0, c is Gray mapped to obtain codeword (0, 0), and c=1, c is Gray mapped to obtain codeword (0, 1), e.g. codeword [0,1,2,3 ] ]The codeword obtained after mapping is [0,0,1,1,0,1,1,0 ]]. After Gray mapping, a quaternary codeword can become twice the original codeword length.
Alternatively, the nonlinear encoding method in the embodiment of the present application may also satisfy the following conditions: the code word before coding corresponding to nonlinear coding is
Figure GDA0003841386120000153
The code word after the code word corresponding to the nonlinear coding mode is +.>
Figure GDA0003841386120000154
E>D, or the code word before coding corresponding to the nonlinear coding mode is +>
Figure GDA0003841386120000155
The code word after the code word corresponding to the nonlinear coding mode is +.>
Figure GDA0003841386120000156
The pre-coding codeword corresponding to the nonlinear coding mode is +.>
Figure GDA0003841386120000157
The code word after the code word corresponding to the nonlinear coding mode is +.>
Figure GDA0003841386120000158
As an example. In addition, unless otherwise specified hereinafter, elements of the codeword referred to in the embodiments of the present application are all numbered as examples starting from "1", but the embodiments of the present application do not limit that elements of the codeword may also be numbered starting from "0". Nonlinear coding enables->
Figure GDA0003841386120000159
And->
Figure GDA00038413861200001510
Satisfy (S)>
Figure GDA00038413861200001511
Figure GDA00038413861200001512
Wherein->
Figure GDA00038413861200001513
Representing modulo A addition, ++>
Figure GDA00038413861200001514
Is composed of
Figure GDA00038413861200001515
Coding the obtained code word by eighteenth coding mode, < >>
Figure GDA00038413861200001516
Is composed of
Figure GDA00038413861200001517
Coding the resulting code word by nineteenth coding means, a code word>
Figure GDA00038413861200001518
Is composed of->
Figure GDA00038413861200001519
Code word obtained by coding in twentieth coding mode。[h 1 ,h 2 ,…,h E/2 ]For code word->
Figure GDA00038413861200001520
E/2 elements of (E),. About. >
Figure GDA00038413861200001521
For code word->
Figure GDA00038413861200001522
Except for [ h ] 1 ,h 2 ,…,h E/2 ]The remaining E/2 elements, codeword +.>
Figure GDA00038413861200001523
For code word->
Figure GDA00038413861200001524
Z elements of (a) codeword->
Figure GDA00038413861200001525
For code word->
Figure GDA00038413861200001526
Except for code word->
Figure GDA00038413861200001527
The remaining D-Z elements, Z is an integer greater than 0 and less than D.
As an alternative, the eighteenth coding scheme is different from the nineteenth coding scheme, and certainly, the possibility that the eighteenth coding scheme is identical to the nineteenth coding scheme is not excluded. Similarly, as an alternative, the eighteenth coding scheme is different from the twentieth coding scheme, but the possibility that the eighteenth coding scheme is identical to the twentieth coding scheme is not excluded.
For example, the first encoding mode is a Delsarte-Goethane code, and the second encoding mode is a first order Reed-Muller code, although the embodiments are not limited thereto.
For example, when k=24, n=128, and m=17, better performance can be obtained by performing channel coding in the manner provided in the embodiments of the present application.
In the embodiment of the present application, at least one of the first encoding method and the second encoding method is a nonlinear encoding method, and generally, nonlinear encoding has a lower error rate than linear encoding, so that the nonlinear encoding has better performance than linear encoding. The branch codes of the polarization codes in the prior art are all linear codes, and the channel codes provided by the embodiment of the application meet the requirements of a prazizane (Plotkin) structure, meanwhile, nonlinear codes are used in the branch codes, and compared with the mode of using linear codes in the branch codes, the coding mode in the embodiment can further reduce the error rate, so that the performance of the channel codes can be improved.
The first codeword may be part of the information element to be transmitted, e.g. the first codeword may be all of the information element to be transmitted, or may also be part of the information element to be transmitted. If the first codeword is only a part of the information element to be transmitted, the other codewords in the information element to be transmitted, except for the first codeword, may also be processed in the same channel coding manner as the first codeword, for example, the information element to be transmitted, except for the first codeword, may also be processed in the same channel coding manner as the first codeword, or the other codewords in the information element to be transmitted, except for the first codeword, may also be processed in a different channel coding manner as the first codeword, which is not limited in particular.
Also in the embodiments of the present application, channel coding may be an iterative process. For example, for the first codeword, the first codeword is divided into
Figure GDA0003841386120000161
And->
Figure GDA0003841386120000162
The two parts are treated separately. And during processing, for each of the two parts, the two parts can be divided into two parts, and for the two parts obtained by further division The parts may be processed in the same manner as the method described above, such as the eighteenth encoding method described above, the nineteenth encoding method, and so on. Further, for each of the two further divided portions, the two further divided portions may be subdivided in the same way, and the new two portions may still be processed in the same way as the method described above, so that the steps iterate. Therefore, at each iteration, there are two coding modes for the two divided parts, and the two coding modes are the branch codes of the coding. Thus, the information to be encoded is divided into two parts, which may be encoded in the same way or in different ways, each forming a branch code.
In the embodiment of the present application, at least one of the two encoding modes in at least one iteration process is a nonlinear encoding mode. It is easy to understand that the more nonlinear coding modes are adopted in the process of iteratively generating the code words, the better the performance is improved. For example, in the embodiment of the present application, at least one of the two corresponding encoding modes may be a nonlinear encoding mode during each iteration, or the embodiment of the present application may make all encoding modes involved in the iteration process be nonlinear encoding modes, so as to achieve a greater improvement on performance.
Although the iteration process of the foregoing embodiment is further divided into the first encoding mode and the second encoding mode into other encoding modes, it is to be understood that the method in the embodiment of the present application may be an implementation process of a certain encoded branch code, for example, an encoding process of a minimum iteration unit in the foregoing iteration process. That is, the method in the embodiment of the present application may be used as a branch code, and a new encoding scheme may be constructed together with other branch codes. In this case, the first signal may further include a portion generated using other codewords than the second codeword.
For better understanding, the following describes the iterative process of the embodiment of the present application by further dividing the first coding scheme and the second coding scheme into examples.
For example, the third codeThe first N/4 elements of the word are fifth codewords, the fifth codewords are obtained by a ninth coding mode from a first part of the pre-coding codewords corresponding to the third codewords, the last N/2 elements of the third codewords are sixth codewords, the sixth codewords are obtained by performing modulo A addition processing on the codewords obtained by a tenth coding mode from a second part of the pre-coding codewords corresponding to the third codewords and the fifth codewords, the first part of the pre-coding codewords corresponding to the third codewords are the pre-lambda elements of the pre-coding codewords corresponding to the third codewords, the second part of the pre-coding codewords corresponding to the third codewords are the rest M-lambda elements except the pre-lambda elements of the pre-coding codewords corresponding to the third codewords, and lambda is an integer greater than 0 and less than M. For example, the third codeword is
Figure GDA0003841386120000171
The fifth codeword is +.>
Figure GDA0003841386120000172
Figure GDA0003841386120000173
Is a codeword in a third set of codewords, the third set of codewords being a set of codewords obtainable by encoding in a ninth encoding mode, that is to say the fifth codeword is encoded by the first part of the pre-encoding codeword corresponding to the third codeword ≡>
Figure GDA0003841386120000174
The code word obtained by coding in the ninth coding mode, and the sixth code word is +.>
Figure GDA0003841386120000175
Figure GDA0003841386120000176
Is a codeword in a fourth set of codewords, the fourth set of codewords being a set of codewords obtainable by encoding in a tenth encoding mode, that is to say the sixth codeword is encoded by the second part of the pre-encoding codeword corresponding to the third codeword ≡>
Figure GDA0003841386120000177
The resulting codeword is encoded by the tenth encoding scheme. Then, at least one of the ninth coding scheme and the tenth coding scheme may be a nonlinear coding scheme, or both the ninth coding scheme and the tenth coding scheme may be linear coding schemes.
The same applies to the fourth codeword. The first N/4 elements of the fourth codeword are seventh codeword, the seventh codeword is obtained by eleventh encoding the first part of the pre-encoding codeword corresponding to the fourth codeword, the last N/2 elements of the fourth codeword are eighth codeword, the eighth codeword is obtained by modulo A addition of the codeword obtained by twelfth encoding the second part of the pre-encoding codeword corresponding to the fourth codeword and the seventh codeword, the first part of the pre-encoding codeword corresponding to the fourth codeword is the first B-M elements of the pre-encoding codeword corresponding to the fourth codeword, the second part of the pre-encoding codeword corresponding to the fourth codeword is the remaining K-B elements of the pre-encoding codeword corresponding to the fourth codeword except the first B-M elements, and B is an integer greater than M and less than K. For example, the fourth codeword is
Figure GDA0003841386120000178
The seventh codeword is +.>
Figure GDA0003841386120000179
Is a codeword in a fifth codeword set, which is a set of codewords encoded by the eleventh coding scheme, that is, the seventh codeword is a first portion of the pre-encoded codeword corresponding to the fourth codeword
Figure GDA00038413861200001710
Code words obtained by coding in an eleventh coding mode, wherein the eighth code word is +.>
Figure GDA00038413861200001711
Figure GDA00038413861200001712
Is a codeword in a sixth codeword set, which is a set of codewords encoded by the twelfth coding scheme, that is, an eighth codeword is encoded by a fourth codeSecond part of the pre-code word corresponding to the word +.>
Figure GDA00038413861200001713
The resulting codeword is encoded by the twelfth encoding scheme. Then, at least one of the eleventh coding scheme and the twelfth coding scheme may be a nonlinear coding scheme, or both the eleventh coding scheme and the twelfth coding scheme may be linear coding schemes. At least one of the ninth coding scheme, tenth coding scheme, eleventh coding scheme, and twelfth coding scheme is a nonlinear coding scheme.
The above is an iterative process, and an iterative process is described again below.
For example, the first N/8 elements of the fifth codeword are ninth codewords, the ninth codewords are obtained by thirteenth encoding the first portion of the pre-encoding codeword corresponding to the fifth codeword, the last N/8 elements of the fifth codeword are tenth codewords, the tenth codewords are obtained by modulo a addition of the ninth codewords and codewords obtained by fourteenth encoding the second portion of the pre-encoding codeword corresponding to the fifth codeword, the first portion of the pre-encoding codeword corresponding to the fifth codeword is the first G elements of the pre-encoding codeword corresponding to the fifth codeword, the second portion of the pre-encoding codeword corresponding to the fifth codeword is the remaining Λ -G elements of the pre-encoding codeword corresponding to the fifth codeword other than the first G elements, and G is an integer greater than 0 and less than Λ. For example, the fifth codeword is
Figure GDA0003841386120000181
The ninth codeword is +.>
Figure GDA0003841386120000182
/>
Figure GDA0003841386120000183
The ninth codeword is a codeword of a seventh set of codewords, the seventh set of codewords being a set of codewords obtainable by encoding in the thirteenth encoding mode, that is to say the ninth codeword being defined by the first part of the pre-encoding codeword to which the fifth codeword corresponds->
Figure GDA0003841386120000184
Code word obtained by coding in thirteenth coding mode, tenth code word is +.>
Figure GDA0003841386120000185
Figure GDA0003841386120000186
Is a codeword in an eighth codeword set, which is a set of codewords encoded by the fourteenth encoding scheme, that is, the tenth codeword is encoded by the second part +_ of the pre-encoded codeword corresponding to the fifth codeword>
Figure GDA0003841386120000187
The second portion of the codeword is encoded into the resulting codeword by the fourteenth encoding scheme. Then, at least one of the thirteenth coding scheme and the fourteenth coding scheme may be a nonlinear coding scheme, or both the thirteenth coding scheme and the fourteenth coding scheme may be linear coding schemes.
For example, the first N/8 elements of the sixth codeword are eleventh codewords, the eleventh codewords are obtained by fifteenth encoding from the first portion of the pre-encoding codewords corresponding to the sixth codewords, the last N/8 elements of the sixth codewords are twelfth codewords, the twelfth codewords are obtained by modulo a addition of the eleventh codewords and codewords obtained by sixteenth encoding from the second portion of the pre-encoding codewords corresponding to the sixth codewords, the first portion of the pre-encoding codewords corresponding to the sixth codewords are the first F- Λ elements of the pre-encoding codewords corresponding to the sixth codewords, the second portion of the pre-encoding codewords corresponding to the sixth codewords are the remaining M-F elements of the pre-encoding codewords corresponding to the sixth codewords other than the first F- Λ elements, and F is an integer greater than Λ and less than M. For example, the sixth codeword is
Figure GDA0003841386120000188
Eleventh codeword is
Figure GDA0003841386120000189
Is the code in the ninth codeword setThe set of words, ninth codeword, is the set of codewords that are encoded by the fifteenth encoding means, i.e. the eleventh codeword is encoded by +.>
Figure GDA00038413861200001810
Code words obtained by coding in a fifteenth coding mode, the twelfth code word is +.>
Figure GDA00038413861200001811
Is a codeword of a tenth set of codewords which is the set of codewords obtainable by the sixteenth coding, i.e. the twelfth codeword is composed of +.>
Figure GDA00038413861200001812
Figure GDA00038413861200001813
The resulting codeword is encoded by the sixteenth encoding scheme. Then, at least one of the fifteenth coding scheme and the sixteenth coding scheme may be a nonlinear coding scheme, or both the fifteenth coding scheme and the sixteenth coding scheme may be linear coding schemes.
For example, the first N/8 elements of the seventh codeword are thirteenth codewords, the thirteenth codewords are obtained by seventeenth encoding of the first portion of the pre-encoding codewords corresponding to the seventh codewords, the last N/8 elements of the seventh codewords are fourteenth codewords, the fourteenth codewords are obtained by modulo a addition of the thirteenth codewords and the codewords obtained by twenty first encoding of the second portion of the pre-encoding codewords corresponding to the seventh codewords, the first portion of the pre-encoding codewords corresponding to the seventh codewords are the first H-M elements of the seventh codewords, the second portion of the pre-encoding codewords corresponding to the fifth codewords are the remaining B-H elements of the pre-encoding codewords corresponding to the fifth codewords except the first H-M elements, and H is an integer greater than M and less than B. For example, the seventh codeword is
Figure GDA0003841386120000191
Thirteenth codeword->
Figure GDA0003841386120000192
Figure GDA0003841386120000193
Is a codeword of an eleventh set of codewords, the eleventh set of codewords being a set of codewords obtainable by encoding in a seventeenth encoding mode, i.e. the thirteenth codeword is composed of +.>
Figure GDA0003841386120000194
The seventeenth code word is the fourteenth code word coded by seventeenth coding mode>
Figure GDA0003841386120000195
Is a codeword of a twelfth set of codewords, which is a set of codewords obtainable by coding in a twelfth coding mode, i.e. the fourteenth codeword is composed of +.>
Figure GDA0003841386120000196
The resulting codeword is encoded by the twenty-first encoding scheme. At least one of the seventeenth coding scheme and the twenty-first coding scheme may be a nonlinear coding scheme, or both the seventeenth coding scheme and the twenty-first coding scheme may be linear coding schemes.
For example, the first N/8 elements of the eighth codeword are fifteenth codewords, the fifteenth codewords are obtained by twenty-second encoding from the first portion of the pre-encoding codewords corresponding to the eighth codewords, the last N/8 elements of the eighth codewords are sixteenth codewords, the sixteenth codewords are obtained by modulo-a addition of the fifteenth codewords and codewords obtained by twenty-third encoding from the second portion of the pre-encoding codewords corresponding to the eighth codewords, the first portion of the pre-encoding codewords corresponding to the eighth codewords are the first Q-B elements of the pre-encoding codewords corresponding to the eighth codewords, the second portion of the pre-encoding codewords corresponding to the sixth codewords are the remaining K-Q elements except the first Q-B elements of the pre-encoding codewords corresponding to the sixth codewords, and Q is an integer greater than B and less than K.
For example, the eighth codeword is
Figure GDA0003841386120000197
Fifteenth codeword->
Figure GDA0003841386120000198
Is a codeword of a thirteenth set of codewords, which is a set of codewords obtainable by encoding in a twenty-second encoding mode, i.e. the fifteenth codeword is composed of +.>
Figure GDA0003841386120000199
Code words obtained by coding in twenty-second coding mode, sixteenth code word is +.>
Figure GDA00038413861200001910
Is a codeword of a fourteenth set of codewords which is a set of codewords obtainable by encoding in a twenty-third encoding mode, i.e. the sixteenth codeword is composed of +.>
Figure GDA00038413861200001911
The resulting codeword is encoded by a twenty-third encoding scheme. At least one of the twenty-second encoding method and the twenty-third encoding method may be a nonlinear encoding method, or both the twenty-second encoding method and the twenty-third encoding method may be linear encoding methods.
Similar iterative processes may also be performed for all or part of the ninth codeword to the sixteenth codeword, and the iterative processes may be continued for the codewords obtained after the iteration, since the processes are similar and will not be described again. In summary, when each codeword is subjected to channel coding, two coding modes are involved, and in this embodiment of the present application, at least one of the two coding modes may be a nonlinear coding mode, so as to improve channel coding performance.
In this embodiment, the first device obtains the second codeword according to the first codeword, and the process of obtaining the first signal according to the second codeword can refer to fig. 5. The first device encodes the first codeword (i.e., the K-bit pre-encoding codeword in fig. 5
Figure GDA0003841386120000201
) Channel coding is performed to obtain a second codeword (i.e., an N-bit coded codeword in fig. 5), and after obtaining the second codeword, the first device may scramble the second codeword by the scrambling sequence to obtain an N-bit scrambled codeword->
Figure GDA0003841386120000202
The first device will scramble the codeword +.>
Figure GDA0003841386120000203
Modulating, for example, binary phase shift keying (binary phase shift keying, BPSK) modulation or quadrature phase shift keying (quadrature phase shift keying, QPSK) modulation, etc., to obtain modulated symbols ∈>
Figure GDA0003841386120000204
And then->
Figure GDA0003841386120000205
Mapping to L sub-carriers to obtain L-point frequency domain signals. The first device performs inverse fast fourier transform (inverse fast Fourier transformation, IFFT) on a frequency domain signal containing L elements, obtains a corresponding time domain signal, and adds a cyclic prefix to the time domain signal, generating a first signal.
As shown in fig. 6, after receiving the first signal, the second device may remove the cyclic prefix from the received first signal and then perform a fast fourier transform (fast fourier transformation, FFT) to obtain a signal in the frequency domain. I.e. the modulation symbols carried by the individual subcarriers. Then, the second device demaps the frequency domain signal to obtain a modulation symbol, and then performs channel equalization according to the channel coefficient obtained by the channel estimation. And then the second device demodulates the modulation symbol after the channel equalization to obtain a codeword on the modulation symbol. The code word and the scrambling code module two are subjected to scrambling code removal to obtain a code word
Figure GDA0003841386120000206
Then +.>
Figure GDA0003841386120000207
Performing channel decoding to obtain decoded code word +.>
Figure GDA0003841386120000208
/>
Among them, the common channel decoding method is maximum likelihood decoding or decoding approaching the maximum likelihood.
For example, one common way of channel equalization is to divide the modulation symbols by the channel coefficients on the corresponding subcarriers, resulting in equalized modulation symbols.
Common channel decoding schemes are maximum likelihood decoding or decoding that approximates maximum likelihood. A mode for realizing maximum likelihood decoding is to encode the code word
Figure GDA0003841386120000209
And solving correlation values with all possible codewords, wherein the codeword before coding corresponding to the codeword with the largest correlation value is the codeword after decoding. Or, according to the structural characteristics of the code word, a decoding mode approaching the maximum likelihood is adopted, for example, a polarization code can adopt an interference cancellation path (SCL) decoding algorithm, and the encoding in the embodiment of the application can adopt an SCL decoding algorithm similar to the polarization code.
For the second device, it can be according to
Figure GDA00038413861200002010
Obtaining the likelihood ratio of the second codeword>
Figure GDA00038413861200002011
Obtaining the likelihood ratio of the fourth codeword from the likelihood ratio of the second codeword +.>
Figure GDA00038413861200002012
Decoding the fourth codeword according to the likelihood ratio of the fourth codeword to obtain a second portion of the first codeword, and then obtaining a second codeword according to the likelihood ratio of the second portion of the first codeword and the second codeword Likelihood ratio ∈three codeword>
Figure GDA00038413861200002013
Decoding the third codeword according to the likelihood ratio value of the third codeword to obtain the first portion of the first codeword, in this way, helps to reduce the complexity of decoding by the second device. If the third codeword or the fourth codeword also satisfies the plotkin structure, a decoding algorithm similar to the above may be used to further reduce the decoding complexity of the second device.
For the second device, the second device may perform channel decoding on only a portion of the first signal including the fourth codeword to obtain the fourth codeword, and then obtain the third codeword according to the fourth codeword, or the second device may perform channel decoding on the fourth codeword in the second codeword to obtain a first channel decoding result, and then perform channel decoding on the third codeword in the second codeword according to the first channel decoding result to obtain a second channel decoding result, and may obtain the first codeword according to the first channel decoding result and the second channel decoding result. In this way, the complexity of the decoding by the second device is facilitated to be reduced.
For example, k=24, n=128, and m=17, where the first coding mode is a delarte-golethane code (nonlinear coding), the second coding mode is a first-order Reed-Muller code (linear coding), please refer to fig. 7, which is a schematic diagram of a functional relationship between a block error rate (BLER) and a signal-to-interference-plus-noise ratio (signal to interference plus noise ratio, SINR), an upper curve in fig. 7 is a curve corresponding to a polarization code, and a lower curve is a curve corresponding to a channel coding mode provided in an embodiment of the present application. The polar code in the figure adopts SCL decoding, and the decoding reserves 32 paths. For example, as can be seen from fig. 7, when the BLER is 10 -5 In this case, when the channel coding is performed according to the channel coding method provided in the embodiment of the present application, a gain of about 0.8dB is obtained as compared with the polarization code.
It should be noted that the process shown in fig. 5 and 6 in the embodiment of the present application may be an example. In practical implementation, only part of the above process may be implemented, or other operations may be performed, and embodiments of the present application are not limited to the above process. As long as the processing of the first device and the second device are corresponding.
In order to solve the same technical problem, the embodiment of the present application further provides a signal sending and receiving method, and a flowchart of the method is shown in fig. 8. The method may be applied to the scenario shown in fig. 1, and in the following description, the method provided in the embodiment of the present application is taken as an example applied to the application scenario shown in fig. 1. In addition, the method may be performed by two communication devices, for example, a third communication device and a fourth communication device, wherein the third communication device may be a network apparatus or a communication device (e.g., a chip system) capable of supporting a function required by the network apparatus to implement the method, or the third communication device may be a terminal apparatus or a communication device (e.g., a chip system) capable of supporting a function required by the terminal apparatus to implement the method. The same applies to the fourth communication device, which may be a network appliance or a communication device (e.g., a chip system) capable of supporting functions required by the network appliance to implement the method, or the fourth communication device may be a terminal appliance or a communication device (e.g., a chip system) capable of supporting functions required by the terminal appliance to implement the method. And the implementation manner of the third communication device and the fourth communication device is not limited, for example, the third communication device may be a terminal device, the fourth communication device is a network device, or the third communication device and the fourth communication device are both network devices, or the third communication device and the fourth communication device are both terminal devices, or the third communication device is a terminal device, the fourth communication device is a communication device capable of supporting functions required by the network device to implement the method, and so on. Wherein the network device is, for example, a base station.
For convenience of description, hereinafter, the method is exemplified by the first apparatus and the second apparatus, and specifically, the third communication device is exemplified by the first apparatus and the fourth communication device is exemplified by the second apparatus. The first device is, for example, a network device, the second device is, for example, a terminal device, then the first signal described herein may be a downstream signal, or the first device is, for example, a terminal device, and the second device is, for example, a network device, then the first signal described herein may be an upstream signal.
S81, the first device codes the code words of K elements
Figure GDA0003841386120000211
Performing channel coding to obtain N-element code words +.>
Figure GDA0003841386120000212
Wherein said channel coding is such that said +.>
Figure GDA0003841386120000213
And->
Figure GDA0003841386120000214
Satisfy (S)>
Figure GDA0003841386120000215
Figure GDA0003841386120000216
Wherein [ y ] 1 ,y 2 ,…,y N/2 ]For code word->
Figure GDA0003841386120000217
N/2 elements of (a)>
Figure GDA0003841386120000218
For code word->
Figure GDA0003841386120000219
The remaining N/2 elements of +.>
Figure GDA00038413861200002110
Representing modulo A addition, ++>
Figure GDA00038413861200002111
Is composed of->
Figure GDA00038413861200002112
Through a third braidingThe resulting code word is coded in a code manner,
Figure GDA00038413861200002113
is composed of->
Figure GDA00038413861200002114
The resulting codeword is encoded by the fourth encoding scheme,
Figure GDA00038413861200002115
is composed of->
Figure GDA00038413861200002116
A codeword obtained by encoding in a fifth encoding mode, wherein at least one of the third encoding mode and the fifth encoding mode is a nonlinear encoding mode, and the codeword ∈ ->
Figure GDA00038413861200002117
For the code word->
Figure GDA0003841386120000221
Is the code word +. >
Figure GDA0003841386120000222
For the code word->
Figure GDA0003841386120000223
The rest K-B elements in the formula (I) are B, wherein B is an integer greater than 0 and less than K, N and K are positive integers, N>K, A is an integer greater than 1;
s82, the first device uses the code word
Figure GDA0003841386120000224
Generating a first signal;
s83, the first device sends the first signal, and the second device receives the first signal from the first device;
s84, the second device obtains the code word according to the first signal
Figure GDA0003841386120000225
It is noted that codeword [ y ] 1 ,y 2 ,…,y N/2 ]Indicating that the codeword is a codeword
Figure GDA0003841386120000226
The N/2 elements may be the first N/2 elements, the last N/2 elements, or any N/2 elements. And codeword [ y ] 1 ,y 2 ,…,y N/2 ]May be codeword->
Figure GDA00038413861200002231
Either consecutive N/2 elements or non-consecutive N/2 elements. Code word
Figure GDA0003841386120000227
Indicating that the codeword is codeword->
Figure GDA0003841386120000228
Except codeword y 1 ,y 2 ,…,y N/2 ]The remaining N/2 elements. Wherein the reference number of the element does not indicate the codeword of the element +.>
Figure GDA0003841386120000229
Is used to determine the actual position of the object. Code word->
Figure GDA00038413861200002210
And code word->
Figure GDA00038413861200002211
The relation of (2) is the same as above and will not be described again.
In the embodiment of the application, the code word [ y ] 1 ,y 2 ,…,y N/2 ]Is a codeword
Figure GDA00038413861200002212
The first N/2 elements of (B) a codeword
Figure GDA00038413861200002213
For code word->
Figure GDA00038413861200002214
The first B elements of (B) are illustrated as examples. The embodiments of the present application are not limited thereto.
Wherein the code word
Figure GDA00038413861200002215
May be referred to as pre-coding codeword, codeword +.>
Figure GDA00038413861200002216
May be referred to as a coded codeword. In the embodiment of the present application, code word +.>
Figure GDA00038413861200002217
Interleaving may be performed without changing the coding performance. For code word->
Figure GDA00038413861200002218
Interleaving may be performed without changing the coding performance. Reference is made to the description of the embodiment shown in fig. 4.
Where the channel code described herein is an a-ary code, a is an integer greater than 1, e.g., the value of a may be 2 or 4, where if a is 2, the value range of each element of the corresponding codeword may be {0,1}, and if a is 4, the value range of each element of the corresponding codeword may be {0,1,2,3}. Generally 2, is described herein by taking a=2 as an example, that is, unless otherwise specified, the a-ary codes each refer to a binary code, that is, the element x of the first codeword i And element y of the second codeword i The value of (2) is 0 or 1.
In the embodiment of the present application, the nonlinear code may be a Kerdock code or a Delsarte-golthans code, or may be other codes. For an introduction to the Kerdock code or the Delsarte-golthans code, reference is made to the embodiment shown in fig. 4.
Alternatively, the nonlinear encoding method in the embodiment of the present application may also satisfy the following conditions: the code word before coding corresponding to nonlinear coding is
Figure GDA00038413861200002219
The code word after the code word corresponding to the nonlinear coding mode is +.>
Figure GDA00038413861200002220
E>D, or the code word before coding corresponding to the nonlinear coding mode is +>
Figure GDA00038413861200002221
The code word after the code word corresponding to the nonlinear coding mode is +.>
Figure GDA00038413861200002222
The pre-coding codeword corresponding to the nonlinear coding mode is +.>
Figure GDA00038413861200002223
The code word after the code word corresponding to the nonlinear coding mode is +.>
Figure GDA00038413861200002224
As an example. In addition, unless otherwise specified hereinafter, elements of the codeword referred to in the embodiments of the present application are all numbered as examples starting from "1", but the embodiments of the present application do not limit that elements of the codeword may also be numbered starting from "0". Nonlinear coding enables->
Figure GDA00038413861200002225
And->
Figure GDA00038413861200002226
The method can be used for solving the problems that,
Figure GDA00038413861200002227
Figure GDA00038413861200002228
wherein->
Figure GDA00038413861200002229
Representing modulo A addition, ++>
Figure GDA00038413861200002230
Is composed of->
Figure GDA0003841386120000231
Coding the obtained code word by eighteenth coding mode, < >>
Figure GDA0003841386120000232
Is composed of
Figure GDA0003841386120000233
Coding the resulting code word by nineteenth coding means, a code word>
Figure GDA0003841386120000234
Is composed of->
Figure GDA0003841386120000235
The resulting codeword is encoded by the twentieth encoding scheme. [ h ] 1 ,h 2 ,…,h E/2 ]For code word->
Figure GDA0003841386120000236
E/2 elements of (E),. About.>
Figure GDA0003841386120000237
For code word->
Figure GDA0003841386120000238
Except for [ h ] 1 ,h 2 ,…,h E/2 ]The remaining E/2 elements, codeword +.>
Figure GDA0003841386120000239
For code word->
Figure GDA00038413861200002310
Z elements of (a) codeword->
Figure GDA00038413861200002311
For code word->
Figure GDA00038413861200002312
Except for code word->
Figure GDA00038413861200002313
Among the my remaining D-Z elements, Z is an integer greater than 0 and less than D.
Note that, [ h ] 1 ,h 2 ,…,h E/2 ]And
Figure GDA00038413861200002314
the relation of (c) may refer to the above codeword [ y ] 1 ,y 2 ,…,y N/2 ]And code word->
Figure GDA00038413861200002315
Is the relation of codeword [ g ] 1 ,g 2 ,…,g Z ]And code word->
Figure GDA00038413861200002316
The relation of (c) may also refer to the above codeword [ y ] 1 ,y 2 ,…,y N/2 ]And code word->
Figure GDA00038413861200002317
Is not described in detail herein.
As an alternative, the eighteenth coding scheme is different from the nineteenth coding scheme, and certainly, the possibility that the eighteenth coding scheme is identical to the nineteenth coding scheme is not excluded. Similarly, as an alternative, the eighteenth coding scheme is different from the twentieth coding scheme, but the possibility that the eighteenth coding scheme is identical to the twentieth coding scheme is not excluded.
For example, the first encoding mode is a Delsarte-Goethane code, and the second encoding mode is a first order Reed-Muller code, although the embodiments are not limited thereto.
In the embodiment of the present application, at least one of the third encoding mode and the fifth encoding mode is a nonlinear encoding mode, and generally, nonlinear encoding has better performance than linear encoding.
Code word
Figure GDA00038413861200002318
May be part of an information element to be transmitted, e.g. codeword +>
Figure GDA00038413861200002319
May be all or part of the information element to be transmitted. If codeword->
Figure GDA00038413861200002320
Only the part of the information element to be transmitted, except the code word +. >
Figure GDA00038413861200002321
Other code words than code word +.>
Figure GDA00038413861200002322
The same channel coding is used for processing, e.g. the information elements to be transmitted are apart from the code words +.>
Figure GDA00038413861200002323
A code word is included, for which channel coding can also be carried out in the same way, or for which the information element to be transmitted is other than the code word +.>
Figure GDA00038413861200002324
Other code words than code word +.>
Figure GDA00038413861200002325
The different channel coding modes are processed, and the method is not particularly limited.
Also in the embodiments of the present application, channel coding may be an iterative process. For example for codewords
Figure GDA00038413861200002326
Is to add code word->
Figure GDA00038413861200002327
Is divided into->
Figure GDA00038413861200002328
And->
Figure GDA00038413861200002329
The two parts are processed separately, and during processing, each of the two parts can be divided into two parts, the two parts can be processed in the same way as the method described above, further, each of the two parts can be subdivided into two parts in the same way, and the two parts can still be processed in the same way as the method described above, so that the steps are iterated. Thus, at each iteration, there are three coding modes for the two parts obtained by the division. In this embodiment of the present application, at least one of the two encoding modes in each of the at least one iteration process may be made to be a nonlinear encoding mode (i.e., at least one of the two encoding modes corresponding to v and u is made to be a nonlinear encoding mode), where the more nonlinear encoding modes are adopted, the better the performance improvement. For example, in the embodiment of the present application, at least one of the two corresponding encoding modes may be made to be a nonlinear encoding mode during each iteration, or the embodiment of the present application may make the encoding modes involved in the iteration process be all nonlinear encoding modes, so as to achieve a larger improvement on performance. For the iterative process, reference may be made to the relevant description in the embodiment of fig. 4, and since the process is similar, a detailed description is omitted.
The first device based on the codeword
Figure GDA0003841386120000241
Obtaining codewords/>
Figure GDA0003841386120000242
Based on code word->
Figure GDA0003841386120000243
The process of deriving the first signal may continue with reference to fig. 5 and the description above.
With continued reference to fig. 6, the processing of the second device after receiving the first signal may also be further described above.
For example, the first device is used as a transmitting end to perform channel coding on a codeword x with K bits to obtain a codeword y with N bits, where x= [ x1, x2, x3], and k=k1+k2+k3, where x1 occupies K1 bits, x2 occupies K2 bits, and x3 occupies K3 bits.
For example, n=64, k=24, k1=9, k2=7, k3=8. Reference is made to fig. 9, wherein an N/4 bit codeword u1 is obtained from k1 bits of x1, N/4 bit codewords v1 and p1 are obtained from k2 bits of x2, N/2 bit codewords u are obtained from N/4 bit codewords u1 and N/4 bit codewords v1, p1,
Figure GDA0003841386120000244
Figure GDA0003841386120000245
n/2 bit code words v and p can be obtained from k3 bit x3, and N bit code words y,/can be obtained from 2/N bit code words u and 2/N bit code words v, p>
Figure GDA0003841386120000246
Where u1= (x1×g1) mod 2, g1 is a generator matrix of 9×16:
Figure GDA0003841386120000247
v1= (x 2×g2) mod 2, g2 is a generator matrix of 7×16:
Figure GDA0003841386120000248
Figure GDA0003841386120000249
g3 is a 7×16 generator matrix:
Figure GDA00038413861200002410
v= (x 3 x g 4) mod 2, g4 is the generator matrix of 8 x 32:
Figure GDA00038413861200002411
Figure GDA0003841386120000251
Figure GDA0003841386120000252
g5 is a generator matrix of 8×32: />
Figure GDA0003841386120000253
Please refer to fig. 10, which is a schematic diagram illustrating a functional relationship between BLER and SINR. The upper curve in fig. 10 is the curve corresponding to the polarization code, and the lower curve is the curve corresponding to the channel coding mode provided in the embodiment of the present application. The pole code in the figure adopts a CRC-assisted interference cancellation path (CA-SCL) decoding algorithm, the CRC length is 8, and the reserved path is 32. For example, as can be seen from fig. 10, when the BLER is 10 -4 In this case, when the channel coding is performed according to the channel coding method provided in the embodiment of the present application, a gain of about 0.4dB is obtained compared with the polarization code.
The apparatus for implementing the above method in the embodiments of the present application is described below with reference to the accompanying drawings. Therefore, the above contents can be used in the following embodiments, and repeated contents are not repeated.
Fig. 11 shows a schematic structural diagram of a communication device 1100. The communication apparatus 1100 may implement the functionality of the first device referred to above. The communication apparatus 1100 may be the first device described above, for example the communication apparatus 1100 is the network device 102 shown in fig. 1, or the access network device 102 shown in fig. 2, or the communication apparatus 1100 may be the terminal device shown in fig. 1 or fig. 3, or the communication apparatus 1100 may be a chip provided in the first device described above. The communication device 1100 may include a processor 1101 and a transceiver 1102. If the first device shown in fig. 13 is the access network device 102 shown in fig. 2, the processor 1101 and the controller/processor 201 may be the same component, and the transceiver 1102 and the transceiver 202 may be the same component; alternatively, if the first device shown in fig. 13 is the terminal device shown in fig. 1 or 3, the processor 1101 and the application processor 302 may be the same component, and the transceiver 1102 and the transceiver 301 may be the same component. Wherein the processor 1101 may be configured to perform S41 and S42 in the embodiment shown in fig. 4, and/or other processes for supporting the techniques described herein, for example, all or part of the other processes performed by the first device other than the transceiving processes described above may be performed. The transceiver 1102 may be configured to perform S43 in the embodiment shown in fig. 4, and/or to support other processes of the techniques described herein, such as all or part of the transceiving processes performed by the first device described above.
Fig. 12 shows a schematic configuration of a communication apparatus 1200. The communication apparatus 1200 may implement the functionality of the second device referred to above. The communication apparatus 1200 may be the second device described above, for example the communication apparatus 1100 is the network device 102 shown in fig. 1, or the access network device 102 shown in fig. 2, or the communication apparatus 1100 may be the terminal device shown in fig. 1 or fig. 3, or the communication apparatus 1200 may be a chip provided in the second device described above. The communication device 1200 may include a processor 1201 and a transceiver 1202. If the first device shown in fig. 13 is the terminal device shown in fig. 1 or fig. 3, the second device shown in fig. 14 may be the access network device 102 shown in fig. 2, the processor 1201 and the controller/processor 201 may be the same component, and the transceiver 1202 and the transceiver 202 may be the same component; alternatively, if the first device shown in fig. 13 is the access network device 102 shown in fig. 2, the second device shown in fig. 14 may be the terminal device shown in fig. 1 or fig. 3, the processor 1201 and the application processor 302 may be the same component, and the transceiver 1202 and the transceiver 301 may be the same component. Wherein the processor 1201 may be configured to perform S44 in the embodiment shown in fig. 4, and/or to support other processes of the techniques described herein, such as performing all or part of other operations performed by the second device in addition to the transceiving operations. The transceiver 1202 may be configured to perform S43 in the embodiment illustrated in fig. 4, and/or to support other processes of the techniques described herein, e.g., may perform all or part of the transceiving processes performed by the second device described previously.
Fig. 13 shows a schematic configuration of a communication apparatus 1300. The communications apparatus 1300 can implement the functionality of the first device referred to above. The communication apparatus 1300 may be the first device described above, for example the communication apparatus 1100 is the network device 102 shown in fig. 1, or the access network device 102 shown in fig. 2, or the communication apparatus 1100 may be the terminal device shown in fig. 1 or fig. 3, or the communication apparatus 1300 may be a chip provided in the first device described above. The communications apparatus 1300 can include a processor 1301 and a transceiver 1302. If the first device shown in fig. 13 is the access network device 102 shown in fig. 2, the processor 1301 and the controller/processor 201 may be the same component, and the transceiver 1102 and the transceiver 202 may be the same component; alternatively, if the first device shown in fig. 13 is the terminal device shown in fig. 1 or 3, the processor 1301 and the application processor 302 may be the same component, and the transceiver 1302 and the transceiver 301 may be the same component. Wherein processor 1301 may be configured to perform S81 and S82 in the embodiment illustrated in fig. 8, and/or other processes for supporting the techniques described herein, e.g., may perform all or part of the other processes performed by the first device, except for the transceiving processes, described above. The transceiver 1302 may be configured to perform S83 in the embodiment shown in fig. 8, and/or to support other processes of the techniques described herein, e.g., may perform all or part of the transceiving processes performed by the first device as described above.
Fig. 14 shows a schematic structural diagram of a communication device 1400. The communication apparatus 1400 may implement the functionality of the second device referred to above. The communication apparatus 1400 may be a network device as described above, for example the communication apparatus 1100 is a network device 102 as shown in fig. 1, or an access network device 102 as shown in fig. 2, or the communication apparatus 1100 may be a terminal device as shown in fig. 1 or fig. 3, or the communication apparatus 1400 may be a chip provided in a network device as described above. The communication device 1400 may include a processor 1401 and a transceiver 1402. If the first device shown in fig. 13 is the terminal device shown in fig. 1 or fig. 3, the second device shown in fig. 14 may be the access network device 102 shown in fig. 2, the processor 1201 and the controller/processor 201 may be the same component, and the transceiver 1202 and the transceiver 202 may be the same component; alternatively, if the first device shown in fig. 13 is the access network device 102 shown in fig. 2, the second device shown in fig. 14 may be the terminal device shown in fig. 1 or fig. 3, the processor 1201 and the application processor 302 may be the same component, and the transceiver 1202 and the transceiver 301 may be the same component. Wherein the processor 1401 may be configured to perform S84 in the embodiment shown in fig. 8, and/or to support other processes of the techniques described herein, such as performing all or part of other operations performed by the second device other than the transceiving operations. The transceiver 1402 may be used to perform S83 in the embodiment shown in fig. 8, and/or other processes for supporting the techniques described herein, e.g., may perform all or part of the transceiving processes performed by the second device as described previously.
In a simple embodiment, it will be appreciated by those skilled in the art that the communication apparatus 1100, the communication apparatus 1200, the communication apparatus 1300, or the communication apparatus 1400 may also be implemented by the structure of the communication apparatus 1500 as shown in fig. 15. The communication apparatus 1500 may implement the functions of the first device or the second device referred to above. The communications device 1500 may include a processor 1501. Optionally, the communications device 1500 may also include a memory 1502 that may be used to store instructions required by the processor 1501 to perform tasks.
Where the communications apparatus 1500 is configured to implement the functionality of the first device referred to above, the processor 1501 may be configured to perform S41 and S42 in the embodiment shown in fig. 4, and/or to support other processes of the techniques described herein, for example, all or part of other processes performed by the first device other than the transceiving processes described above; alternatively, where the communications apparatus 1500 is used to implement the functionality of the second device referred to above, the processor 1501 may be configured to perform S44 in the embodiment illustrated in fig. 4, e.g., may perform all or part of other operations performed by the second device, other than transceiving operations, and/or other procedures to support the techniques described herein; alternatively, where the communications apparatus 1500 is used to implement the functionality of the first device referred to above, the processor 1501 may be configured to perform S81 and S82 in the embodiment illustrated in fig. 8, and/or to support other processes of the techniques described herein, e.g., may perform all or part of other processes performed by the first device in addition to the transceiving processes described above; alternatively, where the communications apparatus 1500 is used to implement the functionality of the second device referred to above, the processor 1501 may be configured to perform S84 in the embodiment illustrated in fig. 8, e.g., may perform all or part of other operations performed by the second device, other than transceiving operations, and/or other procedures for supporting the techniques described herein.
In the embodiment of the present application, the communication apparatus 1100, the communication apparatus 1200, the communication apparatus 1300, the communication apparatus 1400, and the communication apparatus 1500 are presented in a form of dividing each functional module for each function, or may be presented in a form of dividing each functional module in an integrated manner. A "module" herein may refer to an ASIC, a processor and memory that execute one or more software or firmware programs, an integrated logic circuit, and/or other devices that can provide the described functionality.
In addition, the communication device 1100 provided by the embodiment shown in fig. 11 may be implemented in other forms. For example, the communication device includes a processing module and a transceiver module. For example, the processing module may be implemented by the processor 1101, and the transceiver module may be implemented by the transceiver 1102. Wherein the processing module may be configured to perform S41 and S42 in the embodiment shown in fig. 4, and/or other processes for supporting the techniques described herein, for example, all other processes or part of other processes performed by the first device other than the transceiving process described above may be performed. The transceiving module may be used to perform S43 in the embodiment shown in fig. 4, and/or to support other processes of the techniques described herein, e.g., may perform all or part of the transceiving processes performed by the first device as described above.
The embodiment shown in fig. 12 provides a communication device 1200 that may also be implemented in other forms. For example, the communication device includes a processing module and a transceiver module. For example, the processing module may be implemented by the processor 1201 and the transceiver module may be implemented by the transceiver 1202. Wherein the processing module may be configured to perform S81 and S82 in the embodiment shown in fig. 8, and/or other processes for supporting the techniques described herein, for example, all other processes or part of other processes performed by the first device other than the transceiving process described above may be performed. The transceiver module may be configured to perform S83 in the embodiment shown in fig. 8, and/or to support other processes of the techniques described herein, e.g., may perform all or part of the transceiving processes performed by the first device as described above.
The embodiment shown in fig. 13 provides a communication device 1300 that may also be implemented in other forms. For example, the communication device includes a processing module and a transceiver module. For example, the processing module may be implemented by the processor 1301, and the transceiver module may be implemented by the transceiver 1302. Wherein the processing module may be configured to perform S84 in the embodiment shown in fig. 8, and/or to support other processes of the techniques described herein, such as performing all or part of other operations performed by the second device other than the transceiving operations. The transceiver module may be used to perform S83 in the embodiment shown in fig. 8, and/or to support other processes of the techniques described herein, e.g., may perform all or part of the transceiving processes performed by the second device described previously.
Since the communication device 1100, the communication device 1200, the communication device 1300, the communication device 1400 and the communication device 1500 provided in the embodiments of the present application can be used to perform the method provided in the embodiment shown in fig. 4 or the method provided in the embodiment shown in fig. 8, the technical effects obtained by the method can be referred to the above method embodiments, and will not be described herein.
The present examples also provide an apparatus (e.g., an integrated circuit, a wireless device, a circuit module, etc.) for implementing the above-described methods. The means for implementing the power tracker and/or power supply generator described herein may be a stand-alone device or may be part of a larger device. The device may be (i) a free-standing IC; (ii) A set of one or more 1C, which may include a memory IC for storing data and/or instructions; (iii) RFICs, such as RF receivers or RF transmitter/receivers; (iv) an ASIC, such as a mobile station modem; (v) modules that may be embedded within other devices; (vi) A receiver, cellular telephone, wireless device, handset, or mobile unit; (vii) others, and so forth.
The method and the device provided by the embodiment of the application can be applied to terminal equipment or access network equipment (which can be collectively called wireless equipment). The terminal device or access network device or wireless device may include a hardware layer, an operating system layer running above the hardware layer, and an application layer running above the operating system layer. The hardware layer includes hardware such as a CPU, a memory management unit (memory management unit, MMU), and a memory (also referred to as a main memory). The operating system may be any one or more computer operating systems that implement business processes through processes (processes), such as a Linux operating system, a Unix operating system, an Android operating system, an iOS operating system, or a windows operating system. The application layer comprises applications such as a browser, an address book, word processing software, instant messaging software and the like. In addition, in the embodiment of the present application, the embodiment of the present application is not limited to a specific structure of an execution body of the method, as long as the execution body of the method of the embodiment of the present application can communicate in the method of transmitting a signal according to the embodiment of the present application by executing a program recorded with a code of the method of the embodiment of the present application, and for example, the execution body of the method of wireless communication of the embodiment of the present application may be a terminal device or an access network device, or may be a functional module in the terminal device or the access network device that can call the program and execute the program.
Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the embodiments of the present application.
Furthermore, various aspects or features of embodiments of the present application may be implemented as a method, apparatus, or article of manufacture using standard programming and/or engineering techniques. The term "article of manufacture" as used herein encompasses a computer program accessible from any computer-readable device, carrier, or media. For example, computer-readable media can include, but are not limited to, magnetic storage devices (e.g., hard disk, floppy disk, or magnetic strips, etc.), optical disks (e.g., compact disk, CD, digital versatile disk, digital versatile disc, DVD, etc.), smart cards, and flash memory devices (e.g., erasable programmable read-only memory, EPROM), cards, sticks, or key drives, etc. Additionally, various storage media described herein can represent one or more devices and/or other machine-readable media for storing information. The term "machine-readable medium" can include, without being limited to, wireless channels and various other media capable of storing, containing, and/or carrying instruction(s) and/or data.
In the above embodiments, it may be implemented in whole or in part by software, hardware, firmware, or any combination thereof. When implemented in software, may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When loaded and executed on a computer, produces a flow or function in accordance with embodiments of the present application, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a computer network, or other programmable apparatus. The computer instructions may be stored in or transmitted from one computer-readable storage medium to another, for example, by wired (e.g., coaxial cable, optical fiber, digital Subscriber Line (DSL)), or wireless (e.g., infrared, wireless, microwave, etc.). The computer readable storage medium may be any available medium that can be accessed by a computer or a data storage device such as a server, data center, etc. that contains an integration of one or more available media. The usable medium may be a magnetic medium (e.g., floppy disk, hard disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., solid State Disk (SSD)), etc.
It should be understood that, in various embodiments of the present application, the sequence numbers of the foregoing processes do not mean the order of execution, and the order of execution of the processes should be determined by the functions and internal logic of the processes, and should not constitute any limitation on the implementation process of the embodiments of the present application.
It will be clear to those skilled in the art that, for convenience and brevity of description, specific working procedures of the above-described systems, apparatuses and units may refer to corresponding procedures in the foregoing method embodiments, and are not repeated herein.
In the several embodiments provided in this application, it should be understood that the disclosed systems, devices, and methods may be implemented in other manners. For example, the apparatus embodiments described above are merely illustrative, e.g., the division of the units is merely a logical function division, and there may be additional divisions when actually implemented, e.g., multiple units or components may be combined or integrated into another system, or some features may be omitted or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be an indirect coupling or communication connection via some interfaces, devices or units, which may be in electrical, mechanical or other form.
The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a computer-readable storage medium. Based on such understanding, the technical solution of the embodiments of the present application may be essentially or, what contributes to the prior art, or part of the technical solution may be embodied in the form of a software product stored in a storage medium, comprising several instructions for causing a computer device (which may be a personal computer, a server, or an access network device, etc.) to perform all or part of the steps of the methods described in the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a read-only memory (ROM), a random access memory (random access memory, RAM), a magnetic disk, or an optical disk, or other various media capable of storing program codes.
The foregoing is merely a specific implementation of the embodiments of the present application, but the protection scope of the embodiments of the present application is not limited thereto, and any person skilled in the art may easily think about changes or substitutions within the technical scope of the embodiments of the present application, and all changes and substitutions are included in the protection scope of the embodiments of the present application.

Claims (47)

1. A signal transmission method, comprising:
channel coding is carried out on a first codeword of K elements to obtain a second codeword of N elements, wherein N/2 elements of the second codeword are third codewords, the third codewords are obtained by a first part of the first codeword through a first coding mode, the remaining N/2 elements of the second codeword are fourth codewords, the fourth codeword is a result of (a+b) mod A, a represents a codeword obtained by a second part of the first codeword through a second coding mode, b represents the third codeword, the first part is M elements of the first codeword, the second part is the remaining K-M elements of the first codeword except the M elements, at least one of the first coding mode and the second coding mode is a nonlinear coding mode, N and K are positive integers, and N > K and A is an integer greater than 1;
Generating a first signal using the second codeword;
and transmitting the first signal.
2. The method of claim 1, wherein the first codeword is part of an information element to be transmitted.
3. The method according to claim 1 or 2, wherein the third codeword is the first N/2 elements of the second codeword and the fourth codeword is the last N/2 elements of the second codeword.
4. A method according to claim 1 or 2, characterized in that,
the code word before coding corresponding to the nonlinear coding mode is
Figure FDA0004176464760000011
The code word after the code word corresponding to the nonlinear coding mode is +.>
Figure FDA0004176464760000012
E>D, said nonlinear coding is such that said ++>
Figure FDA0004176464760000013
And said->
Figure FDA0004176464760000014
Satisfy (S)>
Figure FDA0004176464760000015
Figure FDA0004176464760000016
Figure FDA0004176464760000017
Wherein->
Figure FDA0004176464760000018
Representing modulo A addition, ++>
Figure FDA0004176464760000019
Is composed of->
Figure FDA00041764647600000110
The resulting codeword is encoded by the eighteenth encoding means,
Figure FDA00041764647600000111
is composed of->
Figure FDA00041764647600000112
The resulting codeword is encoded by the nineteenth encoding,
Figure FDA00041764647600000113
is composed of->
Figure FDA00041764647600000114
Encoded codeword by twentieth encoding scheme, [ h ] 1 ,h 2 ,…,h E/2 ]For the code word->
Figure FDA00041764647600000115
E/2 elements of (E),. About.>
Figure FDA00041764647600000116
For code word->
Figure FDA00041764647600000117
The remaining E/2 elements of said codeword +.>
Figure FDA00041764647600000118
For the code word->
Figure FDA00041764647600000119
Is said codeword +.>
Figure FDA00041764647600000120
For the code word->
Figure FDA00041764647600000121
Z is an integer greater than 0 and less than D, and A is an integer greater than 1.
5. The method according to claim 1 or 2, wherein the first coding scheme is a Delsarte-golthanals code and the second coding scheme is a first order Reed-Muller code.
6. A signal transmission method, comprising:
code word for K elements
Figure FDA00041764647600000122
Performing channel coding to obtain N-element code words +.>
Figure FDA00041764647600000123
Wherein said channel coding is such that said +.>
Figure FDA00041764647600000124
And->
Figure FDA00041764647600000125
Satisfy (S)>
Figure FDA00041764647600000126
Figure FDA00041764647600000127
Wherein [ y ] 1 ,y 2 ,…,y N/2 ]For code word->
Figure FDA00041764647600000128
N/2 elements of (a)>
Figure FDA00041764647600000129
For code word->
Figure FDA00041764647600000130
The remaining N/2 elements of +.>
Figure FDA0004176464760000021
Representing modulo A addition, ++>
Figure FDA0004176464760000022
Is composed of->
Figure FDA0004176464760000023
The resulting codeword is encoded by the third encoding scheme,
Figure FDA0004176464760000024
is composed of->
Figure FDA0004176464760000025
The resulting codeword is encoded by the fourth encoding scheme,
Figure FDA0004176464760000026
is composed of->
Figure FDA0004176464760000027
A codeword obtained by encoding in a fifth encoding mode, wherein at least one of the third encoding mode and the fifth encoding mode is a nonlinear encoding mode, and the codeword ∈ ->
Figure FDA0004176464760000028
For the code word->
Figure FDA0004176464760000029
Is the code word +.>
Figure FDA00041764647600000210
For the code word->
Figure FDA00041764647600000211
The rest K-B elements in the formula (I) are B, wherein B is an integer greater than 0 and less than K, N and K are positive integers, N>K, A is an integer greater than 1;
using the codeword
Figure FDA00041764647600000212
Generating a first signal;
and transmitting the first signal.
7. According to claimThe method of 6, wherein the codeword
Figure FDA00041764647600000213
Is part of the information element to be transmitted.
8. The method according to claim 6 or 7, wherein,
the code word before coding corresponding to the nonlinear coding mode is
Figure FDA00041764647600000214
The code word after the code word corresponding to the nonlinear coding mode is +.>
Figure FDA00041764647600000215
E>D, said nonlinear coding is such that said ++>
Figure FDA00041764647600000216
And said->
Figure FDA00041764647600000217
Satisfy (S)>
Figure FDA00041764647600000218
Figure FDA00041764647600000219
Figure FDA00041764647600000220
Wherein->
Figure FDA00041764647600000221
Representing modulo A addition, ++>
Figure FDA00041764647600000222
Is composed of->
Figure FDA00041764647600000223
The resulting codeword is encoded by the eighteenth encoding means,
Figure FDA00041764647600000224
is composed of->
Figure FDA00041764647600000225
The resulting codeword is encoded by the nineteenth encoding,
Figure FDA00041764647600000226
is composed of->
Figure FDA00041764647600000227
Encoded codeword by twentieth encoding scheme, [ h ] 1 ,h 2 ,…,h E/2 ]For the code word->
Figure FDA00041764647600000228
E/2 elements of (E),. About.>
Figure FDA00041764647600000229
For code word->
Figure FDA00041764647600000230
The remaining E/2 elements of said codeword +.>
Figure FDA00041764647600000231
For the code word->
Figure FDA00041764647600000232
Is said codeword +.>
Figure FDA00041764647600000233
For the code word->
Figure FDA00041764647600000234
Z is an integer greater than 0 and less than D, and A is an integer greater than 1.
9. The method according to any one of claims 6 or 7, wherein at least one of the third coding scheme and the fifth coding scheme is a Delsarte-golthanals code or a Kerdock code.
10. A signal receiving method, comprising:
receiving a first signal;
the first signal is generated by a second codeword of N elements, the second codeword is satisfied, N/2 elements of the second codeword are third codewords, the third codewords are obtained by a first portion of a first codeword through a first coding mode, the remaining N/2 elements of the second codeword are fourth codewords, the fourth codewords are the result of (a+b) mod a, wherein a represents a codeword obtained by a second portion of the first codeword through a second coding mode, b represents the third codeword, the first portion is M elements of the first codeword, the second portion is the remaining K-M elements of the first codeword except for the M elements, at least one of the first coding mode and the second coding mode is a nonlinear coding mode, and a is an integer greater than 1;
And carrying out channel decoding on the first signal to obtain a first codeword with K elements, wherein N and K are positive integers, and N is greater than K.
11. The method of claim 10, wherein the first codeword is a portion of a received information element.
12. The method according to claim 10 or 11, wherein the third codeword is the first N/2 elements of the second codeword and the fourth codeword is the last N/2 elements of the second codeword.
13. The method according to claim 10 or 11, wherein,
the code word before coding corresponding to the nonlinear coding mode is
Figure FDA0004176464760000031
The code word after the code word corresponding to the nonlinear coding mode is +.>
Figure FDA0004176464760000032
E>D, said nonlinear coding is such that said ++>
Figure FDA0004176464760000033
And said->
Figure FDA0004176464760000034
Satisfy (S)>
Figure FDA0004176464760000035
Figure FDA0004176464760000036
Figure FDA0004176464760000037
Wherein->
Figure FDA0004176464760000038
Representing modulo A addition, ++>
Figure FDA0004176464760000039
Is composed of->
Figure FDA00041764647600000310
The resulting codeword is encoded by the eighteenth encoding means,
Figure FDA00041764647600000311
is composed of->
Figure FDA00041764647600000312
The resulting codeword is encoded by the nineteenth encoding,
Figure FDA00041764647600000313
is composed of->
Figure FDA00041764647600000314
Encoded codeword by twentieth encoding scheme, [ h ] 1 ,h 2 ,…,h E/2 ]For the code word->
Figure FDA00041764647600000315
E/2 elements of (E),. About.>
Figure FDA00041764647600000316
For code word->
Figure FDA00041764647600000317
The remaining E/2 elements of said codeword +.>
Figure FDA00041764647600000318
For the code word->
Figure FDA00041764647600000319
Is said codeword +.>
Figure FDA00041764647600000320
For the code word->
Figure FDA00041764647600000321
Z is an integer greater than 0 and less than D, and A is an integer greater than 1.
14. The method according to claim 10 or 11, wherein the first coding scheme is a Delsarte-golthanals code and the second coding scheme is a first order Reed-Muller code.
15. A signal receiving method, comprising:
receiving a first signal;
the first signal is a codeword of N elements
Figure FDA00041764647600000322
Generating, codeword->
Figure FDA00041764647600000323
Satisfy (S)>
Figure FDA00041764647600000324
Figure FDA00041764647600000325
Figure FDA00041764647600000326
Wherein->
Figure FDA00041764647600000327
Representing modulo A addition, ++>
Figure FDA00041764647600000328
Is composed of->
Figure FDA00041764647600000329
Code words obtained by the third coding mode, are encoded>
Figure FDA00041764647600000330
Is composed of->
Figure FDA00041764647600000331
Code word obtained by the fourth coding mode, < >>
Figure FDA00041764647600000332
Is composed of->
Figure FDA00041764647600000333
The code word obtained by the fifth coding mode is coded, wherein at least one of the third coding mode and the fifth coding mode is a nonlinear coding mode, [ y ] 1 ,y 2 ,…,y N/2 ]For code word->
Figure FDA00041764647600000334
N/2 elements of (a)>
Figure FDA00041764647600000335
For code word->
Figure FDA00041764647600000336
The remaining N/2 elements of (3);
channel decoding the first signal to obtain code words of K elements
Figure FDA00041764647600000337
Wherein the code word->
Figure FDA00041764647600000338
For the code word
Figure FDA00041764647600000339
Is the code word +.>
Figure FDA00041764647600000340
For the code word->
Figure FDA00041764647600000341
The rest K-B elements in the formula (I) are B, wherein B is an integer greater than 0 and less than K, N and K are positive integers, N>K, A is an integer greater than 1.
16. The method of claim 15, wherein the codeword is a codeword
Figure FDA0004176464760000041
Is part of the received information element.
17. The method according to claim 15 or 16, wherein,
the code word before coding corresponding to the nonlinear coding mode is
Figure FDA0004176464760000042
The code word after the code word corresponding to the nonlinear coding mode is +.>
Figure FDA0004176464760000043
E>D, said nonlinear coding is such that said ++>
Figure FDA0004176464760000044
And said->
Figure FDA0004176464760000045
Satisfy (S)>
Figure FDA0004176464760000046
Figure FDA0004176464760000047
Figure FDA0004176464760000048
Wherein->
Figure FDA0004176464760000049
Representing modulo A addition, ++>
Figure FDA00041764647600000410
Is composed of->
Figure FDA00041764647600000411
The resulting codeword is encoded by the eighteenth encoding means,
Figure FDA00041764647600000412
is composed of->
Figure FDA00041764647600000413
The resulting codeword is encoded by the nineteenth encoding,
Figure FDA00041764647600000414
is composed of->
Figure FDA00041764647600000415
Encoded codeword by twentieth encoding scheme, [ h ] 1 ,h 2 ,…,h E/2 ]For the code word->
Figure FDA00041764647600000416
E/2 elements of (E),. About.>
Figure FDA00041764647600000417
For code word->
Figure FDA00041764647600000418
The remaining E/2 elements of said codeword +.>
Figure FDA00041764647600000419
For the code word->
Figure FDA00041764647600000420
Is said codeword +.>
Figure FDA00041764647600000421
For the code word->
Figure FDA00041764647600000422
Z is an integer greater than 0 and less than D, and A is an integer greater than 1.
18. The method of claim 15 or 16, wherein at least one of the third coding scheme and the fifth coding scheme is a Delsarte-golethane code or a Kerdock code.
19. A signal receiving method, comprising:
receiving a first signal;
the first signal is generated by a second codeword of N elements, the second codeword is satisfied, N/2 elements of the second codeword are third codewords, the third codewords are obtained by a first portion of a first codeword through a first coding mode, the remaining N/2 elements of the second codeword are fourth codewords, the fourth codewords are the result of (a+b) mod a, wherein a represents a codeword obtained by a second portion of the first codeword through a second coding mode, b represents the third codeword, the first portion is M elements of the first codeword, the second portion is the remaining K-M elements of the first codeword except for the M elements, at least one of the first coding mode and the second coding mode is a nonlinear coding mode, and a is an integer greater than 1;
Performing channel decoding on a fourth codeword in the second codewords of the N elements to obtain a first channel decoding result;
performing channel decoding on a third codeword in the second codeword of the N elements according to the first channel decoding result to obtain a second channel decoding result;
and obtaining a first codeword of K elements according to the first channel decoding result and the second channel decoding result, wherein N and K are positive integers, and N is greater than K.
20. The method of claim 19, wherein the first codeword is a portion of a received information element.
21. The method of claim 19 or 20, wherein the third codeword is a first N/2 elements of the second codeword and a fourth codeword is a last N/2 elements of the second codeword.
22. The method according to claim 19 or 20, wherein,
the code word before coding corresponding to the nonlinear coding mode is
Figure FDA00041764647600000423
The code word after the code word corresponding to the nonlinear coding mode is +.>
Figure FDA0004176464760000051
E>D, said nonlinear coding is such that said ++>
Figure FDA0004176464760000052
And said->
Figure FDA0004176464760000053
Satisfy (S)>
Figure FDA0004176464760000054
Figure FDA0004176464760000055
Figure FDA0004176464760000056
Wherein->
Figure FDA0004176464760000057
Representing modulo A addition, ++>
Figure FDA0004176464760000058
Is composed of->
Figure FDA0004176464760000059
The resulting codeword is encoded by the eighteenth encoding means,
Figure FDA00041764647600000510
is composed of->
Figure FDA00041764647600000511
The resulting codeword is encoded by the nineteenth encoding,
Figure FDA00041764647600000512
Is composed of->
Figure FDA00041764647600000513
Encoded codeword by twentieth encoding scheme, [ h ] 1 ,h 2 ,…,h E/2 ]For the code word->
Figure FDA00041764647600000514
E/2 elements of (E),. About.>
Figure FDA00041764647600000515
For code word->
Figure FDA00041764647600000516
The remaining E/2 elements of said codeword +.>
Figure FDA00041764647600000517
For the code word->
Figure FDA00041764647600000518
Is said codeword +.>
Figure FDA00041764647600000519
For the code word->
Figure FDA00041764647600000520
Z is an integer greater than 0 and less than D, and A is an integer greater than 1.
23. The method according to claim 19 or 20, wherein the first coding scheme is a Delsarte-golthanals code and the second coding scheme is a first order Reed-Muller code.
24. A communication device, comprising:
a processor, configured to perform channel coding on a first codeword with K elements to obtain a second codeword with N elements, where N/2 elements of the second codeword are third codewords, the third codewords are obtained by a first portion of the first codeword through a first coding manner, the remaining N/2 elements of the second codeword are fourth codewords, the fourth codewords are results of (a+b) mod a, where a represents a codeword obtained by a second portion of the first codeword through a second coding manner, b represents the third codeword, the first portion is M elements of the first codeword, the second portion is the remaining K-M elements of the first codeword except for the M elements, at least one of the first coding manner and the second coding manner is a nonlinear coding manner, N and K are positive integers, N > K is an integer greater than 1;
The processor is further configured to generate a first signal using the second codeword;
and the transceiver is used for transmitting the first signal.
25. The communication device of claim 24, wherein the first codeword is part of an information element to be transmitted.
26. The communication device of claim 24 or 25, wherein the third codeword is a first N/2 elements of the second codeword and a fourth codeword is a last N/2 elements of the second codeword.
27. A communication device according to claim 24 or 25, characterized in that,
the code word before coding corresponding to the nonlinear coding mode is
Figure FDA00041764647600000521
The code word after the code word corresponding to the nonlinear coding mode is +.>
Figure FDA00041764647600000522
E>D, said nonlinear coding is such that said ++>
Figure FDA00041764647600000523
And said->
Figure FDA00041764647600000524
Satisfy (S)>
Figure FDA00041764647600000525
Figure FDA00041764647600000526
Figure FDA00041764647600000527
Wherein->
Figure FDA00041764647600000528
Representing modulo A addition, ++>
Figure FDA00041764647600000529
Is composed of->
Figure FDA00041764647600000530
The resulting codeword is encoded by the eighteenth encoding means,
Figure FDA00041764647600000531
is composed of->
Figure FDA00041764647600000532
The resulting codeword is encoded by the nineteenth encoding,
Figure FDA00041764647600000533
is composed of->
Figure FDA00041764647600000534
Encoded codeword by twentieth encoding scheme, [ h ] 1 ,h 2 ,…,h E/2 ]For the code word->
Figure FDA0004176464760000061
E/2 elements of (E),. About.>
Figure FDA0004176464760000062
For code word->
Figure FDA0004176464760000063
The remaining E/2 elements of said codeword +.>
Figure FDA0004176464760000064
For the code word->
Figure FDA0004176464760000065
Is said codeword +.>
Figure FDA0004176464760000066
For the code word- >
Figure FDA0004176464760000067
Z is an integer greater than 0 and less than D, and A is an integer greater than 1.
28. The communication device according to claim 24 or 25, wherein the first coding scheme is a Delsarte-golthanals code and the second coding scheme is a first order Reed-Muller code.
29. A communication device, comprising:
a processor for code words of K elements
Figure FDA0004176464760000068
Performing channel coding to obtain N-element code words +.>
Figure FDA0004176464760000069
Wherein said channel coding is such that said +.>
Figure FDA00041764647600000610
And->
Figure FDA00041764647600000611
Satisfy (S)>
Figure FDA00041764647600000612
Figure FDA00041764647600000613
Wherein [ y ] 1 ,y 2 ,…,y N/2 ]For code word->
Figure FDA00041764647600000614
N/2 elements of (a)>
Figure FDA00041764647600000615
For code word->
Figure FDA00041764647600000616
The remaining N/2 elements of +.>
Figure FDA00041764647600000617
Representing modulo A addition, ++>
Figure FDA00041764647600000618
Is composed of->
Figure FDA00041764647600000619
The resulting codeword is encoded by the third encoding scheme,
Figure FDA00041764647600000620
is composed of->
Figure FDA00041764647600000621
The resulting codeword is encoded by the fourth encoding scheme,
Figure FDA00041764647600000622
is composed of->
Figure FDA00041764647600000623
A codeword obtained by encoding in a fifth encoding mode, wherein at least one of the third encoding mode and the fifth encoding mode is a nonlinear encoding mode, and the codeword ∈ ->
Figure FDA00041764647600000624
For the code word->
Figure FDA00041764647600000625
Is the code word +.>
Figure FDA00041764647600000626
For the code word->
Figure FDA00041764647600000627
The rest K-B elements in the formula (I) are B, wherein B is an integer greater than 0 and less than K, N and K are positive integers, N>K, A is an integer greater than 1;
the processor is further configured to use the code Word(s)
Figure FDA00041764647600000628
Generating a first signal;
and the transceiver is used for transmitting the first signal.
30. The communication device of claim 29, wherein the codeword comprises
Figure FDA00041764647600000629
Is part of the information element to be transmitted.
31. A communication device according to claim 29 or 30, characterized in that,
the code word before coding corresponding to the nonlinear coding mode is
Figure FDA00041764647600000630
The code word after the code word corresponding to the nonlinear coding mode is +.>
Figure FDA00041764647600000631
E>D, said nonlinear coding is such that said ++>
Figure FDA00041764647600000632
And said->
Figure FDA00041764647600000633
Satisfy (S)>
Figure FDA00041764647600000634
Figure FDA00041764647600000635
Figure FDA00041764647600000636
Wherein->
Figure FDA00041764647600000637
Representing modulo A addition, ++>
Figure FDA00041764647600000638
Is composed of->
Figure FDA00041764647600000639
The resulting codeword is encoded by the eighteenth encoding means,
Figure FDA00041764647600000640
is composed of->
Figure FDA00041764647600000641
The resulting codeword is encoded by the nineteenth encoding,
Figure FDA00041764647600000642
is composed of->
Figure FDA00041764647600000643
Encoded codeword by twentieth encoding scheme, [ h ] 1 ,h 2 ,…,h E/2 ]For the code word->
Figure FDA00041764647600000644
E/2 elements of (E),. About.>
Figure FDA00041764647600000645
For code word->
Figure FDA00041764647600000646
The remaining E/2 elements of said codeword +.>
Figure FDA00041764647600000647
For the code word->
Figure FDA00041764647600000648
Is said codeword +.>
Figure FDA00041764647600000649
For the code word->
Figure FDA00041764647600000650
Z is an integer greater than 0 and less than D, and A is an integer greater than 1.
32. The communication device according to claim 29 or 30, wherein at least one of the third coding scheme and the fifth coding scheme is a Delsarte-golthanals code or a Kerdock code.
33. A communication device, comprising:
a transceiver for receiving a first signal;
the first signal is generated by a second codeword of N elements, the second codeword is satisfied, the first N/2 elements of the second codeword are third codewords, the third codewords are obtained by a first part of a first codeword through a first coding mode, the remaining N/2 elements of the second codeword are fourth codewords, the fourth codewords are the result of (a+b) mod a, wherein a represents codewords obtained by a second part of the first codeword through a second coding mode, b represents the third codewords, the first part is the first M elements of the first codeword, the second part is the remaining K-M elements of the first codeword except the first M elements, at least one of the first coding mode and the second coding mode is a nonlinear coding mode, and a is an integer greater than 1;
and the processor is used for carrying out channel decoding on the first signal to obtain a first codeword with K elements, wherein N and K are positive integers, and N is more than K.
34. The communication device of claim 33, wherein the first codeword is part of a received information element.
35. The communication device of claim 33 or 34, wherein the third codeword is a first N/2 elements of the second codeword and a fourth codeword is a last N/2 elements of the second codeword.
36. A communication device according to claim 33 or 34, characterized in that,
the code word before coding corresponding to the nonlinear coding mode is
Figure FDA0004176464760000071
The code word after the code word corresponding to the nonlinear coding mode is +.>
Figure FDA0004176464760000072
E>D, said nonlinear coding is such that said ++>
Figure FDA0004176464760000073
And said->
Figure FDA0004176464760000074
Satisfy (S)>
Figure FDA0004176464760000075
Figure FDA0004176464760000076
Figure FDA0004176464760000077
Wherein->
Figure FDA0004176464760000078
Representing modulo A addition, ++>
Figure FDA0004176464760000079
Is composed of->
Figure FDA00041764647600000710
The resulting codeword is encoded by the eighteenth encoding means,
Figure FDA00041764647600000711
is composed of->
Figure FDA00041764647600000712
The resulting codeword is encoded by the nineteenth encoding,
Figure FDA00041764647600000713
is composed of->
Figure FDA00041764647600000714
Encoded codeword by twentieth encoding scheme, [ h ] 1 ,h 2 ,…,h E/2 ]For the code word->
Figure FDA00041764647600000715
E/2 elements of (E),. About.>
Figure FDA00041764647600000716
For code word->
Figure FDA00041764647600000717
The remaining E/2 elements of said codeword +.>
Figure FDA00041764647600000718
For the code word->
Figure FDA00041764647600000719
Is said codeword +.>
Figure FDA00041764647600000720
For the code word->
Figure FDA00041764647600000721
Z is an integer greater than 0 and less than D, and A is an integer greater than 1.
37. The communication device according to claim 33 or 34, wherein the first coding scheme is a Delsarte-golthanals code and the second coding scheme is a first order Reed-Muller code.
38. A communication device, comprising:
a transceiver for receiving a first signal;
the first signal is a codeword of N elements
Figure FDA00041764647600000722
Generating, codeword->
Figure FDA00041764647600000723
Satisfy (S)>
Figure FDA00041764647600000724
Figure FDA0004176464760000081
Figure FDA0004176464760000082
Wherein->
Figure FDA0004176464760000083
Representing modulo A addition, ++>
Figure FDA0004176464760000084
Is composed of->
Figure FDA0004176464760000085
Code word obtained by coding in third coding mode,/>
Figure FDA0004176464760000086
Is composed of->
Figure FDA0004176464760000087
Code word obtained by the fourth coding mode, < >>
Figure FDA0004176464760000088
Is composed of->
Figure FDA0004176464760000089
Encoding the resulting codeword by a fifth encoding scheme, wherein [ y ] 1 ,y 2 ,…,y N/2 ]For code word->
Figure FDA00041764647600000810
N/2 elements of (a)>
Figure FDA00041764647600000811
For code word->
Figure FDA00041764647600000812
At least one of the rest N/2 elements, the third coding mode and the fifth coding mode is a nonlinear coding mode;
a processor for performing channel decoding on the first signal to obtain K element code words
Figure FDA00041764647600000813
Wherein the code word->
Figure FDA00041764647600000814
For the code word->
Figure FDA00041764647600000815
Is the code word +.>
Figure FDA00041764647600000816
For the code word->
Figure FDA00041764647600000817
The rest K-B elements in the formula (I) are B, wherein B is an integer greater than 0 and less than K, N and K are positive integers, N>K, A is an integer greater than 1.
39. The communication device of claim 38, wherein the codeword is a codeword
Figure FDA00041764647600000818
Is part of the received information element.
40. A communication device as claimed in claim 38 or 39, characterized in that,
the code word before coding corresponding to the nonlinear coding mode is
Figure FDA00041764647600000819
The code word after the code word corresponding to the nonlinear coding mode is +.>
Figure FDA00041764647600000820
E>D, said nonlinear coding is such that said ++>
Figure FDA00041764647600000821
And said->
Figure FDA00041764647600000822
Satisfy (S)>
Figure FDA00041764647600000823
Figure FDA00041764647600000824
Figure FDA00041764647600000825
Wherein->
Figure FDA00041764647600000826
Representing modulo A addition, ++>
Figure FDA00041764647600000827
Is composed of->
Figure FDA00041764647600000828
The resulting codeword is encoded by the eighteenth encoding means,
Figure FDA00041764647600000829
is composed of->
Figure FDA00041764647600000830
The resulting codeword is encoded by the nineteenth encoding,
Figure FDA00041764647600000831
is composed of->
Figure FDA00041764647600000832
Encoded codeword by twentieth encoding scheme, [ h ] 1 ,h 2 ,…,h E/2 ]For the code word->
Figure FDA00041764647600000833
E/2 elements of (E),. About.>
Figure FDA00041764647600000834
For code word->
Figure FDA00041764647600000835
The remaining E/2 elements of said codeword +.>
Figure FDA00041764647600000836
For the code word->
Figure FDA00041764647600000837
Is said codeword +.>
Figure FDA00041764647600000838
For the code word->
Figure FDA00041764647600000839
Z is an integer greater than 0 and less than D, and A is an integer greater than 1.
41. The communication device of claim 38 or 39, wherein at least one of the third and fifth encoding schemes is a Delsarte-golthanals code or a Kerdock code.
42. A communication device, comprising:
a transceiver for receiving a first signal;
the first signal is generated by a second codeword of N elements, the second codeword is satisfied, N/2 elements of the second codeword are third codewords, the third codewords are obtained by a first portion of a first codeword through a first coding mode, the remaining N/2 elements of the second codeword are fourth codewords, the fourth codewords are the result of (a+b) mod a, wherein a represents a codeword obtained by a second portion of the first codeword through a second coding mode, b represents the third codeword, the first portion is M elements of the first codeword, the second portion is the remaining K-M elements of the first codeword except for the M elements, at least one of the first coding mode and the second coding mode is a nonlinear coding mode, and a is an integer greater than 1;
The processor is used for carrying out channel decoding on a fourth codeword in the second codeword of the N elements to obtain a first channel decoding result;
the processor is further configured to perform channel decoding on a third codeword in the second codewords of the N elements according to the first channel decoding result, to obtain a second channel decoding result;
the processor is further configured to obtain a first codeword with K elements according to the first channel decoding result and the second channel decoding result, where N and K are positive integers, and N > K.
43. The communication device of claim 42, wherein the first codeword is part of a received information element.
44. The communication device of claim 42 or 43,
the code word before coding corresponding to the nonlinear coding mode is
Figure FDA0004176464760000091
The code word after the code word corresponding to the nonlinear coding mode is +.>
Figure FDA0004176464760000092
E>D, said nonlinear coding is such that said ++>
Figure FDA0004176464760000093
And said->
Figure FDA0004176464760000094
Satisfy (S)>
Figure FDA0004176464760000095
Figure FDA0004176464760000096
Figure FDA0004176464760000097
Wherein->
Figure FDA0004176464760000098
Representing modulo A addition, ++>
Figure FDA0004176464760000099
Is composed of->
Figure FDA00041764647600000910
The resulting codeword is encoded by the eighteenth encoding means,
Figure FDA00041764647600000911
is composed of->
Figure FDA00041764647600000912
The resulting codeword is encoded by the nineteenth encoding,
Figure FDA00041764647600000913
is composed of->
Figure FDA00041764647600000914
Encoded codeword by twentieth encoding scheme, [ h ] 1 ,h 2 ,…,h E/2 ]For the code word->
Figure FDA00041764647600000915
E/2 elements of (E),. About.>
Figure FDA00041764647600000916
For code word->
Figure FDA00041764647600000917
Residual E-
2 elements, the code word
Figure FDA00041764647600000918
For the code word->
Figure FDA00041764647600000919
Is said codeword +.>
Figure FDA00041764647600000920
For the code word->
Figure FDA00041764647600000921
Z is an integer greater than 0 and less than D, and A is an integer greater than 1.
45. A communication device as defined in claim 42 or 43, wherein the first encoding scheme is a Delsarte-Goethane code and the second encoding scheme is a first order Reed-Muller code.
46. A computer readable storage medium, characterized in that the computer readable storage medium stores a computer program which, when executed by a computer, causes the computer to perform the method according to any one of claims 1-9.
47. A computer readable storage medium, characterized in that the computer readable storage medium stores a computer program which, when executed by a computer, causes the computer to perform the method according to any one of claims 10-23.
CN201910054822.0A 2019-01-21 2019-01-21 Signal transmitting and receiving method and device Active CN111464260B (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN201910054822.0A CN111464260B (en) 2019-01-21 2019-01-21 Signal transmitting and receiving method and device
PCT/CN2020/071532 WO2020151505A1 (en) 2019-01-21 2020-01-10 Signal sending and receiving methods and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910054822.0A CN111464260B (en) 2019-01-21 2019-01-21 Signal transmitting and receiving method and device

Publications (2)

Publication Number Publication Date
CN111464260A CN111464260A (en) 2020-07-28
CN111464260B true CN111464260B (en) 2023-07-11

Family

ID=71680718

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910054822.0A Active CN111464260B (en) 2019-01-21 2019-01-21 Signal transmitting and receiving method and device

Country Status (2)

Country Link
CN (1) CN111464260B (en)
WO (1) WO2020151505A1 (en)

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108964834A (en) * 2017-05-23 2018-12-07 华为技术有限公司 Data transmission method, chip, transceiver and computer readable storage medium

Family Cites Families (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102035626B (en) * 2009-09-30 2013-06-12 华为技术有限公司 Method and device for acquiring pre-coding matrix index
CN102208969B (en) * 2010-03-31 2013-08-28 华为技术有限公司 Retransmission method, retransmission apparatus and communication system
US8775490B2 (en) * 2011-02-04 2014-07-08 Alcatel Lucent Method and apparatus for compressive sensing with reduced compression complexity
CN102420617B (en) * 2011-11-14 2014-08-13 中兴通讯股份有限公司 Overlapped RM (Reed-Muller) code decoding method and system
CN104144027A (en) * 2013-05-07 2014-11-12 北京三星通信技术研究有限公司 Feedback method for channel state information
CN106330271B (en) * 2015-06-19 2019-11-26 中国移动通信集团公司 The nonopiate sending method of multi-antenna multi-user, base station, blind checking method, terminal
CN107124188B (en) * 2016-02-24 2020-08-07 华为技术有限公司 Encoding method, decoding method, encoding device and decoding device for polarization code
CN108781100B (en) * 2016-03-10 2021-06-22 华为技术有限公司 Transmission diversity method, equipment and system
CN107548094B (en) * 2016-06-23 2020-08-25 华为技术有限公司 Method for transmitting user sequence, network equipment and terminal equipment
CN108347322B (en) * 2017-01-25 2020-07-07 华为技术有限公司 Method and device for uplink transmission
CN108631792B (en) * 2017-03-24 2021-04-06 电信科学技术研究院 Method and device for encoding and decoding polarization code

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108964834A (en) * 2017-05-23 2018-12-07 华为技术有限公司 Data transmission method, chip, transceiver and computer readable storage medium

Also Published As

Publication number Publication date
CN111464260A (en) 2020-07-28
WO2020151505A1 (en) 2020-07-30

Similar Documents

Publication Publication Date Title
WO2016101089A1 (en) Polar code coding method and coding device
WO2016138632A1 (en) Uplink data transmission method and device
CN108242972B (en) Method and apparatus for non-orthogonal transmission of data
CN104541466B (en) The method and apparatus for the intertexture that inter-carrier interference in the wireless communication system being limited for phase noise suppresses
CA2968892A1 (en) Polar code rate matching method and apparatus, and wireless communications device
KR102031597B1 (en) Data transmission method, transmit end device and receive end device
CN106922213B (en) Method, device and equipment for transmitting information
EP3039834A1 (en) Method and apparatus for transmitting a signal with constant envelope
WO2017124844A1 (en) Method for determining transmission block size of polarisation code, and communication device
WO2016090587A1 (en) Data processing method, apparatus and device
AU2015338473A1 (en) Device
WO2019052581A1 (en) Coding method and coding apparatus for polar code
WO2020238566A1 (en) Coding modulation method, demodulation decoding method, apparatus, and device
WO2016082123A1 (en) Method for processing data, network node and terminal
WO2016049916A1 (en) Data communication method and related device and communication system
WO2017133407A1 (en) Signal transmission method and device
CN111464260B (en) Signal transmitting and receiving method and device
WO2016000197A1 (en) Decoding method and device
CN108631924B (en) Resource mapping method and device thereof
WO2018161946A1 (en) Data processing method and device
CN107566100B (en) Information sending and receiving method and equipment
CN106797567B (en) Data transmission method and related equipment
CN108574555B (en) Interference randomization method and device
CN110768922B (en) Data modulation method and device and computer storage medium
CN108631977A (en) A kind of sending method and sending device of broadcast message instruction

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant