WO2018233462A1 - 极化码解码方法和解码器 - Google Patents

极化码解码方法和解码器 Download PDF

Info

Publication number
WO2018233462A1
WO2018233462A1 PCT/CN2018/089040 CN2018089040W WO2018233462A1 WO 2018233462 A1 WO2018233462 A1 WO 2018233462A1 CN 2018089040 W CN2018089040 W CN 2018089040W WO 2018233462 A1 WO2018233462 A1 WO 2018233462A1
Authority
WO
WIPO (PCT)
Prior art keywords
decoding
statistical
statistical output
candidate decoding
path
Prior art date
Application number
PCT/CN2018/089040
Other languages
English (en)
French (fr)
Inventor
王闰昕
那崇宁
永田聪
Original Assignee
株式会社Ntt都科摩
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 株式会社Ntt都科摩 filed Critical 株式会社Ntt都科摩
Publication of WO2018233462A1 publication Critical patent/WO2018233462A1/zh

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
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0057—Block codes
    • 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
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0045—Arrangements at the receiver end
    • H04L1/0047—Decoding adapted to other signal detection operation
    • H04L1/005—Iterative decoding, including iteration between signal detection and decoding operation
    • 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
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0045—Arrangements at the receiver end
    • H04L1/0047—Decoding adapted to other signal detection operation
    • H04L1/005—Iterative decoding, including iteration between signal detection and decoding operation
    • H04L1/0051—Stopping criteria
    • 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
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0045—Arrangements at the receiver end
    • H04L1/0052—Realisations of complexity reduction techniques, e.g. pipelining or use of look-up tables

