WO2022178886A1 - Procédé et dispositif de mappage de mot de code - Google Patents

Procédé et dispositif de mappage de mot de code Download PDF

Info

Publication number
WO2022178886A1
WO2022178886A1 PCT/CN2021/078321 CN2021078321W WO2022178886A1 WO 2022178886 A1 WO2022178886 A1 WO 2022178886A1 CN 2021078321 W CN2021078321 W CN 2021078321W WO 2022178886 A1 WO2022178886 A1 WO 2022178886A1
Authority
WO
WIPO (PCT)
Prior art keywords
codeword
scma
user
resource block
mapping
Prior art date
Application number
PCT/CN2021/078321
Other languages
English (en)
Chinese (zh)
Inventor
韩昌浩
吴世娟
赵慧
余政
Original Assignee
华为技术有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 华为技术有限公司 filed Critical 华为技术有限公司
Priority to PCT/CN2021/078321 priority Critical patent/WO2022178886A1/fr
Priority to CN202180092540.5A priority patent/CN116848826A/zh
Publication of WO2022178886A1 publication Critical patent/WO2022178886A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00—Modulated-carrier systems
    • H04L27/26—Systems using multi-frequency codes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path

Definitions

  • the present application relates to the field of communications, and in particular, to a codeword mapping method and device.
  • Sparse code division multiple access has the characteristics of high shaping gain, support for high-order modulation and high-overload transmission.
  • Multi-ary channel coding technology is better than binary channel coding technology in decoding performance.
  • the communication system can be designed by combining the multi-ary channel coding technology and the SCMA technology.
  • the interleaving process is performed on the SCMA codeword set on the resource block of the even-numbered user in the constellation diagram, so that the multi-ary channel coding symbols ⁇ 00, 01, 10, 11 ⁇ and the SCMA codeword ⁇ -x
  • Figure 1 shows two different mapping relationships between multi-ary channel coding symbols and SCMA codewords.
  • the arrangement method two ⁇ 10,11,00,01 ⁇ moves the multi-level channel coding symbol 11 and the multi-level channel coding symbol 00 from the outside to the inside of the coordinate axis, and changes the power distribution method to make the energy distribution more fair.
  • the peak to average power ratio (PAPR) can be reduced.
  • mapping relationship is designed based on the codeword energy allocation, ignoring the influence of the mapping relationship selection on the decoding performance, and only the mapping relationship designed based on the codeword energy allocation may result in a decrease in bit error performance.
  • the embodiments of the present application provide a codeword mapping method and apparatus, which can improve the decoding performance and the fairness of energy allocation in a communication system jointly designed by the multi-ary channel coding technology and the SCMA technology.
  • a codeword mapping method includes: obtaining a first mapping relationship of at least one user on at least two resource blocks; determining a second mapping relationship of at least one user on at least two resource blocks; The peak-to-average power ratio corresponding to the second mapping relationship on the block determines the third mapping relationship of the at least one user on the at least two resource blocks.
  • the first mapping relationship of each user on each resource block consists of at least two corresponding relationships, each of which is a corresponding relationship between sparse code division multiple access SCMA codewords and multi-ary channel coding symbols.
  • the second mapping relationship of each user on each resource block consists of at least one corresponding relationship, and the at least one corresponding relationship is the corresponding relationship with the smallest corresponding criterion value among the at least two corresponding relationships.
  • the criterion value is used to measure whether the SCMA codeword is Incorrect decoding and the possibility of incorrect decoding of multi-binary channel coded symbols.
  • the third mapping relationship of each user on each resource block is a corresponding relationship, a corresponding relationship is one of at least one corresponding relationship, and the peak-to-average power ratio is the energy of the SCMA codeword superimposed on at least two resource blocks. Peak-to-average power ratio.
  • a first mapping relationship of at least one user on at least two resource blocks is obtained, and the first mapping relationship of each user on each resource block is composed of at least two corresponding relationships , and each correspondence is the correspondence between sparse code division multiple access SCMA codewords and multi-ary channel coding symbols. Then, determine the second mapping relationship of the at least one user on the at least two resource blocks. Since the second mapping relationship is the one with the smallest corresponding criterion value among the at least two correspondences included in the first mapping relationship, the criterion value is It is used to measure the possibility that the SCMA codeword is decoded incorrectly and the multi-level channel coded symbol is incorrectly decoded.
  • the mapping relationship is determined based on the bit error performance, which can reduce the bit error rate and improve the bit error performance.
  • the peak-to-average power ratio of each user after the codeword energy on at least two resource blocks is superimposed is further determined, and the corresponding relationship is selected according to the peak-to-average power ratio, so that the power between the codewords can be guaranteed. fairness of distribution.
  • the multi-level channel coding symbol may include a first multi-level channel coding symbol and a second multi-level channel coding symbol
  • the SCMA codeword may include the first SCMA codeword and the second SCMA code Character.
  • the criterion value may be determined according to the Hamming distance and the Euclidean distance, and the Hamming distance is the number of bits with different values in the corresponding bits between the first multi-ary channel coding symbol and the second multi-ary channel coding symbol,
  • the Euclidean distance is the geometrical distance in Euclidean space between the first SCMA codeword and the second SCMA codeword.
  • the first multi-level channel coding symbol corresponds to the first SCMA codeword
  • the second multi-level channel coding symbol corresponds to the second SCMA codeword
  • the first SCMA codeword is the codeword currently to be decoded
  • the second SCMA codeword Different from the first SCMA codeword.
  • bit error performance of the corresponding relationship can be obtained according to the criterion value, and the corresponding relationship that optimizes the bit error performance can be selected, thereby reducing the bit error rate.
  • the criterion value may include traversing and stacking the product of at least one Hamming distance and at least one corresponding metric criterion, where the metric criterion is determined according to the Euclidean distance.
  • At least two resource blocks may include a first resource block and a second resource block, and at least one user may include the first user.
  • the above-mentioned determining the third mapping relationship of the at least one user on the at least two resource blocks according to the peak-to-average power ratio corresponding to the second mapping relationship of the at least one user on the at least two resource blocks may include: The second mapping relationship on a resource block and the second mapping relationship of the first user on the second resource block, obtain the peak-to-average power ratio, and map the second mapping relationship on the first resource block corresponding to the first peak-to-average power ratio The relationship and the second mapping relationship on the second resource block are respectively determined as the third mapping relationship of the first user on the first resource block and the third mapping relationship of the first user on the second resource block.
  • the peak-to-average power ratio may include at least two peak-to-average power ratios, and the minimum value of the at least two peak-to-average power ratios is the first peak-to-average power ratio.
  • the bit error performance of the corresponding relationship can be obtained, thereby The corresponding relationship can be selected according to the bit error performance, which can improve the bit error performance.
  • the first aspect provides a codeword mapping method, which may further include: obtaining a basic SCMA codeword set according to a first Euclidean criterion, and obtaining a basic SCMA codeword set according to the basic SCMA codeword set and the second Euclidean criterion A collection of dimensional SCMA codewords.
  • the first Euclidean criterion may include maximizing the minimum Euclidean distance between SCMA codewords of one user on one resource block
  • the basic SCMA codeword set may include SCMA codewords of one user on one resource block
  • one-dimensional SCMA codewords The set of codewords may include SCMA codewords of at least one user on one resource block
  • the second Euclidean criterion may include a minimum Euclidean distance sum maximization between SCMA codewords of at least two users on one resource block.
  • the minimum Euclidean distance is maximized between the SCMA codewords in the obtained basic SCMA codeword set, and the minimum Euclidean distance and maximization between the SCMA codewords of at least two users on one resource block can reduce bit errors rate to further improve bit error performance.
  • the first Euclidean criterion can satisfy the following relation:
  • r 1 represents the value of the SCMA codeword with the smallest modulus value in the basic SCMA codeword set, represents the value of the SCMA codeword with the smallest modulus value in the basic SCMA codeword set obtained by the first Euclidean criterion
  • Represents SCMA codeword a multiple of the SCMA codeword r 1 represents the multiple between SCMA codeword r2 and SCMA codeword r1 obtained by the first Euclidean criterion
  • a multiple of the SCMA codeword r 1 , i 1 can range from 1 to Integer between , i 2 can range from 1 to An integer between, M 2 represents the modulation order of the SCMA codeword.
  • the minimum Euclidean distance is maximized between the SCMA codewords in the basic SCMA codeword set obtained according to the first Euclidean criterion
  • the second Euclidean criterion can satisfy the following relation:
  • ⁇ 1 * represents the angle between the SCMA codeword set of the user whose sequence number is 1 and the basic SCMA codeword set obtained by the second Euclidean criterion
  • ⁇ 1 represents the SCMA codeword set of the user whose sequence number is 1 and the basic SCMA codeword set initial angle between sets of codewords
  • j represents the imaginary part of the complex number
  • m 1 1,2,...,M 2
  • d f represents the number of users superimposed on a resource block
  • the minimum Euclidean distance sum between the SCMA codewords of at least two users on one resource block can be maximized, the bit error rate can be reduced, and the bit error performance can be further improved.
  • the metric can satisfy the following relationship:
  • m 1 represents the sequence number of the first SCMA codeword
  • k represents the serial number of the resource block
  • u represents the serial number of the user
  • x u,k (m 1 ) represents the code word with the serial number m 1 of the user u on the resource block k
  • the sequence number of user u on resource block k is The codeword of , the operator symbol
  • the criterion value can satisfy the following relationship:
  • E mapping is the criterion value
  • M 2 represents the modulation order of the SCMA codeword
  • m 1 is the sequence number of the first SCMA codeword
  • c 1 is the first multi-ary channel coding symbol
  • Code symbols for the second multi-ary channel the corresponding relationship can be determined according to the criterion value, for example, the corresponding relationship with the smallest criterion value can be selected, so that the corresponding relationship that optimizes the bit error performance can be obtained, the bit error rate can be reduced, and the bit error performance can be improved.
  • the peak-to-average power ratio can satisfy the following relationship:
  • PAPR is the peak-to-average power ratio
  • M 2 represents the modulation order of the SCMA codeword
  • Z represents the number of resource blocks occupied by a single user
  • a zm represents the modulus value of the SCMA codeword.
  • a codeword mapping apparatus in a second aspect, includes: a mapping module and a processing module.
  • the mapping module is configured to obtain the first mapping relationship of at least one user on at least two resource blocks.
  • the processing module is configured to determine the second mapping relationship of the at least one user on the at least two resource blocks.
  • the processing module is further configured to determine the third mapping relationship of the at least one user on the at least two resource blocks according to the peak-to-average power ratio corresponding to the second mapping relationship of the at least one user on the at least two resource blocks.
  • the first mapping relationship of each user on each resource block consists of at least two corresponding relationships, each of which is a corresponding relationship between sparse code division multiple access SCMA codewords and multi-ary channel coding symbols.
  • the second mapping relationship of each user on each resource block consists of at least one corresponding relationship, and the at least one corresponding relationship is the corresponding relationship with the smallest corresponding criterion value among the at least two corresponding relationships.
  • the criterion value is used to measure whether the SCMA codeword is Incorrect decoding and the possibility of incorrect decoding of multi-binary channel coded symbols.
  • the third mapping relationship of each user on each resource block is a corresponding relationship, a corresponding relationship is one of at least one corresponding relationship, and the peak-to-average power ratio is the energy of the SCMA codeword superimposed on at least two resource blocks. Peak-to-average power ratio.
  • the multi-level channel coding symbol may include a first multi-level channel coding symbol and a second multi-level channel coding symbol
  • the SCMA codeword may include the first SCMA codeword and the second SCMA code Character.
  • the criterion value may be determined according to the Hamming distance and the Euclidean distance, and the Hamming distance is the number of bits with different values in the corresponding bits between the first multi-ary channel coding symbol and the second multi-ary channel coding symbol,
  • the Euclidean distance is the geometrical distance in Euclidean space between the first SCMA codeword and the second SCMA codeword.
  • the first multi-level channel coding symbol corresponds to the first SCMA codeword
  • the second multi-level channel coding symbol corresponds to the second SCMA codeword
  • the first SCMA codeword is the codeword currently to be decoded
  • the second SCMA codeword Different from the first SCMA codeword.
  • the criterion value may include traversing and stacking the product of at least one Hamming distance and at least one corresponding metric criterion, and the metric criterion is determined according to the Euclidean distance.
  • At least two resource blocks may include a first resource block and a second resource block, and at least one user may include the first user.
  • the processing module is further configured to obtain the peak-to-average power ratio according to the second mapping relationship of the first user on the first resource block and the second mapping relationship of the first user on the second resource block.
  • the peak-to-average power ratio may include at least two peak-to-average power ratios, and the minimum value of the at least two peak-to-average power ratios is the first peak-to-average power ratio.
  • the processing module is further configured to respectively determine the second mapping relationship on the first resource block and the second mapping relationship on the second resource block corresponding to the first peak-to-average power ratio as the first user on the first resource block. and the third mapping relationship of the first user on the second resource block.
  • the mapping module is further configured to obtain the basic SCMA codeword set according to the first Euclidean criterion.
  • the first Euclidean criterion may include maximizing the minimum Euclidean distance between SCMA codewords of one user on one resource block, and the basic SCMA codeword set may include SCMA codewords of one user on one resource block.
  • the mapping module is further configured to obtain a one-dimensional SCMA codeword set according to the basic SCMA codeword set and the second Euclidean criterion.
  • the one-dimensional SCMA codeword set may include SCMA codewords of at least one user on one resource block
  • the second Euclidean criterion may include the minimum Euclidean distance and the maximum distance between the SCMA codewords of at least two users on one resource block. change.
  • the first Euclidean criterion can satisfy the following relation:
  • r 1 represents the value of the SCMA codeword with the smallest modulus value in the basic SCMA codeword set, represents the value of the SCMA codeword with the smallest modulus value in the basic SCMA codeword set obtained by the first Euclidean criterion
  • Represents SCMA codeword a multiple of the SCMA codeword r 1 represents the multiple between SCMA codeword r2 and SCMA codeword r1 obtained by the first Euclidean criterion
  • a multiple of the SCMA codeword r 1 , i 1 can range from 1 to Integer between , i 2 can range from 1 to An integer between, M 2 represents the modulation order of the SCMA codeword.
  • the second Euclidean criterion can satisfy the following relation:
  • ⁇ 1 * represents the angle between the SCMA codeword set of the user whose sequence number is 1 and the basic SCMA codeword set obtained by the second Euclidean criterion
  • ⁇ 1 represents the SCMA codeword set of the user whose sequence number is 1 and the basic SCMA codeword set initial angle between sets of codewords
  • j represents the imaginary part of the complex number
  • m 1 1,2,...,M 2
  • d f represents the number of users superimposed on a resource block
  • d f represents the number of users superimposed on a resource block
  • represents the modulo.
  • the metric can satisfy the following relationship:
  • m 1 represents the sequence number of the first SCMA codeword
  • k represents the serial number of the resource block
  • u represents the serial number of the user
  • x u,k (m 1 ) represents the code word with the serial number m 1 of the user u on the resource block k
  • the sequence number of user u on resource block k is The codeword of , the operator symbol
  • means modulo.
  • the criterion value can satisfy the following relationship:
  • E mapping is the criterion value
  • M 2 represents the modulation order of the SCMA codeword
  • m 1 is the sequence number of the first SCMA codeword
  • m 2 is the sequence number of the second SCMA codeword
  • c 1 is the first multi-ary channel coding symbol
  • Code symbols for the second multi-ary channel
  • the peak-to-average power ratio can satisfy the following relationship:
  • PAPR is the peak-to-average power ratio
  • M 2 represents the modulation order of the SCMA codeword
  • Z represents the number of resource blocks occupied by a single user
  • a zm represents the modulus value of the SCMA codeword.
  • mapping module and the processing module may be set separately, or may be integrated in one module, that is, the processing module.
  • the present application does not specifically limit the specific implementation manners of the mapping module and the processing module.
  • the codeword mapping apparatus described in the second aspect may further include a transceiver module.
  • the transceiver module is used to receive data and/or signaling sent by other devices, and may also be used to send data and/or signaling to other devices.
  • the transceiver module may include a receiving module and a sending module.
  • the receiving module is used to receive data and/or signaling sent by other devices
  • the sending module is used to send data and/or signaling to other devices. This application does not specifically limit the specific implementation manner of the transceiver module.
  • the codeword mapping apparatus described in the second aspect may further include a storage module, where the storage module stores programs or instructions.
  • the processing module executes the program or the instruction
  • the codeword mapping apparatus described in the second aspect can execute the codeword mapping method described in the first aspect.
  • the codeword mapping apparatus described in the second aspect may be a terminal device, or may be a chip (system) or other components or components that can be provided in the terminal device, which is not limited in this application.
  • a codeword mapping apparatus in a third aspect, includes a processor coupled to a memory for storing a computer program.
  • the processor is configured to execute the computer program stored in the memory, so that the codeword mapping apparatus executes the codeword mapping method described in any possible implementation manner of the first aspect.
  • the codeword mapping apparatus described in the third aspect may further include a transceiver.
  • the transceiver may be a transceiver circuit or an input/output port.
  • the transceiver may be used for the codeword mapping apparatus to communicate with other devices.
  • the codeword mapping apparatus described in the third aspect may be a terminal device, or a chip or a chip system provided inside the terminal device.
  • a chip system in a fourth aspect, includes a processor and an input/output port, the processor is used to implement the processing functions involved in the first aspect, and the input/output port is used to implement the first aspect The transceiver functions involved.
  • the chip system further includes a memory for storing program instructions and data for implementing the functions involved in the first aspect.
  • the chip system may be composed of chips, or may include chips and other discrete devices.
  • a computer-readable storage medium comprising: a computer program or instruction; when the computer program or instruction is run on a computer, the computer is made to execute any one of the possible implementations described in the first aspect Codeword mapping method.
  • a computer program product comprising a computer program or an instruction, which, when the computer program or instruction is run on a computer, causes the computer to execute the codeword mapping described in any possible implementation manner in the first aspect method.
  • 1 is a schematic diagram of the mapping relationship between a multi-ary channel coding symbol and an SCMA codeword provided by an embodiment of the present application;
  • FIG. 2 is a schematic structural diagram of a codeword mapping apparatus provided by an embodiment of the present application.
  • FIG. 3 is a schematic flowchart of a codeword mapping method provided by an embodiment of the present application.
  • FIG. 4 is a schematic diagram of Polar code encoding provided by an embodiment of the present application.
  • FIG. 5 is a schematic structural diagram of another codeword mapping apparatus provided by an embodiment of the present application.
  • the technical solutions of the embodiments of the present application can be applied to various communication systems, such as a wireless fidelity (WiFi) system, a vehicle-to-everything (V2X) communication system, a device-to-device (device-to-device, D2D) communication system, Internet of Vehicles communication system, 4th generation (4G) mobile communication system, such as long term evolution (LTE) system, worldwide interoperability for microwave access (WiMAX) communication systems, 5th generation (5G) mobile communication systems, such as new radio (NR) systems, and future communication systems, such as 6th generation (6G) mobile communication systems.
  • 4G mobile communication system such as long term evolution (LTE) system
  • WiMAX worldwide interoperability for microwave access
  • 5G 5th generation
  • NR new radio
  • 6G 6th generation
  • the codeword mapping method provided in the embodiment of the present application can be applied to a terminal device, where the terminal device is a terminal with a wireless transceiver function or a chip or a chip system that can be provided in the terminal.
  • the terminal equipment may also be referred to as user equipment, access terminal, subscriber unit, subscriber station, mobile station, mobile station, remote station, remote terminal, mobile device, user terminal, terminal, wireless communication device, user agent, or user equipment.
  • the terminal device in the embodiment of the present application may be a mobile phone (mobile phone), a tablet computer (Pad), a computer with a wireless transceiver function, a virtual reality (virtual reality, VR) terminal device, an augmented reality (augmented reality, AR) terminal equipment, wireless terminals in industrial control, wireless terminals in self driving, wireless terminals in remote medical, wireless terminals in smart grid, transportation security ( Wireless terminals in transportation safety), wireless terminals in smart cities, wireless terminals in smart homes, vehicle-mounted terminals, RSUs with terminal functions, etc.
  • the terminal device of the present application may also be an on-board module, on-board module, on-board component, on-board chip or on-board unit built into the vehicle as one or more components or units.
  • the on-board component, on-board chip or on-board unit may implement the codeword mapping method provided in this application.
  • FIG. 2 is a schematic structural diagram of a codeword mapping apparatus 200 that can be used to execute the codeword mapping method provided by the embodiment of the present application.
  • the codeword mapping apparatus 200 may be a terminal device, or may be a chip applied in the terminal device or other components with terminal functions.
  • the codeword mapping apparatus 200 may include a processor 201 and a memory 202 .
  • the codeword mapping apparatus 200 may further include a transceiver 203 .
  • the processor 201 is coupled with the memory 202 and the transceiver 203, such as can be connected through a communication bus.
  • the processor 201 is the control center of the codeword mapping apparatus 200, and may be a processor or a general term for multiple processing elements.
  • the processor 201 is one or more central processing units (central processing units, CPUs), may also be specific integrated circuits (application specific integrated circuits, ASICs), or is configured to implement one or more of the embodiments of the present application
  • An integrated circuit such as: one or more microprocessors (digital signal processor, DSP), or, one or more field programmable gate array (field programmable gate array, FPGA).
  • the processor 201 can execute various functions of the codeword mapping apparatus 200 by running or executing software programs stored in the memory 202 and calling data stored in the memory 202 .
  • the processor 201 may include one or more CPUs, such as CPU0 and CPU1 shown in FIG. 2 .
  • the codeword mapping apparatus 200 may also include multiple processors, for example, the processor 201 and the processor 204 shown in FIG. 2 .
  • processors can be a single-core processor (single-CPU) or a multi-core processor (multi-CPU).
  • a processor herein may refer to one or more communication devices, circuits, and/or processing cores for processing data (eg, computer program instructions).
  • the memory 202 may be read-only memory (ROM) or other type of static storage communication device that can store static information and instructions, random access memory (RAM) or other type of static storage communication device that can store information and instructions.
  • Type of dynamic storage communication device it can also be electrically erasable programmable read-only memory (electrically erasable programmable read-only memory, EEPROM), compact disc read-only memory (CD-ROM) or other optical disk storage, Optical disc storage (including compact discs, laser discs, optical discs, digital versatile discs, Blu-ray discs, etc.), magnetic disk storage media or other magnetic storage communication devices, or capable of carrying or storing desired program code in the form of instructions or data structures and Any other medium that can be accessed by a computer, but is not limited to this.
  • the memory 202 can exist independently, or can be integrated with the processor 201 .
  • the memory 202 is used for storing the software program for executing the solution of the present application, and the execution is controlled by the processor 201 .
  • the processor 201 controls the execution of the software program for executing the solution of the present application.
  • the transceiver 203 is used for communication with other codeword mapping apparatuses. Of course, the transceiver 203 may also be used to communicate with a communication network. Transceiver 203 may include a receiver to implement a receive function, and a transmitter to implement a transmit function.
  • codeword mapping apparatus 200 shown in FIG. 2 does not constitute a limitation on the codeword mapping apparatus, and the actual codeword mapping apparatus may include more or less components than those shown in the figure, or Combining certain components, or different component arrangements.
  • FIG. 3 is a schematic flowchart of a codeword mapping method provided by an embodiment of the present application.
  • the codeword mapping method includes the following steps:
  • S301 Obtain a first mapping relationship of at least one user on at least two resource blocks.
  • the first mapping relationship of each user on each resource block consists of at least two corresponding relationships. That is, the first mapping relationship may include at least two corresponding relationships.
  • each correspondence is a correspondence between sparse code division multiple access SCMA codewords and multi-ary channel coding symbols.
  • the corresponding relationship between SCMA codewords and multi-ary channel coding symbols can be designed for each SCMA codeword set in the factor matrix, and the factor matrix can include the SCMA codeword set of at least one user on at least two resource blocks .
  • the codeword mapping method provided by the embodiment of the present application may further include: obtaining a multi-ary channel coding symbol.
  • the multi-ary channel coding symbols may be obtained.
  • the Polar code is encoded by the multi-system method, and the calculation field is GF(M 1 ), where M 1 represents the channel coding system number, and the coding kernel of the Polar code can satisfy the following: Formula 1).
  • G' represents the coding kernel of the Polar code, where ⁇ is an integer less than or equal to M 1 -1, ⁇ is an integer less than or equal to M 1 -1, and M 1 represents the channel coding progress. system number.
  • the encoding process may satisfy the following formula (2).
  • n c N/log 2
  • M 1 represents the number of symbols after converting binary channel coding symbols into multi-ary channel coding symbols
  • N represents the number of binary channel coding symbols
  • M 1 represents channel coding the base number
  • mathematical symbols represents the Kronecker product.
  • obtaining the multi-ary channel coding symbol above may include: designing a binary channel coding symbol with a code length of n c *log 2 M 1 Convert binary channel-coded symbols to multi-binary channel-coded symbols with the number of symbols n c Encodes multi-binary channel coded symbols.
  • FIG. 4 is a schematic diagram of encoding a quaternary Polar code with four symbols.
  • u 1 , . . . , u 4 is the source sequence, which represents the Polar code input before encoding.
  • x 1 ,...,x 4 represent coding sequences.
  • c 1 ,...,c 4 is the output sequence, representing the Polar code obtained after encoding.
  • W 2 represents the channel obtained by combining two channels W
  • W 4 represents the channel obtained by combining two channels W 2
  • the codeword mapping method provided by the embodiment of the present application may further include: obtaining an SCMA codeword set.
  • the SCMA codeword set may be obtained before the above S301.
  • the embodiment of the present application does not limit the sequence of obtaining the multi-ary channel coding symbol and obtaining the SCMA codeword set.
  • obtaining the SCMA codeword set above may include the following steps 1 to 2.
  • Step 1 obtain a basic SCMA codeword set according to the first Euclidean criterion.
  • the first Euclidean criterion may include maximizing the minimum Euclidean distance between SCMA codewords of a user on a resource block. In this way, the minimum Euclidean distance maximization is satisfied between the SCMA codewords in the obtained basic SCMA codeword set.
  • the base SCMA codeword set may include one user's SCMA codeword on one resource block.
  • SCMA codewords of d f users on one resource block constitute a complex number set Sk,u .
  • d f means superimposed on a resource block the number of users.
  • the complex number set S k,u includes ⁇ S k,0 ,S k,1 ,...,S k,df-1 ⁇ , and each subset includes M 2 SCMA codewords.
  • Sk,0 may be referred to as a basic SCMA codeword set, and the elements included in the basic SCMA codeword set may be real numbers.
  • the basic SCMA codeword set can be of the form: in, is the SCMA codeword in the base SCMA codeword set.
  • the codeword mapping method provided by the embodiment of the present application may further include: rotating the basic SCMA codeword set Sk,0 to obtain other SCMA codeword sets on the resource block where the basic SCMA codeword set is located.
  • the set of sub-SCMA codewords other than the base SCMA codeword set in the complex number set Sk,u may be referred to as the first SCMA codeword set.
  • the first set of SCMA codewords includes SCMA codewords for one user on one resource block.
  • the first SCMA codeword set may satisfy the following formula (3).
  • Sk, u+1 represents the first SCMA codeword set
  • u represents the serial number of the user
  • u 0, 1, . . . d f -1
  • d f represents on a resource block
  • j represents the imaginary part of the complex number
  • ⁇ u represents the angle between the SCMA codeword set of user u on resource block k and the base SCMA codeword set.
  • ⁇ u can be called the rotation angle.
  • the basic SCMA codeword set obtained according to the first Euclidean criterion may satisfy the following formula (4).
  • ⁇ basic is the first Euclidean criterion
  • S k,0 can be optimized according to the first Euclidean criterion to obtain thereby The minimum Euclidean distance is maximized between the SCMA codewords in .
  • the first Euclidean criterion may satisfy the following formula (5).
  • r 1 represents the value of the SCMA codeword with the smallest modulus value in the basic SCMA codeword set, represents the value of the SCMA codeword with the smallest modulus value in the basic SCMA codeword set obtained by the first Euclidean criterion
  • Represents SCMA codeword a multiple of the SCMA codeword r 1 represents the multiple between SCMA codeword r2 and SCMA codeword r1 obtained by the first Euclidean criterion
  • a multiple of the SCMA codeword r 1 , i 1 can range from 1 to Integer between , i 2 can range from 1 to An integer between, M 2 represents the modulation order of the SCMA codeword.
  • the relationship between the SCMA codewords in the SCMA codeword set satisfies the following formula (6).
  • the value of i ranges from 1 to An integer between , and ⁇ i is a multiple representing the SCMA codeword r i+1 and the SCMA codeword r 1 .
  • the average signal energy of each user on each resource block is 1, which can specifically satisfy the following formula (7), so as to ensure fairness and convenience in practical applications.
  • P avg is the average signal energy
  • r i is the SCMA codeword
  • M 2 represents the modulation order of the SCMA codeword.
  • Step 2 Obtain a one-dimensional SCMA codeword set according to the basic SCMA codeword set and the second Euclidean criterion.
  • the one-dimensional SCMA codeword set may include SCMA codewords of at least one user on one resource block.
  • the obtained one-dimensional SCMA codeword set may include SCMA codewords of 2 users on resource block 1.
  • the obtained one-dimensional SCMA codeword set for resource block 2 may include SCMA codewords of 2 users on resource block 2.
  • the obtained one-dimensional SCMA codeword set of resource block 3 may include SCMA codewords of 2 users on resource block 3 .
  • the obtained one-dimensional SCMA codeword set of resource block 4 may include SCMA codewords of two users on resource block 4.
  • the second Euclidean criterion may include a minimum Euclidean distance sum maximization between SCMA codewords of at least two users on one resource block.
  • the SCMA codewords of the three users on the resource block 1 can be optimized according to the second Euclidean criterion, Maximize the minimum sum of Euclidean distances satisfied between the SCMA codewords of the 3 users on resource block 1.
  • the SCMA codewords for 3 users on resource block 2, the SCMA codewords for 3 users on resource block 3, and the SCMA codewords for 3 users on resource block 4 can be optimized according to the second Euclidean criterion , and will not be repeated here.
  • the second step above may include: optimizing the rotation angle according to the basic SCMA codeword set and the second Euclidean criterion, and the optimized rotation angle may satisfy the following formula (8).
  • ⁇ 1 * represents the angle between the SCMA codeword set of the user whose sequence number is 1 obtained by the second Euclidean criterion and the basic SCMA codeword set, represents the angle between the SCMA codeword set of the user whose sequence number is d f -1 obtained by the second Euclidean criterion and the basic SCMA codeword set, ⁇ 1 represents the SCMA codeword set of the user whose sequence number is 1 and the basic SCMA codeword the initial angle between sets, represents the initial angle between the SCMA codeword set of the user whose serial number is d f -1 and the basic SCMA codeword set, and ⁇ mother represents the second Euclidean criterion.
  • the above-mentioned step 2 may further include: obtaining a one-dimensional SCMA codeword set according to the angle between the SCMA codeword set of the user whose serial number is u obtained through the second Euclidean criterion and the basic SCMA codeword set.
  • the second Euclidean criterion may satisfy the following formula (9).
  • ⁇ 1 * represents the angle between the SCMA codeword set of the user whose sequence number is 1 obtained by the second Euclidean criterion and the basic SCMA codeword set
  • ⁇ 1 represents the SCMA codeword set of the user whose sequence number is 1 the initial angle between the set of codewords and the set of underlying SCMA codewords
  • j represents the imaginary part of the complex number
  • m 1 1,2,...,M 2
  • d f represents the number of users superimposed on a resource block
  • ⁇ u may be referred to as the rotation angle.
  • the codeword mapping method provided in the embodiment of the present application may further include: dividing the one-dimensional SCMA codeword set to at least one user on one resource block, and obtaining the basic SCMA codeword set on the one resource block except for the Set of SCMA codewords other than .
  • the one-dimensional SCMA codeword set is divided into d f -1 users superimposed on the resource blocks corresponding to the one-dimensional SCMA codeword set, and a complex number set can be obtained.
  • set of complex numbers include
  • the basic SCMA codeword set obtained by the method is
  • the one-dimensional SCMA codeword set obtained according to the above step 2 includes: in,
  • the representation of the factor matrix F is as follows:
  • the set of codewords obtained in the above steps 1 and 2 may be as shown in Table 1 above.
  • the obtained SCMA codebook can be expressed in the form of a factor matrix F.
  • obtaining the SCMA codeword set above may include: obtaining an SCMA codebook based on a Cartesian product-based codebook design method.
  • the set of SCMA codewords for 4-QAM is used to generate the set of mother SCMA codewords.
  • two K-dimensional SCMA codeword sets (also called constellation diagrams) are subjected to phase rotation respectively, and then the Cartesian product of the two rotated 4-QAM SCMA codeword sets is performed to obtain the mother SCMA code Word set, based on the mother SCMA codeword set and the mapping matrix to obtain the SCMA codebook.
  • mapping matrix F' can satisfy the following relationship:
  • the SCMA codebook obtained by the codebook design method based on the Cartesian product can be As shown in Table 2 above.
  • S302 Determine a second mapping relationship of at least one user on at least two resource blocks.
  • the second mapping relationship of each user on each resource block consists of at least one corresponding relationship. That is, the second mapping relationship may include one or more corresponding relationships.
  • the at least one correspondence is the correspondence with the smallest corresponding criterion value among the at least two correspondences. That is to say, the second mapping relationship is the corresponding relationship with the smallest corresponding criterion value among the at least two corresponding relationships included in the first mapping relationship.
  • the criterion value is used to measure the probability of incorrect decoding of SCMA codewords and incorrect decoding of multi-binary channel coded symbols.
  • the mapping relationship is determined based on the bit error performance, and the corresponding relationship with the smallest criterion value can be selected, so that the corresponding relationship that optimizes the bit error performance can be obtained, the bit error rate can be reduced, and the bit error performance can be improved.
  • the criterion value may be used to select the mapping relationship for each SCMA codeword set in the factor matrix F.
  • the SCMA codeword set S 1,0 in the factor matrix F takes the SCMA codeword set S 1,0 in the factor matrix F as an example.
  • the first mapping relationship includes 24 correspondences, of which the criterion value of 8 correspondences is -48, the criterion value of 8 correspondences is -44.8, and the criterion value of the other 8 correspondences is -35.2.
  • the criterion value-48 is the smallest among the criterion value-48, criterion value-44.8 and criterion value-35.2, so it is determined that the second mapping relationship of the SCMA codeword set S 1,0 includes 8 correspondences corresponding to criterion value-48.
  • a similar method can be used to obtain the second mapping relationship of other SCMA codeword sets (eg S 3,2 ) in the factor matrix F. It is assumed that the obtained second mapping relationship of the SCMA codeword set S 3,2 also includes 8 corresponding relationships.
  • the multi-ary channel coded symbols may include first and second multi-ary channel coded symbols.
  • the multi-ary channel coded symbol may include a plurality of multi-ary coded symbols, and the plurality of multi-ary coded symbols include a first multi-ary channel coded symbol and a second multi-ary channel coded symbol.
  • the SCMA codeword may include a first SCMA codeword and a second SCMA codeword.
  • the SCMA codeword may include a plurality of SCMA codewords including a first SCMA codeword and a second SCMA codeword.
  • the first multi-level channel coding symbol corresponds to the first SCMA code word
  • the second multi-level channel coding symbol corresponds to the second SCMA code word
  • the first SCMA code word is the code word to be decoded currently
  • the second The SCMA codeword is different from the first SCMA codeword.
  • the criterion value may be determined according to the Hamming distance and the Euclidean distance.
  • the Hamming distance is the number of bits with different values among the corresponding bits between the first multi-ary channel coding symbol and the second multi-ary channel coding symbol.
  • the Euclidean distance is the Euclidean spatial geometric distance between the first SCMA codeword and the second SCMA codeword.
  • the bit error performance of the corresponding relationship can be obtained by selecting The corresponding relationship to optimize the bit error performance, thereby reducing the bit error rate.
  • the criterion value includes traversing the product of at least one Hamming distance and at least one corresponding metric criterion, and the metric criterion may be determined according to the Euclidean distance.
  • the metric can satisfy the following relationship in the following formula (12).
  • m 1 represents the sequence number of the first SCMA codeword
  • k represents the serial number of the resource block
  • u represents the serial number of the user
  • x u,k (m 1 ) represents the code word with the serial number m 1 of the user u on the resource block k
  • the sequence number of user u on resource block k is The codeword of , the operator symbol
  • means modulo.
  • the criterion value may satisfy the following formula (13).
  • E mapping is the criterion value
  • M 2 represents the modulation order of the SCMA codeword
  • m 1 is the serial number of the first SCMA codeword
  • m 2 is the sequence number of the second SCMA codeword
  • c 1 is the first multi-ary channel coding symbol
  • Code symbols for the second multi-ary channel
  • the metric can be obtained based on the Max-log MPA decoding algorithm.
  • Max-Log MPA algorithm does not need exponential operation to calculate absolute probability value in the process of calculating conditional probability.
  • the Max-log MPA decoding algorithm is approximated by the Jacobian formula, and obtaining the Max-Log MPA algorithm includes initializing the user data prior probability and calculating the conditional probability.
  • the prior probability may satisfy the following formula (14).
  • m 1 represents the sequence number of the SCMA codeword of user 1 on resource block k
  • m 1 1,2,...M 2
  • m 2 represents the sequence number of the SCMA codeword of user 2 on resource block k
  • m 2 1,2,...M 2
  • m 3 represents the sequence number of the SCMA codeword of user 3 on resource block k
  • m 3 1,2,...M 2
  • h k,j represents the channel coefficient of user j on resource block k
  • x j,k represents the SCMA codeword of user j on resource block k
  • y k represents the received signal on resource block k at the receiver
  • n k represents Received noise on resource block k.
  • the initialization information in the above formula (14) will affect the final SCMA codeword decision result of the user.
  • the order of x 1,k (m 1 ) of SCMA codewords will affect the confidence information size relationship of each SCMA codeword, thereby affecting the probability that different SCMA codewords are erroneously judged as other codewords.
  • the order of x 1,k (m 1 ) of the SCMA codeword will affect the correspondence between the M 2 -order SCMA codeword and log(M 2 )/log(M 1 ) M 1 -ary channel coding symbols. Affects the Hamming distance between log(M 2 )/log(M 1 ) M 1 -ary channel coding symbols, thereby affecting the final bit error rate.
  • S303 Determine a third mapping relationship of the at least one user on the at least two resource blocks according to the peak-to-average power ratio corresponding to the second mapping relationship of the at least one user on the at least two resource blocks.
  • the third mapping relationship of each user on each resource block is one corresponding relationship, and one corresponding relationship is one of at least one corresponding relationship. That is, the third mapping relationship is one of the at least one corresponding relationship included in the second mapping relationship.
  • the peak-to-average power ratio is the peak-to-average power ratio after the energy of the SCMA codeword is superimposed on at least two resource blocks.
  • the at least two resource blocks include a first resource block and a second resource block, and the at least one user includes the first user.
  • the above S303 may include the following steps 3 to 4.
  • Step 3 Obtain the peak-to-average power ratio according to the second mapping relationship of the first user on the first resource block and the second mapping relationship of the first user on the second resource block.
  • the peak-to-average power ratio may include at least two peak-to-average power ratios, and the minimum value of the at least two peak-to-average power ratios is the first peak-to-average power ratio.
  • Step 4 respectively determine the second mapping relationship on the first resource block and the second mapping relationship on the second resource block corresponding to the first peak-to-average power ratio as the first user's second mapping relationship on the first resource block.
  • the obtained second mapping relationship of user J 1 on resource block 1 includes 8 corresponding relationships (eg, corresponding relationship 1-corresponding relationship 8), that is, SCMA codeword set S 1,0
  • the second mapping relationship includes 8 corresponding relationships
  • the obtained second mapping relationship of the user J 1 on the resource block 3 includes 8 corresponding relationships (such as the corresponding relationship 9-corresponding relationship 16), that is, the SCMA codeword set S 3,
  • the second mapping relationship of 1 includes 8 corresponding relationships.
  • a corresponding relationship is respectively selected from the corresponding relationship 1-corresponding relationship 8 and the corresponding relationship 9-corresponding relationship 16 to determine the peak-to-average power ratio.
  • the peak-to-average power ratios corresponding to correspondence 1 and 9, the peak-to-average power ratios corresponding to correspondence 1 and 10, and similarly, the peak-to-average power ratios corresponding to correspondence 1 and 16 are obtained.
  • the peak-to-average power ratios corresponding to correspondences 8 and 9 the peak-to-average power ratios corresponding to correspondences 8 and 10, and similarly, the peak-to-average power ratios corresponding to correspondences 8 and 16 are obtained.
  • the number of peak-to-average power ratios corresponding to the second mapping relationship of user J 1 on resource block 1 and resource block 3 is 64.
  • a corresponding relationship of a user on resource block 1 and a corresponding relationship of the user on resource block 3 are referred to as a corresponding relationship combination.
  • the corresponding relationship 1 and the corresponding relationship 9 may be referred to as Correspondence combination.
  • the second mapping relationship of user J 1 on resource block 1 and the second mapping relationship on resource block 3 correspond to 64 corresponding relationship combinations.
  • the obtained peak-to-average power is shown in Table 4 below.
  • the obtained 64 corresponding relationship combinations correspond to the peaks.
  • the peak-to-average power ratio corresponding to the 32 corresponding relationship combinations is 0dB
  • the peak-to-average power ratio corresponding to the 32 corresponding relationship combinations is 2.55dB.
  • 0dB is less than 2.55dB, so that from the 32 correspondence combinations corresponding to the peak-to-average power ratio 0dB, one correspondence combination can be selected as the third mapping relationship of user J 1 on resource block 1 and the third mapping relationship on resource block 3.
  • the peak-to-average power ratio after the codeword energy of each user is superimposed on at least two resource blocks is determined, and the corresponding relationship corresponding to the smallest peak-to-average power ratio is selected, thereby ensuring the fairness of power allocation between codewords.
  • the peak-to-average power ratio may satisfy the following formula (16):
  • PAPR is the peak-to-average power ratio
  • M2 represents the modulation order of the SCMA codeword
  • Z represents the number of resource blocks occupied by a single user
  • the calculation method of the peak-to-average power ratio shown in the above formula (16) is universal, and can be applied to the case of high-order SCMA codewords, different numbers of users, and different numbers of resources.
  • mapping relationship between multi-level symbols and SCMA codewords will affect the signal energy of different codewords, so as to transmit information in resource block 1 and resource block 3
  • the 4-dimensional complex sequence of each codeword of user J 1 For example.
  • mapping relationship on each resource block (that is, the sequence of SCMA codewords) will affect the codeword energy allocation of user J 1 on this resource block.
  • the superposition of the respective SCMA codeword energies on the two resource blocks will result in different energy allocation results. .
  • the selection of different mapping relationships for each user will affect the codeword energy allocation for each user.
  • the peak-to-average power ratio can be determined, and the multi-ary channel coding symbol and SCMA codeword corresponding to the smallest peak-to-average power ratio can be selected.
  • the mapping relationship between them can ensure the fairness of signal transmission.
  • the codeword mapping method obtaineds the first mapping relationship of at least one user on at least two resource blocks, and the first mapping relationship of each user on each resource block is composed of at least two corresponding relationships, Each correspondence is a correspondence between a sparse code division multiple access SCMA codeword and a multi-ary channel coding symbol. Then, determine the second mapping relationship of the at least one user on the at least two resource blocks. Since the second mapping relationship is the one with the smallest corresponding criterion value among the at least two correspondences included in the first mapping relationship, the criterion value is It is used to measure the possibility that the SCMA codeword is decoded incorrectly and the multi-level channel coded symbol is incorrectly decoded.
  • the mapping relationship is determined based on the bit error performance, which can reduce the bit error rate and improve the bit error performance.
  • the peak-to-average power ratio of each user after the codeword energy on at least two resource blocks is superimposed is further determined, and the corresponding relationship is selected according to the peak-to-average power ratio, so that the power between the codewords can be guaranteed. fairness of distribution.
  • the codeword mapping method provided by the embodiments of the present application has been described in detail above with reference to FIGS. 3-4 .
  • the codeword mapping apparatus provided by the embodiment of the present application is described in detail below with reference to FIG. 5 .
  • FIG. 5 is a schematic structural diagram of a codeword mapping apparatus provided by an embodiment of the present application.
  • the codeword mapping apparatus 500 includes: a mapping module 501 and a processing module 502 .
  • FIG. 5 only shows the main components of the codeword mapping apparatus.
  • the mapping module 501 is configured to obtain a first mapping relationship of at least one user on at least two resource blocks.
  • the processing module 502 is configured to determine a second mapping relationship of at least one user on at least two resource blocks.
  • the processing module 502 is further configured to determine the third mapping relationship of the at least one user on the at least two resource blocks according to the peak-to-average power ratio corresponding to the second mapping relationship of the at least one user on the at least two resource blocks.
  • the first mapping relationship of each user on each resource block consists of at least two corresponding relationships, each of which is a corresponding relationship between sparse code division multiple access SCMA codewords and multi-ary channel coding symbols.
  • the second mapping relationship of each user on each resource block consists of at least one corresponding relationship, and the at least one corresponding relationship is the corresponding relationship with the smallest corresponding criterion value among the at least two corresponding relationships.
  • the criterion value is used to measure whether the SCMA codeword is Incorrect decoding and the possibility of incorrect decoding of multi-binary channel coded symbols.
  • the third mapping relationship of each user on each resource block is a corresponding relationship, a corresponding relationship is one of at least one corresponding relationship, and the peak-to-average power ratio is the energy of the SCMA codeword superimposed on at least two resource blocks. Peak-to-average power ratio.
  • the multi-level channel coding symbol may include a first multi-level channel coding symbol and a second multi-level channel coding symbol
  • the SCMA codeword may include the first SCMA codeword and the second SCMA code Character.
  • the criterion value may be determined according to the Hamming distance and the Euclidean distance, and the Hamming distance is the number of bits with different values in the corresponding bits between the first multi-ary channel coding symbol and the second multi-ary channel coding symbol,
  • the Euclidean distance is the geometrical distance in Euclidean space between the first SCMA codeword and the second SCMA codeword.
  • the first multi-level channel coding symbol corresponds to the first SCMA codeword
  • the second multi-level channel coding symbol corresponds to the second SCMA codeword
  • the first SCMA codeword is the codeword currently to be decoded
  • the second SCMA codeword Different from the first SCMA codeword.
  • the criterion value may include traversing and stacking the product of at least one Hamming distance and at least one corresponding metric criterion, and the metric criterion is determined according to the Euclidean distance.
  • At least two resource blocks may include a first resource block and a second resource block, and at least one user may include the first user.
  • the processing module 502 is further configured to obtain the peak-to-average power ratio according to the second mapping relationship of the first user on the first resource block and the second mapping relationship of the first user on the second resource block.
  • the peak-to-average power ratio may include at least two peak-to-average power ratios, and the minimum value of the at least two peak-to-average power ratios is the first peak-to-average power ratio.
  • the processing module 502 is further configured to respectively determine the second mapping relationship on the first resource block and the second mapping relationship on the second resource block corresponding to the first peak-to-average power ratio as the first user in the first resource The third mapping relationship on the block and the third mapping relationship of the first user on the second resource block.
  • the mapping module 501 is further configured to obtain the basic SCMA codeword set according to the first Euclidean criterion.
  • the first Euclidean criterion may include maximizing the minimum Euclidean distance between SCMA codewords of one user on one resource block, and the basic SCMA codeword set may include SCMA codewords of one user on one resource block.
  • the mapping module 501 is further configured to obtain a one-dimensional SCMA codeword set according to the basic SCMA codeword set and the second Euclidean criterion.
  • the one-dimensional SCMA codeword set may include SCMA codewords of at least two users on one resource block, and the second Euclidean criterion may include the minimum Euclidean distance between the SCMA codewords of at least two users on one resource block and maximize.
  • the first Euclidean criterion can satisfy the following relation:
  • r 1 represents the value of the SCMA codeword with the smallest modulus value in the basic SCMA codeword set, represents the value of the SCMA codeword with the smallest modulus value in the basic SCMA codeword set obtained by the first Euclidean criterion
  • Represents SCMA codeword a multiple of the SCMA codeword r 1 represents the multiple between SCMA codeword r2 and SCMA codeword r1 obtained by the first Euclidean criterion
  • a multiple of the SCMA codeword r 1 , i 1 can range from 1 to Integer between , i 2 can range from 1 to An integer between, M 2 represents the modulation order of the SCMA codeword.
  • the second Euclidean criterion can satisfy the following relation:
  • ⁇ 1 * represents the angle between the SCMA codeword set of the user whose sequence number is 1 and the basic SCMA codeword set obtained by the second Euclidean criterion
  • ⁇ 1 represents the SCMA codeword set of the user whose sequence number is 1 and the basic SCMA codeword set initial angle between sets of codewords
  • j represents the imaginary part of the complex number
  • m 1 1,2,...,M 2
  • d f represents the number of users superimposed on a resource block
  • the metric can satisfy the following relationship:
  • m 1 represents the sequence number of the first SCMA codeword
  • k represents the serial number of the resource block
  • u represents the serial number of the user
  • x u,k (m 1 ) represents the code word with the serial number m 1 of the user u on the resource block k
  • the sequence number of user u on resource block k is The codeword of , the operator symbol
  • means modulo.
  • the criterion value can satisfy the following relationship:
  • E mapping is the criterion value
  • M 2 represents the modulation order of the SCMA codeword
  • m 1 is the sequence number of the first SCMA codeword
  • m 2 is the sequence number of the second SCMA codeword
  • c 1 is the first multi-ary channel coding symbol
  • Code symbols for the second multi-ary channel
  • the peak-to-average power ratio can satisfy the following relationship:
  • PAPR is the peak-to-average power ratio
  • M 2 represents the modulation order of the SCMA codeword
  • Z represents the number of resource blocks occupied by a single user
  • a zm represents the modulus value of the SCMA codeword.
  • mapping module 501 and the processing module 502 may be set separately, or may be integrated into one module, that is, the processing module (not shown in FIG. 5 ).
  • the present application does not specifically limit the specific implementation manners of the mapping module 501 and the processing module 502 .
  • the codeword mapping apparatus 500 may further include a transceiver module (not shown in FIG. 5 ).
  • the transceiver module is used to receive data and/or signaling sent by other devices, and may also be used to send data and/or signaling to other devices.
  • the transceiver module may include a receiving module and a transmitting module (not shown in FIG. 5 ).
  • the receiving module is used to receive data and/or signaling sent by other devices
  • the sending module is used to send data and/or signaling to other devices. This application does not specifically limit the specific implementation manner of the transceiver module.
  • the codeword mapping apparatus 500 may further include a storage module (not shown in FIG. 5 ), where the storage module stores programs or instructions. When the processing module executes the program or the instruction, the codeword mapping apparatus 500 can execute the codeword mapping method shown in FIG. 3 .
  • the codeword mapping apparatus 500 may be a terminal device, or may be a chip (system) or other components or components that can be provided in the terminal device, which is not limited in this application.
  • An embodiment of the present application provides a chip system, where the chip system includes a processor and an input/output port, where the processor is used to implement the processing functions involved in the foregoing method embodiments, and the input/output port is used to implement the foregoing method implementation Send and receive functions involved in the example.
  • the chip system further includes a memory for storing program instructions and data for implementing the functions involved in the above method embodiments.
  • the chip system may be composed of chips, or may include chips and other discrete devices.
  • An embodiment of the present application provides a computer-readable storage medium, including: the computer-readable storage medium includes a computer program or instruction, and when the computer program or instruction runs on a computer, the computer is made to execute the method described in the foregoing method embodiment. codeword mapping method.
  • An embodiment of the present application provides a computer program product containing instructions, the computer program product includes: a computer program or an instruction, when the computer program or instruction is run on a computer, the computer is made to execute the method described in the foregoing method embodiment. Codeword mapping method.
  • processors in the embodiments of the present application may be a central processing unit (central processing unit, CPU), and the processor may also be other general-purpose processors, digital signal processors (digital signal processors, DSP), dedicated integrated Circuit (application specific integrated circuit, ASIC), off-the-shelf programmable gate array (field programmable gate array, FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc.
  • a general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
  • the memory in the embodiments of the present application may be volatile memory or non-volatile memory, or may include both volatile and non-volatile memory.
  • the non-volatile memory may be read-only memory (ROM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), electrically programmable Erase programmable read-only memory (electrically EPROM, EEPROM) or flash memory.
  • Volatile memory may be random access memory (RAM), which acts as an external cache.
  • RAM random access memory
  • SRAM static random access memory
  • DRAM dynamic random access memory
  • DRAM synchronous dynamic random access memory
  • SDRAM synchronous dynamic random access memory
  • DDR SDRAM double data rate synchronous dynamic random access memory
  • enhanced SDRAM enhanced synchronous dynamic random access memory
  • SLDRAM synchronous connection dynamic random access memory Fetch memory
  • direct memory bus random access memory direct rambus RAM, DR RAM
  • the above embodiments may be implemented in whole or in part by software, hardware (eg, circuits), firmware, or any other combination.
  • the above-described embodiments 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 or computer programs. When the computer instructions or computer programs are loaded or executed on a computer, all or part of the processes or functions described in the embodiments of the present application are generated.
  • the computer may be a general purpose computer, special purpose computer, computer network, or other programmable device.
  • the computer instructions may be stored in or transmitted from one computer-readable storage medium to another computer-readable storage medium, for example, the computer instructions may be downloaded from a website site, computer, server, or data center Transmission to another website site, computer, server or data center by wire (eg, infrared, wireless, microwave, etc.).
  • the computer-readable storage medium may be any available medium that a computer can access, or a data storage device such as a server, a data center, or the like containing one or more sets of available media.
  • the usable media may be magnetic media (eg, floppy disks, hard disks, magnetic tapes), optical media (eg, DVDs), or semiconductor media.
  • the semiconductor medium may be a solid state drive.
  • At least one means one or more, and “plurality” means two or more.
  • At least one item(s) below” or similar expressions thereof refer to any combination of these items, including any combination of single item(s) or plural items(s).
  • at least one item (a) of a, b, or c can represent: a, b, c, a-b, a-c, b-c, or a-b-c, where a, b, c may be single or multiple .
  • the size of the sequence numbers of the above-mentioned processes does not mean the sequence of execution, and the execution sequence of each process should be determined by its functions and internal logic, and should not be dealt with in the embodiments of the present application. implementation constitutes any limitation.
  • the disclosed system, apparatus and method may be implemented in other manners.
  • the apparatus embodiments described above are only illustrative.
  • the division of the units is only a logical function division. In actual implementation, there may be other division methods.
  • multiple units or components may be combined or Can be integrated into another system, or some features can be ignored, or not implemented.
  • the shown or discussed mutual coupling or direct coupling or communication connection may be through some interfaces, indirect coupling or communication connection of devices or units, and may be in electrical, mechanical or other forms.
  • the units described as separate components may or may not be physically separated, and components displayed as units may or may not be physical units, that is, may be located in one place, or may be distributed to multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution in this embodiment.
  • each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically alone, or two or more units may be integrated into one unit.
  • the functions, if implemented in the form of software functional units and sold or used as independent products, may be stored in a computer-readable storage medium.
  • the technical solution of the present application can be embodied in the form of a software product in essence, or the part that contributes to the prior art or the part of the technical solution.
  • the computer software product is stored in a storage medium, including Several instructions are used to cause a computer device (which may be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of the present application.
  • the aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM), random access memory (RAM), magnetic disk or optical disk and other media that can store program codes .

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

La présente demande concerne un procédé de mappage de mot de code, destiné à être utilisé pour améliorer les performances de codage et l'équité d'attribution d'énergie d'un système de communication conçu conjointement par une technologie de codage de canal multi-système et une technologie d'accès multiple à code épars (SCMA). Le procédé fait appel aux étapes suivantes : obtention d'une première relation de mappage d'au moins un utilisateur sur au moins deux blocs de ressources (S301), détermination d'une seconde relation de mappage de l'au moins un utilisateur sur les au moins deux blocs de ressources (S302), et détermination d'une troisième relation de mappage de l'au moins un utilisateur sur les au moins deux blocs de ressources selon un rapport de puissance crête sur puissance moyenne correspondant à la seconde relation de mappage de l'au moins un utilisateur sur les au moins deux blocs de ressources (S303). La première relation de mappage de chaque utilisateur sur chaque bloc de ressource est composée d'au moins deux correspondances, et chaque correspondance est une correspondance entre un mot de code SCMA et un symbole de codage de canal multi-système. Une valeur de critère est utilisée pour mesurer la probabilité selon laquelle le mot de code SCMA est décodé de façon erronée et le symbole de codage de canal multi-système est décodé de façon erronée. Le rapport de puissance crête sur puissance moyenne est un rapport de puissance crête sur puissance moyenne après que l'énergie du mot de code SCMA est superposée sur les au moins deux blocs de ressource.
PCT/CN2021/078321 2021-02-27 2021-02-27 Procédé et dispositif de mappage de mot de code WO2022178886A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
PCT/CN2021/078321 WO2022178886A1 (fr) 2021-02-27 2021-02-27 Procédé et dispositif de mappage de mot de code
CN202180092540.5A CN116848826A (zh) 2021-02-27 2021-02-27 码字映射方法及装置

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2021/078321 WO2022178886A1 (fr) 2021-02-27 2021-02-27 Procédé et dispositif de mappage de mot de code

Publications (1)

Publication Number Publication Date
WO2022178886A1 true WO2022178886A1 (fr) 2022-09-01

Family

ID=83047763

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2021/078321 WO2022178886A1 (fr) 2021-02-27 2021-02-27 Procédé et dispositif de mappage de mot de code

Country Status (2)

Country Link
CN (1) CN116848826A (fr)
WO (1) WO2022178886A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115296739A (zh) * 2022-10-08 2022-11-04 南昌大学 Scma辅助可见光通信的快速译码方法及系统
CN115550934A (zh) * 2022-11-29 2022-12-30 安徽电信规划设计有限责任公司 基于深度学习的混合多址接入异构网络多用户检测方法

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105634712A (zh) * 2016-03-25 2016-06-01 重庆邮电大学 高斯信道下scma简易码本设计方法
CN106712892A (zh) * 2015-07-21 2017-05-24 普天信息技术有限公司 一种编码多址接入方法及装置
US20170295500A1 (en) * 2016-04-08 2017-10-12 Qualcomm Incorporated Techniques for sparse code multiple access (scma) codebook design
CN107534641A (zh) * 2015-05-08 2018-01-02 华为技术有限公司 低数据速率传输的方法和系统
CN107635250A (zh) * 2017-08-16 2018-01-26 南京邮电大学 Scma上行多址接入系统过载特性的优化方法
WO2020006738A1 (fr) * 2018-07-05 2020-01-09 Huawei Technologies Co., Ltd. Procédé et appareil pour des communications sans fil avec protection inégale contre les erreurs

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107534641A (zh) * 2015-05-08 2018-01-02 华为技术有限公司 低数据速率传输的方法和系统
CN106712892A (zh) * 2015-07-21 2017-05-24 普天信息技术有限公司 一种编码多址接入方法及装置
CN105634712A (zh) * 2016-03-25 2016-06-01 重庆邮电大学 高斯信道下scma简易码本设计方法
US20170295500A1 (en) * 2016-04-08 2017-10-12 Qualcomm Incorporated Techniques for sparse code multiple access (scma) codebook design
CN107635250A (zh) * 2017-08-16 2018-01-26 南京邮电大学 Scma上行多址接入系统过载特性的优化方法
WO2020006738A1 (fr) * 2018-07-05 2020-01-09 Huawei Technologies Co., Ltd. Procédé et appareil pour des communications sans fil avec protection inégale contre les erreurs

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115296739A (zh) * 2022-10-08 2022-11-04 南昌大学 Scma辅助可见光通信的快速译码方法及系统
CN115296739B (zh) * 2022-10-08 2023-03-07 南昌大学 Scma辅助可见光通信的快速译码方法及系统
CN115550934A (zh) * 2022-11-29 2022-12-30 安徽电信规划设计有限责任公司 基于深度学习的混合多址接入异构网络多用户检测方法
CN115550934B (zh) * 2022-11-29 2023-04-07 安徽电信规划设计有限责任公司 基于深度学习的混合多址接入异构网络多用户检测方法

Also Published As

Publication number Publication date
CN116848826A (zh) 2023-10-03

Similar Documents

Publication Publication Date Title
CN108347302B (zh) 一种编译码方法和终端
JP7252344B2 (ja) データ伝送方式及び通信デバイス
WO2022178886A1 (fr) Procédé et dispositif de mappage de mot de code
US8675771B2 (en) Log likelihood ratio arithmetic circuit, transmission apparatus, log likelihood ratio arithmetic method, and program
KR20200017520A (ko) 극성 코드 인코딩 방법 및 디바이스
WO2018202057A1 (fr) Procédé de transmission de données, station de base et appareil terminal
WO2018137645A1 (fr) Structure d'entrelaceur à code ldpc
WO2017124844A1 (fr) Procédé de détermination de taille de bloc de transmission d'un code de polarisation, et dispositif de communication
JP7186715B2 (ja) ポーラ符号化および復号方法、送信デバイス、ならびに受信デバイス
US11075653B2 (en) Polar code encoding and decoding method and apparatus
WO2013174093A1 (fr) Procédés et appareils de modulation et de démodulation de code pour modulation d'ordre élevé
CN111478752B (zh) 一种信息编码的方法及装置
CN111224677A (zh) 编码方法、译码方法及装置
BR112019019039A2 (pt) método de transmissão de dados e dispositivo relacionado
US20210006267A1 (en) Method for constructing parity-check concatenated polar codes and apparatus therefor
WO2018112891A1 (fr) Procédé et dispositif de transmission de signal, et appareil
WO2018201983A1 (fr) Procédé de codage de canal à codes polaires, dispositif et système de communications
WO2019029748A1 (fr) Procédé et dispositif de codage par code polaire
CN113794479B (zh) 极化调节卷积码的生成方法及相关设备
CN113541698B (zh) 编码、译码方法、装置及设备
JP4494276B2 (ja) 適応変調装置および適応変調方法
CN113922852A (zh) 码本确定方法、装置、电子设备及计算机可读存储介质
WO2022161449A1 (fr) Procédé de codage, procédé de décodage et dispositif de communication
CN105474548B (zh) 一种信道编码方法及装置
WO2019047788A1 (fr) Procédé et dispositif de codage

Legal Events

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

Ref document number: 21927321

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 202180092540.5

Country of ref document: CN

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 21927321

Country of ref document: EP

Kind code of ref document: A1