Error correction coding method and apparatus integrated with transmit diversity

Abstract

The disclosure relates to a 5G or 6G communication system for supporting a higher data transmission rate. The disclosure discloses a method and apparatus for error correction coding in a communication system, and more particularly, to error correction coding integrated with transmission diversity.

Description

Technical Field

[0001] This disclosure generally relates to error correction coding in communication systems, and more specifically, to error correction coding integrated with transport diversity. Background Technology

[0002] 5G mobile communication technology defines a wide frequency band, enabling high transmission rates and new services. It can be implemented not only in "below 6 GHz" bands such as 3.5 GHz, but also in "above 6 GHz" bands, including 28 GHz and 39 GHz, known as mmWave. Furthermore, 6G mobile communication technology (referred to as "super 5G systems") is being considered in terahertz bands (e.g., the 95 GHz to 3 THz band) to achieve transmission rates fifty times faster than 5G and ultra-low latency one-tenth that of 5G.

[0003] At the outset of 5G mobile communication technology development, standardization was underway regarding beamforming and massive MIMO to support services and meet performance requirements associated with enhanced mobile broadband (eMBB), ultra-reliable low-latency communication (URLLC), and massive machine-type communication (mMTC). This standardization aimed to mitigate radio wave path loss in millimeter waves and increase radio wave transmission distance; support parameter sets for dynamic operation (e.g., operating multiple subcarrier spacings) to efficiently utilize millimeter wave resources and time slot formats; initial access technologies to support multi-beam transmission and broadband; the definition and operation of bandwidth portions (BWP); new channel decoding methods (such as low-density parity-check (LDPC) codes for large data transmissions and polar codes for highly reliable transmission of control information); L2 preprocessing; and network slicing for providing dedicated networks for specific services.

[0004] Currently, given the services supported by 5G mobile communication technology, discussions are underway regarding improvements and performance enhancements to the initial 5G mobile communication technology. Physical layer standardization for technologies such as Vehicle-to-Everything (V2X) is also in place, designed to assist autonomous vehicle driving decisions based on information about the vehicle's location and status transmitted by the vehicle, and to enhance user convenience. This includes NR-U (New Radio Unlicensed) and NR UE Energy Saving (NTN), which are UE-satellite direct communication technologies used to provide coverage and positioning in areas where communication with terrestrial networks is unavailable.

[0005] Furthermore, standardization is ongoing for technologies within the air interface architecture / protocol, such as the Industrial Internet of Things (IIoT) for supporting new services through interoperability and convergence with other industries, Integrated Access and Backhaul (IAB) for providing nodes for network service area extension by supporting wireless backhaul and access links in an integrated manner, mobility enhancements including conditional handover and Dual Active Protocol Stack (DAPS) handover, and two-step random access (two-step RACH for NR) for simplifying the random access process. Standardization is also underway for 5G baseline architectures (e.g., service-based architectures or service-based interfaces) for combining Network Functions Virtualization (NFV) and Software-Defined Networking (SDN) technologies, as well as system architectures / services for Mobile Edge Computing (MEC) based on UE location reception services.

[0006] With the commercialization of 5G mobile communication systems, the already exponentially growing number of connected devices will be connected to the communication network, thus necessitating enhanced functionality and performance of 5G mobile communication systems as well as integrated operation of connected devices. To this end, new research related to extended reality (XR) has been arranged to effectively support augmented reality (AR), virtual reality (VR), mixed reality (MR), etc., by leveraging artificial intelligence (AI) and machine learning (ML), AI service support, metaspace service support, and drone communication to improve 5G performance and reduce complexity.

[0007] Furthermore, this development of 5G mobile communication systems will not only serve as the foundation for developing new waveforms for providing terahertz band coverage in 6G mobile communication technologies, such as multi-antenna transmission technologies like full-dimensional MIMO (FD-MIMO), array antennas, and massive MIMO; metamaterial-based lenses and antennas for improving terahertz band signal coverage; high-dimensional spatial multiplexing technologies using orbital angular momentum (OAM); and reconfigurable smart surfaces (RIS); it will also serve as the foundation for developing full-duplex technologies to improve the frequency efficiency of 6G mobile communication technologies and enhance system networks; AI-based communication technologies to achieve system optimization by leveraging satellites and AI from the design phase and internalizing end-to-end AI support functions; and next-generation distributed computing technologies to achieve services with complexity levels exceeding the operational capabilities of UEs by utilizing ultra-high-performance communication and computing resources.

[0008] This patent document also provides definitions for certain other words and phrases throughout. Those skilled in the art will understand that, in many cases (if not most), these definitions apply to the prior and future use of the words and phrases thus defined. Summary of the Invention

[0009] Technical issues

[0010] This disclosure discloses an error correction coding method and apparatus in a communication system, and more specifically, discloses an error correction coding integrated with transmission diversity.

[0011] Technical solution

[0012] In one embodiment, a transmitter device in a communication system is provided. The transmitter device includes an encoder configured to identify data words from a source. Furthermore, based on the encoder input mapping relationship and multiple encoding functions according to the data words... Identify multiple encoder output subwords ,in, Greater than one; and a diversity mapper, configured to output sub-words based on diversity transformation and sub-channel allocation relationships from multiple encoders. Identify multiple channel input subwords And transmit multiple channel input subwords through the channel. The channel includes multiple sub-channels, among which... Related to the number of sub-channels, and Greater than one.

[0013] In another embodiment, a transmitter method in a communication system is provided. The transmitter method includes an encoding step, wherein the encoding step includes: identifying data words from a source. Furthermore, based on the encoder input mapping relationship and multiple encoding functions according to the data words... Identify multiple encoder output subwords ,in, Greater than one; and a diversity mapping step, wherein the diversity mapping step includes: outputting sub-words from multiple encoders based on diversity transformation and sub-channel allocation relationships. Identify multiple channel input subwords And transmit multiple channel input subwords through the channel. The channel includes multiple sub-channels, among which... Related to the number of sub-channels, and Greater than one.

[0014] In another embodiment, a receiver method in a communication system is provided. The receiver method includes a diversity demapping step, wherein the diversity demapping step includes: receiving a plurality of channel output subwords from a channel. The channel includes multiple sub-channels, among which... Related to the number of sub-channels, and Greater than one, in the receiver process of the first step In the next iteration, the first... Decoder input statistics , among which, the Decoder input statistics based on In the Any decision feedback messages received from the decoder in the iterations preceding this iteration, as well as the diversity transformation matrix. ,in, It has of Matrix, will the first Decoder input statistics Send to the decoder, and obtain the first from the decoder The decision feedback; and the decoding steps, wherein the decoding steps include: obtaining the first... Decoder input statistics Based on the first Decoder input statistics Identify the first Partial decoder decision, of which, the first Partial decoder decisions include the first Decoding encoder input subword Determine whether the condition is met. Termination condition, in the If the termination condition is not met, identify the first The judgment feedback message will be the first The judgment feedback message is sent to the diversity demapping module, where the first... The judgment feedback message is based on the first Partial decoder decision, and including the first The decoder outputs the subword. ,in, Based on the The encoding function is based on the first Decoding encoder input subword The obtained, of which, the first Encoding functions include The polarization transformation, upon satisfying the termination condition, identifies the decoder output and sends it to the destination. The decoder output includes the decoded data words. , where, for each , ,in, yes The non-trivial partition, where, yes The number of elements, where, It makes The set of sets, where for each , |

[0015] Other technical features may be readily apparent to those skilled in the art from the following figures, description and claims.

[0016] Before proceeding with the following detailed description, it may be advantageous to clarify the definitions of certain words and phrases used throughout this patent document. The term “coupled” and its derivatives refer to any direct or indirect communication between two or more elements, regardless of whether these elements are physically in contact with each other. The terms “transmit,” “receive,” and “communicate,” and their derivatives encompass both direct and indirect communication. The terms “comprising” and “including,” and their derivatives, indicate a non-limiting inclusion. The term “or” is inclusive, meaning and / or. The phrase “associated with,” and its derivatives, mean including, being included within, interconnected with, containing, being contained within, connected to or connected to, coupled to or coupled with, capable of communicating with, cooperating with, intertwined, juxtaposed, adjacent, bound to or bound to, having, possessing the properties of, having a relationship with, etc. The term “controller” means any device, system, or part thereof that controls at least one operation. Such a controller may be implemented in hardware or a combination of hardware and software and / or firmware. The functionality associated with any particular controller may be centralized or distributed, whether local or remote. It should be noted that the functionality associated with any particular controller can be centralized or distributed, whether local or remote. When the phrase “at least one of…” is used with a list of items, it means that different combinations of one or more of the listed items can be used, and it is possible that only one item in the list is needed. For example, “at least one of A, B, and C” includes any of the following combinations: A, B, C, A and B, A and C, B and C, and A, B, and C.

[0017] Furthermore, the various functions described below can be implemented or supported by one or more computer programs, each computer program being formed by computer-readable program code and embodied in a computer-readable medium. The terms "application" and "program" refer to one or more computer programs, software components, instruction sets, procedures, functions, objects, classes, instances, associated data, or portions thereof suitable for implementation in appropriate computer-readable program code. The phrase "computer-readable program code" includes any type of computer code, including source code, object code, and executable code. The phrase "computer-readable medium" includes any type of media accessible by a computer, such as read-only memory (ROM), random access memory (RAM), hard disk drive, compact disc (CD), digital video disc (DVD), or any other type of storage. "Non-transitory" computer-readable media does not include wired, wireless, optical, or other communication links that transmit transient electrical or other signals. Non-transitory computer-readable media includes media that can permanently store data as well as media that can store data and subsequently rewrite it, such as rewritable optical discs or erasable memory devices.

[0018] This patent document also provides definitions for certain other words and phrases throughout. Those skilled in the art will understand that, in many cases (if not most), these definitions apply to the prior and future use of the words and phrases thus defined.

[0019] Before proceeding with the following detailed description, it may be advantageous to clarify the definitions of certain words and phrases used throughout this patent document: the terms “comprising” and “including” and their derivatives indicate non-limiting inclusion; the term “or” is inclusive, meaning and / or; the phrases “associated with” and “associated with” and their derivatives may mean including, being included in, interconnected with, containing, contained within, connected to or connected to, coupled to or coupled to, capable of communicating with, cooperating with, intertwined, juxtaposed, adjacent, bound to or bound to, having, having the properties of, etc.; and the term “controller” means any device, system or part thereof that controls at least one operation, such device may be implemented in hardware, firmware or software or some combination thereof. It should be noted that the functionality associated with any particular controller may be centralized or distributed, whether local or remote.

[0020] Furthermore, the various functions described below can be implemented or supported by one or more computer programs, each computer program being formed by computer-readable program code and embodied in a computer-readable medium. The terms "application" and "program" refer to one or more computer programs, software components, instruction sets, procedures, functions, objects, classes, instances, associated data, or portions thereof suitable for implementation in appropriate computer-readable program code. The phrase "computer-readable program code" includes any type of computer code, including source code, object code, and executable code. The phrase "computer-readable medium" includes any type of media accessible by a computer, such as read-only memory (ROM), random access memory (RAM), hard disk drive, compact disc (CD), digital video disc (DVD), or any other type of storage. "Non-transitory" computer-readable media does not include wired, wireless, optical, or other communication links that transmit transient electrical or other signals. Non-transitory computer-readable media includes media that can permanently store data as well as media that can store data and subsequently rewrite it, such as rewritable optical discs or erasable memory devices.

[0021] This patent document provides definitions of certain words and phrases throughout, and those skilled in the art will understand that, in many cases (if not most), these definitions apply to both the prior and future use of the words and phrases thus defined.

[0022] Beneficial effects

[0023] According to at least one embodiment of this disclosure, efficient error correction coding integrated with transport diversity can be performed. Attached Figure Description

[0024] To gain a more complete understanding of this disclosure and its advantages, reference will now be made to the following description taken in conjunction with the accompanying drawings, in which the same reference numerals denote the same parts:

[0025] Figure 1 An example wireless network is shown, which is an embodiment of the principles of this disclosure and is based on certain aspects of this disclosure.

[0026] Figure 2A An example user equipment network is shown, which is an embodiment of certain aspects of this disclosure and can implement the principles of this disclosure;

[0027] Figure 2B An example base station network is shown, which is an embodiment of certain aspects of this disclosure and can implement the principles of this disclosure;

[0028] Figure 3A This is a block diagram illustrating a communication system according to certain aspects of this disclosure and an embodiment that can implement the principles of this disclosure;

[0029] Figure 3B This is a flowchart illustrating a transmitter method according to certain aspects of this disclosure;

[0030] Figure 3C This is a detailed flowchart illustrating the encoding steps in a transmitter method according to certain aspects of this disclosure;

[0031] Figure 3D This is a detailed flowchart illustrating the diversity mapping steps in a transmitter method according to certain aspects of this disclosure;

[0032] Figure 3E This is a flowchart illustrating a receiver method according to certain aspects of this disclosure.

[0033] Figure 4 This is a diagram illustrating an example of the rank property of diversity transformation according to certain aspects of this disclosure;

[0034] Figure 5 This is a diagram illustrating exemplary diversity transformation, diversity transformation output erasure scene family, and sub-channel allocation partitioning according to certain aspects of this disclosure;

[0035] Figure 6A This is a diagram showing the configuration parameters of a first embodiment of the principles of this disclosure;

[0036] Figure 6B This is a chart comparing the performance of the first embodiment of the principles of this disclosure with that of a reference polar code.

[0037] Figure 7 This is a block diagram of a terminal or UE 700 according to an embodiment of the present disclosure.

[0038] Figure 8 This is a block diagram of a base station 800 according to an embodiment of the present disclosure. Detailed Implementation