Definitions

  • the present disclosure relates to the field of mobile communications, and more particularly, to a polarization code decoding method and decoder for signal decoding in a user equipment or base station.
  • Polar code is a new type of channel coding proposed by E. Arikan in 2008. The polarization code is designed based on channel polarization. It is the first constructive coding scheme that can prove the channel capacity through strict mathematical methods, and it is a major breakthrough in the field of wireless communication.
  • a polarization code decoding method comprising: calculating a path metric for each of a plurality of candidate decoding paths; calculating a statistical output of the path metric using a function; and in the statistic The decoding process is terminated early when the output satisfies the predetermined threshold condition.
  • the function is related to a maximum value and/or a minimum value in a path metric of a plurality of candidate decoding paths.
  • the calculating the statistical output of the path metric by using the function includes: calculating a maximum value and a minimum value of the path metrics of the plurality of candidate decoding paths, and using the difference between the maximum value and the minimum value as a statistical output. Or dividing the maximum value and the minimum value difference by the minimum value as the most statistical output.
  • the calculating, by the function, the statistical output of the path metric comprises: counting a mean or variance of path metrics of the plurality of candidate decoding paths.
  • the plurality of candidate decoding paths are all candidate decoding paths or partial candidate decoding paths.
  • the specific path number included in the partial candidate decoding path takes different values according to different decoding implementation methods.
  • the predetermined threshold condition includes: the statistical output is greater than the threshold, the statistical output is less than the threshold, or the statistical output is equal to the threshold.
  • the predetermined threshold condition is selected according to the representation method of the path metric.
  • a polarization code decoder comprising: a calculation unit configured to calculate a path metric for each of a plurality of candidate decoding paths; a statistical unit configured to utilize a function calculation a statistical output of the path metric; and a determining unit configured to terminate the decoding process early when the statistical output satisfies a predetermined threshold condition.
  • the function is related to a maximum value and/or a minimum value among path metrics of a plurality of candidate decoding paths.
  • the statistical unit includes: calculating a maximum value and a minimum value of the path metrics of the plurality of candidate decoding paths, and using the difference between the maximum value and the minimum value as a statistical output, or the maximum value and the The minimum worth difference divided by the minimum is the most statistical output.
  • the statistical unit includes: counting the mean or variance of the path metrics of the plurality of candidate decoding paths.
  • the plurality of candidate decoding paths are all candidate decoding paths or partial candidate decoding paths.
  • the specific path number included in the partial candidate decoding path takes different values according to different decoding implementation methods.
  • the predetermined threshold condition includes the statistical output being greater than the threshold, the statistical output being less than the threshold, or the statistical output being equal to the threshold.
  • the predetermined threshold condition is selected according to the representation method of the path metric.
  • FIG. 1 is a schematic diagram outlining a communication system in accordance with an embodiment of the present disclosure
  • FIG. 2 is a flowchart illustrating a polarization code decoding method according to an embodiment of the present disclosure
  • FIG. 3 is a block diagram illustrating a polarization code decoder according to an embodiment of the present disclosure
  • FIG. 4 is a block diagram illustrating an example of a hardware configuration of a base station and a user equipment according to an embodiment of the present disclosure.
  • FIG. 1 is a schematic diagram outlining a communication system in accordance with an embodiment of the present disclosure.
  • a communication system according to an embodiment of the present disclosure includes a base station (eNB) 10 and a user equipment (UE) 20.
  • the base station 10 and the user equipment 20 perform transmission and reception of communication signals using a polarization code on the communication channel.
  • the present disclosure is applicable to a 5G-based application scenario, in order to satisfy a decoding operation of a polarization code signal received by a user equipment and a base station in the application scenario.
  • the polarization code decoding method according to an embodiment of the present disclosure includes the following steps.
  • step S101 a path metric is calculated for each of the L candidate decoding paths in the i-th layer decoding.
  • i denotes the current decoding layer
  • 1 ⁇ i ⁇ N denotes the number of decoding layers in the polarization code decoder
  • the value of N may be determined according to the decoding algorithm used or the specific hardware implementation method.
  • the L candidate decoding paths are all candidate decoding paths or partial candidate decoding paths.
  • the path metric may be represented by any one of a likelihood ratio or a likelihood function of the decoded codeword of the next decoding layer in the candidate decoding path, in which case the path metric is a decision on the likelihood ratio or likelihood function. result.
  • the path metrics can also be represented by other representation methods as needed.
  • step S102 the path metric obtained in step S101 is calculated by using the function f to obtain a statistical output, wherein the function f can adopt any function that can reflect the statistical characteristics.
  • the function f is associated with a maximum and/or a minimum of the path metrics of the plurality of candidate decoding paths.
  • the function f can be of the form:
  • L represents the number of candidate decoding paths for calculation
  • L may be the number of all candidate decoding paths, or the number of partial candidate decoding paths, and the specific value of L may be different according to different decoding algorithms or implementations used.
  • the method differs; pm represents the value of the path metric, pm 1 , pm 2 , ..., pm L represents the value of the path metric for the 1st to Lth candidate decoding paths.
  • the maximum and minimum values in the path metrics of the plurality of candidate decoding paths are counted, and the difference between the maximum value and the minimum value is used as a statistical output.
  • the function f can also be of the form:
  • the maximum and minimum values in the path metrics of the plurality of candidate decoding paths are counted, and the difference between the maximum value and the minimum value is divided by the minimum value as a statistical output.
  • the function f may also be a function of the mean or variance of the path metrics that count the L candidate decoding paths.
  • the function f can also be a function with multiple output values.
  • step S103 it is judged whether or not the statistical output obtained in step S102 satisfies the predetermined threshold condition, if the predetermined threshold condition is satisfied, the processing proceeds to step S104, and if the predetermined threshold condition is not satisfied, the processing proceeds to step S105.
  • the predetermined threshold condition includes that the statistical output of step S102 is greater than the threshold; in other examples, the statistical output of step S102 is less than the threshold, or the statistical output of step S102 is equal to the threshold.
  • Which threshold condition is adopted as the predetermined threshold condition of step S103 is selected according to the representation method of the specific path metric. For example, when the path metric is represented by a likelihood ratio, the statistical output is greater than the threshold as a predetermined threshold condition. For another example, when the path metric is represented by the cumulative likelihood ratio, less than 1 or less than 2 or other values may be employed as the predetermined threshold condition. Alternatively, when the path metric is represented by a likelihood function, the statistical output is less than the threshold as a predetermined threshold condition. Depending on the different representations of the path metrics, a statistical output greater than, less than or equal to the threshold may be employed as the predetermined threshold condition.
  • the threshold used in the predetermined threshold condition may be a fixed value, which is a fixed relative threshold.
  • a threshold value may be employed as a judgment condition for decoding termination, and the value of the path metric is generally compared with a threshold value in the decoding process to determine the correctness of the decoding.
  • the threshold includes an absolute threshold and a relative threshold.
  • the value of the absolute threshold is usually changed according to coding parameters (eg, coding rate, coding length, information block size, information bit index, etc.), and the computational complexity is high.
  • the relative threshold is usually a fixed value.
  • the threshold value in the decoding method of the present disclosure may adopt a relative threshold.
  • the threshold may also be a non-fixed value as needed.
  • the relative threshold or absolute threshold may be selected according to the particular manifestation of the function f, and the flexibility of the decoding process is increased by the appropriate selection function f.
  • the relative threshold may also vary depending on the encoding parameters.
  • step S104 the entire decoding process is terminated early when the statistical output satisfies the predetermined threshold condition, and the decoding process is ended.
  • the decoding process is terminated after the final layer of multi-layer decoding is completed, but a decoding error may have occurred during the decoding process, and the decoding operation thereafter is actually doing the useless work.
  • Continuing to decode only increases the memory cost; therefore, in the present disclosure, it is judged whether the predetermined threshold condition is satisfied in the process of decoding, and when the predetermined threshold condition is satisfied, it indicates that a decoding error has occurred, and the termination is terminated early. Decoding avoids the waste of resources caused by continuing decoding after a decoding error occurs.
  • step S105 it is further determined whether i is smaller than N, that is, whether the current decoding layer is the last decoding layer, and if i is smaller than N, the processing proceeds to step S106, and if i is not smaller than N, the processing proceeds to step S107.
  • i in this step is not necessarily i+1, and may be the position of the next information bit or other possible values, as needed.
  • step S107 the decoding result is output, and the decoding process is ended.
  • the statistical result of the path metric of the plurality of candidate decoding paths is compared with the threshold in the decoding process, thereby determining whether a decoding error occurs, and decoding is terminated early when a decoding error is found.
  • the decoding method in the present disclosure can effectively reduce algorithm complexity, reduce memory cost, save system resources, and implement early termination of polarization code decoding more efficiently.
  • FIG. 3 is a block diagram illustrating a polarization code decoder in accordance with an embodiment of the present disclosure.
  • a decoder 200 according to an embodiment of the present disclosure includes a plurality of structurally identical decoding layers, each of which includes a computing unit, a statistical unit, and a determining unit.
  • 3 includes a computing unit 201, a statistic unit 202, and a determining unit 203, 1 ⁇ i ⁇ N, pm 1 , pm 2 , ..., pm L respectively representing the first to L candidate decoding paths
  • the value of the path metric where the candidate decoding path of the i-1th layer decoded output will be the input of the i-th layer decoding, and the candidate decoding path of the i-th layer decoded output will be the input of the i+1th layer decoding.
  • the computing unit 201 is configured to calculate a path metric for each of the plurality of candidate decoding paths; the statistic unit 202 is configured to calculate a statistical output of the path metric using a function; and the determining unit 203 is configured to satisfy the predetermined at the statistical output
  • the decoding process is terminated early when the threshold condition is met.
  • the plurality of candidate decoding paths are all candidate decoding paths or partial candidate decoding paths. The number of specific path segments included in the partial candidate decoding path takes different values according to different decoding implementations.
  • the statistical result of the path metric of the plurality of candidate decoding paths is compared with the threshold in the decoding process, thereby determining whether a decoding error occurs, and decoding is terminated early when a decoding error is found.
  • the decoder in the present disclosure can effectively reduce the algorithm complexity, reduce the memory cost, save system resources, and realize the early termination of the polarization code decoding more efficiently.
  • the statistic unit 202 includes a maximum value and/or a minimum value correlation among the path metrics of the plurality of candidate decoding paths, and then the statistical unit 202 counts the maximum and minimum values of the path metrics of the plurality of candidate decoding paths. And taking the difference between the maximum value and the minimum value as a statistical output, or dividing the maximum value from the minimum value difference by the minimum value as the most statistical output.
  • the statistic unit 202 includes averaging the mean or variance of the path metrics of the plurality of candidate decoding paths.
  • the predetermined threshold condition includes: the statistical output is greater than the threshold, the statistical output is less than the threshold, or the statistical output is equal to the threshold.
  • the predetermined threshold condition is selected according to the representation method of the path metric.
  • each functional block may be implemented by one device that is physically and/or logically combined, or two or more devices that are physically and/or logically separated, directly and/or indirectly (eg, This is achieved by a plurality of devices as described above by a wired and/or wireless connection.
  • a base station, a user equipment, and the like in the embodiments of the present disclosure may function as a computer that performs processing of the wireless communication method of the present disclosure.
  • FIG. 4 is a block diagram illustrating an example of a hardware configuration of a base station and a user equipment according to an embodiment of the present disclosure.
  • the base station 10 and the user equipment 20 described above may be configured as a computer device that physically includes the processor 1001, the memory 1002, the memory 1003, the communication device 1004, the input device 1005, the output device 1006, the bus 1007, and the like.
  • the hardware structure of the base station 10 and the user equipment 20 may include one or more of the devices shown in the figures, or may not include some of the devices.
  • the processor 1001 only illustrates one, but may be multiple processors.
  • the processing may be performed by one processor, or may be performed by one or more processors simultaneously, sequentially, or by other methods.
  • the processor 1001 can be installed by more than one chip.
  • Each function in the base station 10 and the user equipment 20 is realized, for example, by reading a predetermined software (program) into hardware such as the processor 1001 and the memory 1002, thereby causing the processor 1001 to perform an operation, and the communication device 1004 The communication performed is controlled, and the reading and/or writing of data in the memory 1002 and the memory 1003 is controlled.
  • a predetermined software program
  • the communication device 1004 The communication performed is controlled, and the reading and/or writing of data in the memory 1002 and the memory 1003 is controlled.
  • the processor 1001 causes the operating system to operate to control the entire computer.
  • the processor 1001 may be configured by a central processing unit (CPU) including an interface with a peripheral device, a control device, an arithmetic device, a register, and the like.
  • CPU central processing unit
  • the above-described reception control unit 103, retransmission control unit 203, and the like can be implemented by the processor 1001.
  • the processor 1001 reads out programs (program codes), software modules, data, and the like from the memory 1003 and/or the communication device 1004 to the memory 1002, and executes various processes in accordance therewith.
  • programs program codes
  • the program a program for causing a computer to execute at least a part of the operations described in the above embodiments can be employed.
  • the retransmission control unit 203 of the user equipment 20 can be implemented by a control program stored in the memory 1002 and operated by the processor 1001, and can be similarly implemented for other functional blocks.
  • the memory 1002 is a computer readable recording medium, and may be, for example, a read only memory (ROM), an EEPROM (Erasable Programmable ROM), an electrically programmable read only memory (EEPROM), or an electrically programmable read only memory (EEPROM). At least one of a random access memory (RAM) and other suitable storage medium is used.
  • the memory 1002 may also be referred to as a register, a cache, a main memory (main storage device), or the like.
  • the memory 1002 can store an executable program (program code), a software module, and the like for implementing the wireless communication method according to an embodiment of the present disclosure.
  • the memory 1003 is a computer readable recording medium, and may be, for example, a flexible disk, a soft (registered trademark) disk (floppy disk), a magneto-optical disk (for example, a CD-ROM (Compact Disc ROM), etc.). Digital Versatile Disc, Blu-ray (registered trademark) disc, removable disk, hard drive, smart card, flash device (eg card, stick, key driver), magnetic stripe, database At least one of a server, a server, and other suitable storage medium.
  • the memory 1003 may also be referred to as an auxiliary storage device.
  • the communication device 1004 is hardware (transmission and reception device) for performing communication between computers through a wired and/or wireless network, and is also referred to as a network device, a network controller, a network card, a communication module, and the like, for example.
  • the communication device 1004 may include a high frequency switch, a duplexer, a filter, a frequency synthesizer, etc., in order to implement, for example, Frequency Division Duplex (FDD) and/or Time Division Duplex (TDD).
  • FDD Frequency Division Duplex
  • TDD Time Division Duplex
  • the above-described transmitting unit 101, receiving unit 102, receiving unit 201, transmitting unit 202, and the like can be implemented by the communication device 1004.
  • the input device 1005 is an input device (for example, a keyboard, a mouse, a microphone, a switch, a button, a sensor, etc.) that accepts input from the outside.
  • the output device 1006 is an output device (for example, a display, a speaker, a light emitting diode (LED) lamp, etc.) that performs an output to the outside.
  • the input device 1005 and the output device 1006 may also be an integrated structure (for example, a touch panel).
  • each device such as the processor 1001 and the memory 1002 is connected via a bus 1007 for communicating information.
  • the bus 1007 may be composed of a single bus or a different bus between devices.
  • the base station 10 and the user equipment 20 may include a microprocessor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a programmable logic device (PLD, Programmable Logic Device), Hardware such as Field Programmable Gate Array (FPGA) can realize some or all of each functional block by this hardware.
  • DSP digital signal processor
  • ASIC application specific integrated circuit
  • PLD programmable logic device
  • FPGA Field Programmable Gate Array
  • the processor 1001 can be installed by at least one of these hardwares.
  • a polarization code decoding method and a decoder according to an embodiment of the present disclosure are described with reference to FIGS. 1 through 4, in which the statistical result of the path metric using a plurality of candidate decoding paths is compared with a fixed relative threshold. Then, it is judged whether or not a decoding error occurs, and the decoding is terminated early.
  • the decoding method in the present disclosure can effectively reduce algorithm complexity, reduce memory cost, save system resources, and implement early termination of polarization code decoding more efficiently.
  • the channel and/or symbol can also be a signal (signaling).
  • the signal can also be a message.
  • the reference signal may also be simply referred to as an RS (Reference Signal), and may also be referred to as a pilot (Pilot), a pilot signal, or the like according to applicable standards.
  • a component carrier may also be referred to as a cell, a frequency carrier, a carrier frequency, or the like.
  • the information, parameters, and the like described in the present specification may be expressed by absolute values, may be represented by relative values with predetermined values, or may be represented by other corresponding information.
  • wireless resources can be indicated by a specified index.
  • the formula or the like using these parameters may be different from those explicitly disclosed in the present specification.
  • the names used for parameters and the like in this specification are not limitative in any respect.
  • a variety of channels Physical Uplink Control Channel (PUCCH), Physical Downlink Control Channel (PDCCH), Physical Downlink Control Channel (PDSCH), Physical Downlink (Physical Downlink Control Channel) Shared Channels, etc.
  • PUCCH Physical Uplink Control Channel
  • PDCH Physical Downlink Control Channel
  • PDSCH Physical Downlink Control Channel
  • Physical Downlink (Physical Downlink Control Channel) Shared Channels, etc.) and information elements can be identified by any suitable name, and thus the various names assigned to these various channels and information elements are not limiting in any way.
  • the information, signals, and the like described in this specification can be expressed using any of a variety of different techniques.
  • data, commands, instructions, information, signals, bits, symbols, chips, etc. which may be mentioned in all of the above description, may pass voltage, current, electromagnetic waves, magnetic fields or magnetic particles, light fields or photons, or any of them. Combined to represent.
  • information, signals, and the like may be output from the upper layer to the lower layer, and/or from the lower layer to the upper layer.
  • Information, signals, etc. can be input or output via a plurality of network nodes.
  • Information or signals input or output can be stored in a specific place (such as memory) or managed by a management table. Information or signals input or output may be overwritten, updated or supplemented. The output information, signals, etc. can be deleted. The input information, signals, etc. can be sent to other devices.
  • the notification of the information is not limited to the mode/embodiment described in the specification, and may be performed by other methods.
  • the notification of the information may be through physical layer signaling (for example, Downlink Control Information (DCI), Uplink Control Information (UCI), and upper layer signaling (for example, radio resource control).
  • DCI Downlink Control Information
  • UCI Uplink Control Information
  • RRC Radio Resource Control
  • MIB Master Information Block
  • SIB System Information Block
  • MAC Media Access Control
  • the physical layer signaling may be referred to as L1/L2 (Layer 1/Layer 2) control information (L1/L2 control signal), L1 control information (L1 control signal), and the like.
  • the RRC signaling may also be referred to as an RRC message, and may be, for example, an RRC Connection Setup message, an RRC Connection Reconfiguration message, or the like.
  • the MAC signaling can be notified, for example, by a MAC Control Unit (MAC CE).
  • MAC CE MAC Control Unit
  • the notification of the predetermined information (for example, the notification of "ACK” or “NACK”) is not limited to being explicitly performed, and may be implicitly (for example, by not notifying the predetermined information or by notifying other information) )get on.
  • the determination can be performed by a value (0 or 1) represented by 1 bit, or by a true or false value (boolean value) represented by true (true) or false (false), and can also be compared by numerical values ( For example, comparison with a predetermined value).
  • Software whether referred to as software, firmware, middleware, microcode, hardware description language, or other names, should be interpreted broadly to mean commands, command sets, code, code segments, program code, programs, sub- Programs, software modules, applications, software applications, software packages, routines, subroutines, objects, executables, threads of execution, steps, functions, and the like.
  • software, commands, information, and the like may be transmitted or received via a transmission medium.
  • a transmission medium For example, when using wired technology (coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL), etc.) and/or wireless technology (infrared, microwave, etc.) from a website, server, or other remote source
  • wired technology coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL), etc.
  • wireless technology infrared, microwave, etc.
  • base station (BS, Base Station)", “radio base station”, “eNB”, “gNB”, “cell”, “sector”, “cell group”, “carrier”, and “component carrier”
  • BS Base Station
  • radio base station eNB
  • gNB gNodeB
  • cell a cell
  • cell group a carrier
  • component carrier a component carrier
  • the base station is sometimes referred to by a fixed station, a NodeB, an eNodeB (eNB), an access point, a transmission point, a reception point, a femto cell, a small cell, and the like.
  • a base station can accommodate one or more (eg, three) cells (also referred to as sectors). When the base station accommodates multiple cells, the entire coverage area of the base station can be divided into a plurality of smaller areas, and each smaller area can also pass through the base station subsystem (for example, a small indoor base station (RFH, remote head (RRH), Remote Radio Head))) to provide communication services.
  • the term "cell” or “sector” refers to a portion or the entirety of the coverage area of a base station and/or base station subsystem that performs communication services in the coverage.
  • the base station is sometimes referred to by a fixed station, a NodeB, an eNodeB (eNB), an access point, a transmission point, a reception point, a femto cell, a small cell, and the like.
  • eNB eNodeB
  • Mobile stations are also sometimes used by those skilled in the art as subscriber stations, mobile units, subscriber units, wireless units, remote units, mobile devices, wireless devices, wireless communication devices, remote devices, mobile subscriber stations, access terminals, mobile terminals, wireless Terminals, remote terminals, handsets, user agents, mobile clients, clients, or several other appropriate terms are used.
  • the wireless base station in this specification can also be replaced with a user terminal.
  • each mode/embodiment of the present disclosure can also be applied to a configuration in which communication between a wireless base station and a user terminal is replaced with communication between a plurality of user-to-device (D2D) devices.
  • D2D user-to-device
  • the function of the above-described wireless base station 10 can be regarded as a function of the user terminal 20.
  • words such as "upstream” and "downstream” can also be replaced with "side”.
  • the uplink channel can also be replaced with a side channel.
  • the user terminal in this specification can also be replaced with a wireless base station.
  • the function of the user terminal 20 described above can be regarded as a function of the wireless base station 10.
  • a specific operation performed by a base station is also performed by an upper node depending on the situation.
  • various actions performed for communication with the terminal can pass through the base station and more than one network other than the base station.
  • the node may be considered, for example, but not limited to, a Mobility Management Entity (MME), a Serving-Gateway (S-GW, etc.), or a combination thereof.
  • MME Mobility Management Entity
  • S-GW Serving-Gateway
  • LTE Long Term Evolution
  • LTE-A Advanced Long Term Evolution
  • LTE-B Long-Term Evolution
  • LTE-Beyond Long-Term Evolution
  • Super 3rd generation mobile communication system SUPER 3G
  • IMT-Advanced advanced international mobile communication
  • 4th generation mobile communication system (4G, 4th generation mobile communication system
  • 5G 5th generation mobile communication system
  • future radio access FAA
  • new radio access technology New-RAT, Radio Access Technology
  • NR New Radio Access Technology
  • NX new radio access
  • FX Next Generation Wireless Access
  • GSM Registered trademark
  • GSM Global System for Mobile Communications
  • CDMA2000 Code Division Multiple Access 2000
  • UMB Ultra Mobile Broadband
  • IEEE 802.11 Wi-Fi (registered trademark)
  • IEEE 802.16 WiMAX (registered trademark)
  • IEEE 802.20 Ultra Wideband
  • any reference to a unit using the names "first”, “second”, etc., as used in this specification, does not fully limit the number or order of the units. These names can be used in this specification as a convenient method of distinguishing between two or more units. Thus, reference to a first element and a second element does not mean that only two elements may be employed or that the first element must prevail in the form of the second unit.
  • determination used in the present specification sometimes includes various actions. For example, regarding “judgment (determination)", calculation, calculation, processing, deriving, investigating, looking up (eg, table, database, or other) may be performed. Search in the data structure, ascertaining, etc. are considered to be “judgment (determination)”. Further, regarding “judgment (determination)”, reception (for example, receiving information), transmission (for example, transmission of information), input (input), output (output), and access (for example) may also be performed (for example, Accessing data in memory, etc. is considered to be “judgment (determination)”.
  • judgment (determination) it is also possible to consider “resolving”, “selecting”, selecting (choosing), establishing (comparing), comparing (comparing), etc. as “judgement (determination)”. That is to say, regarding "judgment (determination)", several actions can be regarded as performing "judgment (determination)”.
  • connection means any direct or indirect connection or combination between two or more units, This includes the case where there is one or more intermediate units between two units that are “connected” or “coupled” to each other.
  • the combination or connection between the units may be physical, logical, or a combination of the two.
  • connection can also be replaced with "access”.
  • two units may be considered to be electrically connected by using one or more wires, cables, and/or printed, and as a non-limiting and non-exhaustive example by using a radio frequency region.
  • the electromagnetic energy of the wavelength of the region, the microwave region, and/or the light is "connected” or "bonded” to each other.

Landscapes

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

Abstract

本公开涉及一种极化码解码方法和解码器。所述极化码解码方法，包括：为多条候选解码路径中的每一条计算路径度量；利用函数计算所述路径度量的统计输出；并且在所述统计输出满足预定阈值条件时提前终止解码过程。通过本公开中的解码方法和解码器可以有效降低算法复杂度、降低内存成本、节约系统资源，高效地实现对极化码解码的早期终止。

Description

极化码解码方法和解码器 技术领域
本公开涉及移动通信领域，更具体地，公开一种极化码解码方法和解码器，其用于用户设备或基站中的信号解码。
背景技术
随着移动通信产业的发展以及对于移动数据业务需求的不断增长，人们对于移动通信的速率和服务质量(Qos)的要求越来越高。第五代移动通信技术(5G)标准正在制定并且走向应用。
5G移动通信标志性的关键技术主要体现在超高效能的无线传输技术和高密度无线网络技术，高性能的信道编码技术也将成为5G的一个重要研究方向。极化码(Polar码)是2008年由E.Arikan提出的一种新型信道编码。极化码基于信道极化进行设计，是第一种能够通过严格的数学方法证明达到信道容量的构造性编码方案，属于无线通信领域的重大突破。
但是由于极化码在解码过程中需要进行多层解码的迭代过程，这样连续解码会增加解码延迟，特别是在下行链路盲解码的过程中表现的尤为严重。在解码过程中，在未完成多层解码的最后一层解码之前，可能已经发生解码错误，此后的解码操作实际上是在做无用功，继续进行解码只会增加内存成本。
发明内容
根据本公开的一个实施例，提供了一种极化码解码方法，包括：为多条候选解码路径中的每一条计算路径度量；利用函数计算所述路径度量的统计输出；并且在所述统计输出满足预定阈值条件时提前终止解码过程。
此外，根据本公开的一个实施例的方法中，所述函数与多条候选解码路径的路径度量中的最大值和/或最小值相关。其中，所述利用函数计算所述路径度量的统计输出包括：统计多条候选解码路径的路径度量中的最大值及最小值，并将所述最大值与所述最小值的差作为统计输出，或将所述最大值与所述最小值得差除以所述最小值最为统计输出。
此外，根据本公开的另一实施例的方法中，所述利用函数计算所述路径 度量的统计输出包括：统计多条候选解码路径的路径度量的均值或方差。
此外，根据本公开实施例的方法中，所述多条候选解码路径是全部候选解码路径或部分候选解码路径。其中，所述部分候选解码路径中所包括的具体路径条数根据不同的解码实现方法而取不同的值。
此外，根据本公开实施例的方法中，所述预定阈值条件包括：所述统计输出大于所述阈值、所述统计输出小于所述阈值或所述统计输出等于所述阈值。其中，所述预定阈值条件依据所述路径度量的表示方法而进行选取。
根据本公开的一个实施例，提供了一种极化码解码器，包括：计算单元，被配置为为多条候选解码路径中的每一条计算路径度量；统计单元，被配置为利用函数计算所述路径度量的统计输出；并且确定单元，被配置为在所述统计输出满足预定阈值条件时提前终止解码过程。
此外，根据本公开的一个实施例的解码器中，所述函数与多条候选解码路径的路径度量中的最大值和/或最小值相关。其中，所述统计单元包括：统计多条候选解码路径的路径度量中的最大值及最小值，并将所述最大值与所述最小值的差作为统计输出，或将所述最大值与所述最小值得差除以所述最小值最为统计输出。
此外，根据本公开的另一实施例的解码器中，统计单元包括：统计多条候选解码路径的路径度量的均值或方差。
此外，根据本公开实施例的解码器中，所述多条候选解码路径是全部候选解码路径或部分候选解码路径。其中，所述部分候选解码路径中所包括的具体路径条数根据不同的解码实现方法而取不同的值。
此外，根据本公开实施例的解码器中，所述预定阈值条件包括：所述统计输出大于所述阈值、所述统计输出小于所述阈值或所述统计输出等于所述阈值。其中，所述预定阈值条件依据所述路径度量的表示方法而进行选取。
要理解的是，前面的一般描述和下面的详细描述两者都是示例性的，并且意图在于提供要求保护的技术的进一步说明。
附图说明
通过结合附图对本公开实施例进行更详细的描述，本公开的上述以及其它目的、特征和优势将变得更加明显。附图用来提供对本公开实施例的进一步理解，并且构成说明书的一部分，与本公开实施例一起用于解释本公开， 并不构成对本公开的限制。在附图中，相同的参考标号通常代表相同部件或步骤。
图1是概述根据本公开实施例的通信系统的示意图；
图2是图示根据本公开实施例的极化码解码方法的流程图；
图3是图示根据本公开实施例的极化码解码器的框图；
图4是图示根据本公开实施例的基站及用户设备的硬件构成的示例的框图。
具体实施方式
为了使得本公开的目的、技术方案和优点更为明显，下面将参照附图详细描述根据本公开的示例实施例。显然，所描述的实施例仅仅是本公开的一部分实施例，而不是本公开的全部实施例，应理解，本公开不受这里描述的示例实施例的限制。基于本公开中描述的本公开实施例，本领域技术人员在没有付出创造性劳动的情况下所得到的所有其它实施例都应落入本公开的保护范围之内。
图1是概述根据本公开实施例的通信系统的示意图。如图1所示，根据本公开实施例的通信系统包括基站(eNB)10和用户设备(UE)20。基站10和用户设备20在通信信道上，利用极化码执行通信信号的收发。
本公开可用于基于5G的应用场景，为了满足该应用场景下用户设备及基站都接收到的极化码信号进行解码操作。
首先，参照图2描述根据本公开实施例的极化码解码方法。根据本公开的实施例的极化码解码方法包括以下步骤。
在步骤S101中，为第i层解码中的L条候选解码路径中的每一条候选解码路径计算路径度量。
其中，i表示当前的解码层，1≤i≤N，N表示极化码解码器中的解码层的数量，N的取值可根据所采用解码算法或具体的硬件实现方法的不同而确定。L条候选解码路径是全部候选解码路径或部分候选解码路径。
路径度量可以用候选解码路径中下一解码层的解码码字的似然比或似然函数中的任何一个来表示，在这种情况下，路径度量是对似然比或似然函数的判决结果。可替换地，根据需要，路径度量也可以用其他表示方法来表示。
在步骤S102中，利用函数f对步骤S101中得到的路径度量进行计算，获得统计输出，其中的函数f可以采用任何可反映统计特性的函数。可选的该函数f与多条候选解码路径的路径度量中的最大值和/或最小值相关。
在一个示例中，函数f可为以下形式：
f(pm 1,pm 2,…,pm L)＝max(pm 1,pm 2,…,pm L)-min(pm 1,pm 2,…,pm L)
其中，L表示用于计算的候选解码路径的条数，L可以是所有的候选解码路径的数量，或部分候选解码路径的数量，L的具体取值可根据所采用的不同的解码算法或实现方法而不同；pm表示路径度量的值，pm 1,pm 2,…,pm L表示第1到L条候选解码路径的路径度量的值。在该示例中，通过统计多条候选解码路径的路径度量中的最大值及最小值，并将最大值与最小值的差作为统计输出。
在另一示例中，函数f还可为以下形式：
Figure PCTCN2018089040-appb-000001
在该示例中，通过统计多条候选解码路径的路径度量中的最大值及最小值，并将最大值与最小值的差除以最小值作为统计输出。
在另一示例中，函数f还可为统计L条候选解码路径的路径度量的均值或方差的函数。
在另一示例中，函数f还可以为具有多个输出值的函数。在步骤S103中，判断步骤S102得出的统计输出是否满足预定阈值条件，如果满足预定阈值条件则处理进到步骤S104，如果不满足预定阈值条件则处理进到步骤S105。
在一个示例中，预定阈值条件包括：步骤S102的统计输出大于阈值；在其他示例中，步骤S102的统计输出小于阈值，或步骤S102的统计输出等于阈值。而采用哪一种阈值条件作为步骤S103的预定阈值条件是依据具体路径度量的表示方法而进行选取。例如，以似然比表示路径度量的时候，采用统计输出大于阈值作为预定阈值条件。再例如，以累计似然比表示路径度量的时候，可以采用小于1或小于2或其他数值作为预定阈值条件。可替换地，以似然函数表示路径度量的时候，采用统计输出小于阈值作为预定阈值条件。依据路径度量的不同表示可以采用统计输出大于、小于或等于阈值作为预定阈值条件。
预定阈值条件中所采用的阈值可以为一固定值，其为一个固定的相对阈值。在极化码解码过程中可采用阈值作为解码终止的判断条件，在该解码过程中通常将路径度量的值与阈值进行比较以判断解码的正确性。该阈值包括绝对阈值和相对阈值，绝对阈值的取值通常会根据编码参数(例如，编码率、编码长度、信息块大小、信息比特索引等)的不同而改变，其计算复杂度较高，而相对阈值通常为固定值。本公开的解码方法中的阈值可采用相对阈值，在解码过程中仅需将步骤S102中的统计输出与相对阈值进行一次比较即可获得比较结果，因此，该方法能够降低算法复杂度以及内存成本。可替换地，根据需要，该阈值也可以是非固定的值。在一些示例中，可以根据函数f的具体表现形式的不同而选择相对阈值或绝对阈值，通过适当的选取函数f增加了解码过程的灵活性。在另一些示例中，相对阈值也可以根据编码参数的不同而变化。
在步骤S104中，当统计输出满足预定阈值条件时提前终止整个解码过程，结束解码流程。
传统上，在极化码的解码过程中，在完成多层解码的最后一层解码后才会终止解码过程，但可能在解码过程中已经发生解码错误，此后的解码操作实际上是在做无用功，继续进行解码只会增加内存成本；因此，在本公开中采用在解码的过程中对是否满足预定阈值条件进行判断，在满足预定阈值条件时即表示出现了解码错误，并在该处提前终止解码，避免了在发生解码错误后继续解码，造成的资源浪费。
在步骤S105中，进一步判断i是否小于N，即判断当前的解码层是否是最后一个解码层，如果i小于N则处理进到步骤S106，如果i不小于N则处理进到步骤S107。
在步骤S106中，令i＝i+1，并返回步骤S101，进行后续解码过程。可替换地，根据需要，本步骤中的i不必然为i+1，还可以是下个信息比特的位置，或是其他可能的取值。
在步骤S107中，输出解码结果，结束解码流程。
通过上述解码方法，在解码过程中利用多条候选解码路径的路径度量的统计结果与阈值进行比较，进而判断是否出现解码错误，在发现解码错误时提前终止解码。通过本公开中的解码方法可以有效降低算法复杂度、降低内存成本、节约系统资源，更加高效地实现对极化码解码的早期终止。
图3是图示根据本公开实施例的极化码解码器的框图。如图3所示，根据本公开实施例的解码器200，其中包括多个结构相同的解码层，每个解码层均包括计算单元、统计单元和确定单元。作为示例说明，图3中第i层解码包括计算单元201、统计单元202和确定单元203，1≤i≤N，pm 1,pm 2,…,pm L分别表示第1到L条候选解码路径的路径度量的值，其中，第i-1层解码输出的候选解码路径将作为第i层解码的输入，而第i层解码输出的候选解码路径将作为第i+1层解码的输入。
具体地，计算单元201被配置为为多条候选解码路径中的每一条计算路径度量；统计单元202被配置为利用函数计算路径度量的统计输出；并且确定单元203被配置为在统计输出满足预定阈值条件时提前终止解码过程。其中，多条候选解码路径是全部候选解码路径或部分候选解码路径。部分候选解码路径中所包括的具体路径条数根据不同的解码实现而取不同的值。
其中，若确定单元203确定在第i层解码中统计单元202的统计输出满足预定阈值条件时，则退出解码过程，提前终止整个解码。若确定单元203确定在第i层解码中统计单元202的统计输出不满足预定阈值条件时，并且该第i层不是最后一个解码层时，令i＝i+1，并进入第i+1个解码层继续解码。
通过上述解码器，在解码过程中利用多条候选解码路径的路径度量的统计结果与阈值进行比较，进而判断是否出现解码错误，在发现解码错误时提前终止解码。通过本公开中的解码器可以有效降低算法复杂度、降低内存成本、节约系统资源，更加高效地实现对极化码解码的早期终止。
在一示例中，统计单元202包括统计多条候选解码路径的路径度量中的最大值和/或最小值相关，进而由统计单元202统计多条候选解码路径的路径度量中的最大值及最小值，并将所述最大值与所述最小值的差作为统计输出，或将所述最大值与所述最小值得差除以所述最小值最为统计输出。
在另一示例中，统计单元202包括：统计多条候选解码路径的路径度量的均值或方差。
其中，预定阈值条件包括：统计输出大于阈值、统计输出小于阈值或统计输出等于所述阈值。预定阈值条件依据路径度量的表示方法而进行选取。
上述实施例的说明中使用的框图示出了以功能为单位的块。这些功能块(结构单元)通过硬件和/或软件的任意组合来实现。此外，各功能块的实现手段并不特别限定。即，各功能块可以通过在物理上和/或逻辑上相结合的一 个装置来实现，也可以将在物理上和/或逻辑上相分离的两个以上装置直接地和/或间接地(例如通过有线和/或无线)连接从而通过上述多个装置来实现。
例如，本公开的实施例中的基站、用户设备等可以作为执行本公开的无线通信方法的处理的计算机来发挥功能。图4是图示根据本公开实施例的基站及用户设备的硬件构成的示例的框图。上述的基站10和用户设备20可以作为在物理上包括处理器1001、内存1002、存储器1003、通信装置1004、输入装置1005、输出装置1006、总线1007等的计算机装置来构成。
另外，在以下的说明中，“装置”这样的文字也可替换为电路、设备、单元等。基站10和用户设备20的硬件结构可以包括一个或多个图中所示的各装置，也可以不包括部分装置。
例如，处理器1001仅图示出一个，但也可以为多个处理器。此外，可以通过一个处理器来执行处理，也可以通过一个以上的处理器同时、依次、或采用其它方法来执行处理。另外，处理器1001可以通过一个以上的芯片来安装。
基站10和用户设备20中的各功能例如通过如下方式实现：通过将规定的软件(程序)读入到处理器1001、内存1002等硬件上，从而使处理器1001进行运算，对由通信装置1004进行的通信进行控制，并对内存1002和存储器1003中的数据的读出和/或写入进行控制。
处理器1001例如使操作系统进行工作从而对计算机整体进行控制。处理器1001可以由包括与周边装置的接口、控制装置、运算装置、寄存器等的中央处理器(CPU，Central Processing Unit)构成。例如，上述的接收控制单元103、重发控制单元203等可以通过处理器1001实现。
此外，处理器1001将程序(程序代码)、软件模块、数据等从存储器1003和/或通信装置1004读出到内存1002，并根据它们执行各种处理。作为程序，可以采用使计算机执行在上述实施方式中说明的动作中的至少一部分的程序。例如，用户设备20的重发控制单元203可以通过保存在内存1002中并通过处理器1001来工作的控制程序来实现，对于其它功能块，也可以同样地来实现。内存1002是计算机可读取记录介质，例如可以由只读存储器(ROM，Read Only Memory)、可编程只读存储器(EPROM，Erasable Programmable ROM)、电可编程只读存储器(EEPROM，Electrically EPROM)、随机存取存储器(RAM，Random Access Memory)、其它适当的存储介质中 的至少一个来构成。内存1002也可以称为寄存器、高速缓存、主存储器(主存储装置)等。内存1002可以保存用于实施本公开的一实施方式所涉及的无线通信方法的可执行程序(程序代码)、软件模块等。
存储器1003是计算机可读取记录介质，例如可以由软磁盘(flexible disk)、软(注册商标)盘(floppy disk)、磁光盘(例如，只读光盘(CD-ROM(Compact Disc ROM)等)、数字通用光盘、蓝光(Blu-ray，注册商标)光盘)、可移动磁盘、硬盘驱动器、智能卡、闪存设备(例如，卡、棒(stick)、密钥驱动器(key driver))、磁条、数据库、服务器、其它适当的存储介质中的至少一个来构成。存储器1003也可以称为辅助存储装置。
通信装置1004是用于通过有线和/或无线网络进行计算机间的通信的硬件(发送接收设备)，例如也称为网络设备、网络控制器、网卡、通信模块等。通信装置1004为了实现例如频分双工(FDD，Frequency Division Duplex)和/或时分双工(TDD，Time Division Duplex)，可以包括高频开关、双工器、滤波器、频率合成器等。例如，上述的发送单元101、接收单元102、接收单元201、发送单元202等可以通过通信装置1004来实现。
输入装置1005是接受来自外部的输入的输入设备(例如，键盘、鼠标、麦克风、开关、按钮、传感器等)。输出装置1006是实施向外部的输出的输出设备(例如，显示器、扬声器、发光二极管(LED，Light Emitting Diode)灯等)。另外，输入装置1005和输出装置1006也可以为一体的结构(例如触控面板)。
此外，处理器1001、内存1002等各装置通过用于对信息进行通信的总线1007连接。总线1007可以由单一的总线构成，也可以由装置间不同的总线构成。
此外，基站10和用户设备20可以包括微处理器、数字信号处理器(DSP，Digital Signal Processor)、专用集成电路(ASIC，Application Specific Integrated Circuit)、可编程逻辑器件(PLD，Programmable Logic Device)、现场可编程门阵列(FPGA，Field Programmable Gate Array)等硬件，可以通过该硬件来实现各功能块的部分或全部。例如，处理器1001可以通过这些硬件中的至少一个来安装。
以上，参照图1到图4描述了根据本公开实施例的极化码解码方法和解码器，在上述解码过程中利用多条候选解码路径的路径度量的统计结果与一 固定的相对阈值进行比较，进而判断是否出现解码错误，并提前终止解码。通过本公开中的解码方法可以有效降低算法复杂度、降低内存成本、节约系统资源，更加高效地实现对极化码解码的早期终止。
另外，关于本说明书中说明的用语和/或对本说明书进行理解所需的用语，可以与具有相同或类似含义的用语进行互换。例如，信道和/或符号也可以为信号(信令)。此外，信号也可以为消息。参考信号也可以简称为RS(Reference Signal)，根据所适用的标准，也可以称为导频(Pilot)、导频信号等。此外，分量载波(CC，Component Carrier)也可以称为小区、频率载波、载波频率等。
此外，本说明书中说明的信息、参数等可以用绝对值来表示，也可以用与规定值的相对值来表示，还可以用对应的其它信息来表示。例如，无线资源可以通过规定的索引来指示。进一步地，使用这些参数的公式等也可以与本说明书中明确公开的不同。
在本说明书中用于参数等的名称在任何方面都并非限定性的。例如，各种各样的信道(物理上行链路控制信道(PUCCH，Physical Uplink Control Channel)、物理下行链路控制信道(PDCCH，Physical Downlink Control Channel)、物理下行链路共享信道(PDSCH，Physical Downlink Shared Channel)等)和信息单元可以通过任何适当的名称来识别，因此为这些各种各样的信道和信息单元所分配的各种各样的名称在任何方面都并非限定性的。
本说明书中说明的信息、信号等可以使用各种各样不同技术中的任意一种来表示。例如，在上述的全部说明中可能提及的数据、命令、指令、信息、信号、比特、符号、芯片等可以通过电压、电流、电磁波、磁场或磁性粒子、光场或光子、或者它们的任意组合来表示。
此外，信息、信号等可以从上层向下层、和/或从下层向上层输出。信息、信号等可以经由多个网络节点进行输入或输出。
输入或输出的信息、信号等可以保存在特定的场所(例如内存)，也可以通过管理表进行管理。输入或输出的信息、信号等可以被覆盖、更新或补充。输出的信息、信号等可以被删除。输入的信息、信号等可以被发往其它装置。
信息的通知并不限于本说明书中说明的方式/实施方式，也可以通过其 它方法进行。例如，信息的通知可以通过物理层信令(例如，下行链路控制信息(DCI，Downlink Control Information)、上行链路控制信息(UCI，Uplink Control Information))、上层信令(例如，无线资源控制(RRC，Radio Resource Control)信令、广播信息(主信息块(MIB，Master Information Block)、系统信息块(SIB，System Information Block)等)、媒体存取控制(MAC，Medium Access Control)信令)、其它信号或者它们的组合来实施。
另外，物理层信令也可以称为L1/L2(第1层/第2层)控制信息(L1/L2控制信号)、L1控制信息(L1控制信号)等。此外，RRC信令也可以称为RRC消息，例如可以为RRC连接建立(RRC Connection Setup)消息、RRC连接重配置(RRC Connection Reconfiguration)消息等。此外，MAC信令例如可以通过MAC控制单元(MAC CE(Control Element))来通知。
此外，规定信息的通知(例如，“ACK”、“NACK”的通知)并不限于显式地进行，也可以隐式地(例如，通过不进行该规定信息的通知，或者通过其它信息的通知)进行。
关于判定，可以通过由1比特表示的值(0或1)来进行，也可以通过由真(true)或假(false)表示的真假值(布尔值)来进行，还可以通过数值的比较(例如与规定值的比较)来进行。
软件无论被称为软件、固件、中间件、微代码、硬件描述语言，还是以其它名称来称呼，都应宽泛地解释为是指命令、命令集、代码、代码段、程序代码、程序、子程序、软件模块、应用程序、软件应用程序、软件包、例程、子例程、对象、可执行文件、执行线程、步骤、功能等。
此外，软件、命令、信息等可以经由传输介质被发送或接收。例如，当使用有线技术(同轴电缆、光缆、双绞线、数字用户线路(DSL，Digital Subscriber Line)等)和/或无线技术(红外线、微波等)从网站、服务器、或其它远程资源发送软件时，这些有线技术和/或无线技术包括在传输介质的定义内。
本说明书中使用的“系统”和“网络”这样的用语可以互换使用。
在本说明书中，“基站(BS，Base Station)”、“无线基站”、“eNB”、“gNB”、“小区”、“扇区”、“小区组”、“载波”以及“分量载波”这样的用语可以互换使用。基站有时也以固定台(fixed station)、NodeB、eNodeB(eNB)、接入点(access point)、发送点、接收点、毫微微小区、小小区等用语来称呼。
基站可以容纳一个或多个(例如三个)小区(也称为扇区)。当基站容纳多个小区时，基站的整个覆盖区域可以划分为多个更小的区域，每个更小的区域也可以通过基站子系统(例如，室内用小型基站(射频拉远头(RRH，Remote Radio Head)))来提供通信服务。“小区”或“扇区”这样的用语是指在该覆盖中进行通信服务的基站和/或基站子系统的覆盖区域的一部分或整体。
在本说明书中，“移动台(MS，Mobile Station)”、“用户终端(userterminal)”、“用户装置(UE，User Equipment)”以及“终端”这样的用语可以互换使用。基站有时也以固定台(fixed station)、NodeB、eNodeB(eNB)、接入点(access point)、发送点、接收点、毫微微小区、小小区等用语来称呼。
移动台有时也被本领域技术人员以用户台、移动单元、用户单元、无线单元、远程单元、移动设备、无线设备、无线通信设备、远程设备、移动用户台、接入终端、移动终端、无线终端、远程终端、手持机、用户代理、移动客户端、客户端或者若干其它适当的用语来称呼。
此外，本说明书中的无线基站也可以用用户终端来替换。例如，对于将无线基站和用户终端间的通信替换为多个用户终端间(D2D，Device-to-Device)的通信的结构，也可以应用本公开的各方式/实施方式。此时，可以将上述的无线基站10所具有的功能当作用户终端20所具有的功能。此外，“上行”和“下行”等文字也可以替换为“侧”。例如，上行信道也可以替换为侧信道。
同样，本说明书中的用户终端也可以用无线基站来替换。此时，可以将上述的用户终端20所具有的功能当作无线基站10所具有的功能。
在本说明书中，设为通过基站进行的特定动作根据情况有时也通过其上级节点(upper node)来进行。显然，在具有基站的由一个或多个网络节点(network nodes)构成的网络中，为了与终端间的通信而进行的各种各样的动作可以通过基站、除基站之外的一个以上的网络节点(可以考虑例如移动管理实体(MME，Mobility Management Entity)、服务网关(S-GW，Serving-Gateway)等，但不限于此)、或者它们的组合来进行。
本说明书中说明的各方式/实施方式可以单独使用，也可以组合使用，还可以在执行过程中进行切换来使用。此外，本说明书中说明的各方式/实施方式的处理步骤、序列、流程图等只要没有矛盾，就可以更换顺序。例如， 关于本说明书中说明的方法，以示例性的顺序给出了各种各样的步骤单元，而并不限定于给出的特定顺序。
本说明书中说明的各方式/实施方式可以应用于利用长期演进(LTE，Long Term Evolution)、高级长期演进(LTE-A，LTE-Advanced)、超越长期演进(LTE-B，LTE-Beyond)、超级第3代移动通信系统(SUPER 3G)、高级国际移动通信(IMT-Advanced)、第4代移动通信系统(4G，4th generation mobile communication system)、第5代移动通信系统(5G，5th generation mobile communication system)、未来无线接入(FRA，Future Radio Access)、新无线接入技术(New-RAT，Radio Access Technology)、新无线(NR，New Radio)、新无线接入(NX，New radio access)、新一代无线接入(FX，Future generation radio access)、全球移动通信系统(GSM(注册商标)，Global System for Mobile communications)、码分多址接入2000(CDMA2000)、超级移动宽带(UMB，Ultra Mobile Broadband)、IEEE 802.11(Wi-Fi(注册商标))、IEEE 802.16(WiMAX(注册商标))、IEEE 802.20、超宽带(UWB，Ultra-Wide Band)、蓝牙(Bluetooth(注册商标))、其它适当的无线通信方法的系统和/或基于它们而扩展的下一代系统。
本说明书中使用的“根据”这样的记载，只要未在其它段落中明确记载，则并不意味着“仅根据”。换言之，“根据”这样的记载是指“仅根据”和“至少根据”这两者。
本说明书中使用的对使用“第一”、“第二”等名称的单元的任何参照，均非全面限定这些单元的数量或顺序。这些名称可以作为区别两个以上单元的便利方法而在本说明书中使用。因此，第一单元和第二单元的参照并不意味着仅可采用两个单元或者第一单元必须以若干形式占先于第二单元。
本说明书中使用的“判断(确定)(determining)”这样的用语有时包含多种多样的动作。例如，关于“判断(确定)”，可以将计算(calculating)、推算(computing)、处理(processing)、推导(deriving)、调查(investigating)、搜索(looking up)(例如表、数据库、或其它数据结构中的搜索)、确认(ascertaining)等视为是进行“判断(确定)”。此外，关于“判断(确定)”，也可以将接收(receiving)(例如接收信息)、发送(transmitting)(例如发送信息)、输入(input)、输出(output)、存取(accessing)(例如存取内存中的数据)等视为是进行“判断(确定)”。此外，关于“判断(确定)”，还可 以将解决(resolving)、选择(selecting)、选定(choosing)、建立(establishing)、比较(comparing)等视为是进行“判断(确定)”。也就是说，关于“判断(确定)”，可以将若干动作视为是进行“判断(确定)”。
本说明书中使用的“连接的(connected)”、“结合的(coupled)”这样的用语或者它们的任何变形是指两个或两个以上单元间的直接的或间接的任何连接或结合，可以包括以下情况：在相互“连接”或“结合”的两个单元间，存在一个或一个以上的中间单元。单元间的结合或连接可以是物理上的，也可以是逻辑上的，或者还可以是两者的组合。例如，“连接”也可以替换为“接入”。在本说明书中使用时，可以认为两个单元是通过使用一个或一个以上的电线、线缆、和/或印刷电气连接，以及作为若干非限定性且非穷尽性的示例，通过使用具有射频区域、微波区域、和/或光(可见光及不可见光这两者)区域的波长的电磁能等，被相互“连接”或“结合”。
在本说明书或权利要求书中使用“包括(including)”、“包含(comprising)”、以及它们的变形时，这些用语与用语“具备”同样是开放式的。进一步地，在本说明书或权利要求书中使用的用语“或(or)”并非是异或。
以上对本公开进行了详细说明，但对于本领域技术人员而言，显然，本公开并非限定于本说明书中说明的实施方式。本公开在不脱离由权利要求书的记载所确定的本公开的宗旨和范围的前提下，可以作为修改和变更方式来实施。因此，本说明书的记载是以示例说明为目的，对本公开而言并非具有任何限制性的意义。

Claims (16)

  1. 一种极化码解码方法，包括：
    为多条候选解码路径中的每一条计算路径度量；
    利用函数计算所述路径度量的统计输出；并且
    在所述统计输出满足预定阈值条件时提前终止解码过程。
  2. 如权利要求1所述的方法，其中，所述多条候选解码路径是全部候选解码路径或部分候选解码路径。
  3. 如权利要求2所述的方法，其中，所述函数与所述多条候选解码路径的路径度量中的最大值和/或最小值相关。
  4. 如权利要求3所述的方法，其中，所述利用函数计算所述路径度量的统计输出包括：统计所述多条候选解码路径的路径度量中的最大值及最小值，并将所述最大值与所述最小值的差作为统计输出，或将所述最大值与所述最小值得差除以所述最小值最为统计输出。
  5. 如权利要求2所述的方法，其中，所述利用函数计算所述路径度量的统计输出包括：统计所述多条候选解码路径的路径度量的均值或方差。
  6. 如权利要求2所述的方法，其中，所述部分候选解码路径中所包括的具体路径条数根据不同的解码实现而取不同的值。
  7. 如权利要求1所述的方法，其中，所述预定阈值条件包括：所述统计输出大于所述阈值、所述统计输出小于所述阈值或所述统计输出等于所述阈值。
  8. 如权利要求7所述的方法，其中，所述预定阈值条件依据所述路径度量的表示方法而进行选取。
  9. 一种极化码解码器，包括：
    计算单元，被配置为为多条候选解码路径中的每一条计算路径度量；
    统计单元，被配置为利用函数计算所述路径度量的统计输出；并且
    确定单元，被配置为在所述统计输出满足预定阈值条件时提前终止解码过程。
  10. 如权利要求9所述的解码器，其中，所述多条候选解码路径是全部候选解码路径或部分候选解码路径。
  11. 如权利要求10所述的解码器，其中，所述函数与所述多条候选解 码路径的路径度量中的最大值和/或最小值相关。
  12. 如权利要求11所述的解码器，其中，所述统计单元包括：统计所述多条候选解码路径的路径度量中的最大值及最小值，并将所述最大值与所述最小值的差作为统计输出，或将所述最大值与所述最小值得差除以所述最小值最为统计输出。
  13. 如权利要求10所述的解码器，其中，所述统计单元包括：统计所述多条候选解码路径的路径度量的均值或方差。
  14. 如权利要求10所述的解码器，其中，所述部分候选解码路径中所包括的具体路径条数根据不同的解码实现而取不同的值。
  15. 如权利要求9所述的解码器，其中，所述预定阈值条件包括：所述统计输出大于所述阈值、所述统计输出小于所述阈值或所述统计输出等于所述阈值。
  16. 如权利要求15所述的解码器，其中，所述预定阈值条件依据所述路径度量的表示方法而进行选取。
PCT/CN2018/089040 2017-06-18 2018-05-30 极化码解码方法和解码器 WO2018233462A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710460617.5A CN109150382A (zh) 2017-06-18 2017-06-18 极化码解码方法和解码器
CN201710460617.5 2017-06-18

Publications (1)

Publication Number Publication Date
WO2018233462A1 true WO2018233462A1 (zh) 2018-12-27

Family

ID=64736856

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/089040 WO2018233462A1 (zh) 2017-06-18 2018-05-30 极化码解码方法和解码器

Country Status (2)

Country Link
CN (1) CN109150382A (zh)
WO (1) WO2018233462A1 (zh)

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102694625A (zh) * 2012-06-15 2012-09-26 北京邮电大学 一种循环冗余校验辅助的极化码译码方法
US20140019820A1 (en) * 2012-07-11 2014-01-16 The Regents Of The University Of California Ecc polar coding and list decoding methods and codecs
US20150263767A1 (en) * 2014-03-11 2015-09-17 Postech Academy-Industry Foundation List decoding method for polar code and memory system using the same
WO2016168962A1 (zh) * 2015-04-20 2016-10-27 华为技术有限公司 极化码的译码方法和译码装置
WO2016172934A1 (zh) * 2015-04-30 2016-11-03 华为技术有限公司 极化码的译码器和译码方法
WO2016172940A1 (zh) * 2015-04-30 2016-11-03 华为技术有限公司 极性码的译码方法和译码装置
CN106209113A (zh) * 2016-07-29 2016-12-07 中国石油大学(华东) 一种极化码的编解码方法
CN106850144A (zh) * 2017-02-20 2017-06-13 东南大学 一种连续消除极化堆解码器

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102694625A (zh) * 2012-06-15 2012-09-26 北京邮电大学 一种循环冗余校验辅助的极化码译码方法
US20140019820A1 (en) * 2012-07-11 2014-01-16 The Regents Of The University Of California Ecc polar coding and list decoding methods and codecs
US20150263767A1 (en) * 2014-03-11 2015-09-17 Postech Academy-Industry Foundation List decoding method for polar code and memory system using the same
WO2016168962A1 (zh) * 2015-04-20 2016-10-27 华为技术有限公司 极化码的译码方法和译码装置
WO2016172934A1 (zh) * 2015-04-30 2016-11-03 华为技术有限公司 极化码的译码器和译码方法
WO2016172940A1 (zh) * 2015-04-30 2016-11-03 华为技术有限公司 极性码的译码方法和译码装置
CN106209113A (zh) * 2016-07-29 2016-12-07 中国石油大学(华东) 一种极化码的编解码方法
CN106850144A (zh) * 2017-02-20 2017-06-13 东南大学 一种连续消除极化堆解码器

Also Published As

Publication number Publication date
CN109150382A (zh) 2019-01-04

Similar Documents

Publication Publication Date Title
JP7136797B2 (ja) 端末、無線通信方法及びシステム
US11128406B2 (en) Data transmission method, data receiving method, user equipment and base station
WO2019214592A1 (zh) 通信方法、终端设备和网络设备
WO2018202063A1 (zh) 干扰协调信息交互方法、减轻交叉链路干扰的方法和基站
WO2018171426A1 (zh) 波束配置方法、移动台和基站
WO2019001065A1 (zh) 数据发送方法、装置及存储介质
JP2018064253A (ja) ユーザ装置及び信号受信方法
WO2018201910A1 (zh) 波束信息反馈方法及用户装置
US20210211247A1 (en) Precoding method, decoding method, transmitting device and receiving device
WO2019213934A1 (zh) 用于传输信号的方法及相应的用户终端、基站
US11212827B2 (en) Data transmitting method, acknowledgment signal transmitting method, user equipment, and base station
WO2018201786A1 (zh) 一种多波束的csi反馈信息的传输方法和装置
US11818753B2 (en) Random access wait time setting method
JP2020505813A (ja) 符号化方法及び符号化装置
CN112425226B (zh) 通信方法及相应的用户终端、基站
US11057154B2 (en) Method and apparatus for rate matching interleaving for polar codes
US11425742B2 (en) Method for determining an uplink scheduling manner, user equipment and base station
WO2018143124A1 (ja) 通信装置、及び系列選択方法
WO2018233462A1 (zh) 极化码解码方法和解码器
WO2018201928A1 (zh) 数据检测方法和用户设备
WO2021232413A1 (zh) 发送设备、接收设备、干扰信息发送方法和信道接入方法
WO2018233565A1 (zh) 极化编码方法、极化编码器和无线通信设备
CN111279736B (zh) 一种用于生成扩展符号的方法及装置
US20220039043A1 (en) User equipment
WO2020031303A1 (ja) 通信接続装置および通信接続方法

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: 18821433

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 18821433

Country of ref document: EP

Kind code of ref document: A1