EP4283935A1 - Interferenzunterdrückung mit kombination mit reduzierter komplexität - Google Patents

Interferenzunterdrückung mit kombination mit reduzierter komplexität Download PDF

Info

Publication number
EP4283935A1
EP4283935A1 EP23174452.5A EP23174452A EP4283935A1 EP 4283935 A1 EP4283935 A1 EP 4283935A1 EP 23174452 A EP23174452 A EP 23174452A EP 4283935 A1 EP4283935 A1 EP 4283935A1
Authority
EP
European Patent Office
Prior art keywords
input streams
interference
spatial layer
spatial
computing
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
EP23174452.5A
Other languages
English (en)
French (fr)
Inventor
Toni Aleksi Levanen
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nokia Solutions and Networks Oy
Original Assignee
Nokia Solutions and Networks Oy
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Nokia Solutions and Networks Oy filed Critical Nokia Solutions and Networks Oy
Publication of EP4283935A1 publication Critical patent/EP4283935A1/de
Pending legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
    • H04B1/06—Receivers
    • H04B1/10—Means associated with receiver for limiting or suppressing noise or interference
    • H04B1/12—Neutralising, balancing, or compensation arrangements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00—Baseband systems
    • H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/03—Shaping networks in transmitter or receiver, e.g. adaptive shaping networks
    • H04L25/03006—Arrangements for removing intersymbol interference
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00—Baseband systems
    • H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/03—Shaping networks in transmitter or receiver, e.g. adaptive shaping networks
    • H04L25/03891—Spatial equalizers
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/0413—MIMO systems
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/08—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the receiving station
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00—Baseband systems
    • H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/0202—Channel estimation
    • H04L25/021—Estimation of channel covariance
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00—Baseband systems
    • H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/0202—Channel estimation
    • H04L25/0212—Channel estimation of impulse response
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00—Baseband systems
    • H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/03—Shaping networks in transmitter or receiver, e.g. adaptive shaping networks
    • H04L25/03006—Arrangements for removing intersymbol interference
    • H04L25/03159—Arrangements for removing intersymbol interference operating in the frequency domain
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/06—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station
    • H04B7/0697—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station using spatial multiplexing