[0039] The following discussion Figures 1 to 6B The various embodiments described in this patent document to illustrate the principles of this disclosure are merely illustrative and should not be construed in any way as limiting the scope of this disclosure. Those skilled in the art will understand that the principles of this disclosure can be implemented in any suitably arranged system or device.

[0040] In emerging applications such as Ultra-Reliable Low-Latency Communication (URLLC), there is a requirement to transmit relatively short messages with extremely high reliability and low latency through wireless channels affected by fading, interference, and additive thermal noise. Conventional methods for providing extremely high reliability, such as Automatic Repeat Request (ARQ) and Hybrid ARQ (HARQ) schemes, are incompatible with the low-latency requirement. Therefore, error correction coding methods integrated with transport diversity are needed to provide extremely high reliability without requiring retransmissions. The principle of this disclosure addresses this problem by integrating error correction coding with transport diversity.

[0041] The principles of this disclosure can be used as long as the channel in the system supports transmission diversity (such as a channel comprising multiple independent fading sub-channels). For such channels, the principles of this disclosure introduce a diversity transform between the error-correcting code and the channel, thereby providing a simple interface on both the coding and channel sides, allowing a given diversity transform to be used with different codes and channels.

[0042] One class of codes particularly suitable for use as part of or in conjunction with the principles of this disclosure is polar codes, due to their rate- and length-compatible properties, and the existence of low-complexity methods for encoding and decoding polar codes. In one respect, the principles of this disclosure can be viewed as an extension of polar coding, wherein the polar transformation is extended by diversity transformation using the Kronecker product of two transformations. This construction of multi-core polar codes has been known since the emergence of polar coding [1] and has been extensively studied, particularly in references [2], [3], [4], and [5]. The main focus of references [1], [2], [3], and [4] is to improve performance on discrete memoryless channels. Reference [5] uses hybrid kernels to provide flexible code lengths, thereby avoiding puncturing or shortening.

[0043] Unlike references [1], [2], [3], [4], [5], the principles of this disclosure focus on protecting error-correcting codes (whether polar codes or other types) from extreme forms of outage events occurring in the channel. To achieve this goal, the principles of this disclosure introduce redundancy as part of a diversity transform, effectively using the diversity transform as an inner code capable of resolving channel outage events; therefore, the principles of this disclosure rely on a strictly rectangular diversity transform matrix. In contrast, previous work on multi-core polar codes typically emphasizes performance on memoryless channels, which makes the use of non-square kernel matrices disadvantageous when interfacing with the channel.

[0044] Polar coding in the context of fading channels has been extensively studied, for example in references [6], [7], [8], [9], which combine polar coding with various types of interleaving, signal shaping, or modulation methods to provide resistance to fading and interruptions. The principle of this disclosure differs from this research approach in that it intentionally avoids the use of interleavers. Interleaving is a well-known practical but suboptimal process for dealing with fading. The principle of this disclosure does not rely on interleavers, but rather on an algebraic construction optimized for the rank property of diversity transforms under various channel interruption scenarios. In a preferred embodiment of the principle of this disclosure, the diversity transform is derived from maximum distance separable (MDS) codes, an existing technique for constructing distance-optimal error-correcting codes, as described in

[10] .

[0045] References:

[0046] [1] E. Ar Kan, “Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels,” IEEE Transactions on Information Theory, Vol. 55, No. 7, pp. 3051-3073, July 2009, doi: 10.1109 / TIT.2009.2021379.

[0047] [2] R. Mori and T. Tanaka, “Non-binary polar codes using Reed-Solomon codes and algebraic geometry codes,” published in 2010 IEEE Information Theory Workshop (ITW) IEEE, August 2010, pp. 1-5, doi: 10.1109 / CIG.2010.5592755.

[0048] [3] N. Presman, O. Shapira and S. Litsyn, “Mixed-Kernels Constructions of Polar Codes,” IEEE Journal on Selected Areas in CommunicationsVolume 34, Issue 2, pp. 239-253, February 2016, doi: 10.1109 / JSAC.2015.2504278.

[0049] [4] N. Presman, O. Shapira, S. Litsyn, T. Etzion and A. Vardy, “BinaryPolarization Kernels From Code Decompositions,” IEEE Transactions on Information Theory Volume 61, Issue 5, pp. 2227-2239, May 2015, doi: 10.1109 / TIT.2015.2409257.

[0050] [5] F. Gabry, V. Bioglio, I. Land and JC Belfiore, “Multi-kernel construction of polar codes,” published in 2017 IEEE International Conference on Communications Workshops (ICC Workshops) May 2017, pp. 761–765, doi: 10.1109 / ICCW.2017.7962750.

[0051] [6] SR Tavildar, “An interleaver design for polar codes over slowfading channels,” arXiv:1610.04924 [cs, math] Accessed October 18, 2016. [Online] Available at: http: / / arxiv.org / abs / 1610.04924

[0052] [7] T. Koike-Akino, Y. Wang, SC Draper, K. Sugihara and W. Matsumoto, “Bit-interleaved polar-coded OFDM for low-latency M2M wireless communications,” published in 2 017 IEEE International Conference on Communications (ICC)Paris, France: IEEE, May 2017, pp. 1-7, doi:10.1109 / ICC.2017.7996931.

[0053] [8] H. Ju, M. Kim, D. Lee, M. Jang and S.-H. Kim, “Diversity Guaranteeing Transmission of Polar Codes over Block Fading Channels,” in 2022 IEEE Globecom Workshops December 2022, pp. 480-485, doi: 10.1109 / GCWkshps56602.2022.10008535.

[0054] [9] K. Niu and Y. Li, “Polar Coded Diversity on Block Fading Channels via Polar Spectrum,” IEEE Transactions. Signal Processing. Volume 69, pp. 4007-4022, 2021, doi: 10.1109 / TSP.2021.3094652.

[0055]

[10] FJ MacWilliams and NJA Sloane, The Theory of Error Correcting Codes (Principles of Error Correction Codes), Vol. 16. In North-Holland Mathematical Library, Vol. 16, Amsterdam: North-Holland, 1977.

[0056] The publications listed above are incorporated herein by reference.

[0057] The embodiments of this disclosure will now be described in detail with reference to the accompanying drawings.

[0058] In describing the embodiments, descriptions relating to technical content known in the art and not directly related to this disclosure will be omitted. This omission of unnecessary descriptions is intended to prevent obscuring the main concept of this disclosure and to more clearly convey that main concept.

[0059] For the same reason, some elements may be exaggerated, omitted, or shown schematically in the accompanying drawings. Furthermore, the sizes of the elements do not perfectly reflect their actual sizes. In the accompanying drawings, identical or corresponding elements are provided with the same reference numerals.

[0060] The advantages and features of this disclosure, as well as the ways in which it is implemented, will become apparent from the following detailed description of embodiments in conjunction with the accompanying drawings. However, this disclosure is not limited to the embodiments set forth below, but can be implemented in various different forms. The following embodiments are provided only to fully disclose this disclosure and to inform those skilled in the art of its scope, and this disclosure is limited only by the scope of the appended claims. Throughout the specification, the same or similar reference numerals denote the same or similar elements. Furthermore, in describing this disclosure, detailed descriptions of known functions or constructions incorporated herein are omitted if it is determined that such detailed descriptions would unnecessarily obscure the subject matter of the disclosure. The terms described below are defined in consideration of their function in this disclosure and may vary depending on the intent or convention of the user, operator, or other practice. Therefore, the definitions of these terms should be determined based on the entire contents of the specification.

[0061] The terms used in the following description to refer to access nodes, network entities, messages, interfaces between network entities, various types of identification information, etc., are provided as examples for illustrative purposes only. Therefore, this disclosure is not limited to the terms described below, and other terms with equivalent technical meanings may be used. Where appropriate, these terms may also be replaced with those defined in the 3GPP Technical Specification (TS).

[0062] In the following description, the terms physical channel and signal may be used interchangeably with data or control signal. For example, the term PDSCH (Physical Downlink Shared Channel) refers to the physical channel through which data is transmitted, but the term PDSCH may also be used to refer to the data itself. That is, in this disclosure, the expression "transmitting physical channel" can be interpreted as equivalent to the expression "transmitting data or signal via physical channel".

[0063] In this disclosure, higher-layer signaling refers to a signaling method that uses the downlink data channel of the physical layer to transmit signals from a base station to a terminal or uses the uplink data channel of the physical layer to transmit signals from a terminal to a base station. Higher-layer signaling can be understood as RRC (Radio Resource Control) signaling or MAC (Media Access Control) control element (CE).

[0064] Hereinafter, a base station is an entity that allocates resources to a terminal and can be at least one of gNode B, eNode B, Node B, base station (BS), radio access unit, base station controller, and nodes on a network. A terminal can include user equipment (UE), mobile station (MS), cellular phone, smartphone, computer, or multimedia system capable of performing communication functions. In this disclosure, downlink (DL) refers to the radio link through which the base station transmits signals to the UE, while uplink (UL) refers to the radio link through which the UE transmits signals to the base station. Furthermore, the following description may use LTE or LTE-A systems as examples, but embodiments of this disclosure can also be applied to other communication systems with similar technical backgrounds or channel types. Examples of such communication systems may include 5G mobile communication technologies (5G, New Radio, and NR), 6G mobile communication technologies developed after LTE-A, and the hereinafter 5G or 6G may be a concept encompassing existing LTE, LTE-A, or other similar services. Additionally, embodiments of this disclosure can be applied to other communication systems with modifications, based on the judgment of those skilled in the art, without significantly departing from the scope of this disclosure.

[0065] In the following, “A or B” as described in this disclosure may be understood to include A, B, or both A and B.

[0066] Furthermore, "at least one of A, B and C" as described in this disclosure can be understood to include A, B, C or any combination thereof.

[0067] Furthermore, “A / B” as described in this disclosure can be understood as A and / or B, which may include A, B, or both A and B.

[0068] In the specific embodiments of this disclosure described below, terms or components included in this disclosure may be expressed in a singular or plural form, depending on the presented specific embodiments. However, such singular or plural expressions are suitably chosen for ease of description, and this disclosure is not limited to a singular or plural number of components. Components expressed in a plural form may be implemented as a single component, while components expressed in a singular form may be implemented as multiple components.

[0069] The accompanying drawings or flowcharts described below illustrate exemplary methods that can be implemented according to the principles of this disclosure, and various modifications can be made to the methods shown in the flowcharts of this disclosure. For example, although shown as a series of steps, the various steps in the drawings or flowcharts may overlap, occur in parallel, occur in different orders, or be repeated. In other examples, any step may be omitted or replaced with another step.

[0070] In this document, it should be understood that each box in the flowchart illustration, and combinations of boxes in the flowchart illustration, can be executed by computer program instructions. These computer program instructions can be loaded onto the processor of a general-purpose computer, special-purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for performing the functions specified in the flowchart boxes. These computer program instructions can also be stored in a computer-usable or computer-readable storage medium capable of directing the computer or other programmable data processing apparatus to operate in a particular manner, such that the instructions stored in the computer-usable or computer-readable storage medium produce an article of writing including instruction means for performing the functions specified in the flowchart boxes. The computer program instructions can also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable data processing apparatus, thereby producing a process executed by the computer, such that the instructions, which execute on the computer or other programmable data processing apparatus, provide steps for performing the functions specified in the flowchart boxes.

[0071] Furthermore, each box may represent a module, section, or portion of code, which includes one or more executable instructions for performing a specified logical function. It should also be noted that in some alternative implementations, the functions marked in the boxes may not occur in the order shown. For example, two boxes shown consecutively may actually be executed substantially simultaneously, or, depending on the functions involved, the boxes may sometimes be executed in reverse order.

[0072] As used in embodiments of this disclosure, "~cell" refers to a software element or hardware element that performs a predetermined function, such as a field-programmable gate array (FPGA) or application-specific integrated circuit (ASIC). However, the meaning of "~cell" is not always limited to software or hardware. A "~cell" can be configured to be stored in addressable storage media or to execute one or more processors. Thus, a "~cell" includes, for example, software elements, object-oriented software elements, components such as class elements and task elements, processes, functions, attributes, procedures, subroutines, sections of program code, drivers, firmware, microcode, circuits, data, databases, data structures, tables, arrays, and parameters. Components and functions provided by a "~cell" can be combined into a smaller number of components and "~cells," or divided into additional components and "~cells." Furthermore, components and "~cells" can be implemented to reproduce one or more CPUs within a device or secure multimedia card. Additionally, in embodiments, a "~cell" may include one or more processors.

[0073] It should be understood that each box in a flowchart, as well as combinations of flowcharts, can be executed by one or more computer programs including instructions. The entirety of these one or more computer programs can be stored in a single memory device, or the one or more computer programs can be partitioned, with different parts stored in different multiple memory devices.

[0074] Any function or operation described herein may be processed by a single processor or combination of processors. The single processor or combination of processors is circuitry that performs the processing and includes circuitry such as an application processor (AP, e.g., a central processing unit (CPU)), a communication processor (CP, e.g., a modem), a graphics processing unit (GPU), a neural processing unit (NPU) (e.g., an artificial intelligence (AI) chip), a Wi-Fi chip, a Bluetooth® chip, a global positioning system (GPS) chip, a near field communication (NFC) chip, a connectivity chip, a sensor controller, a touch controller, a fingerprint sensor controller, a display driver integrated circuit (IC), an audio CODEC chip, a universal serial bus (USB) controller, a camera controller, an image processing IC, a microprocessor unit (MPU), a system-on-a-chip (SoC), an IC, etc.

[0075] It should be understood that, according to the claims and description in the specification, various embodiments of this disclosure can be implemented in hardware, software, or a combination of hardware and software.

[0076] Any such software may be stored in a non-transitory computer-readable storage medium. The non-transitory computer-readable storage medium stores one or more computer programs (software modules), the one or more computer programs including computer-executable instructions that, when executed individually or jointly by one or more processors of an electronic device, cause the electronic device to perform the methods of this disclosure.

[0077] Any such software may be stored in the form of volatile or non-volatile storage devices, such as read-only memory (ROM) whether erasable or rewritable, or in the form of memory such as random access memory (RAM), memory chips, devices, or integrated circuits, or on optically or magnetically readable media such as CDs, DVDs, magnetic disks, or magnetic tapes. It should be understood that the storage devices and storage media are various embodiments of non-transitory machine-readable storage devices adapted to store one or more computer programs including instructions that, when executed, implement various embodiments of this disclosure. Therefore, various embodiments provide programs including code for implementing the means or methods claimed in any one of the claims of this specification, and non-transitory machine-readable storage devices for storing such programs.

[0078] The methods and apparatus presented in the embodiments of this disclosure are not limited to the individual embodiments, but can also be applied by combining all or some of the embodiments presented in this disclosure. Therefore, as those skilled in the art will understand, the embodiments of this disclosure can be modified and applied without significantly departing from the scope of this disclosure. In such cases, even if certain terms are described differently in different embodiments, they can be used interchangeably or in combination if their underlying concepts are equivalent. For example, for the same or equivalent concepts, even if one embodiment uses the expression "A" while another embodiment uses the expression "B," such expressions can be understood as interchangeable, replaceable, or combinable.

[0079] The operating principles of this disclosure will be described in detail below with reference to the accompanying drawings. In the following description of this disclosure, detailed descriptions of well-known functions or configurations will be omitted if it is determined that such detailed descriptions would unnecessarily obscure the main points of this disclosure. Furthermore, the terminology described below is defined with regard to the functions of this disclosure, and the definitions may vary depending on the intentions or practices of the user or operator. Therefore, the definitions should be determined based on the overall content of this specification.

[0080] For the sake of simplicity, FDD and TDD are both considered as duplex methods for both DL signaling and UL signaling.

[0081] Although the following exemplary description and embodiments assume orthogonal frequency division multiplexing (OFDM) or orthogonal frequency division multiple access (OFDMA), this disclosure can be extended to other OFDM-based transmission waveforms or multiple access schemes, such as filtered OFDM (F-OFDM).

[0082] This disclosure covers several components that can be used in combination or together, or that can operate as a standalone solution.

[0083] Before discussing the details of the principles of this disclosure, let’s list the basic symbols that will be used throughout.

[0084] symbol instruct It is a set The elements of any two sets. and ,symbol express yes A subset of, that is, Each element is The elements of any set. ,write To indicate The complement of the specified universal set; writing To indicate Size (number of elements). (For real numbers) , express The absolute value. (symbol) Represents the empty set. (Set) The partition is an ordered set of sets. , making And for each , If divided A partition is called a nontrivial partition if it contains at least two non-empty sets; otherwise, it is called a trivial partition. Therefore, in order to discuss sets… Non-trivial partitioning There must be and It should also be noted that the partition has been defined as an ordered set of sets, because the order will be important in the following description.

[0085] Using vectors and matrices over algebraic structures (primarily finite fields) to represent various signals and perform encoding and decoding operations on them. Given a... A vector of components ,say The length is , will set Called The index set, and will Called The element or first Coordinates. For vectors any subset of the index ,write To indicate by The index is located in elements in Subvectors ,in The elements in Listed in ascending index order. For example, for and ,have .

[0086] Use uppercase letters to represent matrices over fields. For example, Indicates having lines and Columns An array or matrix containing entries. Located in the row and number Columns. For matrices ,symbol and They represent The inverse (if it exists) and transpose of the matrix. Given two matrices. and , express and The product of . Given vectors sum matrix ,use This represents their product. For these products to be meaningful, the matrices and vectors involved must have compatible dimensions. Any two matrices... and The Kronecker product is defined as .

[0087] Typically, we consider indexed sets of signals or objects in a system that are not necessarily numerical in nature. In this case, the terms "word" and "array" are used to represent one-dimensional and two-dimensional sets, respectively. More precisely, the term "word" is used to represent a set of single integers. A collection of indexes, such as The term "array" is used to represent an array of two sets of integers. and Cartesian product A collection of indexes, such as and Characters and arrays are represented using symbols similar to vectors and matrices, respectively.

[0088] Figure 1 This is a schematic diagram of a wireless network 100 according to certain aspects of this disclosure and an embodiment that can implement the principles of this disclosure. The wireless network 100 is for illustrative purposes only and does not limit the scope of this disclosure. Specifically, this disclosure can be applied to wired communication systems and wireless systems.

[0089] Wireless network 100 includes evolved Node B (eNB) 101, eNB 102, and eNB 103. eNB 101 communicates with eNB 102 and eNB 103. eNB 101 also communicates with at least one Internet Protocol (IP) network 130, such as the Internet, a proprietary IP network, or other data network.

[0090] Depending on the network type, other known terms may be used instead of "Evolved Node B" or "eNB," such as "base station," "BS," "gNodeB," or "access point." For convenience, the terms "Evolved Node B" and "eNB" are used in this patent document to refer to network infrastructure components that provide wireless access to remote terminals. Furthermore, depending on the network type, other known terms may be used instead of "User Equipment" or "UE," such as "Mobile Station" (or "MS"), "User Station" (or "SS"), "Remote Terminal," "Wireless Terminal," or "User Equipment." For convenience, the terms "User Equipment" and "UE" are used in this patent document to refer to remote wireless devices that wirelessly access the eNB, regardless of whether the UE is a mobile device (such as a mobile phone or smartphone) or is generally considered a fixed device (such as a desktop computer or vending machine).

[0091] eNB 102 provides wireless broadband access to network 130 to a first plurality of user equipments (UEs) within its coverage area 120. The first plurality of UEs includes: UE 111, which may be located in a small business (SB); UE 112, which may be located in an enterprise (E); UE 113, which may be located in a WiFi hotspot (HS); UE 114, which may be located in a first residence (R1); UE 115, which may be located in a second residence (R2); and UE 116, which may be a mobile device (M) such as a cellular phone, wireless laptop computer, wireless personal digital assistant (PDA), tablet computer, etc. eNB 103 provides wireless broadband access to network 130 to a second plurality of UEs within its coverage area 125. The second plurality of UEs includes UE 115 and UE 116. In some embodiments, one or more of the eNBs 101-103 may communicate with each other and with the UEs 111-116 using WiFi, WiMAX, 3G, 4G, LTE, LTE-A, 5G, or other current or future advanced wireless communication technologies.

[0092] The dashed lines indicate the approximate extent of coverage areas 120 and 125. For illustrative and explanatory purposes, coverage areas 120 and 125 are shown only as approximately circular. It should be clearly understood that coverage areas associated with the eNB (such as coverage areas 120 and 125) may have other shapes, including irregular shapes, depending on the configuration of the eNB and variations in the radio environment associated with natural and man-made obstacles.

[0093] As described in more detail below, one or more of eNB 101, eNB 102, and eNB 103 include a 2D antenna array that can be used in conjunction with embodiments of this disclosure. In some embodiments, one or more of eNB 101, eNB 102, and eNB 103 support codebook design and architecture for systems with 2D antenna arrays.

[0094] although Figure 1 An example of a wireless network 100 is shown, but more details can be found on other wireless networks. Figure 1 Various modifications can be made. For example, wireless network 100 can include any number of eNBs and any number of UEs arranged in any suitable configuration. Furthermore, eNB 101 can communicate directly with any number of UEs and provide these UEs with wireless broadband access to network 130. Similarly, each eNB 102-103 can communicate directly with network 130 and provide UEs with direct wireless broadband access to network 130. Additionally, eNBs 101, 102, and / or 103 can provide access to other or additional external networks, such as external telephone networks or other types of data networks.

[0095] Embodiments of the principles of this disclosure shown in the figures and described below can be implemented in an eNB (such as eNB 102) and / or a UE (such as UE 116), as described in further detail below.

[0096] Figure 2A An example user equipment network is shown, which is an embodiment of the principles of this disclosure and is based on certain aspects of this disclosure. Figure 2A The embodiment of UE 116 shown is for illustrative purposes only, and Figure 1 UEs 111-116 can have the same or similar configurations. However, UEs have a wide variety of configurations, and Figure 2A This disclosure is not intended to limit the scope of any particular implementation of the UE.

[0097] UE 116 includes an antenna 205, a radio frequency (RF) transceiver 210, transmit (TX) processing circuitry 215, a microphone 220, and receive (RX) processing circuitry 225. UE 116 also includes a speaker 230, a controller / processor 240, an input / output (I / O) interface 245, an input device 250 (such as a keyboard), a display 255, and memory 260. Memory 260 includes a basic operating system (OS) program 261 and one or more applications 262. One or some combination of the OS program 261, applications 262, or other applications, can be programmed to employ the principles of this disclosure as described in the various embodiments herein.

[0098] RF transceiver 210 receives incoming RF signals transmitted by the eNB of network 100 from antenna 205. RF transceiver 210 can down-convert the incoming RF signals to generate an intermediate frequency (IF) signal or baseband signal that will be sent to RX processing circuitry 225. RX processing circuitry 225 sends the processed signal to speaker 230 (e.g., for voice data) or to controller / processor 240 for further processing (e.g., for web browsing data).

[0099] The TX processing circuit 215 receives analog or digital voice data from the microphone 220 or other outgoing baseband data (such as web page data, email, or interactive video game data) from the controller / processor 240 as input data for at least some of the source data blocks. The RF transceiver 210 receives the outgoing processed baseband signal or IF signal from the TX processing circuit 215 and upconverts the baseband signal or IF signal into an RF signal transmitted via the antenna 205.

[0100] The controller / processor 240 may include one or more processors or other processing devices and executes a basic OS program 261 stored in memory 260 to control the overall operation of the UE 116. For example, the controller / processor 240 may control the RF transceiver 210, the RX processing circuitry 225, and the TX processing circuitry 215 to receive forward channel signals and transmit reverse channel signals according to known principles. In some embodiments, the controller / processor 240 includes at least one programmable microprocessor or microcontroller, while in other embodiments, the main processor includes dedicated circuitry and (optionally) programmable logic or processing circuitry.

[0101] The controller / processor 240 is also capable of executing other processes and programs residing in the memory 260, such as operations for channel quality measurement and reporting for a system with a 2D antenna array. The controller / processor 240 can move data and / or instructions into or out of the memory 260 as needed by the processes being executed. In some embodiments, the controller / processor 240 is configured to execute an application 262 based on an OS program 261 or in response to signals received from an eNB or operator. The controller / processor 240 is also coupled to an I / O interface 245, which enables the UE 116 to connect to other devices such as laptop computers and handheld computers. The I / O interface 245 is the communication path between these accessories and the controller / processor 240. The controller / processor 240 can be configured to perform the functions performed by the encoder, diversity mapper, decoder, and diversity demapper described below.

[0102] The controller / processor 240 is also coupled to an input device 250 (which may be a single button, an array, or other set of buttons) and a display 255. The operator of the UE 116 can use the input device 250 to input data into the UE 116. The display 255 may be a touchscreen display or another display capable of displaying text and / or at least limited graphics (such as graphics from a website) and receiving touch input from the user according to known practices.

[0103] The memory 260 is coupled to the controller / processor 240, and at least a portion of the memory 260 may include random access memory (RAM), while another portion of the memory 260 may include flash memory or other read-only memory (ROM).

[0104] although Figure 2A An example of UE 116 is shown, but it is possible to modify it. Figure 2A Make various changes. For example, you can combine, further subdivide, or omit elements according to specific needs. Figure 2A The controller / processor 240 contains various components, and additional components can be added. As a concrete example, the controller / processor 240 can be divided into multiple processors, such as one or more central processing units (CPUs), one or more application-specific integrated circuits (ASICs), one or more field-programmable gate arrays (FPGAs), and one or more graphics processing units (GPUs). Furthermore, although... Figure 2A The UE 116 is shown configured as a mobile phone or smartphone, but the UE can be configured to operate as other types of mobile devices or fixed devices.

[0105] Figure 2B An example of an evolved Node B (eNB) network is shown, which is an embodiment of the principles of the present disclosure and is based on certain aspects of the present disclosure. Figure 2B The embodiment of eNB 102 shown is for illustrative purposes only, and Figure 1 Other eNBs can have the same or similar configurations. However, eNBs have a wide variety of configurations, and Figure 2B This disclosure is not intended to limit the scope to any particular implementation of the eNB. It should be noted that eNB 101 and eNB 103 may include the same or similar structures as eNB 102.

[0106] like Figure 2BAs shown, the eNB 102 includes multiple antennas 270a-270n, multiple RF transceivers 272a-272n, transmit (TX) processing circuitry 274, and receive (RX) processing circuitry 276. In some embodiments, one or more of the multiple antennas 270a-270n include a 2D antenna array. The eNB 102 also includes a controller / processor 278, a memory 280, and a backhaul or network interface 282.

[0107] RF transceivers 272a-272n receive incoming RF signals from antennas 270a-270n, such as signals transmitted by the UE or other eNBs. RF transceivers 272a-272n down-convert the incoming RF signals to generate IF signals or baseband signals. The IF signals or baseband signals are sent to RX processing circuitry 276, which generates a processed signal by filtering, decoding, and / or digitizing the baseband signals or IF signals. RX processing circuitry 276 then sends the processed signal to controller / processor 278 for further processing.

[0108] TX processing circuit 274 receives at least some input data. TX processing circuit 274 implements circuitry for encoding, multiplexing, and / or digitizing outgoing baseband data to generate a processed signal. RF transceivers 272a-272n receive the outgoing processed signal from TX processing circuit 274 and upconvert the baseband signal or IF signal into an RF signal transmitted via antennas 270a-270n.