Definitions

  • Various embodiments described herein relate to the field of wireless communications and, particularly, to performing interference rejection combining in a multiple-input-multiple-output (MIMO) receiver.
  • MIMO multiple-input-multiple-output
  • Interference rejection combining (IRC) techniques are widely applied for mitigating co-channel interference.
  • cellular communication systems employ IRC reception methods.
  • the IRCs may be applied to multi-beam reception techniques such as MIMO communications.
  • a benefit of an IRC receiver is that it does not need detailed information about interfering signals, such as radio channel propagation characteristics. Therefore, IRC receivers are simple compared to other receiver architectures.
  • a characteristic of an IRC receiver is computation of a covariance matrix representing covariance between a desired signal and the interfering signals. Inversion of the covariance matrix is also a characteristic of the IRC receiver, and the inversion operation is computationally complex.
  • an apparatus comprising means for performing: acquiring set of input streams associated with a spatial layer configured for a terminal device; estimating, on the basis of a reference signal, a channel vector h representing a radio channel response associated with the spatial layer; computing an interference covariance matrix R representing power of interference from at least one other spatial layer in the set of input streams and correlation of the interference within the set of input streams of the spatial layer; performing a per-layer interference rejection combining equalization on the set of input streams, comprising:
  • the input parameter is dependent on at least one of a number of input streams in the set of input streams, a modulation and coding scheme of the spatial layer, and a total number of spatial layers configured for all terminal devices scheduled to the same time-frequency resources as the terminal device.
  • the input parameter is dependent on the number of input streams, the modulation and coding scheme of the spatial layer, and the total number of spatial layers, and wherein values of the input parameter are directly proportional with an order of the modulation and coding scheme, directly proportional to the number of spatial layers, and inversely proportional to the number of input streams.
  • the set of linear equations defines a Krylov sub-space presentation comprising orthonormal basis vectors defining the Krylov sub-space, wherein the input parameter defines the number of said orthonormal basis vectors.
  • the Krylov sub-space presentation further comprises elements of a real-valued tridiagonal matrix, and wherein step b) comprises inversion of the real-valued tridiagonal matrix.
  • the means are configured to perform the inversion of the real-value tridiagonal matrix when solving weights for the orthonormal basis vectors by using Thomas algorithm, to combine the weights with the respective orthonormal basis vectors and with an initial estimate, and to compute the estimate of the transmitted symbol on the basis of said combining.
  • the means are configured to perform the inversion of the real-value tridiagonal matrix when solving weights for the orthonormal basis vectors by computing an eigenvalue decomposition of the tridiagonal matrix, to compute the weights by inverting eigenvalues of the eigenvalue decomposition, to combine the weights with the respective orthonormal basis vectors and with an initial estimate, and to compute the estimate of the transmitted symbol on the basis of said combining.
  • the means are configured to generate the Krylov sub-space presentation by using Lanczos algorithm.
  • the means are configured to interpolate the estimated x or a parameter derived from x to time-frequency resources not carrying the reference signal.
  • the means are configured to average in a determined number of channel estimates, wherein the determined number is a function of a modulation and coding scheme associated with the spatial layer.
  • the determined number is smaller for a first modulation scheme than for a second modulation scheme, wherein the first modulation scheme maps a greater number of bits per symbol than the second modulation scheme.
  • the means comprise at least one processor and at least one memory including computer program code, the at least one memory and computer program code configured to, with the at least one processor, cause the performance of the apparatus.
  • a method comprising: acquiring set of input streams associated with a spatial layer configured for a terminal device; estimating, on the basis of a reference signal, a channel vector h representing a radio channel response associated with the spatial layer; computing an interference covariance matrix R representing power of interference from at least one other spatial layer in the set of input streams and correlation of the interference within the set of input streams of the spatial layer; performing a per-layer interference rejection combining equalization on the set of input streams, comprising:
  • the input parameter is dependent on at least one of a number of input streams in the set of input streams, a modulation and coding scheme of the spatial layer, and a total number of spatial layers configured for all terminal devices scheduled to the same time-frequency resources as the terminal device.
  • the input parameter is dependent on the number of input streams, the modulation and coding scheme of the spatial layer, and the total number of spatial layers, and wherein values of the input parameter are directly proportional with an order of the modulation and coding scheme, directly proportional to the number of spatial layers, and inversely proportional to the number of input streams.
  • the set of linear equations defines a Krylov sub-space presentation comprising orthonormal basis vectors defining the Krylov sub-space, wherein the input parameter defines the number of said orthonormal basis vectors.
  • the Krylov sub-space presentation further comprises elements of a real-valued tridiagonal matrix, and wherein step b) comprises inversion of the real-valued tridiagonal matrix.
  • the method comprises performing the inversion of the real-value tridiagonal matrix when solving weights for the orthonormal basis vectors by using Thomas algorithm, combining the weights with the respective orthonormal basis vectors and with an initial estimate, and computing the estimate of the transmitted symbol on the basis of said combining.
  • the method comprises performing the inversion of the real-value tridiagonal matrix when solving weights for the orthonormal basis vectors by computing an eigenvalue decomposition of the tridiagonal matrix, computing the weights by inverting eigenvalues of the eigenvalue decomposition, combining the weights with the respective orthonormal basis vectors and with an initial estimate, and computing the estimate of the transmitted symbol on the basis of said combining.
  • the method comprises generating the Krylov sub-space presentation by using Lanczos algorithm.
  • the method comprises interpolating the estimated x or a parameter derived from x to time-frequency resources not carrying the reference signal.
  • the method comprises averaging a determined number of channel estimates, wherein the determined number is a function of a modulation and coding scheme associated with the spatial layer.
  • the determined number is smaller for a first modulation scheme than for a second modulation scheme, wherein the first modulation scheme maps a greater number of bits per symbol than the second modulation scheme.
  • a computer program product embodied on a computer-readable medium and comprising a computer program code readable by a computer, wherein the computer program code configures the computer to carry out a computer process comprising: acquiring set of input streams associated with a spatial layer configured for a terminal device; estimating, on the basis of a reference signal, a channel vector h representing a radio channel response associated with the spatial layer; computing an interference covariance matrix R representing power of interference from at least one other spatial layer in the set of input streams and correlation of the interference within the set of input streams of the spatial layer; performing a per-layer interference rejection combining equalization on the set of input streams, comprising:
  • UMTS universal mobile telecommunications system
  • UTRAN radio access network
  • LTE long term evolution
  • WLAN wireless local area network
  • WiFi worldwide interoperability for microwave access
  • Bluetooth ® personal communications services
  • PCS personal communications services
  • WCDMA wideband code division multiple access
  • UWB ultra-wideband
  • IMS Internet Protocol multimedia subsystems
  • Figure 1 depicts examples of simplified system architectures only showing some elements and functional entities, all being logical units, whose implementation may differ from what is shown.
  • the connections shown in Figure 1 are logical connections; the actual physical connections may be different. It is apparent to a person skilled in the art that the system typically comprises also other functions and structures than those shown in Figure 1 .
  • Figure 1 shows a part of an exemplifying radio access network.
  • Figure 1 shows terminal devices or user devices 100 and 102 configured to be in a wireless connection on one or more communication channels in a cell with an access node (such as (e/g)NodeB) 104 providing the cell.
  • (e/g)NodeB refers to an eNodeB or a gNodeB, as defined in 3GPP specifications.
  • the physical link from a user device to a (e/g)NodeB is called uplink or reverse link and the physical link from the (e/g)NodeB to the user device is called downlink or forward link.
  • (e/g)NodeBs or their functionalities may be implemented by using any node, host, server or access point etc. entity suitable for such a usage.
  • a communications system typically comprises more than one (e/g)NodeB in which case the (e/g)NodeBs may also be configured to communicate with one another over links, wired or wireless, designed for the purpose. These links may be used not only for signalling purposes but also for routing data from one (e/g)NodeB to another.
  • the (e/g)NodeB is a computing device configured to control the radio resources of communication system it is coupled to.
  • the NodeB may also be referred to as a base station, an access point, an access node, or any other type of interfacing device including a relay station capable of operating in a wireless environment.
  • the (e/g)NodeB includes or is coupled to transceivers.
  • the antenna unit may comprise a plurality of antennas or antenna elements.
  • the (e/g)NodeB is further connected to core network 110 (CN or next generation core NGC).
  • CN core network 110
  • the counterpart on the CN side can be a serving gateway (S-GW, routing and forwarding user data packets), packet data network gateway (P-GW), for providing connectivity of user devices (UEs) to external packet data networks, or mobile management entity (MME), etc.
  • S-GW serving gateway
  • P-GW packet data network gateway
  • MME mobile management entity
  • the user device also called UE, user equipment, user terminal, terminal device, etc.
  • UE user equipment
  • user terminal device terminal device
  • any feature described herein with a user device may be implemented with a corresponding apparatus, such as a relay node.
  • a relay node is a layer 3 relay (self-backhauling relay) towards the base station.
  • 5G specifications support at least the following relay operation modes: out-of-band relay where different carriers and/or RATs (Radio access technologies) may be defined for an access link and a backhaul link; and in-band-relay where the same carrier frequency or radio resources are used for both access and backhaul links.
  • In-band relay may be seen as a baseline relay scenario.
  • a relay node is called an integrated access and backhaul (IAB) node. It has also inbuilt support for multiple relay hops. IAB operation assumes a so-called split architecture having CU and a number of DUs.
  • An IAB node contains two separate functionalities: DU (Distributed Unit) part of the IAB node facilitates the gNB (access node) functionalities in a relay cell, i.e. it serves as the access link; and a mobile termination (MT) part of the IAB node that facilitates the backhaul connection.
  • DU part communicates with the MT part of the IAB node, and it has a wired connection to the CU which again has a connection to the core network.
  • MT part (a child IAB node) communicates with a DU part of the parent IAB node.
  • the user device typically refers to a portable computing device that includes wireless mobile communication devices operating with or without a subscriber identification module (SIM), including, but not limited to, the following types of devices: a mobile station (mobile phone), smartphone, personal digital assistant (PDA), handset, device using a wireless modem (alarm or measurement device, etc.), laptop and/or touch screen computer, tablet, game console, notebook, and multimedia device.
  • SIM subscriber identification module
  • a user device may also be a nearly exclusive uplink only device, of which an example is a camera or video camera loading images or video clips to a network.
  • a user device may also be a device having capability to operate in Internet of Things (IoT) network which is a scenario in which objects are provided with the ability to transfer data over a network without requiring human-to-human or human-to-computer interaction.
  • IoT Internet of Things
  • the user device may also utilize cloud.
  • a user device may comprise a small portable device with radio parts (such as a watch, earphones or eyeglasses) and the computation is carried out in the cloud.
  • the user device (or in some embodiments a layer 3 relay node) is configured to perform one or more of user equipment functionalities.
  • the user device may also be called a subscriber unit, mobile station, remote terminal, access terminal, user terminal or user equipment (UE) just to mention but a few names or apparatuses.
  • CPS cyber-physical system
  • ICT devices sensors, actuators, processors microcontrollers, etc.
  • Mobile cyber physical systems in which the physical system in question has inherent mobility, are a subcategory of cyber-physical systems. Examples of mobile physical systems include mobile robotics and electronics transported by humans or animals.
  • apparatuses have been depicted as single entities, different units, processors and/or memory units (not all shown in Figure 1 ) may be implemented.
  • 5G enables using multiple input - multiple output (MIMO) antennas, many more base stations or nodes than the LTE (a so-called small cell concept), including macro sites operating in co-operation with smaller stations and employing a variety of radio technologies depending on service needs, use cases and/or spectrum available.
  • 5G mobile communications supports a wide range of use cases and related applications including video streaming, augmented reality, different ways of data sharing and various forms of machine type applications (such as (massive) machine-type communications (mMTC), including vehicular safety, different sensors and real-time control.
  • 5G is expected to have multiple radio interfaces, namely below or at 6GHz, cmWave and mmWave, and also being capable of being integrated with existing legacy radio access technologies, such as the LTE.
  • Integration with the LTE may be implemented, at least in the early phase, as a system, where macro coverage is provided by the LTE and 5G radio interface access comes from small cells by aggregation to the LTE.
  • 5G is planned to support both inter-RAT operability (such as LTE-5G) and inter-RI operability (inter-radio interface operability, such as below 6GHz - cmWave, below or at 6GHz - cmWave - mmWave).
  • inter-RAT operability such as LTE-5G
  • inter-RI operability inter-radio interface operability, such as below 6GHz - cmWave, below or at 6GHz - cmWave - mmWave.
  • One of the concepts considered to be used in 5G networks is network slicing in which multiple independent and dedicated virtual sub-networks (network instances) may be created within the same infrastructure to run services that have different requirements on latency, reliability, throughput and mobility.
  • the current architecture in LTE networks is fully distributed in the radio and typically fully centralized in the core network.
  • the low-latency applications and services in 5G require to bring the content close to the radio which leads to local break out and multi-access edge computing (MEC).
  • MEC multi-access edge computing
  • 5G enables analytics and knowledge generation to occur at the source of the data. This approach requires leveraging resources that may not be continuously connected to a network such as laptops, smartphones, tablets and sensors.
  • MEC provides a distributed computing environment for application and service hosting. It also has the ability to store and process content in close proximity to cellular subscribers for faster response time.
  • Edge computing covers a wide range of technologies such as wireless sensor networks, mobile data acquisition, mobile signature analysis, cooperative distributed peer-to-peer ad hoc networking and processing also classifiable as local cloud/fog computing and grid/mesh computing, dew computing, mobile edge computing, cloudlet, distributed data storage and retrieval, autonomic self-healing networks, remote cloud services, augmented and virtual reality, data caching, Internet of Things (massive connectivity and/or latency critical), critical communications (autonomous vehicles, traffic safety, real-time analytics, time-critical control, healthcare applications).
  • the communication system is also able to communicate with other networks 112, such as a public switched telephone network or the Internet, or utilize services provided by them.
  • the communication network may also be able to support the usage of cloud services, for example at least part of core network operations may be carried out as a cloud service (this is depicted in Figure 1 by "cloud" 114).
  • the communication system may also comprise a central control entity, or a like, providing facilities for networks of different operators to cooperate for example in spectrum sharing.
  • Edge cloud may be brought into radio access network (RAN) by utilizing network function virtualization (NFV) and software defined networking (SDN).
  • RAN radio access network
  • NFV network function virtualization
  • SDN software defined networking
  • Using edge cloud may mean access node operations to be carried out, at least partly, in a server, host or node operationally coupled to a remote radio head or base station comprising radio parts. It is also possible that node operations will be distributed among a plurality of servers, nodes or hosts.
  • Application of cloudRAN architecture enables RAN real time functions being carried out at the RAN side (in a distributed unit, DU 105) and non-real time functions being carried out in a centralized manner (in a centralized unit, CU 108).
  • 5G may also utilize satellite communication to enhance or complement the coverage of 5G service, for example by providing backhauling.
  • Possible use cases are providing service continuity for machine-to-machine (M2M) or Internet of Things (IoT) devices or for passengers on board of vehicles, or ensuring service availability for critical communications, and future railway, maritime, and/or aeronautical communications.
  • Satellite communication may utilize geostationary earth orbit (GEO) satellite systems, but also low earth orbit (LEO) satellite systems, in particular mega-constellations (systems in which hundreds of (nano)satellites are deployed).
  • GEO geostationary earth orbit
  • LEO low earth orbit
  • mega-constellations systems in which hundreds of (nano)satellites are deployed.
  • Each satellite 109 in the mega-constellation may cover several satellite-enabled network entities that create on-ground cells.
  • the on-ground cells may be created through an on-ground relay node or by a gNB located on-ground or in a satellite.
  • the depicted system is only an example of a part of a radio access system and in practice, the system may comprise a plurality of (e/g)NodeBs, the user device may have an access to a plurality of radio cells and the system may comprise also other apparatuses, such as physical layer relay nodes or other network elements, etc. At least one of the (e/g)NodeBs or may be a Home(e/g)nodeB. Additionally, in a geographical area of a radio communication system a plurality of different kinds of radio cells as well as a plurality of radio cells may be provided.
  • Radio cells may be macro cells (or umbrella cells) which are large cells, usually having a diameter of up to tens of kilometers, or smaller cells such as micro-, femto- or picocells.
  • the (e/g)NodeBs of Figure 1 may provide any kind of these cells.
  • a cellular radio system may be implemented as a multilayer network including several kinds of cells. Typically, in multilayer networks, one access node provides one kind of a cell or cells, and thus a plurality of (e/g)NodeBs are required to provide such a network structure.
  • a network which is able to use “plug-and-play" (e/g)Node Bs includes, in addition to Home (e/g)NodeBs (H(e/g)nodeBs), a home node B gateway, or HNB-GW (not shown in Figure 1 ).
  • HNB-GW HNB Gateway
  • a HNB Gateway (HNB-GW) which is typically installed within an operator's network may aggregate traffic from a large number of HNBs back to a core network.
  • the IRC receiver is conventionally applied to receivers with multiple antennas and multiple spatial layers configured between a transmitter and a receiver, e.g. a terminal device 100 and an access node 104.
  • the receiver receives multiple beams or input streams from the transmitter, one stream per receiver antenna element.
  • the multiple beams or input streams may together form one or more spatial layers configured between the transmitter and the receiver.
  • the spatial layers are generated via MIMO processing and antenna arrays at both transmitter and receiver.
  • multiple antenna elements and respective beams may be configured per spatial layers in the MIMO processing.
  • Each spatial layer and the respective input streams of the spatial layer may be then processed at a time, by considering the signals from the other spatial layers as interference.
  • the MIMO receiver processing may comprise reception beamforming in which a set of input streams per spatial layer are extracted from signals received by the antenna elements.
  • the interference covariance matrix mentioned in Background is then computed to represent the power of interference in the set of streams and correlation of interference within the set of input streams of the spatial layer subjected to the IRC, and the receiver computes an IRC solution that aims to reduce the interference.
  • the IRC solution conventionally aims to whiten the interference which involves computing an inverse of the covariance matrix. This computation is very complex, and it would be beneficial to reduce the complexity of the IRC receiver.
  • H ⁇ C N ⁇ L defines a channel matrix containing channel estimates for all antennas or input streams (and spatial layers)
  • N defines the number of antennas or equivalently beams or input streams
  • L defines the number of spatial layers configured for the terminal device in the case of single-user MIMO (SU-MIMO) and in the case of multi-user MIMO (MU-MIMO) L represents the total number of spatial layers over all scheduled terminal devices
  • R ⁇ C N ⁇ N defines the interference covariance matrix
  • y ⁇ C N ⁇ 1 defines the received data samples.
  • the interference covariance matrix may contain noise elements such as additive white Gaussian noise and could equally be called an interference-plus-noise covariance matrix.
  • An output of the IRC equalization solution is a vector of transmitted symbol estimates ⁇ .
  • the IRC solution for the multiple spatial layers and multiple input streams is split into a single-layer IRC (SL-IRC) equalizer solution.
  • the idea is that the IRC equalization is computed per spatial layer, allowing to reduce the dimensions and computational complexity of the IRC equalization.
  • h ⁇ C N ⁇ 1 defines the channel vector containing estimates for all antennas or beams or input streams for a specific spatial layer
  • R defines the interference (plus noise) covariance matrix for the spatial layer under study.
  • the channel matrix H reduces to a channel vector h and the output of the SL-IRC solution is an estimate of the transmitted symbol ⁇ for a specific layer, instead of a symbol vector.
  • the received sample vector y may also be spatial-layer-specific, if layer-specific beamforming has been applied.
  • the interference covariance matrix also reduces to a matrix that represents the interference power and interference correlation between input streams of the spatial layer under the SL-IRC processing.
  • the computationally heavy part is the estimation of R -1 . This requires techniques to firstly make the covariance matrix estimate invertible and then inverting the matrix.
  • a whitening-based IRC approach allows to avoid explicit inverse of R by using a Cholesky decomposition as a whitening matrix.
  • Figure 2 illustrates an embodiment of a process for estimating an IRC equalization solution by using a set of linear equations.
  • the process may be executed in a receiver for the terminal device 100 or for the access node, or for another radio receiver.
  • the process may be executed by an apparatus for such a receiver, e.g. a chipset or at least one processor with at least one memory.
  • the process comprises: acquiring (block 200) set of input streams associated with a spatial layer configured for a terminal device; estimating (block 202), on the basis of a reference signal, a channel vector representing a radio channel response associated with the spatial layer; computing (block 202) an interference covariance matrix representing power of interference from at least one other spatial layer in the set of input streams and correlation of the interference within the set of input streams of the spatial layer; performing a per-layer interference rejection combining equalization on the set of input streams, comprising:
  • blocks 200 to 206 it may be determined whether or not there is another spatial layer for which no IRC solution has not yet been estimated. For example, upon carrying out blocks 200 to 206 for the set of input streams of one spatial layer, the blocks 200 to 206 may be carried out for a second set of input streams of another spatial layer co-scheduled to the same time-frequency resources as the first spatial layer.
  • the set of linear equations defines a Krylov sub-space presentation comprising orthonormal basis vectors defining the Krylov sub-space, wherein the input parameter defines the number of said orthonormal basis vectors.
  • the inversion of the covariance matrix can be avoided.
  • Advantages in the computational complexity can be gained with the equal dimensions of the number set of linear equations and the dimensions of the interference covariance matrix. Even further reduction in the computational complexity may be gained when the dimensions of the set of linear equations (parameter m described below for the Krylov sub-space) are smaller than dimensions of the interference covariance matrix.
  • each spatial layer may comprise multiple input streams that define the dimensions of the interference covariance matrix R and the length of the channel vector h.
  • the embodiments described below utilize a minimal residual method (MINRES), Lanczos algorithm, and Thomas algorithm that are as such taught by the literature.
  • MINRES minimal residual method
  • the following description provides a disclosure for adapting such commonly known algorithms to the IRC equalization.
  • the MINRES method is a method that approximates a solution by a vector in a Krylov sub-space with low residual error.
  • K m the m th Krylov subspace, K m .
  • the span function follows its conventional mathematical definition. Because the vectors r 0 , Ar 0 , ..., A m -1 r 0 are linearly dependent, for example Lanczos algorithm may be used to find orthonormal basis V m for K m .
  • One aspect of defining the sufficiently low estimation error is that bit or block error rate performance of a radio link between the transmitter and the receiver is not compromised.
  • Another aspect is that we can trade-off link performance and power consumption, e.g., in UE receiver we can use smaller m-value to reduce power consumption in low-battery scenario.
  • the number of orthonormal basis vectors m defining the Krylov sub-space presentation is a parameter affecting the computation complexity. As described above in connection with Figure 2 , the value of m is selected to define dimensions of the Krylov sub-space to be smaller than dimensions of the interference covariance matrix R.
  • the Krylov presentation or, equivalently, an orthonormal Krylov subspace may be created by using the Lanczos algorithm described in greater detail in the literature.
  • a matrix, V m containing the m orthonormal basis vectors of the Krylov subspace are acquired.
  • the Lanczos algorithm outputs real valued vectors ⁇ and ⁇ , that correspond to elements of the main diagonal ( ⁇ ) and first sub-diagonals ( ⁇ ) of the symmetric tri-diagonal matrix H m , respectively.
  • the first sub-diagonals of H m are identical, as known in connection with Lanczos algorithm.
  • the Lanczos algorithm belongs to a family of power methods for finding the eigenvalues and the orthonormal eigenvectors, and other embodiments may employ another power method.
  • An Arnoldi iteration method is yet another potential algorithm.
  • H m may be arranged to have only real values without impacting the link performance. This results from the use of the Lanczos algorithm. With finite precision arithmetics, complex values may appear but such values may be forced to be represented by using only the real values. This allows to implement the Thomas algorithm only for real values, thus reducing the computational complexity.
  • Equation (2) With the knowledge of x , the received signal y , and the channel vector h, the estimate of the transmitted symbol ⁇ is computed and output for further processing in the receiver.
  • the further processing may include demodulation and decoding, for example.
  • Figure 3 illustrates a processing chain or, equivalently, an architecture of a receiver for computing the SL-IRC solution described above.
  • the channel vector h may be stored in a buffer 300
  • the covariance matrix R may be stored in a buffer 320
  • a received data symbol vector y may be stored in a buffer 330.
  • the channel vector may be subjected to an averaging operation in block 302, and the number of channel estimates to be averaged may be adaptive and a function of determined parameters, e.g. a modulation and coding scheme (MCS) applied to the data symbols.
  • MCS modulation and coding scheme
  • the averaging is omitted.
  • the Krylov sub-space basis vectors are generated in block 304, and the number of basis vectors is defined by the input parameter m.
  • m may be smaller than the dimensions of the covariance matrix, e.g. the number of columns of the covariance matrix R.
  • m is dependent on at least one of a number of input streams N r in the set if input streams of the spatial layer under IRC processing, the MCS of the spatial layer subjected to the interference rejection combining equalization, and a total number of spatial layers configured for the terminal device and, optionally, other terminal devices in the same time-frequency resources.
  • An access node may schedule the same time-frequency resources but different spatial layers to multiple terminal devices.
  • m is a function of a plurality of these parameters, or even all of them as described below.
  • m is dependent on the number of input streams in the set of input streams, the modulation and coding scheme of the spatial layer subjected to the interference rejection combining equalization, and the number of spatial layers configured for the terminal device(s), and wherein values of the input parameter are directly proportional with an order of the modulation and coding scheme, directly proportional to the number of spatial layers, and inversely proportional to the number of input streams.
  • the number of spatial layers may include all spatial layers associated with the same time-frequency resource, e.g. they may include spatial layers configured to the terminal device but they may also include one or more spatial layers scheduled to one or more other terminal devices. The logic is that with a smaller number of spatial layers, there is less interference and thus a smaller Krylov sub-space can provide sufficient performance.
  • QPSK quadrature phase shift keying and QAM quadrature amplitude modulation.
  • the number before QAM means the number of symbols in the symbol constellation, as known in the art.
  • the number of spatial layers may be used to define an initial value for m that may then be adapted on the basis of the modulation and coding scheme and/or the number of input streams by using the above-described logic. With lower number of input streams, the initial value may be increased while it may be decreased with the greater number of input streams.
  • the initial value may be decreased, while it may be maintained or even increased with the high-order modulation schemes such as 64-QAM and 256-QAM. Since the number of spatial layers is common to all spatial layers subjected to the IRC processing, that number may be equal to all spatial layers. However, variation in the value of m for the different spatial layers may be introduced, if the spatial layers are configured with a different number of input streams N r and different modulation and coding schemes.
  • the dependence of m on the MCS may be expanded to dependence of m on a code rate of the spatial layer.
  • the same logic as with the MCS may apply, meaning that a smaller m may be selected if the code rate is small (below a threshold) while a greater m may be selected for a greater code rate (above the threshold).
  • Multiple thresholds may be used in a case where m may assume more than two values, but the logic remains: the value of m is proportional to the value of the code rate.
  • the matrix H m needs to be inverted. Thanks to being real-valued and having reduced dimensions, it is much less complex than inverting the complex-valued interference covariance matrix.
  • the inversion of the real-value tridiagonal matrix is carried out when solving weights for the orthonormal basis vectors by using the Thomas algorithm.
  • Alternative solution is to use, e.g., an eigen value decomposition on matrix H m , and build estimate on z by using a specific number of eigen vectors and inverted eigen values to represent inverse of H m .
  • d ⁇ e 1
  • z ⁇ ⁇ 1 .
  • Hermitian transpose of x is then multiplied with the channel vector in block 308. The result, x H h can be assumed to be real-valued to reduce memory consumption and to reduce computational complexity in the following interpolation steps.
  • both x and x H h are subjected to time-domain and frequency-domain interpolation in blocks 310 and 312, respectively.
  • the purpose of the interpolation is to estimate values of x (or equivalently x H ) and x H h for all sub-carriers and all time-domain signals (or samples) carrying a data symbol y.
  • demodulation reference symbols DMRS
  • DMRS demodulation reference symbols
  • One advantage of this architecture is, in addition to those described above, that the Lanczos algorithm, (tridiagonal) matrix inversion, and computation of x H h is performed before the interpolation blocks.
  • the number of sub-space processing calls and following samples subjected to the inversion, and number of vector products required to solve x H h is much smaller than in a case where the inversion was performed after the interpolation. As a consequence, low computational complexity can be achieved.
  • Equation (2) the Hermitian transpose of estimate of x is then multiplied with the received signal sample y in block 314. Thereafter, the remaining operations of Equation (2) are performed in block 316, thus acquiring the IRC estimate of the transmitted symbol.
  • Figure 4 illustrates a detailed flow diagram of the procedure and let us disclose some further embodiments with reference to Figure 4 .
  • the parameter initialized in block 400 may include at least one of the following parameters: the dimensions of the Krylov sub-space m, the initial estimate xo, and the averaging parameter input to block 302.
  • the averaging parameter is a function of the modulation and coding scheme, similarly to m.
  • the dependence of the averaging parameter on the modulation and coding scheme may follow a logic where parameter value is smaller for a first modulation scheme than for a second modulation scheme, wherein the first modulation scheme maps a greater number of bits per symbol than the second modulation scheme.
  • the averaging parameter is smaller for a higher-order modulation scheme such as 64-QAM or 256-QAM than for a lower-order modulation scheme such as QPSK or 16-QAM. Table below illustrates an embodiment of the dependence. The same principle applies to the other sub-spaces or other sets of linear equations, e.g. the biconjugate transpose method.
  • Modulation and Coding Scheme Averaging Parameter Value QPSK N channelEstimatePerPRB 16-QAM N channelEstimatePerPRB / 2 64-QAM N channelEstimatePeePRB / 2 256-QAM 1
  • the layer-specific code rate information By including the layer-specific code rate information to the MCS table, even more accurate control on the value of averaging parameter can be achieved. For example, if the code rate with 64-QAM is larger than 0.8, the averaging parameter value is set to N channelEstimatePerPRB / 3.
  • the averaging may be performed per physical resource block (PRB) with N channelEstimatePerPRB channel estimates, i.e. the averaging may be performed over channel estimates in the frequency domain within the PRB.
  • the PRB may comprise a determined number of frequency resource elements (e.g. sub-carriers).
  • N channelEstimatePerPRB channel estimates may be averaged. In an embodiment, that all channel estimates of the PRB are averaged in the case of QPSK.
  • N channelEstimatePerPRB / 2 channel estimates may be averaged, and the averaging may be omitted for a high-order modulation and coding scheme such as 256-QAM. Accordingly, the computational complexity can be reduced while maintaining acceptable performance. As described above and illustrated in Figure 3 , the averaging may be performed before computing x.
  • the Krylov sub-space orthonormal basis vectors are generated for a spatial layer under processing (see also block 304), e.g., by using the Lanczos method or another power method, based on the channel vector and interference covariance matrix.
  • the weights for the basis vectors may be computed by using the Thomas algorithm, for example.
  • x may be solved in block 406 (see also block 306), and block 406 may comprise combining the orthonormal basis vectors with respective weights.
  • the final SL-IRC estimate may be computed in block 408 where the weights are combined with the respective orthonormal basis vectors and with an initial estimate. Block 408 may be repeated (via block 409) to other symbols of the spatial layer.
  • the interpolation spans the estimate of x or a parameter derived from x (e.g. x H h ) to the other time-frequency resource (sub-carriers and/or time-domain symbols).
  • IRC estimates of the values of data symbols transmitted on the respective time-frequency resources of the same spatial layer may be computed by repeating block 408.
  • block 410 it is determined whether or not there is a spatial layer still to be processed. If there is, the process returns to block 402 where the next spatial layer and the respective input streams are taken into the processing. If all the spatial layers have been processed, the process may end.
  • sequential order of processing symbols within a spatial layer and processing spatial layers may be various.
  • the different spatial layers may be processed even in parallel by different processing circuitries, for example.
  • Figure 5 illustrates an apparatus according comprising a processing circuitry 50, such as at least one processor, and at least one memory 60 including a computer program code (software) 64, wherein the at least one memory and the computer program code (software) are configured, with the at least one processor, to cause the apparatus to carry out the process of Figure 2 or any one of its embodiments described above.
  • the apparatus may be for the terminal device 100 or for the access node 104, e.g. for the DU or CU.
  • the apparatus may be a circuitry or an electronic device realizing some embodiments of the invention in the terminal device or the access node.
  • the apparatus carrying out the above-described functionalities may thus be comprised in such a device, e.g.
  • the apparatus may comprise a circuitry such as a chip, a chipset, a processor, a micro controller, or a combination of such circuitries for the terminal device or the access node.
  • the apparatus is generally for a radio device, e.g. the radio device or a circuitry in or designed to operate in the radio device.
  • the memory 60 may be implemented using any suitable data storage technology, such as semiconductor-based memory devices, flash memory, magnetic memory devices and systems, optical memory devices and systems, fixed memory and removable memory.
  • the processing circuitry 50 may comprise a SL-IRC processing circuitry 52 configured to carry out the IRC estimation on the received input streams according to any one of the above-described embodiments.
  • the SL-IRC processing circuitry 52 may comprise a linear equations generation circuitry 54 configured to generate the basis vectors and respective weights for the basis vectors or the sets of linear equations to approximate x.
  • the SL-IRC processing circuitry may further comprise a SL-IRC solution estimation circuitry configured to compute the SL-IRC solution by using the sub-space presentation or the sets of linear equations received from the circuitry 54.
  • the SL-IRC circuitry may further comprise at least some further components or functions from the architecture illustrated in Figure 3 and described in the embodiments above.
  • the apparatus further comprises a radio transceiver 62 with multiple antenna elements for receiving the input streams for the IRC processing.
  • the radio transceiver 62 may further comprise other conventional radio receiver components such as filters, amplifiers, frequency-converters and base band signal processing components and functions.
  • circuitry refers to one or more of the following: (a) hardware-only circuit implementations such as implementations in only analog and/or digital circuitry; (b) combinations of circuits and software and/or firmware, such as (as applicable): (i) a combination of processor(s) or processor cores; or (ii) portions of processor(s)/software including digital signal processor(s), software, and at least one memory that work together to cause an apparatus to perform specific functions; and (c) circuits, such as a microprocessor(s) or a portion of a microprocessor(s), that require software or firmware for operation, even if the software or firmware is not physically present.
  • circuitry would also cover an implementation of merely a processor (or multiple processors) or portion of a processor, e.g. one core of a multi-core processor, and its (or their) accompanying software and/or firmware.
  • circuitry would also cover, for example and if applicable to the particular element, a baseband integrated circuit, an application-specific integrated circuit (ASIC), and/or a field-programmable grid array (FPGA) circuit for the apparatus according to an embodiment of the invention.
  • ASIC application-specific integrated circuit
  • FPGA field-programmable grid array
  • the processes or methods described in Figure 3 or any of the embodiments thereof may also be carried out in the form of one or more computer processes defined by one or more computer programs.
  • the computer program(s) may be in source code form, object code form, or in some intermediate form, and it may be stored in some sort of carrier, which may be any entity or device capable of carrying the program.
  • Such carriers include transitory and/or non-transitory computer media, e.g. a record medium, computer memory, read-only memory, electrical carrier signal, telecommunications signal, and software distribution package.
  • the computer program may be executed in a single electronic digital processing unit or it may be distributed amongst a number of processing units.
  • the processes or methods described in Figure 2 to 4 may also be carried out in the form of one or more computer processes defined by one or more computer programs.
  • the computer program(s) may be in source code form, object code form, or in some intermediate form, and it may be stored in some sort of carrier, which may be any entity or device capable of carrying the program.
  • Such carriers include transitory and/or non-transitory computer media, e.g. a record medium, computer memory, read-only memory, electrical carrier signal, telecommunications signal, and software distribution package.
  • the computer program may be executed in a single electronic digital processing unit or it may be distributed amongst a number of processing units.
  • references to computer-readable program code, computer program, computer instructions, computer code etc. should be understood to express software for a programmable processor such as programmable content stored in a hardware device as instructions for a processor, or as configured or configurable settings for a fixed function device, gate array, or a programmable logic device.
  • Embodiments described herein are applicable to wireless networks defined above but also to other wireless networks.
  • the protocols used, the specifications of the wireless networks and their network elements develop rapidly. Such development may require extra changes to the described embodiments. Therefore, all words and expressions should be interpreted broadly and they are intended to illustrate, not to restrict, the embodiment. It will be obvious to a person skilled in the art that, as technology advances, the inventive concept can be implemented in various ways. Embodiments are not limited to the examples described above but may vary within the scope of the claims.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Power Engineering (AREA)
  • Mobile Radio Communication Systems (AREA)
EP23174452.5A 2022-05-27 2023-05-22 Interferenzunterdrückung mit kombination mit reduzierter komplexität Pending EP4283935A1 (de)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
FI20225464 2022-05-27

Publications (1)

Publication Number Publication Date
EP4283935A1 true EP4283935A1 (de) 2023-11-29

Family

ID=86497627

Family Applications (1)

Application Number Title Priority Date Filing Date
EP23174452.5A Pending EP4283935A1 (de) 2022-05-27 2023-05-22 Interferenzunterdrückung mit kombination mit reduzierter komplexität

Country Status (3)

Country Link
US (1) US11855811B1 (de)
EP (1) EP4283935A1 (de)
CN (1) CN117134787A (de)

Family Cites Families (34)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TWI239723B (en) * 2002-07-19 2005-09-11 Interdigital Tech Corp Groupwise successive interference cancellation for block transmission with reception diversity
US7733996B2 (en) * 2005-05-25 2010-06-08 Research In Motion Limited Joint space-time optimum filters (JSTOF) for interference cancellation
US7844232B2 (en) * 2005-05-25 2010-11-30 Research In Motion Limited Joint space-time optimum filters (JSTOF) with at least one antenna, at least one channel, and joint filter weight and CIR estimation
US20070049232A1 (en) * 2005-08-15 2007-03-01 Research In Motion Limited Joint Space-Time Optimum Filter (JSTOF) Using QR and Eigenvalue Decompositions
US20070049233A1 (en) * 2005-08-15 2007-03-01 Research In Motion Limited Wireless Communications Device Including a Joint Space-Time Optimum Filters (JSTOF) Using Singular Value Decompositions (SVD)
US7623602B2 (en) * 2005-11-15 2009-11-24 Tensorcomm, Inc. Iterative interference canceller for wireless multiple-access systems employing closed loop transmit diversity
CN101689880B (zh) * 2007-06-14 2013-07-17 艾利森电话股份有限公司 用于形成和共享损伤协方差矩阵的方法
EP2301181A1 (de) * 2008-05-09 2011-03-30 Nokia Siemens Networks OY Mehrzellenkanalschätzung in auf 3g-lte basierenden virtuellen pilotsequenzen
ES2557894T3 (es) * 2009-04-14 2016-01-29 Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. Método y dispositivo para procesamiento de datos en una red de comunicación
KR101405028B1 (ko) * 2010-01-06 2014-06-10 알까뗄 루슨트 기지국 디바이스, 방법, 및 그의 통신 시스템
US8665693B1 (en) * 2011-08-18 2014-03-04 Applied Micro Circuits Corporation Uplink single carrier frequency division multiple access multiple-input multiple-output soft interference cancellation receiver
US9008202B2 (en) * 2012-03-13 2015-04-14 Qualcomm Incorporated Fast and robust estimation of jointly sparse channels
US8761317B2 (en) * 2012-04-04 2014-06-24 Telefonaktiebolaget L M Ericsson (Publ) Soft-bit generation and channel estimation for interference cancellation using decoder output
US9042428B2 (en) * 2012-05-04 2015-05-26 Telefonaktiebolaget L M Ericsson (Publ) Efficient frequency domain (FD) MMSE equalization weight updates in a multi-stage parallel interference cancellation receiver
WO2015023218A1 (en) * 2013-08-12 2015-02-19 Telefonaktiebolaget L M Ericsson (Publ) Methods and devices for determining link adaptation parameters
DE102013110833B4 (de) * 2013-09-30 2018-10-18 Intel IP Corporation Verfahren und Vorrichtungen zum Bestimmen von effektiven gegenseitigen Informationen
US9198079B2 (en) * 2013-12-02 2015-11-24 Telefonaktiebolaget L M Ericsson (Publ) Method and apparatus for equalization processing in a wireless communication receiver
JP2015207816A (ja) * 2014-04-17 2015-11-19 富士通株式会社 受信装置、受信方法、及び、無線通信システム
DE102014008347B4 (de) * 2014-06-05 2021-01-28 Apple Inc. Verfahren und vorrichtung zur kanalschätzung und ofdm-empfänger
US9628301B2 (en) * 2014-07-23 2017-04-18 Texas Instruments Incorporated Interference estimation for LTE receiver
US9641294B2 (en) * 2014-07-25 2017-05-02 Cisco Technology, Inc. System, method, and program for robust interference rejection combining
KR102641746B1 (ko) * 2016-10-18 2024-02-29 삼성전자주식회사 대규모 안테나를 이용하는 무선 통신 시스템에서 프리코딩을 수행하기 위한 장치 및 방법
US10594406B2 (en) * 2018-03-09 2020-03-17 Nokia Solutions And Networks Oy Pilot-aided digital signal processing for reception of coherent optical communication
FI20185602A1 (fi) * 2018-06-29 2019-12-30 Nokia Technologies Oy Epäjatkuva nopeaan konvoluutioon perustuva suodatinprosessointi
US10998932B2 (en) * 2019-01-14 2021-05-04 Nokia Solutions And Networks Oy Use of vectoring and time- and/or frequency—division multiple access in a multi-user connection
EP3994811A1 (de) * 2019-07-03 2022-05-11 Nokia Technologies Oy Übertragungssystem mit kanalschätzung auf der basis eines neuronalen netzes
CN110753012A (zh) 2019-11-25 2020-02-04 重庆邮电大学 一种时间反演多址系统的多用户检测算法
US11418239B2 (en) * 2020-03-27 2022-08-16 Mavenir Systems, Inc. Decoding uplink in a massive multiple input multiple output wireless communication system for an open radio access network
US11489568B2 (en) * 2020-10-26 2022-11-01 Wisig Networks Private Limited Method of signal processing by a massive MIMO base station receiver
FI20215606A1 (en) * 2021-05-21 2022-05-24 Nokia Solutions & Networks Oy SCHEDULING INFORMATION BASED DATA COLLECTION AND INTERFERENCE DETECTION
US20220393817A1 (en) * 2021-06-08 2022-12-08 Wisig Networks Private Limited Massive mimo interference suppression receivers aided by network signaling
EP4164137B1 (de) * 2021-10-05 2024-07-17 Nokia Solutions and Networks Oy Berechnung von strahlformungsparametern
US12052601B2 (en) * 2021-10-19 2024-07-30 Qualcomm Incorporated Techniques for joint modulation of data with tone reservation signals
CN114142905B (zh) 2021-12-10 2024-02-09 东南大学 时变信道下基于牛顿迭代法的mimo检测算法的改进方法

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
MAJEED ERFAN ET AL: "Advanced receiver design for interfering small cell deployments in LTE networks", 2015 IEEE CONFERENCE ON STANDARDS FOR COMMUNICATIONS AND NETWORKING (CSCN), IEEE, 28 October 2015 (2015-10-28), pages 294 - 299, XP032856182, ISBN: 978-1-4799-8927-0, [retrieved on 20160125], DOI: 10.1109/CSCN.2015.7390460 *
QU, H ET AL.: "IEEE Transactions on Wireless Communications", vol. 21, February 2022, IEEE, article "Efficient Channel Equalization and Symbol Detection for MIMO OTFS Systems", pages: 6672 - 6686
SAHRAB AMMAR ALI ET AL: "Enhanced IRC-SIC algorithm with beamforming for MU-MIMO systems", 2015 INTERNATIONAL SYMPOSIUM ON SIGNALS, CIRCUITS AND SYSTEMS (ISSCS), IEEE, 9 July 2015 (2015-07-09), pages 1 - 4, XP033195451, DOI: 10.1109/ISSCS.2015.7203930 *
XIAO, C ET AL.: "China Communications", vol. 12, December 2015, IEEE, article "Low-complexity soft-output detection for massive MIMO using SCBiCG and Lanczos methods", pages: 9 - 17

Also Published As

Publication number Publication date
US11855811B1 (en) 2023-12-26
CN117134787A (zh) 2023-11-28
US20240007333A1 (en) 2024-01-04

Similar Documents

Publication Publication Date Title
CN113196866B (zh) 用于处理上行链路信号的分布式基站系统的方法、远程无线电单元和基带单元
EP3940968B1 (de) Verfahren und vorrichtung für ein übertragungsschema
CN113676281B (zh) 一种用于通信的方法、装置和计算机可读存储介质
US20220368583A1 (en) Signal dimension reduction using a non-linear transformation
CN104936299B (zh) 用于处理资源块的方法和装置
US11664867B2 (en) Computation of beamforming parameters
WO2019222913A1 (en) Transmission method
EP4283935A1 (de) Interferenzunterdrückung mit kombination mit reduzierter komplexität
WO2019166995A1 (en) Method to estimate snr for mu-mimo based on channel orthogonality
US10797930B1 (en) Apparatus and method for detection of received signals
CN112217543B (zh) 用于符号检测的方法和装置
US11617183B2 (en) Demapping received data
US20240204891A1 (en) Interference rejection in cooperative multi-point communication
KR20160016525A (ko) Lte-a ue에 대한 블라인드 검출된 간섭 매개변수들을 기반으로 하는 간섭 제거 기술
US11552661B2 (en) Interference detection in radio access network
EP4120579A1 (de) Interferenzbewusste eigenstrahlformung basierend auf statistiken zweiter ordnung
US11483717B1 (en) Machine learning for orthogonal frequency-division multiplexing based communication
EP4270795A1 (de) Schätzung und reduzierung des hf-kettenversatzes
EP4340247A1 (de) Bestimmung der kovarianz unter verwendung eines verlustbehafteten kompressionsverfahrens
KANAPARTHI et al. Review On Channel Estimation In 5g Massive Mimo Using Tdm and Ai
Kumar et al. Low Complexity Interference Rejection Combining Equalizer for Extreme Massive MIMO
Peken et al. Elastic net for channel estimation in massive MIMO
KR20150094475A (ko) 콘스텔레이션 다이어그램을 이용하는 간섭 제거 기법

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION HAS BEEN PUBLISHED

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC ME MK MT NL NO PL PT RO RS SE SI SK SM TR

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE

17P Request for examination filed

Effective date: 20240529

RBV Designated contracting states (corrected)

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC ME MK MT NL NO PL PT RO RS SE SI SK SM TR