[0109] The controller / processor 278 may include one or more processors or other processing devices that control the overall operation of the eNB 102. For example, the controller / processor 278 may control the RF transceivers 272a-272n, the RX processing circuitry 276, and the TX processing circuitry 274 to receive forward channel signals and transmit reverse channel signals, based on known principles. The controller / processor 278 may also support additional functions, such as more advanced wireless communication capabilities. The controller / processor 278 may support any of a wide variety of other functions in the eNB 102. In some embodiments, the controller / processor 278 includes at least one microprocessor or microcontroller, while in other embodiments, the main processor includes dedicated circuitry (e.g., for controlling encoding and decoding processes, code punching and / or shortening processes, data mapping, etc.) and (optionally) programmable logic or processing circuitry. The controller / processor 278 may be configured to perform the functions performed by the encoder, diversity mapper, decoder, and diversity demapper described in the following specification.

[0110] The controller / processor 278 is also capable of executing programs and other processes, such as a basic operating system, residing in the memory 280. The controller / processor 278 is also capable of supporting channel quality measurement and reporting for systems with 2D antenna arrays. In some embodiments, the controller / processor 278 supports communication between entities. The controller / processor 278 can move data and / or instructions into or out of the memory 280 as needed by the processes being executed.

[0111] The controller / processor 278 is also coupled to a backhaul or network interface 282. The backhaul or network interface 282 allows the eNB 102 to communicate with other devices or systems via a backhaul connection or via a network. Interface 282 can support communication via any suitable wired or wireless connection. For example, when the eNB 102 is implemented as part of a cellular communication system (such as a system supporting 3G, 4G, 5G, LTE, or LTE-A), interface 282 can allow the eNB 102 to communicate with other eNBs via a wired or wireless backhaul connection. When the eNB 102 is implemented as an access point, interface 282 can allow the eNB 102 to communicate via a wired or wireless local area network or via a wired or wireless connection to a larger network (such as the Internet). Interface 282 includes any suitable structure that supports communication via a wired or wireless connection, such as an Ethernet transceiver or an RF transceiver.

[0112] Memory 280 is coupled to controller / processor 278. A portion of memory 280 may include RAM, while another portion may include flash memory or other ROM. In some embodiments, multiple instructions are stored in the memory. These instructions are configured to cause controller / processor 278 to perform system and / or non-system encoding or decoding processes, shortening processes, data mapping, etc.

[0113] although Figure 2B An example of an eNB 102 is shown, but more can be found on other eNBs. Figure 2B Various modifications can be made. For example, the eNB 102 may include any number of the components shown. As a specific example, the access point may include multiple interfaces 282, and the controller / processor 278 may support routing functions for routing data between different network addresses. As another specific example, although shown as a single instance including the TX processing circuitry 274 and the RX processing circuitry 276, the eNB 102 may include multiple instances of each (such as one instance per RF transceiver).

[0114] Figure 3AThis is a block diagram illustrating a communication system 300 according to certain aspects of this disclosure and an embodiment that can implement the principles of this disclosure. System 300 includes a source 310, a transmitter 320 connected to the source, a channel 330 connected to the transmitter 320, a receiver 340 connected to the channel 330, and a destination 350 connected to the receiver 340. Transmitter 320 includes an encoder 321 and a diversity mapper 322. Channel 330 includes a plurality of subchannels 330-1 to 330-s, wherein... It is the number of sub-channels and Receiver 340 includes a diversity demapper 341 and a decoder 342. The fundamental objective of communication system 300 is to reliably deliver data from source 310 to destination 350. The principles of this disclosure primarily relate to the situation where transmitter 320 and receiver 340 are designed and operated to achieve extremely high reliability by utilizing diversity transmission across channel 330. Reference is now made to... Figures 3B to 3E The transmitter 320 and receiver 340 are described in more detail. The transmitter can be a base station and the receiver can be a terminal, or vice versa.

[0115] Figure 3B This is a flowchart illustrating a transmitter method 360 implemented according to an embodiment of the present disclosure. The transmitter method 360 is implemented at a transmitter 320 and includes an encoding step 361 and a diversity mapping step 362. The encoding step 361 is performed at an encoder 321 and includes: (i) identifying data words from a source. ; and (ii) based on the encoder input mapping relationship and multiple encoding functions, according to the data words Identify multiple encoder output subwords ,in, Greater than one. Diversity mapping step 362 is performed at diversity mapper 322 and includes: (i) based on diversity transformation and subchannel allocation relationship, according to the output subwords of multiple encoders. Identify multiple channel input subwords ; and (ii) transmitting multiple channel input subwords via the channel. The channel includes multiple sub-channels. Related to the number of sub-channels and Greater than one.

[0116] The flowcharts above illustrate example methods that can be implemented according to the principles of this disclosure, and various modifications can be made to the methods shown in the flowcharts herein. For example, although shown as a series of operations, the various operations in the figures may overlap, occur in parallel, occur in different orders, or occur multiple times. In another example, operations may be omitted or replaced with other operations.

[0117] Figure 3CThis is a detailed flowchart illustrating the encoding step 361 in a transmitter method 360 according to certain aspects of this disclosure. Figure 3C The encoding step 361 of method 360 further includes the following step: 3612, based on the encoder input mapping relationship, according to the data words Identify multiple encoder input subwords ; and 3613, based on multiple encoding functions, according to the input sub-words of multiple encoders. Identify multiple encoder output subwords .

[0118] The flowcharts above illustrate example methods that can be implemented according to the principles of this disclosure, and various modifications can be made to the methods shown in the flowcharts herein. For example, although shown as a series of operations, the various operations in the figures may overlap, occur in parallel, occur in different orders, or occur multiple times. In another example, operations may be omitted or replaced with other operations.

[0119] In a preferred embodiment of the principles of this disclosure, for each , No. Encoder output subword Through the first Encoding function and the first Encoder input subword Related, among which, It can depend on length , With irrelevant length And for all , .

[0120] Figure 3D This is a detailed flowchart illustrating the diversity mapping step 362 in a transmitter method 360 according to certain aspects of this disclosure. Figure 3D The diversity mapping step 362 also includes the following steps: 3621, based on diversity transformation, according to the sub-words output by multiple encoders Identify multiple diversity transform output subwords ,in, Greater than 3622, based on sub-channel allocation relationships, output sub-words according to multiple diversity transforms. Identify multiple channel input subwords The sub-channel allocation relationship includes the sub-channel allocation division. Among them, sub-channel allocation division It is a set The non-trivial partition of , where, belong In the case of the first Diversity transform output subword Assigned to the Sub-channel input word ; and 3623, for each Through the first Sub-channel transmission number Channel input subword .

[0121] The flowcharts above illustrate example methods that can be implemented according to the principles of this disclosure, and various modifications can be made to the methods shown in the flowcharts herein. For example, although shown as a series of operations, the various operations in the figures may overlap, occur in parallel, occur in different orders, or occur multiple times. In another example, operations may be omitted or replaced with other operations.

[0122] The principles of this disclosure are compatible with a wide variety of encoder input mappings. To illustrate one such mapping, it is assumed that the encoder input subwords are given as design constraints. Size Let the data word include element: for a given , ,in, This can also be viewed as a design constraint. The encoder input mapping relationship can be determined based on a pair of... Specify, where, yes The non-trivial partition of makes , ;and It makes and |、 The set. For each The pair via Define the input mapping; in other words, for each The encoder input mapping relationship will The character Copy to Corresponding sub-character Above. Those skilled in the art will recognize that choosing a nontrivial partition... The key aspect is less about sets Its composition is more about the base. , The choice is subject to constraints. ,in, and At least two of them are strictly positive. Regarding Choice, set The composition of the components is a major design issue that critically affects the performance obtained through the principles of this disclosure.

[0123] In some preferred embodiments of the principles of this disclosure, polar coding is included at encoder 321. When polar coding is used, a pair based on the above definition is used. The encoder input mapping enables the use of existing polar code design methods. Specifically, given a nontrivial partition... ,gather The polar code can be selected based on existing technical design rules, such as density evolution or by sequentially listing the polar code bit channels according to reliability. An example of a polar code is provided below to illustrate this type of encoder input mapping.

[0124] At this point, the application can be explained. The reason for the requirement of non-trivial partitioning (excluding trivial partitioning). If trivial partitioning were allowed within the framework of the principles of this disclosure, the resulting system would lack diversity and would be equivalent to prior art systems. Trivial partitioning (its generation parameter selection) is acceptable when there is no fading in the channel or the fading is sufficiently minimal to tolerate the fading within the specified reliability requirements. ) becomes a nontrivial partition (its generation parameter selection) A better option. The benefits of the principles of this disclosure become apparent when extremely high reliability, requiring preparedness for a wide range of interruption events, is needed.

[0125] A second example of encoder input mapping is, for each , will the character Mapped to The character Therefore, it is only necessary to set the conditions. Replace with This type of encoder input mapping rule is systematic in the sense that data subwords are transparently presented as part of the encoder output subwords. Therefore, the principles of this disclosure are compatible with systematic coding and can take advantage of its benefits.

[0126] System 300 is configured to make the numerical parameters , and satisfy and Except according to data words In addition to the data symbols, each encoder input subword may also contain a freeze symbol and a parity symbol. The freeze symbol is fixed to a predetermined value. The parity symbol is dynamically calculated into the data word. The function. Data word It may also contain built-in redundancy such as cyclic redundancy check (CRC) symbols.

[0127] In some embodiments of the principles of this disclosure, the communication system can be configured with multiple encoder input mappings and / or multiple subchannel allocation relationships to provide flexibility regarding code rate, code length, and diversity. Such multi-configuration systems are common in current wireless standards such as 5G and are a requirement of future 6G standards. When the principles of this disclosure are used with such multiple configurations, coordination problems arise between the transmitter and receiver. In some cases, the receiver can employ a blind detection method to discover the configuration at the transmitter. Alternatively, encoder input mapping candidates (relationship-1, relationship-2, and relationship-3) are configured by sending Radio Resource Control (RRC) messages, and a relationship (e.g., relationship-2) can be specified by sending a Medium Access Control (MAC) Control Element (CE) or Downlink Control Information (DCI) (or L1 signaling). Similarly, if multiple subchannel allocation methods are available, the same scheme can be used for the diversity mapping step. For example, given (or predefined or preconfigured) multiple diversity mapping methods (method-1, method-2, and method-3), a relationship (e.g., method-2) can be specified by sending at least one of the corresponding RRC message or DCI. As another example, diversity mapping methods (method-1, method-2, and method-3) are configured by sending RRC messages, and one method (e.g., method-2) can be specified by sending at least one of MAC CE or DCI. Furthermore, one of these relationships can omit diversity transmission for backward compatibility or for the absence of diversity transmission.

[0128] In both the transmitter and receiver, one or more parameters related to at least one of the following can be obtained: encoder input mapping configuration, multiple encoding functions, diversity transformation method, and subchannel allocation configuration. Some of these parameters may be predetermined, some may be signaled between the transmitter and receiver, and some may be determined by the transmitter and / or receiver itself. It is also possible to pre-set a set including the aforementioned parameters and to transmit signaling indicating a specific set of parameters between the transmitter and receiver.

[0129] By employing a modular architecture that adds diversity transforms as modules between various conventional error correction coding methods and channels, the principles of this disclosure offer a wide range of implementation options in a flexible manner. Current wireless standards and envisioned future wireless standards are equipped with control channels and signaling methods to coordinate transmitters and receivers, thereby leveraging the principles of this disclosure in rapidly changing wireless transmission environments.

[0130] More details about the specific design methodology of transmitter 320 will be provided below; however, let's now turn our attention back to... Figure 3A The discussion of system 300 will continue with a focus on channel 330 and receiver 340.

[0131] Channel 330 responds to multiple channel input subwords This generates multiple channel output subwords. . Specifically, no. Sub-channel 330-i responds to the first Channel input subword And thus the first Channel output subword , The internal details of channel 330 are beyond the scope of the principles of this disclosure. Transmitter 320 and receiver 340 do not need to know the internal details of channel 330. The principles of this disclosure can be applied using a statistical model of channel 330. In the statistical model, multiple channel output subwords... It can be a one-dimensional or multi-dimensional real-valued or complex-valued symbol or signal from a discrete or continuous alphabet; or it can be an array of probability distributions, likelihood ratios, or log-likelihood ratios, etc. Additionally, It may include various forms of auxiliary information about the multiple sub-channels 330-1 to 330-s, such as estimates of fading coefficients, interruption events, received signal strength, SNR estimates, etc.; the principles of this disclosure are designed to make full use of such auxiliary information about the channel state.

[0132] Turning now to receiver 340 and outlining its general characteristics. The principles of this disclosure rely on an iterative receiver process at receiver 340, implemented through the interaction of diversity demapper 341 and decoder 342 over a series of iterations. This process comprises four main steps: initialization, diversity demapping, decoding, and termination. Initialization involves receiving multiple channel output subwords from channel 330. The diversity demapping and decoding steps involve iterative loops. Termination involves generating a receiver output and sending that output to destination 350. Several possible ways exist to implement this iterative receiver process. A basic implementation is described below.

[0133] Figure 3E This is a flowchart illustrating a receiver method 380 according to certain aspects of the present disclosure. Receiver method 380 is implemented at receiver 340 and includes multiple steps 381 to 389, wherein steps 382 to 384 are implemented at diversity demapping unit 342; steps 385 to 388 are implemented at decoder 342; and steps 381 and 389 respectively indicate the start and end states of the receiver method as a whole.

[0134] Process Initiation: The process begins in step 381 and proceeds to step 382 when new channel data arrives. In step 382, ​​diversity demapper 341 receives multiple channel output subwords from channel 330. In step 383, the diversity demapper 341 sets the global iteration counter. The value is initialized to 1. Global iteration counter. It has global visibility, that is, its value is visible to both the diversity demapper 341 and the decoder 342 when they execute the steps of method 380.

[0135] Iterative process at position 341 of the diversity demapper: (The rest of the text appears to be a fragmented and incomplete sequence, possibly related to a problem or process.) At the start of the next iteration, in step 384, the diversity demapper 341 receives the feedback message sent by the decoder 342 as part of the previous iteration; in the first iteration, there will be no decision feedback message, so the diversity demapper continues in the first iteration without attempting to obtain decision feedback. Still in step 384, the diversity demapper identifies the first iteration based on the initially received multiple channel output subwords and any decision feedback received from the decoder 342 in the previous iteration. Decoder input statistics , will the Decoder input statistics Send to decoder 342, and begin waiting for the first [transmission / received data] from decoder 342. Feedback on the judgment.

[0136] Iteration process at decoder 342: In step 385, decoder 342 obtains the... Decoder input statistics And identify the first Partial decoder decision. In step 386, decoder 342 checks the... Whether the termination condition is met. If the termination condition is not met, decoder 342 executes step 387, which includes identifying the first... The judgment feedback message will be the first The decision feedback message is sent to the diversity demapper 341, and the global iteration counter is incremented by one. At this time, the... The next iteration is completed, and the next iteration begins in step 384, where the diversity demapper takes control of the process.

[0137] Process completion: When the termination condition in step 386 is met, decoder 342 proceeds to step 388, which includes identifying the decoder output and sending it to destination 350. The next step 389 marks the end of the receiver process. The process can return to step 381 and initiate a new receiver process.

[0138] Further details of possible implementations of the various steps of receiver method 380 are now provided. In a basic embodiment of receiver method 380, the first... Partial decoder decisions may include the first Decoding encoder input subword And the first The judgment feedback message may include the first The decoder outputs the subword. Then, if and Reproduce the first The actual values ​​of the encoder input subword and output subword and If so, steps 385 and 387 are considered successful. Step 386... Termination conditions may include checking the global iteration counter. Is the value less than the number of encoder input subwords? Step 386 Termination conditions may also include, for example, by checking Checking for decoding failure involves performing a cyclic redundancy check. If step 388 is reached without detecting a decoder failure, the decoder output may include the decoded data words. ,in, It is achieved by using the inverse of the encoder input mapping rule (used at transmitter 320) to decode the encoder input subwords from multiple encoders. … Identified. Otherwise, if step 388 is reached upon detecting a decoder failure, decoder 342 may send an error code to the destination to indicate decoder failure. Regarding the diversity demapping steps of the basic embodiment, the first... Decoder input statistics This can include the following conditional probability distribution: given multiple channel output subwords and the previous received from decoder 342 in the previous iteration The encoder output subword for decoding , No. Encoder output subword The conditional probability distribution of the possible values. (In the first iteration, (This should be interpreted as an empty list of subwords.) Some simulation results for this type of basic receiver are given below, along with a precise description of each step of receiver method 380.

[0139] The above-described basic embodiment of receiver method 380 spends [time / cost] in this embodiment. This iteration generates the decoded data. In a sense, it is serial. Serial receiver implementations minimize hardware complexity at the cost of latency. The receiver method 380 depicted in the flowchart is sufficiently general to accommodate parallelized implementations, in which the diversity demapper 341 and decoder 342 cooperate to generate multiple partial decoder decisions in each iteration and complete the receiver process with fewer iterations. This parallelized implementation reduces latency at the cost of hardware complexity. As those skilled in the art will recognize, there exists a basis... Figure 3E The flowchart illustrates many ways to implement receiver method 380 in parallel. A direct alternative is to employ multiple copies of the serial implementation of receiver method 380 in parallel, wherein each copy is configured according to an index set. Various permutations Various determined sequences The encoder input subwords that generate multiple decoders … In this implementation, parallel copies of the serial receiver process can aggregate their partial decoder decisions and decision feedback messages to assist each other. Once multiple encoders input subwords... Once each member in the algorithm has a reliable estimate, the parallel decoding process terminates.

[0140] Clearly, the parallel decoder process described above is highly complex to implement; however, if implemented properly, it can reduce latency and improve performance (by lowering the probability of decoding errors) because it uses diversity (in addition to transport diversity) in the decoding process. Parallel decoding can be chosen to reduce latency and improve performance when symmetries are built into the diversity transform and various decoding orders are equal to each other under these symmetries. In another variation of the parallel receiver process implemented according to receiver method 380, an adaptive decoding order can be used, where multiple copies of receiver method 380 observe multiple channel output subwords. The set of decoding order permutations is then adaptively selected. The adaptive decoding method prioritizes permutations more likely to succeed and can improve performance or reduce implementation costs. The principles of this disclosure set forth a framework for utilizing diversity in transmission, which in turn lays the foundation for a wealth of ideas for utilizing diversity. The scope of the principles of this disclosure covers all such variations of receiver method 380 that will be apparent to those skilled in the art from the description given herein.

[0141] The flowcharts above illustrate example methods that can be implemented according to the principles of this disclosure, and various modifications can be made to the methods shown in the flowcharts herein. For example, although shown as a series of operations, the various operations in the figures may overlap, occur in parallel, occur in different orders, or occur multiple times. In another example, operations may be omitted or replaced with other operations.

[0142] To avoid overwhelming the description with unnecessary details, the description of ordered execution is omitted. Figure 3E The flowchart describes the common control functions necessary for the steps. Such details will be obvious to those skilled in the art.

[0143] The focus will now turn to preferred embodiments of the principles of this disclosure, and specific encoding and decoding methods will be described. For this purpose, the mathematical formulation of the principles of this disclosure will be considered using standard vector spaces and concepts of probability theory. This mathematical formulation is intended to illustrate the principles of this disclosure in a clear and precise manner; it should not be construed as limiting the scope of the principles of this disclosure in any way.

[0144] The mathematical description begins with transmitter 320. Signal processing steps within transmitter 320 will be represented using vectors and matrices. Row vectors will be used to represent signals (words or subwords), and matrices will be used to represent operations on the signals. Multiple encoder input subwords will be used. Multiple encoder output sub-words and multiple diversity transform output subwords Represented as a row vector. For simplicity, let's assume it's used... and The vectors have a common length Allowed for use The vector has the property that can depend on length , Under this assumption regarding length, for , , , will have vector representation , and In a preferred embodiment of the principles of this disclosure, for all The length parameter satisfies Multiple encoder input subwords The sum of the lengths, that is It must be large enough to accommodate the input data words. All elements. If and input data words On a common alphabet, for example, if they are all binary vectors, then there must be ,in, Indicates input data word The length. Even if and The principles of this disclosure also allow for the same alphabet. This is because additional symbols, such as freeze symbols or parity symbols, can be inserted into the encoder input subwords.

[0145] In a preferred embodiment of the principles of this disclosure, the encoding operation and diversity transformation operation are linear operations represented by matrices. matrix Indicates the first Encoder input Mapped to the Encoder output The Encoding function, and will the first The encoding function is called the first Encoding matrix, .use matrix This represents a diversity transformation, and the diversity transformation is called the diversity transformation matrix.

[0146] In a preferred embodiment, encoder 321 is configured to calculate From the first Encoder input subword Identify the first Encoder output subword ,in, express The Elements; or equivalently, configured to be computed To identify, .

[0147] In a preferred embodiment, diversity mapper 322 is configured to compute ,in, , Output sub-words based on multiple encoders Identify multiple diversity transform output subwords ,in, Represents the diversity transformation matrix The Entries. The equivalent form of diversity transformation is: ,in, and , Or, more compactly represented as ,in, It is an encoder output array, and It is a diversity transform output array. Note that... and The The rows are respectively equal to and ;and and The The columns are respectively equal to and From the perspective of implementation, diversity transformation include independent diversity transformations , This independent diversity transformation can be computed in parallel or semi-parallel manner to reduce latency (at the cost of increased hardware complexity).

[0148] Diversity mapper 322 also includes sub-channel allocation relationships, which further include the sub-channel allocation partitioning described above. If and only if , and At that time, diversity mapper 322 will... Diversity transform output subword Assign (reuse) to the Channel input subword In the middle (and thus through the first) Sub-channel 330-i transmission Therefore, for each , No. Channel input subword Including elements in some arbitrary order . No. Interruption events occurring in sub-channel 330-i erase their indexes. belong All diversity transform output subwords .exist internal, effective payload It can be serialized in any desired order. For example, it can have... ,in, ,and It is written in ascending index order. A list of all elements. It may be beneficial to use serialization tailored to various modulation schemes (such as bit-interleaved coded modulation), which can better mitigate the effects of the first... The effects of interference and / or fading within subchannel 330-i. The principles of this disclosure are entirely flexible in this respect; they can be used in conjunction with any serialization method or interleaver.

[0149] Now we turn to a more precise mathematical formulation of receiver 340. Receiver 340 outputs sub-words to multiple channels based on the probabilistic model of communication system 300. Decode and identify the decoded data words. Probabilistic models treat signals (words, subwords) as samples (realized values) of random variables or vectors over various ensembles of possible values. By convention, samples (realized values) are represented by lowercase letters, and the corresponding random variables, vectors, words, or subwords are represented by uppercase letters. For example, Indicates and The corresponding random sub-word. Similarly, , and They are respectively with , and The corresponding random subwords. The probability mass function and probability density function are represented using standard notation, for example, Represents a given event Time Event The conditional probability. When the stochastic ensemble is clearly known from the context. and Sometimes, writing Instead .

[0150] A key part of the probability model at receiver 340 is the channel transition probability function. This indicates that multiple channel input subwords are being transmitted. In the case of receiving multiple channel output words The probability quality or probability density. From the perspective of the principles of this disclosure, the channel model of particular importance is the block fading channel model. This model will be discussed below when presenting some simulation results.

[0151] A key task in the receiver implementation is to specify and compute multiple decoder input statistics at the diversity demapper 341. Here, the general process of various well-established receiver designs can be followed. For example, This can include the following conditional probabilities : Output subword for given channel And the assumption that all previous decoder decisions were correct. , No. Encoder output subword The conditional probability of the possible values. This type of decoding is used when receiver 340 employs successive elimination decoding. It is suitable. The principles of this disclosure can also be implemented to make This includes likelihood ratios or log-likelihood ratios, which can improve the numerical stability of the calculation. Various approximations are introduced in the calculations to reduce computational complexity or keep numerical stability under control. Those skilled in the art will be able to adapt this method for calculating soft channel information to the problems described herein without difficulty. The scope of the principles of this disclosure covers all such methods for calculating decoder input statistics.

[0152] Generally speaking, due to the size of the ensemble involved, The computation of this can be a daunting problem. This difficulty is significantly alleviated if the channel 330 can be modeled using a product-like probability distribution. One type of channel that makes the computational problem more manageable is the block fading channel model, and this type of channel will be considered in the following examples.

[0153] This completes the description of system 300. Those skilled in the art will appreciate that the principles of this disclosure feature an architecture that separates error correction functionality from diversity mapping functionality; these two functions can be implemented independently so that they can interact with each other through a standardized interface. This allows a given diversity mapper / demapper pair to be used in conjunction with many different types of encoder / decoder pairs. This property is important in adaptive coding schemes where the code length and code rate can change from one use of system 300 to another.

[0154] To implement the various preferred embodiments of the principles of this disclosure, two important topics still need to be discussed further: first, polar coding as a specific FEC scheme in conjunction with the principles of this disclosure; and second, specific diversity transformations that provide the promised high-reliability transmission. Since diversity transformations play a central role in configuring the rest of system 300, this discussion will begin with diversity transformations.

[0155] Various methods for the design and performance analysis of diversity transformation are now described. The goal is to find a suitable diversity transformation that matches the error-correcting characteristics of the forward error-correcting codes embodied by encoder 321 and decoder 342 with the characteristics of channel 330. For diversity transformation design and analysis, diversity mapper 322, channel 330, and diversity demapper 341 are considered in isolation from the rest of system 300, and the focus is on a single-transmission scenario without any error-correcting codes. Diversity mapper 322 is configured with diversity transformation and subchannel allocation partitioning. In this context, diversity transformation is derived from any finite field. On matrix Let a single scenario include: (i) randomly selecting a vector. (ii) as input for diversity transformation; (ii) by applying diversity transformation ,Will Mapping to diversity transform output (iii) According to the division ,Will Mapped to multiple sub-channel inputs (iv) Transmitted via channel 330 ,in Through the first Sub-channel 330-i is used for transmission.

[0156] For diversity mapper design and performance evaluation, channel 330 was chosen to be modeled as an erasure channel. Specifically, the third... Sub-channel 330- ( The model is a block erasure channel, which is modeled with a certain probability. Input delivered without any errors or by probability erase ,in, It is the block erase probability.

[0157] The focus is on the extreme scenario where multiple sub-channels suffer block erasure. This is achieved through a set of... This is used to specify such a scenario; the set indicates the index of the sub-channel that has undergone block erasure. This set will be discussed below. This is called a subchannel erasure scenario. Given a subchannel erasure scenario... If and only if At that time, the first The subchannel erases its input. A family of subchannel erasure scenarios is also considered, such as... , of which each This refers to a specific sub-channel erasure scenario. The terms "subchannel interruption" and "subchannel erasure" are used synonymously.

[0158] In the sub-channel erasure scenario Down to channel input Part of The erasure causes a change in the output of the transformation. Part of The erasure, among which, It has All partition elements The union of the sub-channels. Therefore, sub-channel allocation partitioning. Erasing each subchannel scenario Link to diversity transform output erasure scene ,in, Similarly, Erase each subchannel scene family Link to diversity transform output erase scene family ,in, , .

[0159] Given a diversity transform output erasure scenario The diversity solution mapper 341 can only obtain the system of equations. Instead of the complete system of equations ,in, express exist The complement of the set, and Indicates deletion The index belongs to All columns and from The obtained matrix. According to a fundamental fact of linear algebra, the matrix... For full rank, that is Only then can the diversity solution mapper 341 recover the unknowns from the simplified system of equations. This observation is presented as a design criterion for diversity transformation.

[0160] Full rank criterion. If for each ,matrix If both are full-rank matrices, then a pair is called a family of erased scenes including diversity transformation and diversity transformation output. It satisfies the full rank criterion.

[0161] Diversity transform output erase scene family Depends on subchannel erase scenario family Sub-channel allocation partitioning Given a diversity transformation and sub-channel erase scenario family Various sub-channel allocation and partitioning methods can be tried. Until a pair is found Diversity transform output erasure scene family that satisfies the full rank criterion Therefore, a key feature of the principle of this disclosure is diversity transformation. and diversity transform output erase scene family The conditions for satisfying the full rank criterion are as follows: With sub-channel erase scene family Related, among which, Each element includes an interruption of at least one of the multiple sub-channels.

[0162] From the perspective of the principles of this disclosure, it is desirable to use a pair that satisfies the full-rank criterion. However, even if a pair satisfying the full-rank criterion cannot be found... Alternatively, the principles of this disclosure can be used. A more refined design criterion, called a "rank profile," can be used to study how full-rank criteria fail and the severity of the failure, and to select a design accordingly. To describe a given pair... The rank profile allows for the introduction of more symbols. Let For any Diversity transformation matrix, and let ( ) indicates by from Deleted forward Obtained through action Matrix. Therefore, ,and Depend on The Arriving at the The rows are composed of lines, and their order is the same as in the order of lines. The order is the same.

[0163] Rank profile. Given a pair This pair have diversity transformation and diversity transform output erase scene family ,Will rank profile matrix Defined as Matrix, its first entry equal The rank, that is , Rank profile matrix The The line is called about the first Erase mode The rank profile.

[0164] To illustrate the above definition and discuss its significance, let's turn to examples. Figure 4 Figure 400 is an illustration of an example of the rank property of a diversity transformation according to certain aspects of this disclosure. The first illustrative example in Figure 400 includes a first diversity transformation. Sub-channel allocation partitioning 402 and sub-channel erasure scenario family 403. The first diversity transformation 401 has dimension , And is intended for use in subchannel erasure scenario family 403 with On channel 330 of each sub-channel. Using the symbols of the single transmission scenario described above, the sub-channel allocation is divided into 402, and the multiple sub-channel inputs are... Give, Therefore, as shown in 404, the diversity transform output erase scene family is obtained. As shown in 405, there is Similar calculations show that for all , Therefore, the first diversity transform 401 satisfies the full rank criterion. The rank profile matrix of the first diversity transform 401 is shown in 406. The rank profile matrix shows that each input coordinate of the first diversity transform 401 is fully protected against the erasure of the scene family 404 by the diversity transform output.

[0165] The second illustrative example shown in Figure 400 includes a second diversity transformation. 411. Subchannel allocation partitioning 402. Subchannel erasure scenario family 403. Diversity transform output erasure scenario family 404. In this case, the full rank criterion fails because the rank under erasure is still 4, but the number of rows is 8. The rank profile matrix of the second diversity transform 411 is shown in 412. The rank profile matrix 412 shows that in the erasure scenario... In the current scenario, only transformed input components 5, 6, 7, and 8 can be recovered; however, in the erase scenario... and Under these conditions, only transform input components 3, 4, 7, and 8 can be recovered. Therefore, if the second diversity transform 411 is used, only transform input components 7 and 8 can be reliably recovered in all erasure modes; the remaining six components must be frozen. Those skilled in polar coding will readily verify that the second diversity transform 411 is a third-order polar transform over the binary domain: ,in, .matrix Used as length Diversity transform of ordinary polar codes. There is no sub-channel erasure scenario family 403 that satisfies the full rank condition. The fact that there is a submatrix is ​​a weakness, and the principle of this disclosure remedies this weakness by using a diversity transformation that satisfies the full rank condition.

[0166] A preferred method for constructing diversity transforms. A preferred method for constructing diversity transforms is to begin with the construction of a maximum distance separable (MDS) code and adapt it to the principles of this disclosure. To illustrate this, see [link to disclosure]. Figure 5 , Figure 5 Figure 500 illustrates exemplary diversity transformations 501 to 509, diversity transformation output erasure scene families 521 to 525, and subchannel allocation divisions 531 to 535, according to certain aspects of this disclosure.

[0167] exist Figure 5 In this paper, matrices are used instead of sets to represent diversity transform output erasure scenarios; this provides a more compact representation. For example, matrix 521 represents a family of diversity transform output erasure scenarios. In this case, the first line of 521 corresponds to the first scenario. Encode the second line of 521 for the second scenario. Encode it, and the third line of 521 corresponds to the third scenario. Encode the data. The encoding rule is: if the first element of matrix 521 is... If the number of entries is 0, then .exist Figure 5 In addition, more compact notation is used to represent sub-channel allocation divisions. For example, the division shown in 531 The complete symbol can be written as ,in, , , .

[0168] Diversity transforms 501 to 509 are constructed based on Reed-Solomon (RS) codes or their extended versions. In the following text, the symbols... Indicates that the block length is Dimensions And the minimum distance is The RS code. As is well known, in any field... Above, for any and All exist The RS code is an MDS code because for a given... and The RS code satisfies the Plotkin boundary equation. In the following text, we also consider extended versions of RS codes (single, double, or triple), which are also MDS codes.

[0169] Diversity transformations 501 to 508 are... The generator matrix of the RS code is constructed. The domain used in this paper... Based on satisfying The primitive element And has elements The construction includes: by... Each entry Replace with ),Will Value RS generating matrix Convert to Value diversity transformation matrix ,in, From arrive On Mapping of a set of matrices. The specific mapping used in Examples 501 to 508 is defined as follows: , , and .if yes On If the matrix is ​​a subset of the set, then the resulting set transformation matrix is ​​a subset of the set. yes On matrix.

[0170] Mapping In fact, it is used in the following senses On Matrix representation For any , and In general, such a field representation exists. For any finite field... and any There is use On Matrix The representation of For the method of constructing this matrix representation, refer to page 106 of "FJ MacWilliams and NJA Sloane, The Theory of Error Correcting Codes, vol. 16 in North-Holland Mathematical Library, vol. 16. Amsterdam: North-Holland, 1977". Therefore, the following description is used to explain the binary field. The specific diversity transformation constructions of the principles disclosed herein are more generally applicable to diversity transformation constructions over larger domains.

[0171] As a first example of this construction, consider diversity transformation 501. Diversity transformation 501 is achieved by using the mapping described above. Replace each entry in the generated matrix with its image, from which... On Code generation matrix The diversity transform 501 has 4 rows and 6 columns, twice the number of rows and columns of the aforementioned generator matrix, respectively. It can be verified that diversity transform 501 satisfies the full-rank criterion under the erasure scenario 521. Therefore, diversity transform 501, together with subchannel allocation partition 531, provides complete protection against interruption of any single subchannel in channel 330, which has three subchannels.

[0172] Diversity transformation 502 is achieved by using mapping Replace each element of the generated matrix with its image, from the single-expansion matrix. Code generation matrix The diversity transform 502 satisfies the full-rank criterion under the erasure scenario 522. Therefore, the diversity transform 502, together with the subchannel allocation partition 532, provides complete protection against interruption of any two subchannels of the channel 330 with four subchannels.

[0173] Diversity transformation 503 is achieved by using mapping The image of each element in the generated matrix replaces that element, from the double-extended matrix. Generating matrix The diversity transform 503 satisfies the full-rank criterion under the erasure scenario 523. Therefore, the diversity transform 503, together with the subchannel allocation partition 533, provides complete protection against the interruption of any three subchannels in channel 330 with five subchannels.

[0174] The RS code used in the construction of diversity transforms 502 and 503 is obtained through extended cyclic... It was obtained from the code. It can be obtained from... Starting with different generator matrices of the code, and expanding those generator matrices, new diversity transformations that also satisfy the full-rank criterion are obtained. Diversity transformations 504, 505, 506, and 507 are obtained in this way.

[0175] Diversity transformation 504 is achieved by using the representation Conversion Code generation matrix The diversity transform 504 satisfies the full rank criterion under the erasure scenario 521. The diversity transform 504 and the subchannel allocation partition 531 provide complete protection against interruption of any single subchannel in channel 330 with 3 subchannels.

[0176] Diversity transformation 505 is used to represent From single-fold extension Code generation matrix The diversity transform 505 satisfies the full rank criterion under the erasure scenario 522. The diversity transform 505 and the subchannel allocation partition 532 provide complete protection against the interruption of any two subchannels in channel 330 with four subchannels.

[0177] Diversity transformation 506 uses the representation From dual extension Code generation matrix The diversity transform 506 satisfies the full rank criterion under the erasure scenario 523. The diversity transform 506 and the subchannel allocation partition 533 provide complete protection against the interruption of any three subchannels in channel 330 with five subchannels.

[0178] Diversity transformation 507 is used to represent From the triple extension Code generation matrix The diversity transform 507 satisfies the full rank criterion under the erasure scenario 524. The diversity transform 507 and the subchannel allocation partition 534 provide complete protection against the interruption of any three subchannels in channel 330 with six subchannels.

[0179] Diversity transform 508 is obtained by converting diversity transform 502 into systematic form through elementary row operations. Diversity transform 508 satisfies the full rank criterion under erasure scenario 522. Diversity transform 508 and subchannel allocation partition 532 provide complete protection against interruption of any two subchannels in channel 330 with four subchannels.

[0180] Diversity transformation 509 is based on A single parity-check code with a length of 3, a dimension of 2, and a minimum distance of 2 is used. Diversity transform 509 satisfies the full-rank criterion under erasure scenario 525. Diversity transform 509 and subchannel allocation partition 535 provide complete protection against interruption of any single subchannel in channel 330 with 3 subchannels. It should be noted that the single parity-check code is an MDS code. The construction in this paper can be considered by... or dimensions on a larger domain ,length and distance The single parity check code was promoted.

[0181] In summary, how to construct a full-rank diversity transform starting from RS codes and their extensions has been shown. Due to complexity considerations, relatively small diversity transforms are expected to be the most practical; therefore, attention will be limited to such diversity transforms. The general diversity transformation Demapping the channel output (in other words, calculating such as...) The complexity of providing decoder input statistics to decoder 342 using the probability of ( ) is This is a first-order operation. Therefore, the principles of this disclosure are expected to be most useful when the size of the diversity transform remains manageable within practical constraints. In this regard, it is of great significance, as will be shown below, when using a transform size of... and of Significant practical advantages have been observed in simulation studies of diversity transformation on [the surface].

[0182] The principles of this disclosure with polar codes are explained. Returning now to Figure 3, we will discuss in detail how polar codes can be implemented as part of system 300. The term "polar code" is used broadly to refer to its encoding, which includes polar transformations. Any error-correcting code, the polarization transformation is derived from a finite field. Multiple (not necessarily identical) kernel matrices Kroneck Given, where, for all , It has of Square matrix. Therefore, polarization transformation Represented as having of Square matrix. The following description applies to this general type of polar code in a broad sense. When using this polar code, the encoder input subwords... Having common length And for all Multiple encoding functions include a common first... Encoding matrix .

[0183] In the case of polar codes, encoder 321 receives data words. Based on the encoder input mapping relationship, the data words are... Mapped to multiple encoder input subwords In, and through calculation Will Encoding into multiple encoder output subwords ,in, , , And among them, the encoder input mapping relationship includes for each set up ,in, yes The non-trivial partition, in which, yes The number of elements, where, It makes The set of sets, where for each , |, among which It is a polarization transformation matrix, and the selection is based on the polar code design relationship. Among them, the design relationships of polar codes include The reliability order of the elements, where, Reliability ranking can be based on polar code design methods such as density evolution tailored to a given channel, or general design methods such as 5G NR polar code bit selection methods, which can be stored in a lookup table.

[0184] Assume that the diversity mapper 322 is agnostic to polarization coding and follows the general principles already discussed above. The combined polarization and diversity transformation operations can be represented as follows: ,for , ,in, Represents the diversity transformation matrix The Elements, and Represents the polarization transformation matrix The element.

[0185] Polarization transformation can be written more compactly as ,in, It is the previously defined encoder output array, and It is defined as The polarization transform input array. Recall that the diversity transform can be represented as... The overall operation can be written as .product It can be calculated as shown in Figure 3. or calculated as This reverses the order of transformations. The first calculation method involves... One polarization transformation, followed by One diversity transformation, while the second method requires A diversity transformation, followed by A polarization transformation. Due to the assumption... Therefore, from a complexity perspective, the first approach is preferred. The first approach also provides flexibility, as it allows diversity transformation to be implemented without modifying the existing polar encoder, thus allowing the diversity transformation to be inserted between encoder 321 and channel 330. This flexibility is essential when the polar encoder is not externally accessible, for example, because it is implemented as part of a custom-designed integrated circuit.

[0186] Those familiar with Elias product codes and matrix Kronecker products will recognize that matrix equations It can be written as ,in, and They are matrices and Column-by-column vectorization. Specifically, and From this perspective, the combination of polarization transformation and diversity transformation is equivalent to the generation matrix. The generated linear code. Generating matrix. yes Matrix, due to the requirements of the principles of this disclosure Therefore, the matrix is ​​not a square matrix. Thus, it has a generating matrix. The code differs from ordinary polar codes that use square polarization transform. The differences between the principles of this disclosure and existing polar coding methods in this respect have been discussed in the background section.

[0187] Polar coding and Figure 3E The receiver method discussed in the paper is 380 compliant. Given the first... Decoder input statistics Decoder 342 can be used to calculate the... Decoding encoder input subword And A type of polarization decoding algorithm is sent back to the diversity demapper 341. The polarization decoding algorithm can be a successive elimination (SC) decoding algorithm, or a variation of SC decoding, such as CRC-assisted SC decoding or CRC-assisted SC list decoding. The type of polarization decoding algorithm that can be used to implement the decoder 342 in accordance with the principles of this disclosure is unrestricted. Polarization coding algorithms with parallel decoding, automorphism-group decoding, etc., are fully compatible with the general framework of the receiver method 380.

[0188] Now let’s turn to some examples to demonstrate the practical utility of the principles of this disclosure. Figure 6A This is a diagram 600 showing the configuration parameters of a first embodiment of the principles of this disclosure. The parameters 600 include a polarization transformation matrix 601, a diversity transformation matrix 602, a payload allocation vector 603, a symbol quality ranking vector 604, and a sub-channel allocation partition 605. The polarization transformation matrix 601 is a matrix of length [missing information]. The standard polarization transform, where , and The diversity transformation matrix 602 has The dimension, in which and Furthermore, the diversity transformation matrix 602, combined with the above, Figure 5 The diversity transformation matrix 505 discussed is the same. The first embodiment is configured to carry a length of... Data words Therefore, the total code rate in the first embodiment is (Generally speaking, the code rate of a combined polarization-diversity code is determined by...) Given that it is equal to the average code rate used for polar coding. With the code rate used for diversity transformation (The product of the two.)

[0189] In the first embodiment, the encoder 321 divides the data words according to the payload allocation vector 603 and the symbol quality sorting vector 604. Mapped to multiple encoder input subwords Payload allocation vector The Element indicator is assigned to the first Encoder input subword Data words The number of elements, Therefore, in the first embodiment, the sub-word From data words respectively The encoder receives 5, 6, 7, and 8 elements. The elements of the symbol quality sorting vector 604 indicate the sorting of the coordinates of the encoder input subwords, where 1 indicates the least preferred position and 8 indicates the most preferred position. Based on these rules, the encoder 321 in the first embodiment prepares the polarization transform input matrix as shown in 606. Polarization transform input matrix The first line of 606 was obtained as This vector contains data words as specified in the first entry of payload allocation vector 603. The payload of the 5 data elements. The five data elements are positioned in the five most preferred (highest quality) positions indicated by the symbol quality sorting vector 604. Therefore, the two vectors 603 and 604, along with the data words... Number of elements Define the matrix together 606 internally The elements occupy A subset of data locations. In the first embodiment, The elements are allocated into U606 in ascending index order. Each data position is assigned from left to right, starting with the first row. This type of allocation is natural; however, the principles of this disclosure are related to data words. The elements in the matrix Within 606 Any other allocation order between the data locations is fully compatible. This statement applies not only to the first embodiment 600, but more generally.

[0190] The polarization transformation and diversity transformation operations in the first embodiment 600 are performed according to the general principles described in the previous description. Specifically, the diversity mapper divides multiple diversity transformation output subwords according to the subchannel allocation partition 605. Assigned to multiple channel input subwords Therefore, diversity transform outputs sub-word pairs. , , , They were respectively assigned to the channel input subwords , , , In the first embodiment, natural serialization is used, making it possible to... and , and Therefore, the first Channel input subword include One portion, , In the first embodiment, the diversity mapper 322 transmits multiple channel input subwords via channel 330. To complete the operation of transmitter 320.

[0191] The channel 330 in the first embodiment includes There are several sub-channels, and the channel transition probability function is used to determine the channel transition probability function. Characterization, in which, It is a vector of block fading coefficients, where, It is the first Sub-channel block fading coefficient, Furthermore, suppose the first The output of the sub-channel is through Related to its input, among which, Is with The corresponding modulation characters, and It is the first Subchannel noise word, .

[0192] Assuming binary phase shift keying (BPSK) modulation is used on all sub-channels, then... have One portion, , where, depends on They are equal to 0 or 1 respectively. equal or , , In BPSK modulation, each subchannel carries one bit per use, therefore, the transmission of a block requires one bit from each subchannel. This is the first time it has been used. In the [number]th [use]. Sub-channel During the entire duration of the first block use, the fading coefficient Keep it fixed. Noise words include Each component And assume that these components have a mean of 0 and a variance of . Statistically independent Gaussian random variables. Under these modeling assumptions, we have Therefore, with The value of is a condition, the first The subchannel is an additive white Gaussian noise (AWGN) channel.

[0193] Consider fading coefficient vector The two scenarios. The first scenario is the "no decay" scenario, in which... In the first scenario, each sub-channel is a pure AWGN channel without fading. The second scenario is a "block fading" scenario, in which... Values ​​are uniformly and randomly selected from set 607. The second scenario corresponds to two of the four sub-channels being constantly interrupted. For example, This corresponds to sub-channels 3 and 4 being interrupted, while the other two sub-channels operate without any fading. The first scenario is defined as a benchmark for measuring the relative performance under the second fading scenario. This completes the description of channel 330 in the first embodiment.

[0194] The receiver 340 in the first embodiment operates according to the general method described above. The diversity demapper 341 in the first embodiment uses the log-likelihood ratio.

[0195]

[0196] As the first Stage decoder input statistics , The diversity demapper 341 operates with complete knowledge of the noise variance. and the block fading coefficient vector valid for the current transmission The log-likelihood ratio is calculated under the condition that successive elimination (SC) decoding is performed. In the first embodiment, the decoder 342 implements successive elimination (SC) decoding.

[0197] A benchmark polar code is used for performance comparison. The performance of the first embodiment specified above will be evaluated by comparing its performance with that of the benchmark polar code. The benchmark polar code is a standard prior art polar code that uses polar transformation. The length is The data word is encoded as having a length of The codeword. Therefore, the dimension of the reference polar code matches the dimension of the code in the first embodiment. In the reference polar code, the polarization transform input word It includes frozen bits and data bits. The data bits are located in the set of positions indicated by the bit selection vector, where the bit selection vector in the reference polar code is equal to (16, 24, 28, 30, 31, 32, 40, 44, 45, 46, 47, 48, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64). This bit selection vector is constructed using existing polarization construction rules and following the 5G NR polar code specification. In the reference polar code, the frozen bits in the polarization transform input word are set to zero. The encoding of the reference polar code is achieved by calculating the codeword as... This is to be completed. The reference polar code is modulated using BPSK on the same channel specified above for the first embodiment. There are four sub-channels in channel 330, and the codewords... section In the Sub-channels are being transmitted. The reference polar code is decoded by a standard successive cancellation (SC) decoder, which is fully aware of the noise variance. and the block fading coefficient vector valid for the current transmission The reference polar code is equipped with a channel interleaver, which is composed of permutations. The codewords (60, 30, 48, 54, 15, 3, 29, 9, 11, 1, 6, 41, 28, 37, 56, 43, 46, 18, 39, 19, 21, 58, 20, 26, 35, 5, 49, 52, 36, 2, 14, 42, 55, 61, 62, 47, 13, 27, 57, 4, 59, 51, 44, 24, 34, 45, 50, 22, 64, 17, 63, 31, 8, 40, 23, 10, 12, 16, 32, 25, 53, 38, 7, 33) are defined, and the interleaver can be turned on or off. If interleaving is used, the codewords... According to the order of substitution It was sent to channel 330. (Permutation) It was found by trying 1000 randomly selected permutations and selecting the best one. One of the advantages of the principle disclosed here is that it eliminates the need for an interleaver.

[0198] Figure 6B This is graph 650, which compares the performance of the first embodiment of the principles of this disclosure with the performance of a reference polar code. In graph 650, the horizontal axis indicates the performance in decibels (dB). For the BPSK system in this paper, based on the AWGN noise variance ,Will Defined as The vertical axis corresponds to the frame error rate (FER). Curves 651 and 652 show the performance curves of the reference polar code and the polar-diversity code in the first embodiment under the first channel scenario, respectively. Curves 651 and 652 show that, in the absence of channel fading, the principles of this disclosure do not provide a gain superior to the reference polar code. Curves 653 and 654 show the performance curves of the reference polar code with and without interleaving under the second channel scenario, respectively. Curves 653 and 654 show that, although interleaving helps, the reference polar code suffers from a severe error floor effect, and the FER stops decreasing even when the SNR increases to a very high value. This indicates that the reference polar code cannot cope with channel outage events defined by the second channel scenario. Curve 655 shows the performance of the first embodiment of the principles of this disclosure under the second channel scenario; there is no error floor, and the performance improves as the SNR increases.

[0199] Figure 650 illustrates the practical utility of the principles of this disclosure as a coding system designed to withstand extreme interruption scenarios. Even if such extreme interruption scenarios are rare, they can be a major performance determinant in applications requiring extremely high reliability under latency constraints. For example, The FER target requires consideration of the probability as Interruption events. An interruption event is any event in a channel that severely interferes with information transmission and renders the channel practically unusable (such as interference, excessive noise, etc.). The principles of this disclosure improve the resilience of forward error correction coding to such catastrophic interruption events (curves 652 and 655), at the cost of some performance degradation under typical operating conditions (curves 651 and 652).

[0200] Figure 7 This is a block diagram of a terminal or UE 700 according to an embodiment of the present disclosure.

[0201] A terminal is an electronic device capable of wireless communication, which may include user equipment (UE) with various form factors, portable phones, smartphones, tablets, IoT devices, etc., and can communicate wirelessly with base stations via wireless channels.

[0202] refer to Figure 7 UE 700 may include at least one transceiver (hereinafter referred to as "transceiver") 701, at least one processor (hereinafter referred to as "processor") 702, and at least one memory (hereinafter referred to as "memory") 703. The transceiver 701, processor 702, and memory 703 of UE 700 may operate according to at least one method or combination thereof corresponding to the above embodiments. However, the components of UE 700 are not limited to... Figure 7The exemplary components are shown in the figure. In another embodiment, UE 700 may include other components besides those described above, or some components may be omitted. Furthermore, in some embodiments, transceiver 701, processor 702, or memory 703 may be integrated as a single chip.

[0203] Transceiver 701 may be a communication circuit that enables UE 700 to send signals to or receive signals from a base station via cellular communication. For example, transceiver 701 may support at least one of various cellular communication technologies, including 3G, 4G, LTE, 5G New Radio (NR), 6G, and all subsequent evolution generations of wireless communication.

[0204] According to an embodiment, UE 700 may include multiple transceivers. When supporting E-UTRA-NR dual connectivity (EN-DC), the UE may include a first transceiver supporting 4G LTE wireless communication and a second transceiver supporting 5G NR wireless communication. According to another embodiment, when supporting NR dual connectivity (NR-DC), UE 700 may include multiple transceivers supporting 5G NR wireless communication. According to yet another embodiment, when supporting near-field wireless communication, UE 700 may individually include a transceiver supporting at least one standard from the set of wireless communication protocol standards defined by protocol standards for Bluetooth, wireless LAN, or WLAN networks (including, but not limited to, the IEEE 802.11-2016 standard or its revisions, such as 802.11ah, 802.11ad, 802.11ay, 802.11ax, 802.11az, 802.11ba, and 802.11be).

[0205] According to an embodiment, transceiver 701 may include various circuit structures for transmitting signals to or receiving signals from a base station via a wireless channel. The signals may include control information and data. For example, transceiver 701 may include an RF transmitter for up-converting and amplifying the frequency of the transmitted signal, and an RF receiver for low-noise amplification and down-converting the frequency of the received signal. Transceiver 701 may output signals received via the wireless channel to processor 702, and may also transmit signals output from processor 702 via the wireless channel.

[0206] Processor 702 can control the general operation of UE 700 according to the embodiments of the present disclosure described above. Processor 702 can be implemented by one or more integrated circuit (or circuit) (IC) chips and can perform various data processing. Processor 702 may include at least one circuit and can execute instructions (or programs, code, data, etc.) stored in memory 703 individually, jointly, or in any combination thereof. Furthermore, processor 702 may include a single-core processor or a multi-core processor and may include processor components containing multiple processing circuits, depending on the specific implementation.

[0207] The processor 702 can be electrically coupled, operationally coupled, or communicatively coupled to the transceiver 701 to control the transceiver 701.

[0208] Processor 702 may include at least one processor (or processor circuitry), and the at least one processor may perform operations individually, jointly, or in any combination thereof. For example, processor 702 may include a communication processor (CP) configured to control communication operations and an application processor (AP) configured to control the execution of higher layers (e.g., the application layer). In a particular embodiment, at least a portion of processor 702 may be included in one chip, and another portion of processor 702 may be included in another chip. Alternatively, at least one processor may be included in another component, such as transceiver 701 or memory 703.

[0209] The processor 702 can execute or control the operation of the UE to perform at least one method or combination of methods according to embodiments of the present disclosure. For example, the processor 702 can control the operation of the UE to process downlink signals received from a base station or to generate and transmit uplink signals to the base station. To this end, the processor 702 can execute computer programs, code, or instructions stored in the memory 703 to control other components of the UE 700, thereby enabling the execution of various operations.

[0210] Memory 703 corresponds to a hardware storage device capable of temporarily or permanently storing information and may include one or more storage media. For example, memory 703 may include a memory component containing one or more storage media. For example, one or more storage media may include permanent memory such as a hard disk drive, flash memory or read-only memory (ROM), semi-permanent memory such as random access memory (RAM), cache memory, or combinations thereof.

[0211] The memory 703 can be electrically coupled, operationally coupled, or communicatively coupled to the processor 702 and can be accessed by the processor 702.

[0212] Memory 703 may store computer programs, code, or instructions executable by processor 702. According to embodiments, the computer programs, code, or instructions executable by processor 702 may be stored in a single memory or distributed across two or more memories. By executing the instructions stored in memory 703, processor 702 can perform various functions according to embodiments of this disclosure.

[0213] According to embodiments of this disclosure, the operation of the UE discussed below can be performed individually, jointly, or in any combination by a computer program, code, or instructions stored in memory 703, by at least one processor configured to execute the features of this disclosure alone, jointly, or in any combination thereof, a processing circuit configured not to execute instructions, or a component of a processing circuit configured not to execute instructions.

[0214] Figure 8 This is a block diagram of a base station 800 according to an embodiment of the present disclosure.

[0215] Base station 800 can communicate wirelessly with at least one UE located within the area of ​​base station 800 via a wireless channel.

[0216] refer to Figure 8 The base station 800 may include at least one transceiver (hereinafter referred to as "transceiver") 801, at least one processor (hereinafter referred to as "processor") 802, and at least one memory (hereinafter referred to as "memory") 803. The transceiver 801, processor 802, and memory 803 of the base station 800 may operate according to at least one method or combination thereof corresponding to the above embodiments. However, the components of the base station 800 are not limited to... Figure 8 The exemplary components are shown in the figure. In another embodiment, base station 800 may include other components besides those described above, or some components may be omitted. Furthermore, in some embodiments, transceiver 801, processor 802, or memory 803 may be integrated as a single chip.

[0217] Transceiver 801 may be a communication circuit that enables base station 800 to transmit signals to or receive signals from UE 700 via cellular communication. For example, transceiver 801 may support various cellular communication technologies including 3G, 4G, LTE, 5G New Radio (NR), 6G, and all subsequent evolution generations of wireless communication. According to embodiments, transceiver 801 may include various circuit structures for transmitting signals to or receiving signals from the UE via a wireless channel. The signals may include control information and data. For example, transceiver 801 may include an RF transmitter for up-converting and amplifying the frequency of the transmitted signal and an RF receiver for low-noise amplification and down-converting the frequency of the received signal. Transceiver 801 may output signals received via the wireless channel to processor 802 and may transmit signals output from processor 802 via the wireless channel.

[0218] Processor 802 can control the general operation of base station 800 according to the embodiments of the present disclosure described above. Processor 802 can be implemented by one or more integrated circuit (or circuit) (IC) chips and can perform various data processing. Processor 802 may include at least one circuit and can execute instructions (or programs, code, data, etc.) stored in memory 803 individually, jointly, or in any combination thereof. Furthermore, processor 802 may include a single-core processor or a multi-core processor and may include processor components containing multiple processing circuits, depending on the specific implementation.

[0219] The processor 802 can be electrically coupled, operationally coupled, or communicatively coupled to the transceiver 801 to control the transceiver 801.

[0220] Processor 802 may include at least one processor (or processor circuitry), and the at least one processor may perform operations individually, jointly, or in any combination thereof. In a particular embodiment, at least a portion of processor 802 may be included in one chip, and another portion of processor 802 may be included in another chip. Alternatively, at least one processor may be included in another component, such as transceiver 801 or memory 803.

[0221] The processor 802 can execute or control the operation of the base station to perform at least one method or combination of methods according to embodiments of the present disclosure. For example, the processor 802 can control the operation of the base station to generate and transmit downlink signals to the UE or process uplink signals received from the UE. Alternatively, the base station can transmit signals to or receive signals from neighboring base stations, transmit signals received from the UE to upper-layer nodes of the network, or transmit signals transmitted from upper-layer nodes of the network to the UE. For this purpose, the processor 802 can execute computer programs, code, or instructions stored in the memory 803 to control other components of the base station 800, thereby enabling the execution of various operations.

[0222] Memory 803 corresponds to a hardware storage device capable of temporarily or permanently storing information and may include one or more storage media. For example, memory 803 may include a memory component containing one or more storage media. For example, one or more storage media may include permanent memory such as a hard disk drive, flash memory or read-only memory (ROM), semi-permanent memory such as random access memory (RAM), cache memory, or combinations thereof.

[0223] The memory 803 can be electrically coupled, operationally coupled, or communicatively coupled to the processor 802 and can be accessed by the processor 802.

[0224] Memory 803 may store computer programs, code, or instructions executable by processor 802. According to embodiments, the computer programs, code, or instructions executable by processor 802 may be stored in a single memory or distributed across two or more memories. By executing the instructions stored in memory 803, processor 802 can perform various functions according to embodiments of this disclosure.

[0225] According to embodiments of this disclosure, the operation of the base station discussed below can be performed individually, jointly, or in any combination by a computer program, code, or instructions stored in memory 803, by at least one processor configured to execute the features of this disclosure alone, jointly, or in any combination thereof, a processing circuit configured not to execute instructions, or a component of a processing circuit configured not to execute instructions.

[0226] Although a particular “error correction coding method and apparatus in combination with diversity mapping” is described in detail herein and depicted in the accompanying drawings, it should be understood that the subject matter covered by this disclosure is limited only by the claims. While this disclosure has been described in conjunction with exemplary embodiments, various changes and modifications can be made by those skilled in the art. This disclosure is intended to cover such changes and modifications that fall within the scope of the appended claims. The description in this application should not be construed as implying that any particular element, step, or function is a necessary or critical element that must be included within the scope of the claims: the scope of the patent subject matter is limited only by the granted claims. Furthermore, unless the exact phrase “apparatus for…” or “step for…” is explicitly used in a particular claim, followed by a participle phrase identifying the function, these claims are not intended to invoke 35 USC § 112(f) against any of the appended claims or claim elements. Terms used in the claims, such as (but not limited to) “mechanism,” “module,” “device,” “unit,” “component,” “element,” “building,” “device,” “machine,” “system,” “processor,” or “controller,” should be understood and intended to refer to structures known to a person skilled in the art that are further modified or enhanced by the features of the claims themselves, and are not intended to invoke 35 USC § 112(f).

[0227] Furthermore, although specific embodiments of this disclosure have been described in detail, various modifications can be made without departing from the scope of this disclosure. Therefore, the scope of this disclosure should not be limited to the described embodiments, but should be defined by the claims and their equivalents.

Claims

1. A transmitter device in a communication system, the transmitter device comprising: Memory, storing instructions; and Processing circuitry, coupled to a memory and configured to at least partially cause the transmitter device based on the instructions: Identify data characters from the source , Based on the encoder input mapping relationship and multiple encoding functions, according to the data words Identify multiple encoder output subwords ,in Greater than one, Based on diversity transformation and sub-channel allocation relationships, the sub-words are output according to the multiple encoders. Identify multiple channel input subwords , The plurality of channel input subwords are transmitted via the channel. The channel includes multiple sub-channels, among which... Related to the number of sub-channels and Greater than one.

2. The transmitter device according to claim 1, wherein, The plurality of encoding functions include a plurality of encoding matrices. Furthermore, the processing circuitry is configured to cause the transmitter device, at least in part, based on the instructions: Based on the encoder input mapping relationship, according to the data words Identify multiple encoder input subwords ,as well as For each and Through calculation According to the input sub-words of the multiple encoders Identify the output subwords of the multiple encoders ,in, yes The Elements, among which yes The Elements, among which yes The Elements, among which yes The number of elements, where, yes The number of elements, satisfy And for each , .

3. The transmitter device according to claim 1, wherein, Diversity transformation includes diversity transformation matrix Furthermore, the processing circuitry is configured to cause the transmitter device, at least in part, based on the instructions: For each and Through calculation The sub-words are output according to the plurality of encoders. Identify multiple diversity transform output subwords ,in, yes The Elements, among which, yes The Elements, among which, yes The Elements, among which, yes The number of elements, and for each , The same, among which, It is the number of subwords output by the diversity transform, and satisfy , Based on the sub-channel allocation relationship, the sub-words are output according to the multiple diversity transforms. Identify the multiple channel input subwords .

4. The transmitter device according to claim 2, wherein, The encoder input mapping relationship includes: for each ,set up ,in, yes The non-trivial partition, in which, It makes The set of sets, where for each , ,in, It is a data word The number of elements, where, .

5. The transmitter device according to claim 4, wherein, It is the polarization transformation matrix, and It is based on the polar code design relation selection, which includes the polar code design relation. The reliability order of the elements, where, .

6. A method performed by a transmitter device in a communication system, the method comprising: The encoding steps include: Identify data characters from the source ;as well as Based on the encoder input mapping relationship and multiple encoding functions, according to the data words Identify multiple encoder output subwords ,in, Greater than one; and The diversity mapping step includes: Based on diversity transformation and sub-channel allocation relationships, the sub-words are output according to the multiple encoders. Identify multiple channel input subwords ;as well as The plurality of channel input subwords are transmitted via the channel. The channel includes multiple sub-channels, among which... Related to the number of sub-channels and Greater than one.

7. The method according to claim 6, wherein, The plurality of encoding functions include a plurality of encoding matrices. Furthermore, the encoding steps also include: Based on the encoder input mapping relationship, according to the data words Identify multiple encoder input subwords ,as well as For each and Through calculation According to the input sub-words of the multiple encoders Identify the output subwords of the multiple encoders ,in, yes The Elements, among which, yes The Elements, among which, yes The Elements, among which, yes The number of elements, where, yes The number of elements, satisfy And for each , same.

8. The method according to claim 6, wherein, Diversity transformation includes diversity transformation matrix The method further includes: For each and Through calculation The sub-words are output according to the plurality of encoders. Identify multiple diversity transform output subwords ,in, yes The Elements, among which yes The Elements, among which yes The Elements, among which yes The number of elements, and for each , The same, among which, It is the number of subwords output by the diversity transform, and satisfy , Based on the sub-channel allocation relationship, the sub-words are output according to the multiple diversity transforms. Identify the multiple channel input subwords .

9. The method according to claim 7, wherein, The encoder input mapping relationship includes: for each ,set up ,in, yes The non-trivial partition, in which, It makes The set of sets, where for each , ,in, It is a data word The number of elements, where, .

10. A receiver device in a communication system, the receiver device comprising: Memory, storing instructions; and Processing circuitry, coupled to the memory and configured to at least partially cause the receiver device based on the instructions: Receive multiple channel output subwords from the channel. The channel includes multiple sub-channels, among which... Related to the number of sub-channels and Greater than one, In the receiver process In the next iteration, the first... Decoder input statistics , among which, the Decoder input statistics based on In the Any decision feedback messages and diversity transformation matrices from iterations prior to the next iteration. ,in yes Matrix, and , Send the Decoder input statistics ,as well as Obtain the Verdict feedback message; and Obtain the Decoder input statistics , Based on the Decoder input statistics Identify the first Partial decoder decision, of which, the first Partial decoder decisions include the first Decoding encoder input subword , Determine the first Has the termination condition been met? In the If the termination condition is not met, identify the first The judgment feedback message was sent and the first The judgment feedback message, among which, the first The judgment feedback message is based on the first Partial decoder decision and including the first The decoder outputs the subword. ,in, Based on the The encoding function is based on the first Decoding encoder input subword The obtained, of which, the first Encoding functions include those with lines and The first of the columns Encoding matrix ,in, yes The number of elements, where, yes The number of elements, where, , where, for each , same, If the termination condition is met, the decoder output is identified and sent to the destination, where the decoder output includes the decoded data words. , where, for each , ,in, yes The non-trivial partition, in which, It makes The set of sets, where for each , ,in, yes The number of elements, where, .

11. The receiver device according to claim 10, wherein, Diversity transformation matrix and diversity transform output erase scene family Satisfying the full rank criterion, such that for each ,matrix It is a full-rank matrix, where, With sub-channel erase scene family Related, among which, Each element includes an interruption event involving at least one of the plurality of sub-channels.

12. The receiver device according to claim 10, wherein, For all , No. The encoding function includes a polarization transform matrix, and .

13. A method performed by a receiver device in a communication system, the method comprising: Receive multiple channel output subwords from the channel. The channel includes multiple sub-channels, among which... Related to the number of sub-channels and Greater than one, and In the receiver process In the next iteration, the first... Decoder input statistics , among which, the Decoder input statistics based on In the Any decision feedback messages and diversity transformation matrices from iterations prior to the next iteration. ,in, yes Matrix, and , Send the Decoder input statistics ,as well as Obtain the Verdict feedback message; and Obtain the Decoder input statistics , Based on the Decoder input statistics Identify the first Partial decoder decision, of which, the first Partial decoder decisions include the first Decoding encoder input subword , Determine the first Has the termination condition been met? In the If the termination condition is not met, identify the first The judgment feedback message was sent and the first The judgment feedback message, among which, the first The judgment feedback message is based on the first Partial decoder decision and including the first The decoder outputs the subword. ,in, Based on the The encoding function is based on the first Decoding encoder input subword The obtained, of which, the first Encoding functions include those with lines and The first of the columns Encoding matrix ,in, yes The number of elements, where, yes The number of elements, of which , where, for each , same, If the termination condition is met, the decoder output is identified and sent to the destination, where the decoder output includes the decoded data words. , where, for each , ,in yes The non-trivial partition, in which, It makes The set of sets, where for each , ,in, yes The number of elements, where, .

14. The method according to claim 13, wherein, Diversity transformation matrix and diversity transform output erase scene family Satisfying the full rank criterion, such that for each ,matrix It is a full-rank matrix, where, With sub-channel erase scene family Related, among which, Each element includes an interruption event involving at least one of the plurality of sub-channels.

15. The method according to claim 13, wherein, For all , No. The encoding function includes a polarization transform matrix, and .

Images