Настройки

Укажите год
-

Небесная энциклопедия

Космические корабли и станции, автоматические КА и методы их проектирования, бортовые комплексы управления, системы и средства жизнеобеспечения, особенности технологии производства ракетно-космических систем

Подробнее
-

Мониторинг СМИ

Мониторинг СМИ и социальных сетей. Сканирование интернета, новостных сайтов, специализированных контентных площадок на базе мессенджеров. Гибкие настройки фильтров и первоначальных источников.

Подробнее

Форма поиска

Поддерживает ввод нескольких поисковых фраз (по одной на строку). При поиске обеспечивает поддержку морфологии русского и английского языка
Ведите корректный номера.
Ведите корректный номера.
Ведите корректный номера.
Ведите корректный номера.
Укажите год
Укажите год

Применить Всего найдено 449. Отображено 189.
15-02-2012 дата публикации

CHANNEL ESTIMATION AND ENTZERRUNG FOR HARD LIMITED SIGNALS

Номер: AT0000545251T
Принадлежит:

Подробнее
15-11-2008 дата публикации

COSEQUENZ STÖRUNGSDETEKTION AND - TREATMENT

Номер: AT0000414350T
Принадлежит:

Подробнее
17-04-2014 дата публикации

Network-centric link adaptation for coordinated multipoint downlink transmission

Номер: AU2010258274B2
Принадлежит:

A Coordinated Multipoint (COMP) cell controller performs network-centric Sink adaptation for User Equipment (UE) in the CoMP cell. The CoMP cell controller receives at least infrequent channel estimates from a UE in the CoMP cell, from which it estimates downlink channel and thermal noise at the UE. The CoMP cell controller is aware of the desired signal to be received at the UE, and the intra-CoMP cell interference to the UE caused by transmissions to other UEs in the CoMP cell. The CoMP cell receives from the UE reports of inter-CoMP cell interference caused by transmissions by other CoMP cells. Based on the downlink channel quality, the desired signal, the intra-CoMP cell interference, the intex-CoMP cell interference, and the thermal noise, the CoMP cell controller performs link adaptation by selecting modulation and coding schemes, and other transmission parameters, for mi upcoming transmission duration (such as a TTI).

Подробнее
08-05-2014 дата публикации

Channel estimation and equalization for hard-limited signals

Номер: AU2009288957B2
Принадлежит:

The present invention provides a method and apparatus for channel estimation when the amplitude of a received signal is hard-limited. A channel estimator computes amplitude estimates for the received signal based on the phase samples of the received signal and previous channel estimates. The amplitude estimates may comprise the expected values of the amplitude given the phase samples and the initial channel estimates. The channel estimator then computes revised channel estimates based on the amplitude estimates and the phase samples. The process may be performed iteratively to refine the channel estimates during each iteration.

Подробнее
08-07-2003 дата публикации

Methods, receiver devices and systems for whitening a signal disturbance in a communication signal

Номер: US0006590932B1
Принадлежит: Ericsson Inc., ERICSSON INC, ERICSSON INC.

Methods, systems and receiver devices are provided which may reduce the average power of a signal disturbance by whitening the signal disturbance. In one aspect, a finite impulse response filter (FIR) is provided which whitens the signal disturbance by filtering a downsampled received signal using filter coefficients adaptively established using known signal information in each signal burst of the received signal. Alternatively, a noise-whitening equalizer is utilized having a modified metric that whitens the signal disturbance again using coefficients adaptively established using known signal information in each signal burst of the received signal. The noise-whitening equalizer approach further allows the noise-whitening coefficients to be updated by treating symbol estimates from the equalizer as known signal information to generate updated noise-whitening coefficients. A novel receiver containing a modified Euclidean metric equalizer to provide noise-whitening is also provided.

Подробнее
16-09-2014 дата публикации

Channel estimation for a very large-scale multiple-input multiple-output (MIMO) system

Номер: US0008837621B2

A transmitter, receiver, and method for channel estimation for a Multiple-Input Multiple-Output (MIMO) communication system in which the transmitter includes a multiplicity of transmit antennas spaced such that spacing between adjacent antennas provides a spatial correlation coefficient greater than a threshold level. The transmitter selects a subset of the multiplicity of transmit antennas for transmitting the pilot reference signals. The pilot reference signals are transmitted only from the selected subset of transmit antennas to the receiver. The receiver includes a channel estimator configured to derive a channel estimation for all of the multiplicity of transmit antennas using the received pilot reference signals and known or estimated spatial correlation among the multiplicity of transmit antennas.

Подробнее
19-05-2015 дата публикации

Spatially randomized pilot symbol transmission methods, systems and devices for multiple input/multiple output (MIMO) wireless communications

Номер: US0009036684B2

Compressive sampling is used to generate pilot symbols to be transmitted over an array of antennas in a MIMO wireless communications device. A pilot symbol is transmitted over the array of antennas according to a spatially randomized antenna transmission function that randomly changes across the array of antennas. The randomized antenna transmission function may randomly select/deselect antennas and/or randomly change amplitude and/or phase of the pilot symbol transmission. Channel estimates can be constructed at a receiver based on the spatially randomized pilot symbols that were transmitted.

Подробнее
15-05-2018 дата публикации

Improving data rates of short message noisy network coding and decode-and forward relaying

Номер: US9973970B2

A method for communicating data in a network node is disclosed. A data transmission is received from a first network node at a second network node. The first network node is configured to perform decode-and-forward operations and the second network node configured to perform compression operations. A compression index to be used for conveying the data transmission is generated. The generated compression index is encoded using superposition coding. The compression index is sent to at least the first network node.

Подробнее
26-11-2020 дата публикации

TRANSMISSION STRUCTURE FOR MMW RAN

Номер: US20200374055A1
Принадлежит:

There is disclosed a method of operating a transmitting node in a millimeter-wave communication network. The method includes transmitting millimeter-wave signaling in a transmission timing structure. The transmission timing structure includes N time interval elements sequentially ordered in time. The millimeter-wave signaling includes N separate signaling structures, each signaling structure being transmitted in a different one of the time interval elements; N being an integer multiple of 2. A first subset of the N separate signaling structures corresponds to control signaling, wherein the subset includes 2{circumflex over ( )}m signaling structures consecutive in time beginning with the signaling structure of the first time interval element; m being an integer such that 2{circumflex over ( )}m<=N. A second subset of the N separate signaling structures corresponds to data signaling. The second subset comprises 0 or an integer number of signaling structures. The disclosure also pertains ...

Подробнее
07-01-2021 дата публикации

Circular buffer rate matching for polar codes

Номер: AU2018218656B2
Принадлежит:

Methods are proposed herein to perform rate matching for polar codes via circular buffering of the polar encoded bits. Embodiments are directed to methods of operation of a transmitting node in a wireless system including performing polar encoding of a set of information bits in accordance with a polar sequence of length ...

Подробнее
12-09-2013 дата публикации

Signal compression for backhaul communications using linear transformations

Номер: AU2012232767A1
Принадлежит:

A compression/decompression method for backhaul communication of a complex-valued radio signal between base stations and the network processing unit, such as a Central Processor of a Coordinated Multipoint (CoMP) system, significantly reduces backhaul bandwidth. The spatial and temporal correlations of the wireless IQ signal are exploited in order to remove redundancy and substantially reduce signal bandwidth. Feature component signals of significance are extracted through linear transformation to form the radio signal, and are individually quantized, possibly at different bit rates in accordance with their relative importance. The transformation can either be pre-determined or computed in real-time based on the spatial and temporal statistics of the radio signal. In the latter case, the transformation matrix or matrices are also sent over the backhaul in order to allow the radio signal to be reconstructed at the receiving end. Different methods of generating the transformation matrices ...

Подробнее
09-08-2018 дата публикации

CONCATENATED POLAR CODE WITH ADAPTIVE ERROR DETECTION

Номер: CA0003050076A1
Принадлежит: ERICSSON CANADA PATENT GROUP

According to certain embodiments, a method by a transmitter is provided for adaptively generating precoder bits for a Polar code. The method includes acquiring at least one configuration parameter upon which a total number of precoder bits depends. The at least one configuration parameter comprising at least one of an information block length K,a code block length N, and/or a code rate R=K/ N. The total number of precoder bits is determined, and the precoder bits for a code block are generated according to the determined total number of precoder bits. The precoder bits are placed within the code block.

Подробнее
26-03-2019 дата публикации

EFFICIENT BEAM SCANNING FOR HIGH-FREQUENCY WIRELESS NETWORKS

Номер: CA0002968202C

Systems and methods relating to non-adaptive beam scanning in a wireless network are disclosed. In some embodiments, a method of operation of a transmit node (12) to perform non-adaptive beam scanning for transmit beam patterns (16) of the transmit node (12) that partition a service coverage area (18) of the transmit node (12) into transmit partition cells (20) is provided. The method transmitting a known signal using each of multiple scanning beam patterns for each of multiple beam scanning stages over nonoverlapping radio resource slots. The scanning beam patterns for the beam scanning stages are such that each unique combination of scanning beam patterns consisting of one scanning beam pattern from each of the beam scanning stages corresponds to a different transmit beam pattern (16) of the transmit node (12). This multi-stage beam scanning approach provides an exponentially more efficient process for beam scanning than the conventional Sequential Beam Sweeping (SBS) approach.

Подробнее
07-09-2017 дата публикации

HOPPING SYNCHRONIZATION SIGNALS

Номер: US20170257139A1
Принадлежит:

A method of synchronizing transmission of signals from a network node to a receiver includes generating a synchronization signal transmission pattern in which transmission resources used for transmission of the synchronization signals in regularly spaced time intervals are changed in successive ones of the time intervals, and transmitting synchronization signals from the network node in accordance with the synchronization signal transmission pattern. Related network nodes and user equipment nodes are disclosed. 1. A method of synchronizing transmission of signals from a network node to a receiver , the method comprising:generating a synchronization signal transmission pattern in which transmission resources used for transmission of the synchronization signals in regularly spaced time intervals are changed in successive ones of the time intervals, wherein the synchronization signal transmission pattern comprises a pseudorandom pattern; andtransmitting synchronization signals from the network node in accordance with the synchronization signal transmission pattern.2. The method of claim 1 , wherein generating the synchronization signal transmission pattern comprises defining a pattern of frequency resources claim 1 , time offsets relative to the regularly spaced time intervals claim 1 , spreading codes claim 1 , and/or beamforming patterns.3. (canceled)4. The method of claim 1 , wherein the pseudorandom pattern repeats at regular intervals.5. The method of claim 1 , wherein the synchronization signal transmission pattern defines a pattern of transmission frequencies claim 1 , and wherein the pseudorandom pattern has a predefined distribution over a predefined transmission bandwidth.6. The method of claim 4 , wherein the synchronization signal transmission pattern defines a pattern of transmission frequencies claim 4 , and wherein the pseudorandom pattern has a uniform distribution over a predefined transmission bandwidth.7. The method of claim 1 , wherein transmitting ...

Подробнее
10-09-2019 дата публикации

Method for improving data throughput in wireless networks

Номер: US0010412654B2

The proposed layer solution defines two or more layers of relay nodes to convey traffic data from a source node to a destination node. All of the nodes in a given layer were selected for that layer because they each satisfied a signal quality requirement specified for that layer, where all relay nodes defined in one layer simultaneously start transmitting in response to a received transmission. Due to the layered approach, the destination node may be configured to decode only the traffic data relayed by the relay nodes in the immediately preceding (final) layer while treating any remaining received signals as noise. As a result, only those access nodes most likely to significantly contribute to and improve the signal quality of traffic data received at the destination node are selected as relay nodes for a particular source-destination node pair.

Подробнее
19-08-2003 дата публикации

Method and apparatus for computing prefilter coefficients

Номер: US0006608862B1
Принадлежит: Ericsson, Inc., ERICSSON INC, ERICSSON, INC.

The impulse response of a prefilter used with a DFSE equalizer in a receiver system is computed. A channel estimate is determined in response to signals received by the receiver system. The channel estimate may include a forward channel estimate and a backward channel estimate. Roots of a z-transform of the forward channel estimate and roots of a z-transform of the backward channel estimate are determined. Those roots of the z-transform of the forward channel estimate having a magnitude greater than one are used to form a z-transform of a forward impulse response of the prefilter while those roots of the z-transform of the backward channel estimate having a magnitude greater than one are used to form a z-transform of a backward impulse response of the prefilter. Forward prefilter coefficients for the prefilter are computed based on the z-transform of the forward impulse response of the prefilter and backward prefilter coefficients for the prefilter are computed based on the z-transform ...

Подробнее
15-11-2008 дата публикации

SMALLEST SQUARES CHANNEL ESTIMATION WITH CORRECTION OF COLORED NOISE

Номер: AT0000412296T
Принадлежит:

Подробнее
15-07-2011 дата публикации

CHANNEL ESTIMATION BY SMALLEST SQUARES WITH CORRECTION OF COLORED NOISE

Номер: AT0000513399T
Принадлежит:

Подробнее
25-02-2002 дата публикации

Equalizer with adaptive pre-filter

Номер: AU0007350001A
Принадлежит:

Подробнее
28-01-2016 дата публикации

Network-centric link adaptation for coordinated multipoint downlink transmission

Номер: AU2013273112B2
Принадлежит:

A Coordinated Multipoint (CoMP) cell controller performs network-centric link adaptation for User Equipment (UE) in the CoMP cell. The CoMP cell controller receives at least infrequent channel estimates from a UE in the CoMP cell, from which it estimates downlink channel and thermal noise at the UE. The CoMP cell controller is aware of the desired signal to be received at the UE, and the intra-CoMP cell interference to the UE caused by transmissions to other UEs in the CoMP cell. The CoMP cell receives from the UE reports of inter-CoMP cell interference caused by transmissions by other CoMP cells. Based on the downlink channel quality, the desired signal, the intra-CoMP cell interference, the inter-CoMP cell interference, and the thermal noise, the CoMP cell controller performs link adaptation by selecting modulation and coding schemes, and other transmission parameters, for an upcoming transmission duration (such as a TTI).

Подробнее
16-12-2010 дата публикации

NETWORK-CENTRIC LINK ADAPTATION FOR COORDINATED MULTIPOINT DOWNLINK TRANSMISSION

Номер: CA0002764229A1
Принадлежит:

A Coordinated Multipoint (COMP) cell controller performs network-centric Sink adaptation for User Equipment (UE) in the CoMP cell. The CoMP cell controller receives at least infrequent channel estimates from a UE in the CoMP cell, from which it estimates downlink channel and thermal noise at the UE. The CoMP cell controller is aware of the desired signal to be received at the UE, and the intra-CoMP cell interference to the UE caused by transmissions to other UEs in the CoMP cell. The CoMP cell receives from the UE reports of inter-CoMP cell interference caused by transmissions by other CoMP cells. Based on the downlink channel quality, the desired signal, the intra-CoMP cell interference, the intex-CoMP cell interference, and the thermal noise, the CoMP cell controller performs link adaptation by selecting modulation and coding schemes, and other transmission parameters, for mi upcoming transmission duration (such as a TTI).

Подробнее
30-01-2014 дата публикации

METHODS OF TRANSMITTING USING FILTERING IN THE TIME DOMAIN AND RELATED DEVICES

Номер: US20140029511A1
Принадлежит: TELEFONAKTIEBOLAGET L M ERICSSON (PUBL)

Methods may be provided to transmit data from a wireless terminal operating in a radio access network. For example, sampling rate conversion may be performed on a serial stream of modulation symbols to generate sampling rate converted symbols, and the sampling rate converted symbols may be transmitted over a wireless channel to a node of the radio access network. Related terminals are also discussed. 1. A method of transmitting data from a wireless terminal operating in a radio access network , the method comprising:performing sampling rate conversion on a serial stream of modulation symbols to generate sampling rate converted symbols; andtransmitting the sampling rate converted symbols over a wireless channel to a node of the radio access network.2. The method of wherein performing sampling rate conversion comprises determining corresponding rate conversion based on cell bandwidth and based on user bandwidth assigned to the wireless terminal.3. The method of further comprising:before transmitting the sampling rate converted symbols and after performing sampling rate conversion, digitally mixing the sampling rate converted symbols with a mixing sequence.4. The method of wherein digitally mixing the sample rate converted symbols comprises determining the mixing sequence based on a frequency location of user bandwidth assigned to the wireless terminal.5. The method according to wherein performing sampling rate conversion comprises using a polyphase structure of a corresponding fractional decimation/interpolation.6. The method according to wherein performing sampling rate conversion comprises using a Farrow structure of a corresponding polynomial interpolation.7. The method according to further comprising:before performing sampling rate conversion, digitally mixing the serial stream of modulation symbols with a mixing sequence.8. The method according to wherein performing sampling rate conversion comprises claim 1 ,generating samples of transmission symbols from a ...

Подробнее
08-08-2006 дата публикации

System and method for interference cancellation in a wireless communication receiver

Номер: US0007088978B2
Принадлежит: Ericsson Inc., ERICSSON INC, ERICSSON INC.

A communication receiver improves its channel estimation performance, its equalization performance, or both, by modeling the non-Gaussian characteristics of a dominant source of interference in a received signal. That is, rather than using Gaussian-based modeling, the receiver generates signal disturbance estimates using a probabilistic model representative of the non-Gaussian interference in a received signal, such as adjacent channel or co-channel signal interference in mobile station operating within a wireless communication network. The receiver may use such non-Gaussian interference modeling responsive to detecting such interference in the received signal and may match its disturbance model to the detected interference. Further, where signal disturbance is predominantly Gaussian in nature, the receiver may switch to a Gaussian disturbance model.

Подробнее
17-11-2016 дата публикации

SYSTEMS AND METHODS OF BEAM TRAINING FOR HYBRID BEAMFORMING

Номер: US20160337016A1
Принадлежит:

Systems and methods of beam training for hybrid beamforming are disclosed. In some embodiments, a method of operation of a receiver includes identifying multiple sets of beam indices for use with transmissions from a transmitter using hybrid precoding. The method also includes communicating the sets of beam indices to the transmitter for use with transmissions using hybrid precoding and receiving a transmission from the transmitter using one of the sets of beam indices. In some embodiments, each set of beam indices is for a different transmission mode. In this way, a transmission mode may be changed without the need to perform re-training of beams which is typically a time consuming process.

Подробнее
18-02-2010 дата публикации

METHOD AND ARRANGEMENT FOR ESTIMATING DC OFFSET

Номер: US20100040174A1
Принадлежит:

A method and arrangement for estimating a DC offset for a signal received in a radio receiver. The received signal includes a digitally modulated signal component, a DC offset component, and a noise component. When the signal is of a known type, such as a Gaussian Minimum Shift Keying (GMSK)-modulated signal with constant amplitude in a GSM/EDGE cellular radio system, the method exploits the known characteristics of the statistical distribution for the known type of signal to obtain a better estimate of the DC offset. The statistical distribution of the received digitally modulated signal component is first analyzed. That statistical distribution is then compared to the known statistical distribution for the known type of signal to identify differences. The differences are then used to estimate the DC offset. Additional iterations may be performed to further improve the DC estimate.

Подробнее
24-04-2018 дата публикации

Transmitter for transmitting discovery signals, a receiver and methods therein

Номер: US0009955411B2

A transmitter and a method therein for transmitting discovery signals to a receiver. The transmitter and the receiver are comprised in a radio communications system. The transmitter transmits two or more discovery signals over two or more directions. Each discovery signal is configured to span over a fraction of a carrier bandwidth.

Подробнее
27-08-2019 дата публикации

Adaptive relay schemes and virtual full-duplex relay operation

Номер: US0010396970B2

A wireless communication system comprises a source node, a destination node, and a plurality of half-duplex relay nodes disposed between the source node and the destination node. The half-duplex relay nodes are configured in two disjoint paths each comprising an equal number of hops from the source node to the destination node. The source node is configured to alternately transmit information via the two disjoint paths in alternating time slots, and the destination node is configured to alternately receive information via the two disjoint paths in alternating time slots.

Подробнее
29-11-2018 дата публикации

Network architecture, methods, and devices for a wireless communications network

Номер: AU2017262847A1
Автор: NORRMAN KARL, OLSSON BENGT-ERIK, PALENIUS TORGNY, PEISA JANNE, PETERSSON SVEN, PRADAS JOSE LUIS, PRYTZ MIKAEL, QUESETH OLAV, RAMACHANDRA PRADEEPA, RAMOS EDGAR, REIAL ANDRES, RIMHAGEN THOMAS, RINGH EMIL, RUGELAND PATRIK, RUNE JOHAN, SACHS JOACHIM, SAHLIN HENRIK, SAXENA VIDIT, SEIFI NIMA, SELÈN YNGVE, SEMAAN ELIANE, SHARMA SACHIN, SHI CONG, SKÖLD JOHAN, STATTIN MAGNUS, STJERNMAN ANDERS, SUNDMAN DENNIS, SUNDSTRÖM LARS, TERCERO VARGAS MIUREL ISABEL, TIDESTAV CLAES, TOMBAZ SIBEL, TORSNER JOHAN, TULLBERG HUGO, VIKBERG JARI, VON WRYCZA PETER, WAGER STEFAN, WALLDEEN THOMAS, WALLÈN ANDERS, WALLENTIN PONTUS, WANG HAI, WANG HELMERSSON KE, WANG JIANFENG, WANG YI-PIN ERIC, WERNER KARL, WIBERG NICLAS, WITTENMARK EMMA, YILMAZ OSMAN NURI CAN, ZAIDI ALI, ZHANG ZHAN, ZHANG ZHANG, ZHENG YANLI, PARKVALL STEFAN, ABRAHAMSSON RICHARD, AKTAS ISMET, ALRIKSSON PETER, ANSARI JUNAID, ASHRAF SHEHZAD ALI, ASPLUND HENRIK, ATHLEY FREDRIK, AXELSSON HÅKAN, AXMON JOAKIM, AXNÄS JOHAN, BALACHANDRAN KUMAR, BALDEMAIR ROBERT, BARK GUNNAR, BERG JAN-ERIK, BERGSTRÖM ANDREAS, BJÖRKEGREN HÅKAN, BRAHMI NADIA, CAPAR CAGATAY, CARLSSON ANDERS, CEDERGREN ANDREAS, COLDREY MIKAEL, DA SILVA ICARO L J, DAHLMAN ERIK, EL ESSAILI ALI, ENGSTRÖM ULRIKA, ERICSON MÅRTEN, ERIKSSON ERIK, FALLGREN MIKAEL, FAN RUI, FODOR GABOR, FRENGER PÅL, FRIDÉN JONAS, FRÖBERG OLSSON JONAS, FURUSKÄR ANDERS, FURUSKOG JOHAN, GARCIA VIRGILE, GATTAMI ATHER, GUNNARSSON FREDRIK, GUSTAVSSON ULF, HAGERMAN BO, HARRYSSON FREDRIK, HE NING, HESSLER MARTIN, HILTUNEN KIMMO, HONG SONGNAM, HUI DENNIS, HUSCHKE JÖRG, IRNICH TIM, JACOBSSON SVEN, JALDÉN NIKLAS, JÄRMYR SIMON, JIANG ZHIYUAN, JOHANSSON MARTIN, JOHANSSON NIKLAS, KANG DU HO, KARIPIDIS ELEFTHERIOS, KARLSSON PATRIK, KHAYRALLAH ALI S, KILINC CANER, KLANG GÖRAN N, KRONANDER JONAS, LANDSTRÖM SARA, LARSSON CHRISTINA, LI GEN, LINCOLN BO, LINDBOM LARS, LINDGREN ROBERT, LINDOFF BENGT, LINDQVIST FREDRIK, LIU JINHUA, LOHMAR THORSTEN, LU QIANXI, MANHOLM LARS, MARIC IVANA, MEDBO JONAS, MIAO QINGYU, MILDH GUNNAR, MOOSAVI REZA, NILSSON JOHAN, MÜLLER WALTER, MYHRE ELENA, Norrman, Karl, Olsson, Bengt-Erik, Palenius, Torgny, Peisa, Janne, Petersson, Sven, Pradas, Jose Luis, Prytz, Mikael, Queseth, Olav, Ramachandra, Pradeepa, Ramos, Edgar, Reial, Andres, Rimhagen, Thomas, Ringh, Emil, Rugeland, Patrik, Rune, Johan, Sachs, Joachim, Sahlin, Henrik, Saxena, Vidit, Seifi, Nima, Selèn, Yngve, Semaan, Eliane, Sharma, Sachin, Shi, Cong, Sköld, Johan, Stattin, Magnus, Stjernman, Anders, Sundman, Dennis, Sundström, Lars, Tercero Vargas, Miurel Isabel, Tidestav, Claes, Tombaz, Sibel, Torsner, Johan, Tullberg, Hugo, Vikberg, Jari, Von Wrycza, Peter, Wager, Stefan, Walldeen, Thomas, Wallèn, Anders, Wallentin, Pontus, Wang, Hai, Wang Helmersson, Ke, Wang, Jianfeng, Wang, Yi-Pin Eric, Werner, Karl, Wiberg, Niclas, Wittenmark, Emma, Yilmaz, Osman Nuri Can, Zaidi, Ali, Zhang, Zhan, Zhang, Zhang, Zheng, Yanli, Parkvall, Stefan, Abrahamsson, Richard, Aktas, Ismet, Alriksson, Peter, Ansari, Junaid, Ashraf, Shehzad Ali, Asplund, Henrik, Athley, Fredrik, Axelsson, Håkan, Axmon, Joakim, Axnäs, Johan, Balachandran, Kumar, Baldemair, Robert, Bark, Gunnar, Berg, Jan-Erik, Bergström, Andreas, Björkegren, Håkan, Brahmi, Nadia, Capar, Cagatay, Carlsson, Anders, Cedergren, Andreas, Coldrey, Mikael, Da Silva, Icaro L.J., Dahlman, Erik, El Essaili, Ali, Engström, Ulrika, Ericson, Mårten, Eriksson, Erik, Fallgren, Mikael, Fan, Rui, Fodor, Gabor, Frenger, Pål, Fridén, Jonas, Fröberg Olsson, Jonas, Furuskär, Anders, Furuskog, Johan, Garcia, Virgile, Gattami, Ather, Gunnarsson, Fredrik, Gustavsson, Ulf, Hagerman, Bo, Harrysson, Fredrik, He, Ning, Hessler, Martin, Hiltunen, Kimmo, Hong, Songnam, Hui, Dennis, Huschke, Jörg, Irnich, Tim, Jacobsson, Sven, Jaldén, Niklas, Järmyr, Simon, Jiang, Zhiyuan, Johansson, Martin, Johansson, Niklas, Kang, Du Ho, Karipidis, Eleftherios, Karlsson, Patrik, Khayrallah, Ali S., Kilinc, Caner, Klang, Göran N., Kronander, Jonas, Landström, Sara, Larsson, Christina, Li, Gen, Lincoln, Bo, Lindbom, Lars, Lindgren, Robert, Lindoff, Bengt, Lindqvist, Fredrik, Liu, Jinhua, Lohmar, Thorsten, Lu, Qianxi, Manholm, Lars, Maric, Ivana, Medbo, Jonas, Miao, Qingyu, Mildh, Gunnar, Moosavi, Reza, Nilsson, Johan, Müller, Walter, Myhre, Elena
Принадлежит: Watermark Intellectual Property Pty Ltd

Methods performed by a wireless device, such as a user equipment, operating in a dormant mode comprise performing a measurement on each of a plurality of resources from a predetermined set of resources or demodulating and decoding information from each of a plurality of resources from a predetermined set of resources, such as a set of beams. The methods further include evaluating the measurement or the demodulated and decoded information for each of the plurality of resources against a predetermined criterion, and then discontinuing the performing and evaluating of measurements, or discontinuing the demodulating and decoding and evaluation of information, in response to determining that the predetermined criterion is met, such that one or more resources in the predetermined set of resources are neither measured nor demodulated and decoded. The methods further comprise deactivating receiver circuitry, further in response to determining that the predetermined criterion is met. The method ...

Подробнее
22-08-2019 дата публикации

Circular buffer rate matching for polar codes

Номер: AU2018218656A1
Принадлежит: Watermark Intellectual Property Pty Ltd

Methods are proposed herein to perform rate matching for polar codes via circular buffering of the polar encoded bits. Embodiments are directed to methods of operation of a transmitting node in a wireless system including performing polar encoding of a set of information bits in accordance with a polar sequence of length ...

Подробнее
16-11-2017 дата публикации

NETWORK ARCHITECTURE, METHODS, AND DEVICES FOR A WIRELESS COMMUNICATIONS NETWORK

Номер: CA0003023874A1
Автор: BALDEMAIR, ROBERT, ABRAHAMSSON, RICHARD, AKTAS, ISMET, ALRIKSSON, PETER, ANSARI, JUNAID, ASHRAF, SHEHZAD ALI, ASPLUND, HENRIK, ATHLEY, FREDRIK, AXELSSON, HAKAN, AXMON, JOAKIM, AXNAS, JOHAN, BALACHANDRAN, KUMAR, BARK, GUNNAR, BERG, JAN-ERIK, BERGSTROM, ANDREAS, BJORKEGREN, HAKAN, BRAHMI, NADIA, CAPAR, CAGATAY, CARLSSON, ANDERS, CEDERGREN, ANDREAS, COLDREY, MIKAEL, DA SILVA, ICARO L. J., DAHLMAN, ERIK, EL ESSAILI, ALI, ENGSTROM, ULRIKA, ERICSON, MARTEN, ERIKSSON, ERIK, FALLGREN, MIKAEL, FAN, RUI, FODOR, GABOR, FRENGER, PAL, FRIDEN, JONAS, FROBERG OLSSON, JONAS, FURUSKAR, ANDERS, FURUSKOG, JOHAN, GARCIA, VIRGILE, GATTAMI, ATHER, GUNNARSSON, FREDRIK, GUSTAVSSON, ULF, HAGERMAN, BO, HARRYSSON, FREDRIK, HE, NING, HESSLER, MARTIN, HILTUNEN, KIMMO, HONG, SONGNAM, HUI, DENNIS, HUSCHKE, JORG, IRNICH, TIM, JACOBSSON, SVEN, JALDEN, NIKLAS, JARMYR, SIMON, JIANG, ZHIYUAN, JOHANSSON, MARTIN, JOHANSSON, NIKLAS, KANG, DU HO, KARIPIDIS, ELEFTHERIOS, KARLSSON, PATRIK, KHAYRALLAH, ALI S., KILINC, CANER, KLANG, GORAN N., KRONANDER, JONAS, LANDSTROM, SARA, LARSSON, CHRISTINA, LI, GEN, LINDBOM, LARS, LINDGREN, ROBERT, LINDOFF, BENGT, LINDQVIST, FREDRIK, LIU, JINHUA, LOHMAR, THORSTEN, LU, QIANXI, MANHOLM, LARS, MARIC, IVANA, MEDBO, JONAS, MIAO, QINGYU, MILDH, GUNNAR, MOOSAVI, REZA, MULLER, WALTER, MYHRE, ELENA, NORRMAN, KARL, OLSSON, BENGT-ERIK, PALENIUS, TORGNY, PARKVALL, STEFAN, PEISA, JANNE, PETERSSON, SVEN, PRADAS, JOSE LUIS, PRYTZ, MIKAEL, QUESETH, OLAV, RAMACHANDRA, PRADEEPA, RAMOS, EDGAR, REIAL, ANDRES, RIMHAGEN, THOMAS, RINGH, EMIL, RUGELAND, PATRIK, RUNE, JOHAN, SACHS, JOACHIM, SAHLIN, HENRIK, SAXENA, VIDIT, SEIFI, NIMA, SELEN, YNGVE, SEMAAN, ELIANE, SHARMA, SACHIN, SHI, CONG, SKOLD, JOHAN, STATTIN, MAGNUS, STJERNMAN, ANDERS, SUNDMAN, DENNIS, SUNDSTROM, LARS, TERCERO VARGAS, MIUREL ISABEL, TIDESTAV, CLAES, TOMBAZ, SIBEL, TORSNER, JOHAN, TULLBERG, HUGO, VIKBERG, JARI, VON WRYCZA, PETER, WAGER, STEFAN, WALLDEEN, THOMAS, WALLENTIN, PONTUS, WANG, HAI, WANG HELMERSSON, KE, WANG, JIANFENG, WANG, YI-PIN ERIC, WERNER, KARL, WIBERG, NICLAS, WITTENMARK, EMMA, YILMAZ, OSMAN NURI CAN, ZAIDI, ALI, ZHANG, ZHAN, ZHANG, ZHANG, ZHENG, YANLI, BALDEMAIR ROBERT, ABRAHAMSSON RICHARD, AKTAS ISMET, ALRIKSSON PETER, ANSARI JUNAID, ASHRAF SHEHZAD ALI, ASPLUND HENRIK, ATHLEY FREDRIK, AXELSSON HAKAN, AXMON JOAKIM, AXNAS JOHAN, BALACHANDRAN KUMAR, BARK GUNNAR, BERG JAN-ERIK, BERGSTROM ANDREAS, BJORKEGREN HAKAN, BRAHMI NADIA, CAPAR CAGATAY, CARLSSON ANDERS, CEDERGREN ANDREAS, COLDREY MIKAEL, DA SILVA ICARO L J, DAHLMAN ERIK, EL ESSAILI ALI, ENGSTROM ULRIKA, ERICSON MARTEN, ERIKSSON ERIK, FALLGREN MIKAEL, FAN RUI, FODOR GABOR, FRENGER PAL, FRIDEN JONAS, FROBERG OLSSON JONAS, FURUSKAR ANDERS, FURUSKOG JOHAN, GARCIA VIRGILE, GATTAMI ATHER, GUNNARSSON FREDRIK, GUSTAVSSON ULF, HAGERMAN BO, HARRYSSON FREDRIK, HE NING, HESSLER MARTIN, HILTUNEN KIMMO, HONG SONGNAM, HUI DENNIS, HUSCHKE JORG, IRNICH TIM, JACOBSSON SVEN, JALDEN NIKLAS, JARMYR SIMON, JIANG ZHIYUAN, JOHANSSON MARTIN, JOHANSSON NIKLAS, KANG DU HO, KARIPIDIS ELEFTHERIOS, KARLSSON PATRIK, KHAYRALLAH ALI S, KILINC CANER, KLANG GORAN N, KRONANDER JONAS, LANDSTROM SARA, LARSSON CHRISTINA, LI GEN, LINDBOM LARS, LINDGREN ROBERT, LINDOFF BENGT, LINDQVIST FREDRIK, LIU JINHUA, LOHMAR THORSTEN, LU QIANXI, MANHOLM LARS, MARIC IVANA, MEDBO JONAS, MIAO QINGYU, MILDH GUNNAR, MOOSAVI REZA, MULLER WALTER, MYHRE ELENA, NORRMAN KARL, OLSSON BENGT-ERIK, PALENIUS TORGNY, PARKVALL STEFAN, PEISA JANNE, PETERSSON SVEN, PRADAS JOSE LUIS, PRYTZ MIKAEL, QUESETH OLAV, RAMACHANDRA PRADEEPA, RAMOS EDGAR, REIAL ANDRES, RIMHAGEN THOMAS, RINGH EMIL, RUGELAND PATRIK, RUNE JOHAN, SACHS JOACHIM, SAHLIN HENRIK, SAXENA VIDIT, SEIFI NIMA, SELEN YNGVE, SEMAAN ELIANE, SHARMA SACHIN, SHI CONG, SKOLD JOHAN, STATTIN MAGNUS, STJERNMAN ANDERS, SUNDMAN DENNIS, SUNDSTROM LARS, TERCERO VARGAS MIUREL ISABEL, TIDESTAV CLAES, TOMBAZ SIBEL, TORSNER JOHAN, TULLBERG HUGO, VIKBERG JARI, VON WRYCZA PETER, WAGER STEFAN, WALLDEEN THOMAS, WALLENTIN PONTUS, WANG HAI, WANG HELMERSSON KE, WANG JIANFENG, WANG YI-PIN ERIC, WERNER KARL, WIBERG NICLAS, WITTENMARK EMMA, YILMAZ OSMAN NURI CAN, ZAIDI ALI, ZHANG ZHAN, ZHANG ZHANG, ZHENG YANLI
Принадлежит:

Methods and apparatus in a fifth-generation wireless communications, including an example method, in a wireless device, that includes receiving a downlink signal comprising an uplink access configuration index, using the uplink access configuration index to identify an uplink access configuration from among a predetermined plurality of uplink access configurations, and transmitting to the wireless communications network according to the identified uplink access configuration. The example method further includes, in the same wireless device, receiving, in a first downlink subframe, a first Orthogonal Frequency-Division Multiplexing (OFDM) transmission formatted according to a first numerology and receiving, in a second downlink subframe, a second OFDM transmission formatted according to a second numerology, the second numerology differing from the first numerology, where the first numerology has a first subcarrier spacing and the second numerology has a second subcarrier spacing, the first ...

Подробнее
28-10-2010 дата публикации

CHANNEL STATE INFORMATION RECONSTRUCTION FROM SPARSE DATA

Номер: CA0002759845A1
Принадлежит:

Accurate downlink channe! estimates are catenated based on infrequently transmitted Channel State information (CS!) feedback data from a UE 20. A plurality of non-uniformly spaced digital CSI feedback samples, representing the frequency response of a downlink communication channel, is received from the UE, The received CS! feedback samples are demodulated and inverse quantized. A time domain tap deiay channel model is generated from the inverse quantized CSI feedback samples. The time domain tap delay channe! model may be frequency-transformed to obtain a reconstructed frequency response of the downlink communication channel in the frequency domain. Alternatively, channel delays may be estimated based on prior delays and/or known references signals transmitted on the uplink. Channel estimates between CS! reporting instances may be predicted, such as by a sample & hold or a linear predictor. The delays may be presumed fixed, and Kalman filter coefficients evolved over time.

Подробнее
05-09-2017 дата публикации

CHANNEL STATE INFORMATION RECONSTRUCTION FROM SPARSE FEEDBACK DATA

Номер: CA0002759845C

Accurate downlink channel estimates are calculated based on infrequently transmitted Channel State Information (CSI) feedback data from a UE 20. A plurality of non-uniformly spaced digital CSI feedback samples, representing the frequency response of a downlink communication channel, is received from the UE. The received CSI feedback samples are demodulated and inverse quantized. A time domain tap delay channel model is generated from the inverse quantized CSI feedback samples. The time domain tap delay channel model may be frequency-transformed to obtain a reconstructed frequency response of the downlink communication channel in the frequency domain. Alternatively, channel delays may be estimated based on prior delays and/or known references signals transmitted on the uplink. Channel estimates between CSI reporting instances may be predicted, such as by a sample & hold or a linear predictor. The delays may be presumed fixed, and Kalman filter coefficients evolved over time.

Подробнее
25-02-2014 дата публикации

Systems and method for coordinated multipoint downlink transmissions

Номер: US0008660597B2

A method for determining antenna weights for use in transmitting data from a plurality of base stations to a user device is disclosed. The antenna weights are determined using an input covariance matrix (S), and the input covariance matrix is determined subject to a predetermined power constraint and a predetermined, non-zero interference constraint.

Подробнее
10-03-2016 дата публикации

Signal compression for backhaul communications using linear transformations

Номер: AU2012232767B2
Принадлежит:

A compression/decompression method for backhaul communication of a complex-valued radio signal between base stations and the network processing unit, such as a Central Processor of a Coordinated Multipoint (CoMP) system, significantly reduces backhaul bandwidth. The spatial and temporal correlations of the wireless IQ signal are exploited in order to remove redundancy and substantially reduce signal bandwidth. Feature component signals of significance are extracted through linear transformation to form the radio signal, and are individually quantized, possibly at different bit rates in accordance with their relative importance. The transformation can either be pre-determined or computed in real-time based on the spatial and temporal statistics of the radio signal. In the latter case, the transformation matrix or matrices are also sent over the backhaul in order to allow the radio signal to be reconstructed at the receiving end. Different methods of generating the transformation matrices ...

Подробнее
25-07-2019 дата публикации

Coding and decoding of a polar code concatenated with interleaving with an outer systematic code

Номер: AU2017393094A1
Принадлежит: AJ PARK

Systems and methods related to concatenated polar encoding with interleaving are disclosed. In some embodiments, a method of operation of a radio node to perform encoding of a plurality of data bits for transmission by the radio node comprises encoding a plurality of data bits using a linear encoder to provide a first plurality of coded bits, where the first plurality of coded bits comprises a plurality of parity bits and the plurality of data bits. The method further comprises interleaving the first plurality of coded bits in accordance with an interleaving mapping to provide a plurality of interleaved bits and encoding the plurality of interleaved bits using a polar encoder to provide a second plurality of coded bits to be transmitted by the radio node.

Подробнее
29-04-2021 дата публикации

Coding and decoding of a polar code concatenated with interleaving with an outer systematic code

Номер: AU2017393094B2
Принадлежит:

Systems and methods related to concatenated polar encoding with interleaving are disclosed. In some embodiments, a method of operation of a radio node to perform encoding of a plurality of data bits for transmission by the radio node comprises encoding a plurality of data bits using a linear encoder to provide a first plurality of coded bits, where the first plurality of coded bits comprises a plurality of parity bits and the plurality of data bits. The method further comprises interleaving the first plurality of coded bits in accordance with an interleaving mapping to provide a plurality of interleaved bits and encoding the plurality of interleaved bits using a polar encoder to provide a second plurality of coded bits to be transmitted by the radio node.

Подробнее
16-11-2017 дата публикации

NETWORK ARCHITECTURE, METHODS, AND DEVICES FOR A WIRELESS COMMUNICATIONS NETWORK

Номер: CA3114770A1
Автор: ARKV ALL STEFAN P, ABRAHAMSSON RICHARD, AKTAS ISMET, ALRIKSSON PETER, ANSARI JUNAID, ASHRAF SHEHZAD ALI, ASPLUND HENRIK, ATHLEY FREDRIK, AXELSSONK HAKAN, AXMON JOAKIM, AXNAS JOHAN, BALACHANDRAN KUMAR, BALDEMAIR ROBERT, BARK GUNNAR, BERG JAN-ERIK, BERGSTROM ANDREAS, BJORKEGREN HAKAN, BRAHMI NADIA, CAPAR CAGATAY, CARLSSON ANDERS, CEDERGREN ANDREAS, COLDREY MIKAEL, DA SILVA ICARO L J, DAHLMAN ERIK, EL ESSAILI ALI, ENGSTROM ULRIKA, ERICSON MARTEN, ERIKSSON ERIK, FALLGREN MIKAEL, FAN RUI, FODOR GABOR, FRENGER PAL, FRIDEN JONAS, FROBERG OLSSON JONAS, FURUSKAR ANDERS, FURUSKOG JOHAN, GARCIA VIRGILE, GATTAMI ATHER, GUNNARSSON FREDRIK, GUSTAVSSON ULF, HAGERMAN BO, HARRYSSON FREDRIK, HE NING, HESSLER MARTIN, HILTUNEN KIMMO, HONG SONGNAM, HUI DENNIS, HUSCHKE JORG, IRNICH TIM, JACOBSSON SVEN, JALDEN NIKLAS, JARMYR SIMON, JIANG ZHIYUAN, JOHANSSON MARTIN, JOHANSSON NIKLAS, KANG DU HO, KARIPIDIS ELEFTHERIOS, KARLSSON PATRIK, KHAYRALLAH ALI S, KILINC CANER, KLANG GORAN N, KRONANDER JONAS, LANDSTROM SARA, LARSSON CHRISTINA, LI GEN, LINCOLN BO, LINDBOM LARS, LINDGREN ROBERT, LINDOFF BENGT, LINDQVIST FREDRIK, LIU JINHUA, LOHMAR THORSTEN, LU QIANXI, MANHOLM LARS, MARIC IVANA, MEDBO JONAS, MIAO QINGYU, MILDH GUNNAR, MOOSAVI REZA, MULLER WALTER, MYHRE ELENA, NILSSON JOHAN, NORRMAN KARL, OLSSON BENGT-ERIK, PALENIUS TORGNY, PEISA JANNE, PETERSSON SVEN, PRADAS JOSE LUIS, PRYTZ MIKAEL, QUESETH OLAV, RAMACHANDRA PRADEEPA, RAMOS EDGAR, REIAL ANDRES, RIMHAGEN THOMAS, RINGH EMIL, RUGELAND PATRIK, RUNE JOHAN, SACH JOACHIM, SAHLIN HENRIK, SAXENA VIDIT, SEIFI NIMA, SELEN YNGVE, SEMAAN ELIANE, SHARMA SACHIN, SHI CONG, SKOLD JOHAN, STATTIN MAGNUS, STJERNMAN ANDERS, SUNDSTROM LARS, TERCERO VARGAS MIUREL ISABEL, TIDESTAV CLAES, TOMBAZ SIBEL, TORSNER JOHAN, TULLBERG HUGO, VIKBERG JARI, VON WRYCZA PETER, WAGER STEFAN, WALLDEEN THOMAS, WALLEN ANDERS, WALLENTIN PONTUS, WANG HAI, WANG HELMERSSON KE, WANG JIANFENG, WANG YI-PIN ERIC, WERNER KARL, WITTENMARK EMMA, YILMAZ OSMAN NURI CAN, ZAIDI ALI, ZHANG ZHAN, ZHANG ZHANG, ZHENG YANLI, ARKV ALL, STEFAN P, ABRAHAMSSON, RICHARD, AKTAS, ISMET, ALRIKSSON, PETER, ANSARI, JUNAID, ASHRAF, SHEHZAD ALI, ASPLUND, HENRIK, ATHLEY, FREDRIK, AXELSSONK, HAKAN, AXMON, JOAKIM, AXNAS, JOHAN, BALACHANDRAN, KUMAR, BALDEMAIR, ROBERT, BARK, GUNNAR, BERG, JAN-ERIK, BERGSTROM, ANDREAS, BJORKEGREN, HAKAN, BRAHMI, NADIA, CAPAR, CAGATAY, CARLSSON, ANDERS, CEDERGREN, ANDREAS, COLDREY, MIKAEL, DA SILVA, ICARO L. J., DAHLMAN, ERIK, EL ESSAILI, ALI, ENGSTROM, ULRIKA, ERICSON, MARTEN, ERIKSSON, ERIK, FALLGREN, MIKAEL, FAN, RUI, FODOR, GABOR, FRENGER, PAL, FRIDEN, JONAS, FROBERG OLSSON, JONAS, FURUSKAR, ANDERS, FURUSKOG. JOHAN, GARCIA, VIRGILE, GATTAMI, ATHER, GUNNARSSON, FREDRIK, GUSTAVSSON, ULF, HAGERMAN, BO, HARRYSSON, FREDRIK, HE, NING, HESSLER, MARTIN, HILTUNEN, KIMMO, HONG, SONGNAM, HUI, DENNIS, HUSCHKE, JORG, IRNICH, TIM, JACOBSSON, SVEN, JALDEN, NIKLAS, JARMYR, SIMON, JIANG, ZHIYUAN, JOHANSSON, MARTIN, JOHANSSON, NIKLAS, KANG, DU HO, KARIPIDIS, ELEFTHERIOS, KARLSSON, PATRIK, KHAYRALLAH, ALI S., KILINC, CANER, KLANG, GORAN N., KRONANDER, JONAS, LANDSTROM, SARA, LARSSON, CHRISTINA, LI, GEN, LINCOLN, BO, LINDBOM, LARS, LINDGREN, ROBERT, LINDOFF, BENGT, LINDQVIST, FREDRIK, LIU, JINHUA, LOHMAR, THORSTEN, LU, QIANXI, MANHOLM, LARS, MARIC, IVANA, MEDBO, JONAS, MIAO, QINGYU, MILDH, GUNNAR, MOOSAVI, REZA, MULLER, WALTER, MYHRE, ELENA, NILSSON, JOHAN, NORRMAN, KARL, OLSSON, BENGT-ERIK, PALENIUS, TORGNY, PEISA, JANNE, PETERSSON, SVEN, PRADAS, JOSE LUIS, PRYTZ, MIKAEL, QUESETH, OLAV, RAMACHANDRA, PRADEEPA, RAMOS, EDGAR, REIAL, ANDRES, RIMHAGEN, THOMAS, RINGH, EMIL, RUGELAND, PATRIK, RUNE, JOHAN, SACH, JOACHIM, SAHLIN, HENRIK, SAXENA, VIDIT, SEIFI, NIMA, SELEN, YNGVE, SEMAAN, ELIANE, SHARMA, SACHIN, SHI, CONG, SKOLD, JOHAN, STATTIN, MAGNUS, STJERNMAN, ANDERS, SUNDSTROM, LARS, TERCERO VARGAS, MIUREL ISABEL, TIDESTAV, CLAES, TOMBAZ, SIBEL, TORSNER, JOHAN, TULLBERG, HUGO, VIKBERG, JARI, VON WRYCZA, PETER, WAGER, STEFAN, WALLDEEN, THOMAS, WALLEN, ANDERS, WALLENTIN, PONTUS, WANG, HAI, WANG HELMERSSON, KE, WANG, JIANFENG, WANG, YI-PIN ERIC, WERNER, KARL, WITTENMARK, EMMA, YILMAZ, OSMAN NURI CAN, ZAIDI, ALI, ZHANG, ZHAN, ZHANG, ZHANG, ZHENG, YANLI
Принадлежит:

Подробнее
27-05-2010 дата публикации

BLIND FREQUENCY-OFFSET ESTIMATION FOR TEMPORALLY AND/OR SPATIALLY CORRELATED SIGNAL

Номер: CA0002742606A1
Автор: HUI, DENNIS, HUI DENNIS
Принадлежит:

An iterative, blind, frequency-offset estimation process that does not require any training signal or demodulated information symbols is disclosed. Receivers embodying the disclosed processes can produce periodic frequency-offset estimates, without running computationally intensive equalization or demodulation algorithms, by exploiting the temporal correlation of the received signal in the time domain, as well as the received signal's correlation across in-phase and quadrature dimensions, in some embodiments, to find a frequency-offset estimate that best fits the received signal in a maximum-likelihood sense. In an exemplary method of estimating receiver frequency offset, a temporally stacked signal block is formed from multi-branch signal samples corresponding to each of two or more time-separated samples of the received signal. The temporally stacked signal block is used in computing a maximum-likelihood joint estimate of the receiver frequency offset and the spatial covariance of the ...

Подробнее
24-09-2014 дата публикации

Metric corrections for demodulators using serial localization with indecision

Номер: CN104067584A
Автор: KHAYRALLAH ALI, HUI DENNIS
Принадлежит:

Demodulation methods and apparatus for a multi-stage SLI demodulator are disclosed. Residual signals from each demodulation stage are modeled as finite sets of unresolved signals and a new metric is introduced for use in search of best candidate symbol estimates. The metric may be evaluated based on a probability distribution function of the residual signals or a probability mass function of the unresolved signals. The metric may also be approximated by the sum of a conventional Euclidean metric and a correction metric. The best candidate symbol estimates generated from each stage of the multi-stage SLI demodulator are summed to form cumulative symbol estimates.

Подробнее
03-11-2020 дата публикации

Soft decoding of rate-compatible polar codes

Номер: US0010826540B2

A node receives transmissions associated with a given set of information bits, wherein each of the transmissions use a different polar code and share one or more information bits of the given set of information bits. The node determines, at each of a plurality of polar decoders of the node, soft information for each information bit included in an associated one of the transmissions, wherein each of the plurality of polar decoders is associated with a different transmission of the transmissions. The node provides, from each polar decoder of the plurality to one or more other polar decoders of the plurality, the determined soft information for any information bits shared by their respective associated transmissions, and uses the provided soft information in an iterative decoding process to decode one or more of the received transmissions.

Подробнее
07-05-2019 дата публикации

Transmission of a signal according to a single- or multi-carrier modulation scheme

Номер: US0010284403B2

A method performed by a communication node for transmission of a signal according to a single- or multiple carrier modulation scheme in a wireless communications network. The communication node modulates at least a first part of the signal into at least a first symbol with a shorter duration than a complete symbol according to the modulation scheme. The communication node modulates at least a second part of the signal into at least a second symbol with a shorter duration than a complete symbol according to the modulation scheme. The duration of the at least first and second symbols are equal to the duration of a complete symbol according to the carrier modulation scheme. Then, the communication node transmits the at least first and second symbol as a complete symbol according to the modulation scheme without time domain separation.

Подробнее
12-03-2015 дата публикации

BACKHAUL SIGNAL COMPRESSION THROUGH SPATIAL-TEMPORAL LINEAR PREDICTION

Номер: US20150071174A1
Автор: Dennis HUI, HUI DENNIS
Принадлежит:

The technology in this application compresses multi-antenna, complex-valued signals by exploiting both a spatial and a temporal correlation of the signals to remove redundancy within the complex-valued signals and substantially reduce the capacity requirement of backhaul links. At a receiver, the compressed signal is received, and a decompressor decompresses the received signal over space and over time to reconstruct the multiple antenna stream. 1. A decompression method , comprising the steps of:receiving a compressed radio signal that corresponds to a multi-antenna signal, the multi-antenna signal including information associated with a user communication received over multiple radio antennas;decompressing the compressed radio signal based on one or more correlations in space and in time to reconstruct a representation of the multi-antenna signal that is complex-valued, andproviding a reconstructed representation of the multi-antenna signal for further processing or output.2. The method of claim 1 , wherein the one or more correlations comprise a correlation in space and an independent correlation in time.3. The method of claim 1 , wherein the one or more correlations comprise a joint correlation in space and time.4. The decompression method in claim 1 , wherein the reconstructed representation of the multi-antenna radio signal is sampled and multi-dimensional.5. The decompression method in claim 1 , wherein:the multi-antenna signal includes a plurality of antenna signals, each comprising information received by a different one of the multiple antennas;the compressed radio signal includes, for each antenna signal, an error signal indicating an error between the antenna signal and a prediction of the antenna signal; and converting the error signals from a digital format to an analog format', 'applying an inverse spatial linear transform to the error signals to generate corresponding quantized error signals, and', 'performing infinite impulse response filtering on ...

Подробнее
01-07-2010 дата публикации

Method and Arrangement for Improved Model Order Selection

Номер: US20100167679A1
Принадлежит: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)

In a method of enabling model order selection for joint channel synchronization and noise covariance estimation of at least one received signal in a wireless communication network, generating S0 a spatially and temporally stacked signal model by stacking successive samples of temporally adjacent received signal vectors and corresponding training vectors, computing S1 a noise variance matrix for each hypothesized synchronization position, channel length and stacking order, based on the stacked training symbols: determining S2 a best synchronization position for the received signal, based on the stacked training vectors, by jointly determining the best synchronization position for the received signal and estimating a channel length and a stacking order for said signal model based on the stacked training vectors.

Подробнее
04-05-2017 дата публикации

Beam-Scan Time Indicator

Номер: US20170127367A1
Принадлежит:

The present disclosure relates to transmitting synchronization signals and in particular to so called beam sweep. In particular the disclosure relates to methods for providing synchronization using synchronization sequences that are transmitted at different points in time. The disclosure also relates to corresponding devices and computer programs. A method in a network node, for transmitting synchronization sequences of a synchronization signal to one or more receiving wireless devices, comprises determining multiple synchronization sequences, such that each synchronization sequence comprises a respective timing indication, whereby each synchronization sequence enables determination of a time of an event in a receiving wireless device and transmitting the synchronization sequences to the one or more wireless devices, at different points in time. 1. A method implemented by a network node , for transmitting synchronization sequences of a synchronization signal to one or more receiving wireless devices , the method comprising:determining multiple synchronization sequences, such that each synchronization sequence comprises a respective timing indication, whereby each synchronization sequence enables determination of a time of an event in a receiving wireless device; andtransmitting the synchronization sequences to the one or more wireless devices, at different points in time.2. The method of claim 1 , wherein the multiple synchronization sequences are time dependent versions of a synchronization signal referring to one particular event.3. The method of claim 1 , further comprising determining a time of the event.4. The method of claim 1 , wherein the synchronization sequences are transmitted in different directions.5. The method of claim 4 , wherein the transmission of the synchronization sequences constitutes a beam sweep.6. The method of claim 1 , wherein the timing indications are relative to a time of transmission of the respective synchronization sequence.7. The ...

Подробнее
28-06-2011 дата публикации

Delay-doppler channel response demodulation method and apparatus

Номер: US0007970081B2

A wireless communication device uses a time-invariant delay-Doppler channel response estimate for received signal demodulation. The device provides coherent signal demodulation by accounting for frequency and time selectivity in a land-based mobile communication environment, which arise mainly because of delay and Doppler shifts, respectively. In one embodiment, the wireless communication device includes a channel estimator that estimates channel response in a wireless communication network by estimating a delay-Doppler response of a wireless communication channel to obtain a delay-Doppler channel response estimate and converting the delay-Doppler channel response estimate to a time-varying channel response estimate, e.g., a time-varying frequency or impulse response. The delay-Doppler response may be estimated in a continuous or discrete domain. In one embodiment, the channel estimator includes a delay-Doppler correlator that measures the delay-Doppler response by observing a response ...

Подробнее
27-08-2001 дата публикации

Least squares channel estimation with colored noise correction

Номер: AU0003647901A
Принадлежит:

Подробнее
03-10-2019 дата публикации

Multiplexing of subframes with different subcarrier spacings

Номер: AU2017264328B2
Автор: BALDEMAIR ROBERT, ABRAHAMSSON RICHARD, AKTAS ISMET, ALRIKSSON PETER, ANSARI JUNAID, ASHRAF SHEHZAD ALI, ASPLUND HENRIK, ATHLEY FREDRIK, ZHENG YANLI, AXELSSON HÅKAN, AXMON JOAKIM, AXNÄS JOHAN, BALACHANDRAN KUMAR, BARK GUNNAR, BERG JAN-ERIK, BERGSTRÖM ANDREAS, BJÖRKEGREN HÅKAN, BRAHMI NADIA, CAPAR CAGATAY, CARLSSON ANDERS, CEDERGREN ANDREAS, COLDREY MIKAEL, DA SILVA ICARO L J, DAHLMAN ERIK, EL ESSAILI ALI, ENGSTRÖM ULRIKA, ERICSON MÅRTEN, ERIKSSON ERIK, FALLGREN MIKAEL, FAN RUI, FODOR GABOR, FRENGER PÅL, FRIDÉN JONAS, FRÖBERG OLSSON JONAS, FURUSKÄR ANDERS, FURUSKOG JOHAN, GARCIA VIRGILE, GATTAMI ATHER, GUNNARSSON FREDRIK, GUSTAVSSON ULF, HAGERMAN BO, HARRYSSON FREDRIK, HE NING, HESSLER MARTIN, HILTUNEN KIMMO, HONG SONGNAM, HUI DENNIS, HUSCHKE JÖRG, IRNICH TIM, JACOBSSON SVEN, JALDÉN NIKLAS, JÄRMYR SIMON, JIANG ZHIYUAN, JOHANSSON MARTIN, JOHANSSON NIKLAS, KANG DU HO, KARIPIDIS ELEFTHERIOS, KARLSSON PATRIK, KHAYRALLAH ALI S, KILINC CANER, KLANG GÖRAN N, KRONANDER JONAS, LANDSTRÖM SARA, LARSSON CHRISTINA, LI GEN, LINDBOM LARS, LINDGREN ROBERT, LINDOFF BENGT, LINDQVIST FREDRIK, LIU JINHUA, LOHMAR THORSTEN, LU QIANXI, MANHOLM LARS, MARIC IVANA, MEDBO JONAS, MIAO QINGYU, MILDH GUNNAR, MOOSAVI REZA, MÜLLER WALTER, MYHRE ELENA, NORRMAN KARL, OLSSON BENGT-ERIK, PALENIUS TORGNY, PARKVALL STEFAN, PEISA JANNE, PETERSSON SVEN, PRADAS JOSE LUIS, PRYTZ MIKAEL, QUESETH OLAV, RAMACHANDRA PRADEEPA, RAMOS EDGAR, REIAL ANDRES, RIMHAGEN THOMAS, RINGH EMIL, RUGELAND PATRIK, RUNE JOHAN, SACHS JOACHIM, SAHLIN HENRIK, SAXENA VIDIT, SEIFI NIMA, SELÈN YNGVE, SEMAAN ELIANE, SHARMA SACHIN, SHI CONG, SKÖLD JOHAN, STATTIN MAGNUS, STJERNMAN ANDERS, SUNDMAN DENNIS, TOMBAZ SIBEL, SUNDSTRÖM LARS, TERCERO VARGAS MIUREL ISABEL, TIDESTAV CLAES, TORSNER JOHAN, TULLBERG HUGO, VIKBERG JARI, VON WRYCZA PETER, WAGER STEFAN, WALLDEEN THOMAS, WALLENTIN PONTUS, WANG HAI, WANG HELMERSSON KE, WANG JIANFENG, WANG YI-PIN ERIC, WERNER KARL, WIBERG NICLAS, WITTENMARK EMMA, YILMAZ OSMAN NURI CAN, ZAIDI ALI, ZHANG ZHAN, ZHANG ZHANG, Baldemair, Robert, Abrahamsson, Richard, Aktas, Ismet, Alriksson, Peter, Ansari, Junaid, Ashraf, Shehzad Ali, Asplund, Henrik, Athley, Fredrik, Zheng, Yanli, Axelsson, Håkan, Axmon, Joakim, Axnäs, Johan, Balachandran, Kumar, Bark, Gunnar, Berg, Jan-Erik, Bergström, Andreas, Björkegren, Håkan, Brahmi, Nadia, Capar, Cagatay, Carlsson, Anders, Cedergren, Andreas, Coldrey, Mikael, Da Silva, Icaro L.J., Dahlman, Erik, El Essaili, Ali, Engström, Ulrika, Ericson, Mårten, Eriksson, Erik, Fallgren, Mikael, Fan, Rui, Fodor, Gabor, Frenger, Pål, Fridén, Jonas, Fröberg Olsson, Jonas, Furuskär, Anders, Furuskog, Johan, Garcia, Virgile, Gattami, Ather, Gunnarsson, Fredrik, Gustavsson, Ulf, Hagerman, Bo, Harrysson, Fredrik, He, Ning, Hessler, Martin, Hiltunen, Kimmo, Hong, Songnam, Hui, Dennis, Huschke, Jörg, Irnich, Tim, Jacobsson, Sven, Jaldén, Niklas, Järmyr, Simon, Jiang, Zhiyuan, Johansson, Martin, Johansson, Niklas, Kang, Du Ho, Karipidis, Eleftherios, Karlsson, Patrik, Khayrallah, Ali S., Kilinc, Caner, Klang, Göran N., Kronander, Jonas, Landström, Sara, Larsson, Christina, Li, Gen, Lindbom, Lars, Lindgren, Robert, Lindoff, Bengt, Lindqvist, Fredrik, Liu, Jinhua, Lohmar, Thorsten, Lu, Qianxi, Manholm, Lars, Maric, Ivana, Medbo, Jonas, Miao, Qingyu, Mildh, Gunnar, Moosavi, Reza, Müller, Walter, Myhre, Elena, Norrman, Karl, Olsson, Bengt-Erik, Palenius, Torgny, Parkvall, Stefan, Peisa, Janne, Petersson, Sven, Pradas, Jose Luis, Prytz, Mikael, Queseth, Olav, Ramachandra, Pradeepa, Ramos, Edgar, Reial, Andres, Rimhagen, Thomas, Ringh, Emil, Rugeland, Patrik, Rune, Johan, Sachs, Joachim, Sahlin, Henrik, Saxena, Vidit, Seifi, Nima, Selèn, Yngve, Semaan, Eliane, Sharma, Sachin, Shi, Cong, Sköld, Johan, Stattin, Magnus, Stjernman, Anders, Sundman, Dennis, Tombaz, Sibel, Sundström, Lars, Tercero Vargas, Miurel Isabel, Tidestav, Claes, Torsner, Johan, Tullberg, Hugo, Vikberg, Jari, Von Wrycza, Peter, Wager, Stefan, Walldeen, Thomas, Wallentin, Pontus, Wang, Hai, Wang Helmersson, Ke, Wang, Jianfeng, Wang, Yi-Pin Eric, Werner, Karl, Wiberg, Niclas, Wittenmark, Emma, Yilmaz, Osman Nuri Can, Zaidi, Ali, Zhang, Zhan, Zhang, Zhang
Принадлежит: Watermark Intellectual Property Pty Ltd

Methods and apparatus in a fifth-generation wireless communications, including an example method, in a wireless device, that includes receiving a downlink signal comprising an uplink access configuration index, using the uplink access configuration index to identify an uplink access configuration from among a predetermined plurality of uplink access configurations, and transmitting to the wireless communications network according to the identified uplink access configuration. The example method further includes, in the same wireless device, receiving, in a first downlink subframe, a first Orthogonal Frequency-Division Multiplexing (OFDM) transmission formatted according to a first numerology and receiving, in a second downlink subframe, a second OFDM transmission formatted according to a second numerology, the second numerology differing from the first numerology, where the first numerology has a first subcarrier spacing and the second numerology has a second subcarrier spacing, the first ...

Подробнее
15-01-2015 дата публикации

Network-centric link adaptation for coordinated multipoint downlink transmission

Номер: AU2013273112A1
Принадлежит:

A Coordinated Multipoint (CoMP) cell controller performs network-centric link adaptation for User Equipment (UE) in the CoMP cell. The CoMP cell controller receives at least infrequent channel estimates from a UE in the CoMP cell, from which it estimates downlink channel and thermal noise at the UE. The CoMP cell controller is aware of the desired signal to be received at the UE, and the intra-CoMP cell interference to the UE caused by transmissions to other UEs in the CoMP cell. The CoMP cell receives from the UE reports of inter-CoMP cell interference caused by transmissions by other CoMP cells. Based on the downlink channel quality, the desired signal, the intra-CoMP cell interference, the inter-CoMP cell interference, and the thermal noise, the CoMP cell controller performs link adaptation by selecting modulation and coding schemes, and other transmission parameters, for an upcoming transmission duration (such as a TTI).

Подробнее
19-04-2018 дата публикации

Beam-scan time indicator

Номер: AU2015413261A1
Принадлежит: Baldwins Intellectual Property

The present disclosure relates to transmitting synchronization signals and in particular to so called beam sweep. In particular the disclosure relates to methods for providing synchronization using synchronization sequences that are transmitted at different points in time. The disclosure also relates to corresponding devices and computer programs.A method in a network node, for transmitting synchronization sequences of a synchronization signal to one or more receiving wireless devices, comprises determining multiple synchronization sequences, such that each synchronization sequence comprises a respective timing indication, whereby each synchronization sequence enables determination of a time of an event in a receiving wireless device and transmitting the synchronization sequences to the one or more wireless devices, at different points in time.

Подробнее
31-03-2010 дата публикации

Adaptive compression of channel feedback based on second order channel statistics

Номер: CN0101689969A
Принадлежит:

A method of variable rate vector quantization reduces the amount of channel state feedback. Channel coefficients of a communication channel are determined and second order statistics (e.g. Variances)of the channel taps are computed. Bit allocation for the channel taps are determined based on the coefficients statistics. The channel taps are individually quantized at rates determined based on said bit allocations.

Подробнее
01-08-2017 дата публикации

Backhaul signal compression through spatial-temporal linear prediction

Номер: US0009722677B2

The technology in this application compresses multi-antenna, complex-valued signals by exploiting both a spatial and a temporal correlation of the signals to remove redundancy within the complex-valued signals and substantially reduce the capacity requirement of backhaul links. At a receiver, the compressed signal is received, and a decompressor decompresses the received signal over space and over time to reconstruct the multiple antenna stream.

Подробнее
17-06-2008 дата публикации

Method of inverting nearly Toeplitz or block Toeplitz matrices

Номер: US0007388935B2
Автор: Dennis Hui, HUI DENNIS

A method of computing an inversion (X) of a nearly Toeplitz n by n matrix (A). A perturbation matrix (E) is first determined such that the sum of the nearly Toeplitz matrix (A) and the perturbation matrix (E) is a Toeplitz matrix (T). The inversion is solved by solving the equation X=T-1(B+EX), where B is a vector or matrix of dimension n by m. An initial estimate X(0) is selected and estimates of the inversion X are iteratively computed through the recursion X(n-1)=T-1(B+EX(n)). The initial estimate X(0) may be equal to an inversion (T-1) of the Toeplitz matrix (T). The present invention may be utilized in a radio receiver to efficiently compute (1) a least-squares (LS) channel estimate, (2) minimum mean squared error (MMSE) prefilter coefficients for a decision feedback equalizer (DFE), or (3) an autoregressive (AR) noise-spectrum estimation from a finite number of observed noise samples.

Подробнее
30-04-2020 дата публикации

Network architecture, methods, and devices for a wireless communications network

Номер: AU2017262847B2
Автор: PARKVALL STEFAN, ABRAHAMSSON RICHARD, AKTAS ISMET, ALRIKSSON PETER, ANSARI JUNAID, ASHRAF SHEHZAD ALI, ASPLUND HENRIK, ATHLEY FREDRIK, AXELSSON HÅKAN, AXMON JOAKIM, AXNÄS JOHAN, BALACHANDRAN KUMAR, BALDEMAIR ROBERT, BARK GUNNAR, BERG JAN-ERIK, BERGSTRÖM ANDREAS, BJÖRKEGREN HÅKAN, BRAHMI NADIA, CAPAR CAGATAY, CARLSSON ANDERS, CEDERGREN ANDREAS, EL ESSAILI ALI, COLDREY MIKAEL, DA SILVA ICARO L J, DAHLMAN ERIK, ENGSTRÖM ULRIKA, ERICSON MÅRTEN, ERIKSSON ERIK, FALLGREN MIKAEL, FAN RUI, FODOR GABOR, FRENGER PÅL, FRIDÉN JONAS, FRÖBERG OLSSON JONAS, FURUSKÄR ANDERS, FURUSKOG JOHAN, GARCIA VIRGILE, GATTAMI ATHER, GUNNARSSON FREDRIK, GUSTAVSSON ULF, HAGERMAN BO, HARRYSSON FREDRIK, HE NING, HESSLER MARTIN, HILTUNEN KIMMO, HONG SONGNAM, HUI DENNIS, HUSCHKE JÖRG, IRNICH TIM, JACOBSSON SVEN, JALDÉN NIKLAS, JÄRMYR SIMON, JIANG ZHIYUAN, JOHANSSON MARTIN, JOHANSSON NIKLAS, KANG DU HO, KARIPIDIS ELEFTHERIOS, KARLSSON PATRIK, KHAYRALLAH ALI S, KILINC CANER, KLANG GÖRAN N, KRONANDER JONAS, LANDSTRÖM SARA, LARSSON CHRISTINA, LI GEN, LINCOLN BO, LINDBOM LARS, LINDGREN ROBERT, LOHMAR THORSTEN, LINDOFF BENGT, LINDQVIST FREDRIK, LIU JINHUA, LU QIANXI, MANHOLM LARS, MARIC IVANA, MEDBO JONAS, MIAO QINGYU, MILDH GUNNAR, MOOSAVI REZA, MÜLLER WALTER, MYHRE ELENA, NILSSON JOHAN, NORRMAN KARL, OLSSON BENGT-ERIK, PALENIUS TORGNY, PEISA JANNE, PETERSSON SVEN, PRADAS JOSE LUIS, PRYTZ MIKAEL, QUESETH OLAV, RAMACHANDRA PRADEEPA, RAMOS EDGAR, REIAL ANDRES, RIMHAGEN THOMAS, RINGH EMIL, RUGELAND PATRIK, RUNE JOHAN, SACHS JOACHIM, SAHLIN HENRIK, SAXENA VIDIT, SEIFI NIMA, SELÈN YNGVE, SEMAAN ELIANE, SHARMA SACHIN, SHI CONG, SKÖLD JOHAN, STATTIN MAGNUS, STJERNMAN ANDERS, SUNDMAN DENNIS, SUNDSTRÖM LARS, TERCERO VARGAS MIUREL ISABEL, TIDESTAV CLAES, TOMBAZ SIBEL, TORSNER JOHAN, TULLBERG HUGO, VIKBERG JARI, VON WRYCZA PETER, WAGER STEFAN, WALLDEEN THOMAS, WALLÈN ANDERS, WALLENTIN PONTUS, WANG HAI, WANG HELMERSSON KE, WANG JIANFENG, WANG YI-PIN ERIC, WERNER KARL, WIBERG NICLAS, WITTENMARK EMMA, YILMAZ OSMAN NURI CAN, ZAIDI ALI, ZHANG ZHAN, ZHANG ZHANG, ZHENG YANLI, Parkvall, Stefan, Abrahamsson, Richard, Aktas, Ismet, Alriksson, Peter, Ansari, Junaid, Ashraf, Shehzad Ali, Asplund, Henrik, Athley, Fredrik, Axelsson, Håkan, Axmon, Joakim, Axnäs, Johan, Balachandran, Kumar, Baldemair, Robert, Bark, Gunnar, Berg, Jan-Erik, Bergström, Andreas, Björkegren, Håkan, Brahmi, Nadia, Capar, Cagatay, Carlsson, Anders, Cedergren, Andreas, El Essaili, Ali, Coldrey, Mikael, Da Silva, Icaro L.J., Dahlman, Erik, Engström, Ulrika, Ericson, Mårten, Eriksson, Erik, Fallgren, Mikael, Fan, Rui, Fodor, Gabor, Frenger, Pål, Fridén, Jonas, Fröberg Olsson, Jonas, Furuskär, Anders, Furuskog, Johan, Garcia, Virgile, Gattami, Ather, Gunnarsson, Fredrik, Gustavsson, Ulf, Hagerman, Bo, Harrysson, Fredrik, He, Ning, Hessler, Martin, Hiltunen, Kimmo, Hong, Songnam, Hui, Dennis, Huschke, Jörg, Irnich, Tim, Jacobsson, Sven, Jaldén, Niklas, Järmyr, Simon, Jiang, Zhiyuan, Johansson, Martin, Johansson, Niklas, Kang, Du Ho, Karipidis, Eleftherios, Karlsson, Patrik, Khayrallah, Ali S., Kilinc, Caner, Klang, Göran N., Kronander, Jonas, Landström, Sara, Larsson, Christina, Li, Gen, Lincoln, Bo, Lindbom, Lars, Lindgren, Robert, Lohmar, Thorsten, Lindoff, Bengt, Lindqvist, Fredrik, Liu, Jinhua, Lu, Qianxi, Manholm, Lars, Maric, Ivana, Medbo, Jonas, Miao, Qingyu, Mildh, Gunnar, Moosavi, Reza, Müller, Walter, Myhre, Elena, Nilsson, Johan, Norrman, Karl, Olsson, Bengt-Erik, Palenius, Torgny, Peisa, Janne, Petersson, Sven, Pradas, Jose Luis, Prytz, Mikael, Queseth, Olav, Ramachandra, Pradeepa, Ramos, Edgar, Reial, Andres, Rimhagen, Thomas, Ringh, Emil, Rugeland, Patrik, Rune, Johan, Sachs, Joachim, Sahlin, Henrik, Saxena, Vidit, Seifi, Nima, Selèn, Yngve, Semaan, Eliane, Sharma, Sachin, Shi, Cong, Sköld, Johan, Stattin, Magnus, Stjernman, Anders, Sundman, Dennis, Sundström, Lars, Tercero Vargas, Miurel Isabel, Tidestav, Claes, Tombaz, Sibel, Torsner, Johan, Tullberg, Hugo, Vikberg, Jari, Von Wrycza, Peter, Wager, Stefan, Walldeen, Thomas, Wallèn, Anders, Wallentin, Pontus, Wang, Hai, Wang Helmersson, Ke, Wang, Jianfeng, Wang, Yi-Pin Eric, Werner, Karl, Wiberg, Niclas, Wittenmark, Emma, Yilmaz, Osman Nuri Can, Zaidi, Ali, Zhang, Zhan, Zhang, Zhang, Zheng, Yanli
Принадлежит: Watermark Intellectual Property Pty Ltd

Methods performed by a wireless device, such as a user equipment, operating in a dormant mode comprise performing a measurement on each of a plurality of resources from a predetermined set of resources or demodulating and decoding information from each of a plurality of resources from a predetermined set of resources, such as a set of beams. The methods further include evaluating the measurement or the demodulated and decoded information for each of the plurality of resources against a predetermined criterion, and then discontinuing the performing and evaluating of measurements, or discontinuing the demodulating and decoding and evaluation of information, in response to determining that the predetermined criterion is met, such that one or more resources in the predetermined set of resources are neither measured nor demodulated and decoded. The methods further comprise deactivating receiver circuitry, further in response to determining that the predetermined criterion is met. The method ...

Подробнее
02-01-2018 дата публикации

NETWORK-CENTRIC LINK ADAPTATION FOR COORDINATED MULTIPOINT DOWNLINK TRANSMISSION

Номер: CA0002764229C

A Coordinated Multipoint (COMP) cell controller performs network-centric Sink adaptation for User Equipment (UE) in the CoMP cell. The CoMP cell controller receives at least infrequent channel estimates from a UE in the CoMP cell, from which it estimates downlink channel and thermal noise at the UE. The CoMP cell controller is aware of the desired signal to be received at the UE, and the intra-CoMP cell interference to the UE caused by transmissions to other UEs in the CoMP cell. The CoMP cell receives from the UE reports of inter-CoMP cell interference caused by transmissions by other CoMP cells. Based on the downlink channel quality, the desired signal, the intra-CoMP cell interference, the intex-CoMP cell interference, and the thermal noise, the CoMP cell controller performs link adaptation by selecting modulation and coding schemes, and other transmission parameters, for mi upcoming transmission duration (such as a TTI).

Подробнее
14-02-2017 дата публикации

BLIND FREQUENCY-OFFSET ESTIMATION FOR TEMPORALLY AND/OR SPATIALLY CORRELATED SIGNAL

Номер: CA0002742606C
Автор: HUI, DENNIS, HUI DENNIS
Принадлежит: TELEFONAKTIEBOLAGET L M ERICSSON (PUBL)

An iterative, blind, frequency-offset estimation process that does not require any training signal or demodulated information symbols is disclosed. Receivers embodying the disclosed processes can produce periodic frequency-offset estimates, without running computationally intensive equalization or demodulation algorithms, by exploiting the temporal correlation of the received signal in the time domain, as well as the received signal's correlation across in-phase and quadrature dimensions, in some embodiments, to find a frequency-offset estimate that best fits the received signal in a maximum-likelihood sense. In an exemplary method of estimating receiver frequency offset, a temporally stacked signal block is formed from multi-branch signal samples corresponding to each of two or more time-separated samples of the received signal. The temporally stacked signal block is used in computing a maximum-likelihood joint estimate of the receiver frequency offset and the spatial covariance of the ...

Подробнее
25-05-2021 дата публикации

Soft output decoding of polar codes

Номер: US0011018696B2

According to certain embodiments, a method is provided for generating soft information for code bits of polar codes. The method includes receiving, by a decoder of a receiver, soft information associated with coded bits from a first module of the receiver and using a tree structure of the polar code to generate updated soft information. The updated soft information is output by the decoder for use by a second module of the receiver.

Подробнее
03-04-2014 дата публикации

LINK ADAPTATION FOR A MULTI-HOP ROUTE IN A WIRELESS MESH NETWORK

Номер: US20140092745A1
Принадлежит: Telefonaktiebolaget L M Ericsson (publ)

Systems and methods for link adaptation for a multi-hop route in a wireless mesh network are disclosed. In one embodiment, a wireless mesh network includes network nodes in a route through the wireless mesh network. The network nodes determine a bottleneck information flow rate for the route based on backward propagation of information indicative of a tentative bottleneck information flow rate for the route from an ending network node to a starting network node through one or more intermediate network nodes. A target information flow rate for the route that is less than or equal to the bottleneck information flow rate for the route is determined. A Modulation and Coding Scheme (MCS) and, in some embodiments, a transmission mode is determined for each network node in the route other than the ending network node based on forward propagation of information indicative of the target information flow rate for the route. 1. A network node in a wireless mesh network , comprising:a radio subsystem comprising a transmitter and a receiver; and receive from a downstream network node of the network node in a route through the wireless mesh network, via the radio subsystem, information that is indicative of one or more tentative bottleneck information flow rates determined by the downstream network node for the route;', 'determine one or more new tentative bottleneck information flow rates for the route based on the one or more tentative bottleneck information flow rates determined by the downstream network node for the route;', 'transmit to an upstream network node of the network node in the route through the wireless mesh network, via the radio subsystem, information that is indicative of the one or more new tentative bottleneck information flow rates for the route;', 'receive from the upstream network node, via the radio subsystem, information that is indicative of a target information flow rate for a wireless link from a transmitter of the upstream network node to the ...

Подробнее
17-10-2019 дата публикации

SOFT DECODING OF RATE-COMPATIBLE POLAR CODES

Номер: US20190319647A1
Принадлежит:

A node (110, 115) receives (804) transmissions associated with a given set of information bits, wherein each of the transmissions use a different polar code and share one or more information bits of the given set of information bits. The node determines (808), at each of a plurality of polar decoders (505, 605) of the node, soft information for each information bit included in an associated one of the transmissions, wherein each of the plurality of polar decoders is associated with a different transmission of the transmissions. The node provides (812), from each polar decoder of the plurality to one or more other polar decoders of the plurality, the determined soft information for any information bits shared by their respective associated transmissions, and uses (816) the provided soft information in an iterative decoding process to decode one or more of the received transmissions.

Подробнее
03-02-2015 дата публикации

Signal compression for backhaul communications using linear transformations

Номер: US8948138B2

A compression/decompression method for backhaul communication of a complex-valued radio signal between base stations and the network processing unit, such as a Central Processor of a Coordinated MultiPoint (CoMP) system, significantly reduces backhaul bandwidth. The spatial and temporal correlations of the wireless IQ signal are exploited in order to remove redundancy and substantially reduce signal bandwidth. Feature component signals of significance are extracted through linear transformation to form the radio signal, and are individually quantized, possibly at different bit rates in accordance with their relative importance. The transformation can either be pre-determined or computed in real-time based on the spatial and temporal statistics of the radio signal. In the latter case, the transformation matrix or matrices are also sent over the backhaul in order to allow the radio signal to be reconstructed at the receiving end. Different methods of generating the transformation matrices ...

Подробнее
29-11-2018 дата публикации

Multiplexing of subframes with different subcarrier spacings

Номер: AU2017264328A1
Автор: BALDEMAIR ROBERT, ABRAHAMSSON RICHARD, AKTAS ISMET, ALRIKSSON PETER, ANSARI JUNAID, ASHRAF SHEHZAD ALI, ASPLUND HENRIK, ATHLEY FREDRIK, AXELSSON HÅKAN, AXMON JOAKIM, AXNÄS JOHAN, BALACHANDRAN KUMAR, BARK GUNNAR, BERG JAN-ERIK, BERGSTRÖM ANDREAS, BJÖRKEGREN HÅKAN, BRAHMI NADIA, TULLBERG HUGO, VIKBERG JARI, VON WRYCZA PETER, WAGER STEFAN, WALLDEEN THOMAS, WALLENTIN PONTUS, WANG HAI, WANG HELMERSSON KE, WANG JIANFENG, WANG YI-PIN ERIC, WERNER KARL, WIBERG NICLAS, WITTENMARK EMMA, YILMAZ OSMAN NURI CAN, ZAIDI ALI, ZHANG ZHAN, ZHANG ZHANG, ZHENG YANLI, FAN RUI, ERICSON MÅRTEN, ERIKSSON ERIK, FALLGREN MIKAEL, FODOR GABOR, FRENGER PÅL, FRIDÉN JONAS, FRÖBERG OLSSON JONAS, FURUSKÄR ANDERS, FURUSKOG JOHAN, GARCIA VIRGILE, GATTAMI ATHER, GUNNARSSON FREDRIK, GUSTAVSSON ULF, HAGERMAN BO, HARRYSSON FREDRIK, HE NING, HESSLER MARTIN, HILTUNEN KIMMO, HONG SONGNAM, HUI DENNIS, HUSCHKE JÖRG, IRNICH TIM, JACOBSSON SVEN, JALDÉN NIKLAS, JÄRMYR SIMON, JIANG ZHIYUAN, JOHANSSON MARTIN, JOHANSSON NIKLAS, KANG DU HO, KARIPIDIS ELEFTHERIOS, KARLSSON PATRIK, KHAYRALLAH ALI S, KILINC CANER, KLANG GÖRAN N, KRONANDER JONAS, LANDSTRÖM SARA, LARSSON CHRISTINA, LI GEN, LINDBOM LARS, LINDGREN ROBERT, LINDOFF BENGT, LINDQVIST FREDRIK, LIU JINHUA, MARIC IVANA, LOHMAR THORSTEN, LU QIANXI, MANHOLM LARS, MEDBO JONAS, MIAO QINGYU, MILDH GUNNAR, MOOSAVI REZA, MÜLLER WALTER, MYHRE ELENA, NORRMAN KARL, OLSSON BENGT-ERIK, PALENIUS TORGNY, PARKVALL STEFAN, PEISA JANNE, PETERSSON SVEN, PRADAS JOSE LUIS, PRYTZ MIKAEL, QUESETH OLAV, RAMACHANDRA PRADEEPA, RAMOS EDGAR, REIAL ANDRES, RIMHAGEN THOMAS, RINGH EMIL, RUGELAND PATRIK, RUNE JOHAN, SACHS JOACHIM, SAHLIN HENRIK, SAXENA VIDIT, SEIFI NIMA, SELÈN YNGVE, SEMAAN ELIANE, SHARMA SACHIN, SHI CONG, SKÖLD JOHAN, STATTIN MAGNUS, STJERNMAN ANDERS, SUNDMAN DENNIS, SUNDSTRÖM LARS, TERCERO VARGAS MIUREL ISABEL, TIDESTAV CLAES, TOMBAZ SIBEL, TORSNER JOHAN, COLDREY MIKAEL, CAPAR CAGATAY, CARLSSON ANDERS, CEDERGREN ANDREAS, DA SILVA ICARO L J, DAHLMAN ERIK, EL ESSAILI ALI, ENGSTRÖM ULRIKA, Baldemair, Robert, Abrahamsson, Richard, Aktas, Ismet, Alriksson, Peter, Ansari, Junaid, Ashraf, Shehzad Ali, Asplund, Henrik, Athley, Fredrik, Axelsson, Håkan, Axmon, Joakim, Axnäs, Johan, Balachandran, Kumar, Bark, Gunnar, Berg, Jan-Erik, Bergström, Andreas, Björkegren, Håkan, Brahmi, Nadia, Tullberg, Hugo, Vikberg, Jari, Von Wrycza, Peter, Wager, Stefan, Walldeen, Thomas, Wallentin, Pontus, Wang, Hai, Wang Helmersson, Ke, Wang, Jianfeng, Wang, Yi-Pin Eric, Werner, Karl, Wiberg, Niclas, Wittenmark, Emma, Yilmaz, Osman Nuri Can, Zaidi, Ali, Zhang, Zhan, Zhang, Zhang, Zheng, Yanli, Fan, Rui, Ericson, Mårten, Eriksson, Erik, Fallgren, Mikael, Fodor, Gabor, Frenger, Pål, Fridén, Jonas, Fröberg Olsson, Jonas, Furuskär, Anders, Furuskog, Johan, Garcia, Virgile, Gattami, Ather, Gunnarsson, Fredrik, Gustavsson, Ulf, Hagerman, Bo, Harrysson, Fredrik, He, Ning, Hessler, Martin, Hiltunen, Kimmo, Hong, Songnam, Hui, Dennis, Huschke, Jörg, Irnich, Tim, Jacobsson, Sven, Jaldén, Niklas, Järmyr, Simon, Jiang, Zhiyuan, Johansson, Martin, Johansson, Niklas, Kang, Du Ho, Karipidis, Eleftherios, Karlsson, Patrik, Khayrallah, Ali S., Kilinc, Caner, Klang, Göran N., Kronander, Jonas, Landström, Sara, Larsson, Christina, Li, Gen, Lindbom, Lars, Lindgren, Robert, Lindoff, Bengt, Lindqvist, Fredrik, Liu, Jinhua, Maric, Ivana, Lohmar, Thorsten, Lu, Qianxi, Manholm, Lars, Medbo, Jonas, Miao, Qingyu, Mildh, Gunnar, Moosavi, Reza, Müller, Walter, Myhre, Elena, Norrman, Karl, Olsson, Bengt-Erik, Palenius, Torgny, Parkvall, Stefan, Peisa, Janne, Petersson, Sven, Pradas, Jose Luis, Prytz, Mikael, Queseth, Olav, Ramachandra, Pradeepa, Ramos, Edgar, Reial, Andres, Rimhagen, Thomas, Ringh, Emil, Rugeland, Patrik, Rune, Johan, Sachs, Joachim, Sahlin, Henrik, Saxena, Vidit, Seifi, Nima, Selèn, Yngve, Semaan, Eliane, Sharma, Sachin, Shi, Cong, Sköld, Johan, Stattin, Magnus, Stjernman, Anders, Sundman, Dennis, Sundström, Lars, Tercero Vargas, Miurel Isabel, Tidestav, Claes, Tombaz, Sibel, Torsner, Johan, Coldrey, Mikael, Capar, Cagatay, Carlsson, Anders, Cedergren, Andreas, Da Silva, Icaro L.J., Dahlman, Erik, El Essaili, Ali, Engström, Ulrika
Принадлежит: Watermark Intellectual Property Pty Ltd

Methods and apparatus in a fifth-generation wireless communications, including an example method, in a wireless device, that includes receiving a downlink signal comprising an uplink access configuration index, using the uplink access configuration index to identify an uplink access configuration from among a predetermined plurality of uplink access configurations, and transmitting to the wireless communications network according to the identified uplink access configuration. The example method further includes, in the same wireless device, receiving, in a first downlink subframe, a first Orthogonal Frequency-Division Multiplexing (OFDM) transmission formatted according to a first numerology and receiving, in a second downlink subframe, a second OFDM transmission formatted according to a second numerology, the second numerology differing from the first numerology, where the first numerology has a first subcarrier spacing and the second numerology has a second subcarrier spacing, the first ...

Подробнее
30-10-2018 дата публикации

NETWORK ARCHITECTURE, METHODS, AND DEVICES FOR A WIRELESS COMMUNICATIONS NETWORK

Номер: SG11201808313RA
Автор: PARKVALL STEFAN, ABRAHAMSSON RICHARD, AKTAS ISMET, ALRIKSSON PETER, ANSARI JUNAID, ASHRAF SHEHZAD ALI, ASPLUND HENRIK, ATHLEY FREDRIK, AXELSSON HÅKAN, AXMON JOAKIM, AXNÄS JOHAN, BALACHANDRAN KUMAR, BALDEMAIR ROBERT, BARK GUNNAR, BERG JAN-ERIK, BERGSTRÖM ANDREAS, BJÖRKEGREN HÅKAN, BRAHMI NADIA, CAPAR CAGATAY, CARLSSON ANDERS, CEDERGREN ANDREAS, COLDREY MIKAEL, DA SILVA ICARO L J, DAHLMAN ERIK, EL ESSAILI ALI, ENGSTRÖM ULRIKA, ERICSON MÅRTEN, ERIKSSON ERIK, FALLGREN MIKAEL, FAN RUI, FODOR GABOR, FRENGER PÅL, FRIDÉN JONAS, FRÖBERG OLSSON JONAS, FURUSKÄR ANDERS, FURUSKOG JOHAN, GARCIA VIRGILE, GATTAMI ATHER, GUNNARSSON FREDRIK, GUSTAVSSON ULF, HAGERMAN BO, HARRYSSON FREDRIK, HE NING, HESSLER MARTIN, HILTUNEN KIMMO, HONG SONGNAM, HUI DENNIS, HUSCHKE JÖRG, IRNICH TIM, JACOBSSON SVEN, JALDÉN NIKLAS, JÄRMYR SIMON, JIANG ZHIYUAN, JOHANSSON MARTIN, JOHANSSON NIKLAS, KANG DU HO, KARIPIDIS ELEFTHERIOS, KARLSSON PATRIK, KHAYRALLAH ALI S, KILINC CANER, KLANG GÖRAN N, KRONANDER JONAS, LANDSTRÖM SARA, LARSSON CHRISTINA, LI GEN, LINCOLN BO, LINDBOM LARS, LINDGREN ROBERT, LINDOFF BENGT, LINDQVIST FREDRIK, LIU JINHUA, LOHMAR THORSTEN, LU QIANXI, MANHOLM LARS, MARIC IVANA, MEDBO JONAS, MIAO QINGYU, MILDH GUNNAR, MOOSAVI REZA, MÜLLER WALTER, MYHRE ELENA, NILSSON JOHAN, NORRMAN KARL, OLSSON BENGT-ERIK, PALENIUS TORGNY, PEISA JANNE, PETERSSON SVEN, PRADAS JOSE LUIS, PRYTZ MIKAEL, QUESETH OLAV, RAMACHANDRA PRADEEPA, RAMOS EDGAR, REIAL ANDRES, RIMHAGEN THOMAS, RINGH EMIL, RUGELAND PATRIK, RUNE JOHAN, SACHS JOACHIM, SAHLIN HENRIK, SAXENA VIDIT, SEIFI NIMA, SELÈN YNGVE, SEMAAN ELIANE, SHARMA SACHIN, SHI CONG, SKÖLD JOHAN, STATTIN MAGNUS, STJERNMAN ANDERS, SUNDMAN DENNIS, SUNDSTRÖM LARS, TERCERO VARGAS MIUREL ISABEL, TIDESTAV CLAES, TOMBAZ SIBEL, TORSNER JOHAN, TULLBERG HUGO, VIKBERG JARI, VON WRYCZA PETER, WAGER STEFAN, WALLDEEN THOMAS, WALLÈN ANDERS, WALLENTIN PONTUS, WANG HAI, WANG HELMERSSON KE, WANG JIANFENG, WANG YI-PIN ERIC, WERNER KARL, WIBERG NICLAS, WITTENMARK EMMA, YILMAZ OSMAN NURI CAN, ZAIDI ALI, ZHANG ZHAN, ZHANG ZHANG, ZHENG YANLI, PARKVALL, Stefan, ABRAHAMSSON, Richard, AKTAS, Ismet, ALRIKSSON, Peter, ANSARI, Junaid, ASHRAF, Shehzad Ali, ASPLUND, Henrik, ATHLEY, Fredrik, AXELSSON, Håkan, AXMON, Joakim, AXNÄS, Johan, BALACHANDRAN, Kumar, BALDEMAIR, Robert, BARK, Gunnar, BERG, Jan-Erik, BERGSTRÖM, Andreas, BJÖRKEGREN, Håkan, BRAHMI, Nadia, CAPAR, Cagatay, CARLSSON, Anders, CEDERGREN, Andreas, COLDREY, Mikael, DA SILVA, Icaro L. J., DAHLMAN, Erik, EL ESSAILI, Ali, ENGSTRÖM, Ulrika, ERICSON, Mårten, ERIKSSON, Erik, FALLGREN, Mikael, FAN, Rui, FODOR, Gabor, FRENGER, Pål, FRIDÉN, Jonas, FRÖBERG OLSSON, Jonas, FURUSKÄR, Anders, FURUSKOG, Johan, GARCIA, Virgile, GATTAMI, Ather, GUNNARSSON, Fredrik, GUSTAVSSON, Ulf, HAGERMAN, Bo, HARRYSSON, Fredrik, HE, Ning, HESSLER, Martin, HILTUNEN, Kimmo, HONG, Songnam, HUI, Dennis, HUSCHKE, Jörg, IRNICH, Tim, JACOBSSON, Sven, JALDÉN, Niklas, JÄRMYR, Simon, JIANG, Zhiyuan, JOHANSSON, Martin, JOHANSSON, Niklas, KANG, Du Ho, KARIPIDIS, Eleftherios, KARLSSON, Patrik, KHAYRALLAH, Ali S., KILINC, Caner, KLANG, Göran N., KRONANDER, Jonas, LANDSTRÖM, Sara, LARSSON, Christina, LI, Gen, LINCOLN, Bo, LINDBOM, Lars, LINDGREN, Robert, LINDOFF, Bengt, LINDQVIST, Fredrik, LIU, Jinhua, LOHMAR, Thorsten, LU, Qianxi, MANHOLM, Lars, MARIC, Ivana, MEDBO, Jonas, MIAO, Qingyu, MILDH, Gunnar, MOOSAVI, Reza, MÜLLER, Walter, MYHRE, Elena, NILSSON, Johan, NORRMAN, Karl, OLSSON, Bengt-Erik, PALENIUS, Torgny, PEISA, Janne, PETERSSON, Sven, PRADAS, Jose Luis, PRYTZ, Mikael, QUESETH, Olav, RAMACHANDRA, Pradeepa, RAMOS, Edgar, REIAL, Andres, RIMHAGEN, Thomas, RINGH, Emil, RUGELAND, Patrik, RUNE, Johan, SACHS, Joachim, SAHLIN, Henrik, SAXENA, Vidit, SEIFI, Nima, SELÈN, Yngve, SEMAAN, Eliane, SHARMA, Sachin, SHI, Cong, SKÖLD, Johan, STATTIN, Magnus, STJERNMAN, Anders, SUNDMAN, Dennis, SUNDSTRÖM, Lars, TERCERO VARGAS, Miurel Isabel, TIDESTAV, Claes, TOMBAZ, Sibel, TORSNER, Johan, TULLBERG, Hugo, VIKBERG, Jari, VON WRYCZA, Peter, WAGER, Stefan, WALLDEEN, Thomas, WALLÈN, Anders, WALLENTIN, Pontus, WANG, Hai, WANG HELMERSSON, Ke, WANG, Jianfeng, WANG, Yi-Pin Eric, WERNER, Karl, WIBERG, Niclas, WITTENMARK, Emma, YILMAZ, Osman Nuri Can, ZAIDI, Ali, ZHANG, Zhan, ZHANG, Zhang, ZHENG, Yanli
Принадлежит:

Подробнее
03-10-2017 дата публикации

Transmitter, a receiver, and methods therein

Номер: US0009780980B2

A method in a transmitter for transmitting CPM signals to a receiver. The transmitter divides bits into first and second sequences; duplicates the sequences into third and fourth sequences. The first and second sequences are mapped into a first layer, and the third fourth sequences are mapped into a second layer. The transmitter time reverses one of the first and second sequences, and one of the third and fourth sequences; and maps 1 to 0 and 0 to 1 in one of the time reversed sequence in each layer. The transmitter formats the first and second sequences into a first burst, and the third and fourth sequences into a second burst; and applies differential encoding to the bursts when a modulation index value is a non-integer. The first and second bursts are continuous phase modulated and transmitted as first and second CPM signals through a respective antenna.

Подробнее
19-03-2001 дата публикации

Method and apparatus for computing prefilter coefficients

Номер: AU0006781200A
Принадлежит:

Подробнее
19-01-2012 дата публикации

Network-centric link adaptation for coordinated multipoint downlink transmission

Номер: AU2010258274A1
Принадлежит:

A Coordinated Multipoint (COMP) cell controller performs network-centric Sink adaptation for User Equipment (UE) in the CoMP cell. The CoMP cell controller receives at least infrequent channel estimates from a UE in the CoMP cell, from which it estimates downlink channel and thermal noise at the UE. The CoMP cell controller is aware of the desired signal to be received at the UE, and the intra-CoMP cell interference to the UE caused by transmissions to other UEs in the CoMP cell. The CoMP cell receives from the UE reports of inter-CoMP cell interference caused by transmissions by other CoMP cells. Based on the downlink channel quality, the desired signal, the intra-CoMP cell interference, the intex-CoMP cell interference, and the thermal noise, the CoMP cell controller performs link adaptation by selecting modulation and coding schemes, and other transmission parameters, for mi upcoming transmission duration (such as a TTI).

Подробнее
16-11-2017 дата публикации

NETWORK ARCHITECTURE, METHODS, AND DEVICES FOR A WIRELESS COMMUNICATIONS NETWORK

Номер: CA0003023879A1
Автор: PARKVALL, STEFAN, ABRAHAMSSON, RICHARD, AKTAS, ISMET, ALRIKSSON, PETER, ANSARI, JUNAID, ASHRAF, SHEHZAD ALI, ASPLUND, HENRIK, ATHLEY, FREDRIK, AXELSSON, HAKAN, AXMON, JOAKIM, AXNAS, JOHAN, BALACHANDRAN, KUMAR, BALDEMAIR, ROBERT, BARK, GUNNAR, BERG, JAN-ERIK, BERGSTROM, ANDREAS, BJORKEGREN, HAKAN, BRAHMI, NADIA, CAPAR, CAGATAY, CARLSSON, ANDERS, CEDERGREN, ANDREAS, COLDREY, MIKAEL, DA SILVA, ICARO L. J., DAHLMAN, ERIK, EL ESSAILI, ALI, ENGSTROM, ULRIKA, ERICSON, MARTEN, ERIKSSON, ERIK, FALLGREN, MIKAEL, FAN, RUI, FODOR, GABOR, FRENGER, PAL, FRIDEN, JONAS, FROBERG OLSSON, JONAS, FURUSKAR, ANDERS, FURUSKOG, JOHAN, GARCIA, VIRGILE, GATTAMI, ATHER, GUNNARSSON, FREDRIK, GUSTAVSSON, ULF, HAGERMAN, BO, HARRYSSON, FREDRIK, HE, NING, HESSLER, MARTIN, HILTUNEN, KIMMO, HONG, SONGNAM, HUI, DENNIS, HUSCHKE, JORG, IRNICH, TIM, JACOBSSON, SVEN, JALDEN, NIKLAS, JARMYR, SIMON, JIANG, ZHIYUAN, JOHANSSON, MARTIN, JOHANSSON, NIKLAS, KANG, DU HO, KARIPIDIS, ELEFTHERIOS, KARLSSON, PATRIK, KHAYRALLAH, ALI S., KILINC, CANER, KLANG, GORAN N., KRONANDER, JONAS, LANDSTROM, SARA, LARSSON, CHRISTINA, LI, GEN, LINCOLN, BO, LINDBOM, LARS, LINDGREN, ROBERT, LINDOFF, BENGT, LINDQVIST, FREDRIK, LIU, JINHUA, LOHMAR, THORSTEN, LU, QIANXI, MANHOLM, LARS, MARIC, IVANA, MEDBO, JONAS, MIAO, QINGYU, MILDH, GUNNAR, MOOSAVI, REZA, MULLER, WALTER, MYHRE, ELENA, NILSSON, JOHAN, NORRMAN, KARL, OLSSON, BENGT-ERIK, PALENIUS, TORGNY, PEISA, JANNE, PETERSSON, SVEN, PRADAS, JOSE LUIS, PRYTZ, MIKAEL, QUESETH, OLAV, RAMACHANDRA, PRADEEPA, RAMOS, EDGAR, REIAL, ANDRES, RIMHAGEN, THOMAS, RINGH, EMIL, RUGELAND, PATRIK, RUNE, JOHAN, SACHS, JOACHIM, SAHLIN, HENRIK, SAXENA, VIDIT, SEIFI, NIMA, SELEN, YNGVE, SEMAAN, ELIANE, SHARMA, SACHIN, SHI, CONG, SKOLD, JOHAN, STATTIN, MAGNUS, STJERNMAN, ANDERS, SUNDMAN, DENNIS, SUNDSTROM, LARS, TERCERO VARGAS, MIUREL ISABEL, TIDESTAV, CLAES, TOMBAZ, SIBEL, TORSNER, JOHAN, TULLBERG, HUGO, VIKBERG, JARI, VON WRYCZA, PETER, WAGER, STEFAN, WALLDEEN, THOMAS, WALLEN, ANDERS, WALLENTIN, PONTUS, WANG, HAI, WANG HELMERSSON, KE, WANG, JIANFENG, WANG, YI-PIN ERIC, WERNER, KARL, WIBERG, NICLAS, WITTENMARK, EMMA, YILMAZ, OSMAN NURI CAN, ZAIDI, ALI, ZHANG, ZHAN, ZHANG, ZHANG, ZHENG, YANLI, PARKVALL STEFAN, ABRAHAMSSON RICHARD, AKTAS ISMET, ALRIKSSON PETER, ANSARI JUNAID, ASHRAF SHEHZAD ALI, ASPLUND HENRIK, ATHLEY FREDRIK, AXELSSON HAKAN, AXMON JOAKIM, AXNAS JOHAN, BALACHANDRAN KUMAR, BALDEMAIR ROBERT, BARK GUNNAR, BERG JAN-ERIK, BERGSTROM ANDREAS, BJORKEGREN HAKAN, BRAHMI NADIA, CAPAR CAGATAY, CARLSSON ANDERS, CEDERGREN ANDREAS, COLDREY MIKAEL, DA SILVA ICARO L J, DAHLMAN ERIK, EL ESSAILI ALI, ENGSTROM ULRIKA, ERICSON MARTEN, ERIKSSON ERIK, FALLGREN MIKAEL, FAN RUI, FODOR GABOR, FRENGER PAL, FRIDEN JONAS, FROBERG OLSSON JONAS, FURUSKAR ANDERS, FURUSKOG JOHAN, GARCIA VIRGILE, GATTAMI ATHER, GUNNARSSON FREDRIK, GUSTAVSSON ULF, HAGERMAN BO, HARRYSSON FREDRIK, HE NING, HESSLER MARTIN, HILTUNEN KIMMO, HONG SONGNAM, HUI DENNIS, HUSCHKE JORG, IRNICH TIM, JACOBSSON SVEN, JALDEN NIKLAS, JARMYR SIMON, JIANG ZHIYUAN, JOHANSSON MARTIN, JOHANSSON NIKLAS, KANG DU HO, KARIPIDIS ELEFTHERIOS, KARLSSON PATRIK, KHAYRALLAH ALI S, KILINC CANER, KLANG GORAN N, KRONANDER JONAS, LANDSTROM SARA, LARSSON CHRISTINA, LI GEN, LINCOLN BO, LINDBOM LARS, LINDGREN ROBERT, LINDOFF BENGT, LINDQVIST FREDRIK, LIU JINHUA, LOHMAR THORSTEN, LU QIANXI, MANHOLM LARS, MARIC IVANA, MEDBO JONAS, MIAO QINGYU, MILDH GUNNAR, MOOSAVI REZA, MULLER WALTER, MYHRE ELENA, NILSSON JOHAN, NORRMAN KARL, OLSSON BENGT-ERIK, PALENIUS TORGNY, PEISA JANNE, PETERSSON SVEN, PRADAS JOSE LUIS, PRYTZ MIKAEL, QUESETH OLAV, RAMACHANDRA PRADEEPA, RAMOS EDGAR, REIAL ANDRES, RIMHAGEN THOMAS, RINGH EMIL, RUGELAND PATRIK, RUNE JOHAN, SACHS JOACHIM, SAHLIN HENRIK, SAXENA VIDIT, SEIFI NIMA, SELEN YNGVE, SEMAAN ELIANE, SHARMA SACHIN, SHI CONG, SKOLD JOHAN, STATTIN MAGNUS, STJERNMAN ANDERS, SUNDMAN DENNIS, SUNDSTROM LARS, TERCERO VARGAS MIUREL ISABEL, TIDESTAV CLAES, TOMBAZ SIBEL, TORSNER JOHAN, TULLBERG HUGO, VIKBERG JARI, VON WRYCZA PETER, WAGER STEFAN, WALLDEEN THOMAS, WALLEN ANDERS, WALLENTIN PONTUS, WANG HAI, WANG HELMERSSON KE, WANG JIANFENG, WANG YI-PIN ERIC, WERNER KARL, WIBERG NICLAS, WITTENMARK EMMA, YILMAZ OSMAN NURI CAN, ZAIDI ALI, ZHANG ZHAN, ZHANG ZHANG, ZHENG YANLI
Принадлежит:

Methods performed by a wireless device, such as a user equipment, operating in a dormant mode comprise performing a measurement on each of a plurality of resources from a predetermined set of resources or demodulating and decoding information from each of a plurality of resources from a predetermined set of resources, such as a set of beams. The methods further include evaluating the measurement or the demodulated and decoded information for each of the plurality of resources against a predetermined criterion, and then discontinuing the performing and evaluating of measurements, or discontinuing the demodulating and decoding and evaluation of information, in response to determining that the predetermined criterion is met, such that one or more resources in the predetermined set of resources are neither measured nor demodulated and decoded. The methods further comprise deactivating receiver circuitry, further in response to determining that the predetermined criterion is met. The method ...

Подробнее
26-10-2021 дата публикации

MULTIPLEXING OF SUBFRAMES WITH DIFFERENT SUBCARRIER SPACINGS

Номер: CA3023874C
Автор: BALDEMAIR ROBERT, ABRAHAMSSON RICHARD, AKTAS ISMET, ALRIKSSON PETER, ANSARI JUNAID, ASHRAF SHEHZAD ALI, ASPLUND HENRIK, ATHLEY FREDRIK, AXELSSON HAKAN, AXMON JOAKIM, AXNAS JOHAN, BALACHANDRAN KUMAR, BARK GUNNAR, BERG JAN-ERIK, BERGSTROM ANDREAS, BJORKEGREN HAKAN, BRAHMI NADIA, CAPAR CAGATAY, CARLSSON ANDERS, CEDERGREN ANDREAS, COLDREY MIKAEL, DA SILVA ICARO L J, DAHLMAN ERIK, EL ESSAILI ALI, ENGSTROM ULRIKA, ERICSON MARTEN, ERIKSSON ERIK, FALLGREN MIKAEL, FAN RUI, FODOR GABOR, FRENGER PAL, FRIDEN JONAS, FROBERG OLSSON JONAS, FURUSKAR ANDERS, FURUSKOG JOHAN, GARCIA VIRGILE, GATTAMI ATHER, GUNNARSSON FREDRIK, GUSTAVSSON ULF, HAGERMAN BO, HARRYSSON FREDRIK, HE NING, HESSLER MARTIN, HILTUNEN KIMMO, HONG SONGNAM, HUI DENNIS, HUSCHKE JORG, IRNICH TIM, JACOBSSON SVEN, JALDEN NIKLAS, JARMYR SIMON, JIANG ZHIYUAN, JOHANSSON MARTIN, JOHANSSON NIKLAS, KANG DU HO, KARIPIDIS ELEFTHERIOS, KARLSSON PATRIK, KHAYRALLAH ALI S, KILINC CANER, KLANG GORAN N, KRONANDER JONAS, LANDSTROM SARA, LARSSON CHRISTINA, LI GEN, LINDBOM LARS, LINDGREN ROBERT, LINDOFF BENGT, LINDQVIST FREDRIK, LIU JINHUA, LOHMAR THORSTEN, LU QIANXI, MANHOLM LARS, MARIC IVANA, MEDBO JONAS, MIAO QINGYU, MILDH GUNNAR, MOOSAVI REZA, MULLER WALTER, MYHRE ELENA, NORRMAN KARL, OLSSON BENGT-ERIK, PALENIUS TORGNY, PARKVALL STEFAN, PEISA JANNE, PETERSSON SVEN, PRADAS JOSE LUIS, PRYTZ MIKAEL, QUESETH OLAV, RAMACHANDRA PRADEEPA, RAMOS EDGAR, REIAL ANDRES, RIMHAGEN THOMAS, RINGH EMIL, RUGELAND PATRIK, RUNE JOHAN, SACHS JOACHIM, SAHLIN HENRIK, SAXENA VIDIT, SEIFI NIMA, SELEN YNGVE, SEMAAN ELIANE, SHARMA SACHIN, SHI CONG, SKOLD JOHAN, STATTIN MAGNUS, STJERNMAN ANDERS, SUNDMAN DENNIS, SUNDSTROM LARS, TERCERO VARGAS MIUREL ISABEL, TIDESTAV CLAES, TOMBAZ SIBEL, TORSNER JOHAN, TULLBERG HUGO, VIKBERG JARI, VON WRYCZA PETER, WAGER STEFAN, WALLDEEN THOMAS, WALLENTIN PONTUS, WANG HAI, WANG HELMERSSON KE, WANG JIANFENG, WANG YI-PIN ERIC, WERNER KARL, WIBERG NICLAS, WITTENMARK EMMA, YILMAZ OSMAN NURI CAN, ZAIDI ALI, ZHANG ZHAN, ZHANG ZHANG, ZHENG YANLI, BALDEMAIR, ROBERT, ABRAHAMSSON, RICHARD, AKTAS, ISMET, ALRIKSSON, PETER, ANSARI, JUNAID, ASHRAF, SHEHZAD ALI, ASPLUND, HENRIK, ATHLEY, FREDRIK, AXELSSON, HAKAN, AXMON, JOAKIM, AXNAS, JOHAN, BALACHANDRAN, KUMAR, BARK, GUNNAR, BERG, JAN-ERIK, BERGSTROM, ANDREAS, BJORKEGREN, HAKAN, BRAHMI, NADIA, CAPAR, CAGATAY, CARLSSON, ANDERS, CEDERGREN, ANDREAS, COLDREY, MIKAEL, DA SILVA, ICARO L. J., DAHLMAN, ERIK, EL ESSAILI, ALI, ENGSTROM, ULRIKA, ERICSON, MARTEN, ERIKSSON, ERIK, FALLGREN, MIKAEL, FAN, RUI, FODOR, GABOR, FRENGER, PAL, FRIDEN, JONAS, FROBERG OLSSON, JONAS, FURUSKAR, ANDERS, FURUSKOG, JOHAN, GARCIA, VIRGILE, GATTAMI, ATHER, GUNNARSSON, FREDRIK, GUSTAVSSON, ULF, HAGERMAN, BO, HARRYSSON, FREDRIK, HE, NING, HESSLER, MARTIN, HILTUNEN, KIMMO, HONG, SONGNAM, HUI, DENNIS, HUSCHKE, JORG, IRNICH, TIM, JACOBSSON, SVEN, JALDEN, NIKLAS, JARMYR, SIMON, JIANG, ZHIYUAN, JOHANSSON, MARTIN, JOHANSSON, NIKLAS, KANG, DU HO, KARIPIDIS, ELEFTHERIOS, KARLSSON, PATRIK, KHAYRALLAH, ALI S., KILINC, CANER, KLANG, GORAN N., KRONANDER, JONAS, LANDSTROM, SARA, LARSSON, CHRISTINA, LI, GEN, LINDBOM, LARS, LINDGREN, ROBERT, LINDOFF, BENGT, LINDQVIST, FREDRIK, LIU, JINHUA, LOHMAR, THORSTEN, LU, QIANXI, MANHOLM, LARS, MARIC, IVANA, MEDBO, JONAS, MIAO, QINGYU, MILDH, GUNNAR, MOOSAVI, REZA, MULLER, WALTER, MYHRE, ELENA, NORRMAN, KARL, OLSSON, BENGT-ERIK, PALENIUS, TORGNY, PARKVALL, STEFAN, PEISA, JANNE, PETERSSON, SVEN, PRADAS, JOSE LUIS, PRYTZ, MIKAEL, QUESETH, OLAV, RAMACHANDRA, PRADEEPA, RAMOS, EDGAR, REIAL, ANDRES, RIMHAGEN, THOMAS, RINGH, EMIL, RUGELAND, PATRIK, RUNE, JOHAN, SACHS, JOACHIM, SAHLIN, HENRIK, SAXENA, VIDIT, SEIFI, NIMA, SELEN, YNGVE, SEMAAN, ELIANE, SHARMA, SACHIN, SHI, CONG, SKOLD, JOHAN, STATTIN, MAGNUS, STJERNMAN, ANDERS, SUNDMAN, DENNIS, SUNDSTROM, LARS, TERCERO VARGAS, MIUREL ISABEL, TIDESTAV, CLAES, TOMBAZ, SIBEL, TORSNER, JOHAN, TULLBERG, HUGO, VIKBERG, JARI, VON WRYCZA, PETER, WAGER, STEFAN, WALLDEEN, THOMAS, WALLENTIN, PONTUS, WANG, HAI, WANG HELMERSSON, KE, WANG, JIANFENG, WANG, YI-PIN ERIC, WERNER, KARL, WIBERG, NICLAS, WITTENMARK, EMMA, YILMAZ, OSMAN NURI CAN, ZAIDI, ALI, ZHANG, ZHAN, ZHANG, ZHANG, ZHENG, YANLI

Methods and apparatus in a fifth-generation wireless communications, including an example method, in a wireless device, that includes receiving a downlink signal comprising an uplink access configuration index, using the uplink access configuration index to identify an uplink access configuration from among a predetermined plurality of uplink access configurations, and transmitting to the wireless communications network according to the identified uplink access configuration. The example method further includes, in the same wireless device, receiving, in a first downlink subframe, a first Orthogonal Frequency-Division Multiplexing (OFDM) transmission formatted according to a first numerology and receiving, in a second downlink subframe, a second OFDM transmission formatted according to a second numerology, the second numerology differing from the first numerology, where the first numerology has a first subcarrier spacing and the second numerology has a second subcarrier spacing, the first ...

Подробнее
12-05-2016 дата публикации

EFFICIENT BEAM SCANNING FOR HIGH-FREQUENCY WIRELESS NETWORKS

Номер: CA0002968202A1
Принадлежит:

Systems and methods relating to non-adaptive beam scanning in a wireless network are disclosed. In some embodiments, a method of operation of a transmit node (12) to perform non-adaptive beam scanning for transmit beam patterns (16) of the transmit node (12) that partition a service coverage area (18) of the transmit node (12) into transmit partition cells (20) is provided. The method transmitting a known signal using each of multiple scanning beam patterns for each of multiple beam scanning stages over nonoverlapping radio resource slots. The scanning beam patterns for the beam scanning stages are such that each unique combination of scanning beam patterns consisting of one scanning beam pattern from each of the beam scanning stages corresponds to a different transmit beam pattern (16) of the transmit node (12). This multi-stage beam scanning approach provides an exponentially more efficient process for beam scanning than the conventional Sequential Beam Sweeping (SBS) approach.

Подробнее
20-10-2016 дата публикации

STAGE-BY-STAGE SUCCESSIVE MIMO DECODING FOR MULTIHOP COMMUNICATIONS

Номер: US20160309484A1
Принадлежит:

According to some embodiments, a method of estimating a relayed wireless signal in a multihop network comprises receiving, at a destination network node, a wireless signal relayed from a plurality of network nodes, each corresponding to a relay stage. The received wireless signal comprises successive quantizations of a source wireless signal performed at each relay stage. The destination network node also receives a plurality of messages, each including quantization information associated with the quantization performed at a corresponding relay stage. The destination network node estimates a wireless signal received at a previous relay stage using a quantized multiple-input multiple-output (MIMO) channel model with the received wireless signal and a message corresponding to the quantization performed at the previous relay stage. The destination network node estimates the source wireless signal using the estimated wireless signal received at the previous relay stage and the remaining messages ...

Подробнее
23-07-2020 дата публикации

SYSTEMS AND METHODS FOR RATE-COMPATIBLE POLAR CODES FOR GENERAL CHANNELS

Номер: US20200235851A1
Принадлежит:

According to certain embodiments, a transmit node in a wireless communications system includes a first universal rate-compatible polar encoder and a transmitter. The first universal rate-compatible polar encoder is configured for a family of two or more types of channels and encodes a plurality of information bits to provide a plurality of coded bits. The transmitter transmits the plurality of coded bits to a receive node. 1. A transmit node in a wireless communications system , comprising:a first universal rate-compatible polar encoder configured for a family of two or more types of channels, the universal rate-compatible polar encoder operable to encode a plurality of information bits to provide a plurality of coded bits; anda transmitter operable to transmit the plurality of coded bits to a receive node.2. The transmit node of claim 1 , wherein the first universal rate-compatible polar encoder configured for the family of the two or more types of channels comprises:a first universalization precoder operable to receive the plurality of information bits and perform a polarization step a number of times (t-times); andone or more first polar encoders configured to receive the plurality of precoded bits from the universalization precoder and output a plurality of coded bits.3. The transmit node of claim 2 , wherein the number of times (t-times) that each polarization step is customized for a collection of two or more information sets claim 2 , each information set corresponding to a member in the family of two or more types of channel.4. The transmit node of claim 3 , wherein each of the one or more (t-times) that the polarization step is performed comprises XORing a bit located in a position indicated in a first information set corresponding to a first channel in the family of the two or more types of channels with another bit position indicated in a second information set corresponding to a second channel in the family of two or more types of channels.5. The ...

Подробнее
30-07-2019 дата публикации

Network architecture, methods, and devices for a wireless communications network

Номер: US0010367677B2
Автор: Stefan Parkvall, Janne Peisa, Gunnar Mildh, Robert Baldemair, Stefan Wager, Jonas Kronander, Karl Werner, Richard Abrahamsson, Ismet Aktas, Peter Alriksson, Junaid Ansari, Shehzad Ali Ashraf, Henrik Asplund, Fredrik Athley, Håkan Axelsson, Joakim Axmon, Johan Axnäs, Kumar Balachandran, Gunnar Bark, Jan-Erik Berg, Andreas Bergström, Håkan Björkegren, Nadia Brahmi, Cagatay Capar, Anders Carlsson, Andreas Cedergren, Mikael Coldrey, Icaro L. J. da Silva, Erik Dahlman, Ali El Essaili, Ulrika Engström, Mårten Ericson, Erik Eriksson, Mikael Fallgren, Rul Fan, Gabor Fodor, Pål Frenger, Jonas Fridén, Jonas Fröberg Olsson, Anders Furuskár, Johan Furuskog, Virgile Garcia, Ather Gattami, Fredrik Gunnarsson, Ulf Gustavsson, Bo Hagerman, Fredrik Harrysson, Ning He, Martin Hessler, Kimmo Hiltunen, Songnam Hong, Dennis Hui, Jörg Huschke, Tim Irnich, Sven Jacobsson, Niklas Jaldén, Simon Järmyr, Zhiyuan Jiang, Martin Johansson, Niklas Johansson, Du Ho Kang, Eleftherios Karipidis, Patrik Karlsson, Ali S. Khayrallah, Caner Kilinc, Göran N. Klang, Sara Landström, Christina Larsson, Gen Li, Bo Lincoln, Lars Lindbom, Robert Lindgren, Bengt Lindoff, Fredrik Lindqvist, Jinhua Liu, Thorsten Lohmar, Qianxi Lu, Lars Manholm, Ivana Maric, Jonas Medbo, Qingyu Miao, Reza Moosavi, Walter Müller, Elena Myhre, Johan Nilsson, Karl Norrman, Bengt-Erik Olsson, Torgny Palenius, Sven Petersson, Jose Luis Pradas, Mikael Prytz, Olav Queseth, Pradeepa Ramachandra, Edgar Ramos, Andres Reial, Thomas Rimhagen, Emil Ringh, Patrik Rugeland, Johan Rune, Joachim Sachs, Henrik Sahlin, Vidit Saxena, Nima Seifi, Yngve Selén, Eliane Semaan, Sachin Sharma, Cong Shi, Johan Sköld, Magnus Stattin, Anders Stjernman, Dennis Sundman, Lars Sundström, Miurel Isabel Tercero Vargas, Claes Tidestav, Sibel Tombaz, Johan Torsner, Hugo Tullberg, Jari Vikberg, Peter Von Wrycza, Thomas Walldeen, Anders Wallén, Pontus Wallentin, Hai Wang, Ke Wang Helmersson, Jianfeng Wang, Yi-Pin Eric Wang, Niclas Wiberg, Emma Wittenmark, Osman Nuri Can Yilmaz, Ali Zaidi, Zhan Zhang, Zhang Zhang, Yanil Zheng, PARKVALL STEFAN, PEISA JANNE, MILDH GUNNAR, BALDEMAIR ROBERT, WAGER STEFAN, KRONANDER JONAS, WERNER KARL, ABRAHAMSSON RICHARD, AKTAS ISMET, ALRIKSSON PETER, ANSARI JUNAID, ASHRAF SHEHZAD ALI, ASPLUND HENRIK, ATHLEY FREDRIK, AXELSSON HÅKAN, AXMON JOAKIM, AXNÄS JOHAN, BALACHANDRAN KUMAR, BARK GUNNAR, BERG JAN-ERIK, BERGSTRÖM ANDREAS, BJÖRKEGREN HÅKAN, BRAHMI NADIA, CAPAR CAGATAY, CARLSSON ANDERS, CEDERGREN ANDREAS, COLDREY MIKAEL, DA SILVA ICARO L J, DAHLMAN ERIK, EL ESSAILI ALI, ENGSTRÖM ULRIKA, ERICSON MÅRTEN, ERIKSSON ERIK, FALLGREN MIKAEL, FAN RUL, FODOR GABOR, FRENGER PÅL, FRIDÉN JONAS, FRÖBERG OLSSON JONAS, FURUSKÁR ANDERS, FURUSKOG JOHAN, GARCIA VIRGILE, GATTAMI ATHER, GUNNARSSON FREDRIK, GUSTAVSSON ULF, HAGERMAN BO, HARRYSSON FREDRIK, HE NING, HESSLER MARTIN, HILTUNEN KIMMO, HONG SONGNAM, HUI DENNIS, HUSCHKE JÖRG, IRNICH TIM, JACOBSSON SVEN, JALDÉN NIKLAS, JÄRMYR SIMON, JIANG ZHIYUAN, JOHANSSON MARTIN, JOHANSSON NIKLAS, KANG DU HO, KARIPIDIS ELEFTHERIOS, KARLSSON PATRIK, KHAYRALLAH ALI S, KILINC CANER, KLANG GÖRAN N, LANDSTRÖM SARA, LARSSON CHRISTINA, LI GEN, LINCOLN BO, LINDBOM LARS, LINDGREN ROBERT, LINDOFF BENGT, LINDQVIST FREDRIK, LIU JINHUA, LOHMAR THORSTEN, LU QIANXI, MANHOLM LARS, MARIC IVANA, MEDBO JONAS, MIAO QINGYU, MOOSAVI REZA, MÜLLER WALTER, MYHRE ELENA, NILSSON JOHAN, NORRMAN KARL, OLSSON BENGT-ERIK, PALENIUS TORGNY, PETERSSON SVEN, PRADAS JOSE LUIS, PRYTZ MIKAEL, QUESETH OLAV, RAMACHANDRA PRADEEPA, RAMOS EDGAR, REIAL ANDRES, RIMHAGEN THOMAS, RINGH EMIL, RUGELAND PATRIK, RUNE JOHAN, SACHS JOACHIM, SAHLIN HENRIK, SAXENA VIDIT, SEIFI NIMA, SELÉN YNGVE, SEMAAN ELIANE, SHARMA SACHIN, SHI CONG, SKÖLD JOHAN, STATTIN MAGNUS, STJERNMAN ANDERS, SUNDMAN DENNIS, SUNDSTRÖM LARS, TERCERO VARGAS MIUREL ISABEL, TIDESTAV CLAES, TOMBAZ SIBEL, TORSNER JOHAN, TULLBERG HUGO, VIKBERG JARI, VON WRYCZA PETER, WALLDEEN THOMAS, WALLÉN ANDERS, WALLENTIN PONTUS, WANG HAI, WANG HELMERSSON KE, WANG JIANFENG, WANG YI-PIN ERIC, WIBERG NICLAS, WITTENMARK EMMA, YILMAZ OSMAN NURI CAN, ZAIDI ALI, ZHANG ZHAN, ZHANG ZHANG, ZHENG YANIL, Parkvall, Stefan, Peisa, Janne, Mildh, Gunnar, Baldemair, Robert, Wager, Stefan, Kronander, Jonas, Werner, Karl, Abrahamsson, Richard, Aktas, Ismet, Alriksson, Peter, Ansari, Junaid, Ashraf, Shehzad Ali, Asplund, Henrik, Athley, Fredrik, Axelsson, Håkan, Axmon, Joakim, Axnäs, Johan, Balachandran, Kumar, Bark, Gunnar, Berg, Jan-Erik, Bergström, Andreas, Björkegren, Håkan, Brahmi, Nadia, Capar, Cagatay, Carlsson, Anders, Cedergren, Andreas, Coldrey, Mikael, da Silva, Icaro L. J., Dahlman, Erik, El Essaili, Ali, Engström, Ulrika, Ericson, Mårten, Eriksson, Erik, Fallgren, Mikael, Fan, Rul, Fodor, Gabor, Frenger, Pål, Fridén, Jonas, Fröberg Olsson, Jonas, Furuskár, Anders, Furuskog, Johan, Garcia, Virgile, Gattami, Ather, Gunnarsson, Fredrik, Gustavsson, Ulf, Hagerman, Bo, Harrysson, Fredrik, He, Ning, Hessler, Martin, Hiltunen, Kimmo, Hong, Songnam, Hui, Dennis, Huschke, Jörg, Irnich, Tim, Jacobsson, Sven, Jaldén, Niklas, Järmyr, Simon, Jiang, Zhiyuan, Johansson, Martin, Johansson, Niklas, Kang, Du Ho, Karipidis, Eleftherios, Karlsson, Patrik, Khayrallah, Ali S., Kilinc, Caner, Klang, Göran N., Landström, Sara, Larsson, Christina, Li, Gen, Lincoln, Bo, Lindbom, Lars, Lindgren, Robert, Lindoff, Bengt, Lindqvist, Fredrik, Liu, Jinhua, Lohmar, Thorsten, Lu, Qianxi, Manholm, Lars, Maric, Ivana, Medbo, Jonas, Miao, Qingyu, Moosavi, Reza, Müller, Walter, Myhre, Elena, Nilsson, Johan, Norrman, Karl, Olsson, Bengt-Erik, Palenius, Torgny, Petersson, Sven, Pradas, Jose Luis, Prytz, Mikael, Queseth, Olav, Ramachandra, Pradeepa, Ramos, Edgar, Reial, Andres, Rimhagen, Thomas, Ringh, Emil, Rugeland, Patrik, Rune, Johan, Sachs, Joachim, Sahlin, Henrik, Saxena, Vidit, Seifi, Nima, Selén, Yngve, Semaan, Eliane, Sharma, Sachin, Shi, Cong, Sköld, Johan, Stattin, Magnus, Stjernman, Anders, Sundman, Dennis, Sundström, Lars, Tercero Vargas, Miurel Isabel, Tidestav, Claes, Tombaz, Sibel, Torsner, Johan, Tullberg, Hugo, Vikberg, Jari, Von Wrycza, Peter, Walldeen, Thomas, Wallén, Anders, Wallentin, Pontus, Wang, Hai, Wang Helmersson, Ke, Wang, Jianfeng, Wang, Yi-Pin Eric, Wiberg, Niclas, Wittenmark, Emma, Yilmaz, Osman Nuri Can, Zaidi, Ali, Zhang, Zhan, Zhang, Zhang, Zheng, Yanil

Methods and apparatus in a fifth-generation wireless communications network, including an example method, in a wireless device, that includes determining a reporting quality threshold for a parameter related to channel state information (CSI); performing a measurement for each of a plurality of beams from a first predetermined set of beams for evaluation; evaluating the measurement for each of the plurality of beams against the reporting quality threshold; discontinuing the performing and evaluating of measurements in response to determining that the reporting quality threshold is met for one of the beams, such that one or more beams in the first predetermined set of beams are not measured and evaluated; and reporting, to the wireless communications network, CSI for the one of the beams.

Подробнее
10-08-2004 дата публикации

Equalizer with adaptive pre-filter

Номер: US0006775322B1
Принадлежит: Ericsson Inc., ERICSSON INC, ERICSSON INC.

A computationally efficient method for computing the filter coefficients for a prefilter in a decision feedback equalizer solves linear equations using a fast Toeplitz algorithm. Computations performed to compute the filter coefficients for the right half burst may be used to compute the prefilter for the left hand burst, thereby reducing the number of computations. Also, a square root-free algorithm may be used to solve the system of linear equations, further reducing computational complexity.

Подробнее
24-07-2012 дата публикации

Method and arrangement for improved model order selection

Номер: US0008229050B2

In a method of enabling model order selection for joint channel synchronization and noise covariance estimation of at least one received signal in a wireless communication network, generating S0 a spatially and temporally stacked signal model by stacking successive samples of temporally adjacent received signal vectors and corresponding training vectors, computing S1 a noise variance matrix for each hypothesized synchronization position, channel length and stacking order, based on the stacked training symbols: determining S2 a best synchronization position for the received signal, based on the stacked training vectors, by jointly determining the best synchronization position for the received signal and estimating a channel length and a stacking order for said signal model based on the stacked training vectors.

Подробнее
04-03-2010 дата публикации

CHANNEL ESTIMATION AND EQUALIZATION FOR HARD-LIMITED SIGNALS

Номер: US20100054322A1
Принадлежит:

The present invention provides a method and apparatus for channel estimation when the amplitude of a received signal is hard-limited. A channel estimator computes amplitude estimates for the received signal based on the phase samples of the received signal and previous channel estimates. The amplitude estimates may comprise the expected values of the amplitude given the phase samples and the initial channel estimates. The channel estimator then computes revised channel estimates based on the amplitude estimates and the phase samples. The process may be performed iteratively to refine the channel estimates during each iteration.

Подробнее
01-07-2017 дата публикации

Random access preamble for minimizing pa backoff

Номер: TW0201724899A
Принадлежит:

An example method in a user equipment comprises generating (1220) a random access preamble signal and transmitting (1230) the random access preamble signal. This generating of the random access preamble signal comprises generating a Single-Carrier Frequency-Division Multiple Access, SC-FDMA, random access preamble signal comprising two or more consecutive preamble symbol groups, each preamble symbol group comprising a cyclic prefix portion and a plurality of identical symbols occupying a single subcarrier of the SC-FDMA random access preamble signal. The single subcarrier for at least one of the preamble symbol groups corresponds to a first subcarrier frequency and the single subcarrier for an immediately subsequent one of the preamble symbol groups corresponds to a second subcarrier frequency.

Подробнее
17-11-2016 дата публикации

Template Frame Based MAC Operation

Номер: US20160338051A1
Принадлежит: Telefonaktiebolaget L M Ericsson (PUBL)

The present disclosure generally relates to the field of resource allocation. More specifically, the present disclosure relates to a technique of allocating communication resources in a wireless communication network. The wireless communication network comprises a plurality of access nodes, each of the plurality of access nodes being connected to one or more of the plurality of access nodes via one or more links to provide a plurality of routes for routing data through the wireless communication network. A method embodiment comprises the step of receiving, for one or more links (180, 182) of at least one access node (100) of the plurality of access nodes, allocation information. The allocation information indicates how available communication resources are to be allocated. The method comprises allocating, for the one or more links (180, 182) of the at least one access node (100), the available communication resources based on the received allocation information and a status of one or more ...

Подробнее
05-10-2021 дата публикации

Adaptation of the CRC code length for 3GPP NR

Номер: US0011139915B2

The application relates to the adaption of the length of the cyclic redundancy check (CRC) code in the context of 3GPP NR. In 3GPP NR, the length of the uplink and downlink control information (UCI, DCI) significantly varies. Therefore, it is necessary to select a CRC code of appropriate size or length. Accordingly, a method (200) for use in a wireless transmitter comprises: determining an amount of data to transmit (212), determining a cyclic redundancy check (CRC) polynomial length based on the amount of data to transmit (214); encoding the data using a CRC of the determined polynomial length (216); and transmitting the encoded data (216). The data to transmit may not only comprise control channel data but also user data and may be encoded with a Polar code or a low-density parity check (LDPC) code.

Подробнее
27-02-2020 дата публикации

CODING AND DECODING OF A POLAR CODE CONCATENATED WITH INTERLEAVING WITH AN OUTER SYSTEMATIC CODE

Номер: US20200067642A1
Принадлежит:

Systems and methods related to concatenated polar encoding with interleaving are disclosed. In some embodiments, a method of operation of a radio node to perform encoding of a plurality of data bits for transmission by the radio node comprises encoding a plurality of data bits using a linear encoder to provide a first plurality of coded bits, where the first plurality of coded bits comprises a plurality of parity bits and the plurality of data bits. The method further comprises interleaving the first plurality of coded bits in accordance with an interleaving mapping to provide a plurality of interleaved bits and encoding the plurality of interleaved bits using a polar encoder to provide a second plurality of coded bits to be transmitted by the radio node. 1. A method of operation of a radio node to perform encoding of a plurality of data bits for transmission by the radio node , comprising:encoding a plurality of data bits using a linear encoder to provide a first plurality of coded bits, the first plurality of coded bits comprising a plurality of parity bits and the plurality of data bits, where the plurality of parity bits are a single parity check code;interleaving the first plurality of coded bits in accordance with an interleaving mapping to provide a plurality of interleaved bits; andencoding the plurality of interleaved bits using a polar encoder to provide a second plurality of coded bits to be transmitted by the radio node.2. The method of wherein the interleaving mapping maps the plurality of interleaved bits to inputs of the polar encoder.3. The method of wherein the plurality of interleaved bits is a sequence of bits comprising the plurality of parity bits interleaved with the plurality of data bits claim 1 , and the interleaving mapping is such that at least one of the plurality of parity bits precedes at least one of the plurality of data bits in the sequence of bits.4. The method of wherein:the plurality of interleaved bits is a sequence of bits ...

Подробнее
11-03-2010 дата публикации

Channel estimation and equalization for hard-limited signals

Номер: AU2009288957A1
Принадлежит:

Подробнее
20-09-2006 дата публикации

METHODS AND APPARATUS FOR PRE-FILTERING A SIGNAL TO INCREASE SIGNAL-TO- NOISE RATIO AND DECORRELATE NOISE

Номер: KR1020060100425A
Принадлежит:

To receive a signal from a multiple- input-multiple-output (MIMO) communication channel, initial channel taps are generated based on an impulse response estimate of the MIMO communication channel. The received signal is pre-filtered (350) using the initial channel taps to generate output channel taps and a corresponding output signal having an increased signal-to-noise ratio (SNR) and uncorrelated noise. The SNR is based on a ratio of the energy in a first subset of the output channel taps to the energy in a second subset of the output channel taps. © KIPO & WIPO 2007 ...

Подробнее
30-08-2011 дата публикации

Equalizer for single carrier FDMA receiver

Номер: US0008009727B2

A method of equalizing a received signal compensates for frequency selectivity of the communication channel taking into account channel estimation errors. The method comprises generating channel estimates for the received signal, computing filter weights for an equalizer based on said channel estimates and a covariance of the channel estimation error, and filtering the received signal using the computed filter weights.

Подробнее
01-06-2017 дата публикации

METHOD AND APPARATUS FOR CONFIGURING A CLUSTER

Номер: US20170155481A1
Принадлежит:

A method for configuring a cluster for a terminal device in a wireless network. The method is performed at a network node, such as a base station or a radio network controller. The terminal device can establish at least two concurrent connections to at least one network node in the cluster. The method comprises dynamically adjusting a configuration of the cluster and informing the terminal device of the adjusted configuration so that connectivity of the terminal device in the cluster is adapted to the adjusted configuration. Correspondingly, there is also provided an apparatus embodied at or as at least part of the network node. 1. A method at a network node for configuring a cluster for a terminal device in a wireless network , wherein the terminal device can establish at least two concurrent connections to at least one network node in the cluster , the method comprising:dynamically adjusting a configuration of the cluster; andinforming the terminal device of the adjusted configuration so that connectivity of the terminal device in the cluster is adapted to the adjusted configuration.2. The method according to claim 1 , wherein dynamically adjusting the configuration of the cluster comprises adjusting at least one of the following:one or more of a set of parameters for adding or removing a connection into or from the cluster;a number of concurrent connections;one or more of a set of parameters for switching between the concurrent connections for transmission; andone or more of a set of parameters for cluster head re-allocation.3. The method according to claim 1 , wherein dynamically adjusting the configuration of the cluster is based on at least one of the following:a service type for the terminal device;a traffic load of the at least one network node; anddeployment of the wireless network.4. The method according to claim 3 , wherein the traffic load is indicated by at least one of the following:a number of active terminal devices under the at least one network ...

Подробнее
29-04-2021 дата публикации

Network Architecture, Methods, and Devices for a Wireless Communications Network

Номер: US20210126726A1
Автор: Stefan Parkvall, Janne Peisa, Gunnar Mildh, Robert Baldemair, Stefan Wager, Jonas Kronander, Karl Werner, Richard Abrahamsson, Ismet Aktas, Peter Alriksson, Junaid Ansari, Shehzad Ali Ashraf, Henrik Asplund, Fredrik Athley, Håkan Axelsson, Joakim Axmon, Johan Axnäs, Kumar Balachandran, Gunnar Bark, Jan-Erik Berg, Andreas Bergström, Håkan Björkegren, Nadia Brahmi, Cagatay Capar, Anders Carlsson, Andreas Cedergren, Mikael Coldrey, Icaro L. J. da Silva, Erik Dahlman, Ali el Essaili, Ulrika Engström, Mårten Ericson, Erik Eriksson, Mikael Fallgren, Rui Fan, Gabor Fodor, Pål Frenger, Jonas Fridén, Jonas Fröberg Olsson, Anders Furuskär, Johan Furuskog, Virgile Garcia, Ather Gattami, Fredrik Gunnarsson, Ulf Gustavsson, Bo Hagerman, Fredrik Harrysson, Ning He, Martin Hessler, Kimmo Hiltunen, Songnam Hong, Dennis Hui, Jörg Huschke, Tim Irnich, Sven Jacobsson, Niklas Jaldén, Simon Järmyr, Zhiyuan Jiang, Niklas Johansson, Martin Johansson, Du Ho Kang, Eleftherios Karipidis, Patrik Karlsson, Ali S. Khayrallah, Caner Kilinc, Göran N. Klang, Sara Landström, Christina Larsson, Gen Li, Lars Lindbom, Robert Lindgren, Bengt Lindoff, Fredrik Lindqvist, Jinhua Liu, Thorsten Lohmar, Qianxi Lu, Lars Manholm, Ivana Maric, Jonas Medbo, Qingyu Miao, Reza Moosavi, Walter Müller, Elena Myhre, Karl Norrman, Bengt-Erik Olsson, Torgny Palenius, Sven Petersson, Jose Luis Pradas, Mikael Prytz, Olav Queseth, Pradeepa Ramachandra, Edgar Ramos, Andres Reial, Thomas Rimhagen, Emil Ringh, Patrik Rugeland, Johan Rune, Joachim Sachs, Henrik Sahlin, Vidit Saxena, Nima Seifi, Yngve Selén, Eliane Semaan, Sachin Sharma, Cong Shi, Johan Sköld, Magnus Stattin, Anders Stjernman, Dennis Sundman, Lars Sundström, Miurel Isabel Tercero Vargas, Claes Tidestav, Sibel Tombaz, Johan Torsner, Hugo Tullberg, Jari Vikberg, Peter von Wrycza, Thomas Walldeen, Pontus Wallentin, Hai Wang, Ke Wang Helmersson, Jianfeng Wang, Yi-Pin Eric Wang, Niclas Wiberg, Emma Wittenmark, Osman Nuri Can Yilmaz, Ali Zaidi, Zhan Zhang, Zhang Zhang, Yanli Zheng, PARKVALL STEFAN, PEISA JANNE, MILDH GUNNAR, BALDEMAIR ROBERT, WAGER STEFAN, KRONANDER JONAS, WERNER KARL, ABRAHAMSSON RICHARD, AKTAS ISMET, ALRIKSSON PETER, ANSARI JUNAID, ASHRAF SHEHZAD ALI, ASPLUND HENRIK, ATHLEY FREDRIK, AXELSSON HÅKAN, AXMON JOAKIM, AXNÄS JOHAN, BALACHANDRAN KUMAR, BARK GUNNAR, BERG JAN-ERIK, BERGSTRÖM ANDREAS, BJÖRKEGREN HÅKAN, BRAHMI NADIA, CAPAR CAGATAY, CARLSSON ANDERS, CEDERGREN ANDREAS, COLDREY MIKAEL, DA SILVA ICARO L J, DAHLMAN ERIK, EL ESSAILI ALI, ENGSTRÖM ULRIKA, ERICSON MÅRTEN, ERIKSSON ERIK, FALLGREN MIKAEL, FAN RUI, FODOR GABOR, FRENGER PÅL, FRIDÉN JONAS, FRÖBERG OLSSON JONAS, FURUSKÄR ANDERS, FURUSKOG JOHAN, GARCIA VIRGILE, GATTAMI ATHER, GUNNARSSON FREDRIK, GUSTAVSSON ULF, HAGERMAN BO, HARRYSSON FREDRIK, HE NING, HESSLER MARTIN, HILTUNEN KIMMO, HONG SONGNAM, HUI DENNIS, HUSCHKE JÖRG, IRNICH TIM, JACOBSSON SVEN, JALDÉN NIKLAS, JÄRMYR SIMON, JIANG ZHIYUAN, JOHANSSON NIKLAS, JOHANSSON MARTIN, KANG DU HO, KARIPIDIS ELEFTHERIOS, KARLSSON PATRIK, KHAYRALLAH ALI S, KILINC CANER, KLANG GÖRAN N, LANDSTRÖM SARA, LARSSON CHRISTINA, LI GEN, LINDBOM LARS, LINDGREN ROBERT, LINDOFF BENGT, LINDQVIST FREDRIK, LIU JINHUA, LOHMAR THORSTEN, LU QIANXI, MANHOLM LARS, MARIC IVANA, MEDBO JONAS, MIAO QINGYU, MOOSAVI REZA, MÜLLER WALTER, MYHRE ELENA, NORRMAN KARL, OLSSON BENGT-ERIK, PALENIUS TORGNY, PETERSSON SVEN, PRADAS JOSE LUIS, PRYTZ MIKAEL, QUESETH OLAV, RAMACHANDRA PRADEEPA, RAMOS EDGAR, REIAL ANDRES, RIMHAGEN THOMAS, RINGH EMIL, RUGELAND PATRIK, RUNE JOHAN, SACHS JOACHIM, SAHLIN HENRIK, SAXENA VIDIT, SEIFI NIMA, SELÉN YNGVE, SEMAAN ELIANE, SHARMA SACHIN, SHI CONG, SKÖLD JOHAN, STATTIN MAGNUS, STJERNMAN ANDERS, SUNDMAN DENNIS, SUNDSTRÖM LARS, TERCERO VARGAS MIUREL ISABEL, TIDESTAV CLAES, TOMBAZ SIBEL, TORSNER JOHAN, TULLBERG HUGO, VIKBERG JARI, VON WRYCZA PETER, WALLDEEN THOMAS, WALLENTIN PONTUS, WANG HAI, WANG HELMERSSON KE, WANG JIANFENG, WANG YI-PIN ERIC, WIBERG NICLAS, WITTENMARK EMMA, YILMAZ OSMAN NURI CAN, ZAIDI ALI, ZHANG ZHAN, ZHANG ZHANG, ZHENG YANLI, Parkvall, Stefan, Peisa, Janne, Mildh, Gunnar, Baldemair, Robert, Wager, Stefan, Kronander, Jonas, Werner, Karl, Abrahamsson, Richard, Aktas, Ismet, Alriksson, Peter, Ansari, Junaid, Ashraf, Shehzad Ali, Asplund, Henrik, Athley, Fredrik, Axelsson, Håkan, Axmon, Joakim, Axnäs, Johan, Balachandran, Kumar, Bark, Gunnar, Berg, Jan-Erik, Bergström, Andreas, Björkegren, Håkan, Brahmi, Nadia, Capar, Cagatay, Carlsson, Anders, Cedergren, Andreas, Coldrey, Mikael, da Silva, Icaro L. J., Dahlman, Erik, el Essaili, Ali, Engström, Ulrika, Ericson, Mårten, Eriksson, Erik, Fallgren, Mikael, Fan, Rui, Fodor, Gabor, Frenger, Pål, Fridén, Jonas, Fröberg Olsson, Jonas, Furuskär, Anders, Furuskog, Johan, Garcia, Virgile, Gattami, Ather, Gunnarsson, Fredrik, Gustavsson, Ulf, Hagerman, Bo, Harrysson, Fredrik, He, Ning, Hessler, Martin, Hiltunen, Kimmo, Hong, Songnam, Hui, Dennis, Huschke, Jörg, Irnich, Tim, Jacobsson, Sven, Jaldén, Niklas, Järmyr, Simon, Jiang, Zhiyuan, Johansson, Niklas, Johansson, Martin, Kang, Du Ho, Karipidis, Eleftherios, Karlsson, Patrik, Khayrallah, Ali S., Kilinc, Caner, Klang, Göran N., Landström, Sara, Larsson, Christina, Li, Gen, Lindbom, Lars, Lindgren, Robert, Lindoff, Bengt, Lindqvist, Fredrik, Liu, Jinhua, Lohmar, Thorsten, Lu, Qianxi, Manholm, Lars, Maric, Ivana, Medbo, Jonas, Miao, Qingyu, Moosavi, Reza, Müller, Walter, Myhre, Elena, Norrman, Karl, Olsson, Bengt-Erik, Palenius, Torgny, Petersson, Sven, Pradas, Jose Luis, Prytz, Mikael, Queseth, Olav, Ramachandra, Pradeepa, Ramos, Edgar, Reial, Andres, Rimhagen, Thomas, Ringh, Emil, Rugeland, Patrik, Rune, Johan, Sachs, Joachim, Sahlin, Henrik, Saxena, Vidit, Seifi, Nima, Selén, Yngve, Semaan, Eliane, Sharma, Sachin, Shi, Cong, Sköld, Johan, Stattin, Magnus, Stjernman, Anders, Sundman, Dennis, Sundström, Lars, Tercero Vargas, Miurel Isabel, Tidestav, Claes, Tombaz, Sibel, Torsner, Johan, Tullberg, Hugo, Vikberg, Jari, von Wrycza, Peter, Walldeen, Thomas, Wallentin, Pontus, Wang, Hai, Wang Helmersson, Ke, Wang, Jianfeng, Wang, Yi-Pin Eric, Wiberg, Niclas, Wittenmark, Emma, Yilmaz, Osman Nuri Can, Zaidi, Ali, Zhang, Zhan, Zhang, Zhang, Zheng, Yanli
Принадлежит: Telefonaktiebolaget LM Ericsson AB

Methods and apparatus in a fifth-generation wireless communications, including an example method, in a wireless device, that includes receiving a downlink signal comprising an uplink access configuration index, using the uplink access configuration index to identify an uplink access configuration from among a predetermined plurality of uplink access configurations, and transmitting to the wireless communications network according to the identified uplink access configuration. The example method further includes, in the same wireless device, receiving, in a first subframe, a first Orthogonal Frequency-Division Multiplexing (OFDM) transmission formatted according to a first numerology and receiving, in a second subframe, a second OFDM transmission formatted according to a second numerology, the second numerology differing from the first numerology. Variants of this method, corresponding apparatuses, and corresponding network-side methods and apparatuses are also disclosed.

Подробнее
21-08-2008 дата публикации

Equalizer for Single Carrier FDMA Receiver

Номер: US2008198911A1
Автор: HUI DENNIS, CHENG JUNG-FU
Принадлежит:

A method of equalizing a received signal compensates for frequency selectivity of the communication channel taking into account channel estimation errors. The method comprises generating channel estimates for the received signal, computing filter weights for an equalizer based on said channel estimates and a covariance of the channel estimation error, and filtering the received signal using the computed filter weights.

Подробнее
22-11-2002 дата публикации

LEAST SQUARES CHANNEL ESTIMATION WITH COLORED NOISE CORRECTION

Номер: KR20020087397A
Принадлежит:

Improved receiver performance in obtaining estimates of the complex- valued baseband channel in the presence of colored baseband noise. In various embodiments of the present invention, systems and methods are provided in which, over each synchronization signal period or other determinate information window, the channel coefficients and the color of the baseband noise are concurrently estimated. Thus, both the channel coefficients and the color of the noise are estimated, rather than assuming white noise, and channel coefficients may be provided that account for the color of the noise. These estimates may be provided for each burst of a communication and may result in an improved channel estimate in the presence of colored noise. The baseband noise can become colored due to, for example, having a non-Nyquist receive filter, due to the presence of a colored co-channel interferer, or due to the presence of an adjacent channel interferer. The concurrent estimates of the color of the noise and ...

Подробнее
27-02-2020 дата публикации

Transmitter for Transmitting Discovery Signals, A Receiver and Methods Therein

Номер: US20200068487A1
Принадлежит:

A transmitter and a method therein for transmitting discovery signals to a receiver. The transmitter and the receiver are comprised in a radio communications system. The transmitter transmits two or more discovery signals over two or more directions. Each discovery signal is configured to span over a fraction of a carrier bandwidth. 1. A method , in a base station , for transmitting discovery signals to a user equipment , the base station is configured for transmitting over a carrier bandwidth , the method comprising:transmitting two or more discovery signals over two or more beams; andwherein each of the two or more discovery signals is configured to span less than all of the carrier bandwidth, the carrier bandwidth is separated into sub-bands, and each of the two or more discovery signals is configured to span over one sub-band.2. The method of claim 1 , wherein transmitting the two or more discovery signals comprises transmitting the two or more discovery signals in two or more symbols.3. The method of claim 2 , wherein transmitting the two or more discovery signals further comprises:multiplexing, in the frequency-domain, the two or more discovery signals for the two or more beams; andtransmitting the multiplexed two or more discovery signals in the two or more symbols.4. The method of claim 1 , wherein transmitting the two or more discovery signals further comprises:multiplexing, in the time-domain, the two or more discovery signals for the two or more beams; andtransmitting the multiplexed two or more discovery signals over a same sub-band.5. The method of claim 1 , wherein transmitting the two or more discovery signals comprises transmitting the two or more discovery signals together with information indicating a beam direction.6. The method of claim 1 , wherein transmitting the two or more discovery signals comprises cyclically claim 1 , over time claim 1 , transmitting the two or more discovery signals into the two or more different beams.7. A base station ...

Подробнее
26-10-2021 дата публикации

Enhanced information sequences for polar codes

Номер: US0011159179B2

According to some embodiments, a method of operation of a transmit node in a wireless communication system comprises performing polar encoding of a set of K information bits to thereby generate a set of polar-encoded information bits. The K information bits are mapped to the first K bit locations in an information sequence SN. The information sequence SN is a ranked sequence of N information bit locations among a plurality of input bits for the polar encoding where N is equivalent to a code length. A size of the information sequence SN is greater than or equal to K. The information sequence SN is optimized for the specific value of the code length (N). The method may further comprise transmitting the set of polar-encoded information bits.

Подробнее
25-09-2014 дата публикации

EFFICIENT UPLINK TRANSMISSION OF CHANNEL STATE INFORMATION

Номер: US2014286267A1
Принадлежит:

A User Equipment in a wireless communication network includes a multiplicity of antennas, from which a subset of antennas is selected using a selection scheme synchronized to the network. A set of sub-carriers is selected from a plurality of sub-carriers using a selection scheme synchronized to the network. The UE receives a plurality of known reference symbols over the selected set of sub-carriers and through the selected subset of antennas. A frequency response for each selected sub-carrier is estimated over only the selected subset of antennas. The results are quantized and transmitted to the network on an uplink control channel.

Подробнее
16-03-2017 дата публикации

A TRANSMITTER, A RECEIVER, AND METHODS THEREIN

Номер: US20170078124A1
Принадлежит:

A method in a transmitter for transmitting CPM signals to a receiver. The transmitter divides bits into first and second sequences; duplicates the sequences into third and fourth sequences. The first and second sequences are mapped into a first layer, and the third fourth sequences are mapped into a second layer. The transmitter time reverses one of the first and second sequences, and one of the third and fourth sequences; and maps to and to in one of the time reversed sequence in each layer. The transmitter formats the first and second sequences into a first burst, and the third and fourth sequences into a second burst; and applies differential encoding to the bursts when a modulation index value is a non-integer. The first and second bursts are continuous phase modulated and transmitted as first and second CPM signals through a respective antenna. 1. A method in a transmitter for transmitting Continuous Phase Modulated (CPM) signals to a receiver , wherein the transmitter and the receiver are comprised in a wireless communications network , and wherein the method comprises:dividing a sequence of user code bits into a first bit sequence and a second bit sequence, wherein the first and second bit sequences are of equal length;duplicating the first bit sequence into a third bit sequence, and the second bit sequence into a fourth bit sequence;mapping the first bit sequence and second bit sequence into a first layer corresponding to a first transmit antenna, and the third bit sequence and the fourth bit sequence into a second layer corresponding to a second transmit antenna;time reversing one of the respective first and second bit sequences in the first layer, and one of the respective third and fourth bit sequences in the second layer;mapping 1 to 0 and 0 to 1 in one of the time reversed first or second time reversed bit sequence, or in one of the time reversed third or fourth bit sequence;formatting the first bit sequence and the second bit sequence into a first ...

Подробнее
07-08-2014 дата публикации

CHANNEL ESTIMATION FOR A VERY LARGE-SCALE MULTIPLE-INPUT MULTIPLE-OUTPUT (MIMO) SYSTEM

Номер: US2014219377A1
Принадлежит:

A transmitter, receiver, and method for channel estimation for a Multiple-Input Multiple-Output (MIMO) communication system in which the transmitter includes a multiplicity of transmit antennas spaced such that spacing between adjacent antennas provides a spatial correlation coefficient greater than a threshold level. The transmitter selects a subset of the multiplicity of transmit antennas for transmitting the pilot reference signals. The pilot reference signals are transmitted only from the selected subset of transmit antennas to the receiver. The receiver includes a channel estimator configured to derive a channel estimation for all of the multiplicity of transmit antennas using the received pilot reference signals and known or estimated spatial correlation among the multiplicity of transmit antennas.

Подробнее
01-03-2012 дата публикации

INCREMENTALLY INCLUSIVE FREQUENCY DOMAIN SYMBOL JOINT DETECTION

Номер: US20120051467A1
Принадлежит: Telefonaktiebolaget lM Ericsson (publ)

In one of its aspects the technology disclosed herein concerns a method of operating a receiver. The method comprises performing symbol detection by (1) receiving a frequency-domain signal that comprises contribution from time-domain symbols transmitted from one or more transmit antennas; (2) generating a transformation matrix and a triangular matrix based on a frequency domain channel response; (3) using the transformation matrix to transform the received frequency-domain signal to obtain a transformed frequency-domain signal; and (4) performing symbol detection by performing plural stages of detection, each stage of detection using elements of the transformed frequency-domain received signal associated with the detection stage. 1. A method of operating a receiver which receives a signal over a radio interface:(1) receiving, over a radio channel, a frequency-domain signal that comprises contribution from time-domain symbols transmitted from one or more transmit antennas;(2) generating a transformation matrix and a triangular matrix based on a frequency domain channel response of the radio channel;(3) using the transformation matrix to transform the received frequency-domain signal to obtain a transformed frequency-domain signal; (4a) in a first detection stage:', 'forming hypotheses for the first detection stage based on possible modulation values of one of the time-domain symbols,', 'evaluating detection metrics for all the hypotheses formed for the first detection stage, and', 'in accordance with evaluation of the detection metrics, retaining a predetermined number of best hypotheses from the first detection stage,', '(4c) in an intermediate detection stage:', 'jointly detecting a number of time-domain symbols, the detected time-domain symbols including all the time-domain symbols that were jointly detected in the immediately preceding stage and an additional time-domain symbol that was not detected in any of the previous stages;', 'forming joint hypotheses for ...

Подробнее
10-05-2012 дата публикации

Receiver and method for reducing an amount of channel state information feedback to a transmitter

Номер: US20120115427A1
Принадлежит: Individual

A receiver and a method are described herein for reducing an amount of channel state information related to a transmit channel correlation matrix φ TX that is feedback to a transmitter. In addition, to a transmitter and a method are described herein for reconstructing the transmit channel correlation matrix φ TX using the reduced channel state feedback information received from the receiver.

Подробнее
21-06-2012 дата публикации

DENIAL OF SERVICE (DoS) ATTACK PREVENTION THROUGH RANDOM ACCESS CHANNEL RESOURCE REALLOCATION

Номер: US20120155274A1
Принадлежит:

A system and method to substantially prevent Denial of Service (DoS) attacks due to Random Access Channel (RACH) overload in cellular wireless networks. Once a mobile handset is identified to cause or contribute significantly to a RACH overload of the cell, the system sends a special System Information Block (SIB) message targeted to that mobile handset and instructing it to redirect its RACH signaling to a separate RACH/PRACH (Physical Random Access Channel) resource or to a small part of the current RACH/PRACH resource. This allows most or all of the regular RACH/PRACH resource from being overloaded by a single user or a group of users. The use of a separate RACH/PRACH resource such as frequency, preamble sequence, and/or radio subframe access slot to “absorb” high volume RACH signaling traffic from a small number of malicious/defective mobile handsets substantially prevents the signaling DoS attacks in the wireless network and makes it more robust to such attacks. 1. A method of managing wireless transmissions from a mobile handset operating in a wireless network associated therewith , the method comprising the steps of:using a processor in wireless communication with the mobile handset via the wireless network, determining whether the mobile handset is a source of a Random Access Channel (RACH) overload in the wireless network; andupon determining that the mobile handset is a source of the RACH overload, configuring the mobile handset, using the processor, to replace usage of a first RACH resource causing the RACH overload with usage of a second RACH resource specified by the processor.2. The method of claim 1 , wherein the determining includes:monitoring a number of RACH preamble transmissions from the mobile handset; andidentifying the mobile handset as causing the RACH overload when the number of RACH preamble transmissions from the mobile handset in a time interval exceeds a pre-determined threshold.3. The method of claim 2 , wherein the monitoring includes: ...

Подробнее
26-07-2012 дата публикации

Efficient uplink transmission of channel state information

Номер: US20120188972A1
Принадлежит: Individual

A UE in a wireless communication network transmits succinct, direct channel state information to the network, enabling coordinated multipoint calculations such as joint processing, without substantially increasing uplink overhead. The UE receives and processes reference symbols over a set of non-uniformly spaced sub-carriers, selected according to a scheme synchronized to the network. The frequency response for each selected sub-carrier is estimated conventionally, and the results quantized and transmitted to the network on an uplink control channel. The non-uniform sub-carrier selection may be synchronized to the network in a variety of ways.

Подробнее
26-07-2012 дата публикации

BACKHAUL SIGNAL COMPRESSION THROUGH SPATIAL-TEMPORAL LINEAR PREDICTION

Номер: US20120190389A1
Автор: Hui Dennis
Принадлежит: Telefonaktiebolaget lM Ericsson (publ)

The technology in this application compresses multi-antenna complex-valued signals by exploiting both a spatial and a temporal correlation of the signals to remove redundancy within the complex-valued signals and substantially reduce the capacity requirement of backhaul links. At a receiver, the compressed signal is received, and a decompressor decompresses the received signal over space and over time to reconstruct the multiple antenna stream. 1. A compression method for compressing information in signals received at multiple antennas , comprising the steps of:receiving, over a plurality of antennas, multiple antenna signals associated with a user communication;decorrelating the received antenna signals over space and over time to generate a compressed signal, andtransmitting the compressed signal to a receiving node.2. The compression method in claim 1 , wherein decorrelating the received antenna signals over space and over time comprises decorrelating the received antenna signals over space and time independently.3. The compression method in claim 1 , wherein decorrelating the received antenna signals over space and over time comprises jointly decorrelating the received antenna signals over space and time.4. The compression method in claim 1 , wherein the multiple antenna signals are part of a coordinated multi-point communication claim 1 , and wherein the transmitting is over one or more backhaul communications links.5. The compression method in claim 1 , wherein the multiple antenna signals are complex-valued and sampled.6. The compression method in claim 5 , wherein the decorrelating includes:generating predictions of the multiple antenna signals;determining associated error signals between the predicted multiple antenna signals and corresponding ones of the received multiple antenna signals; andusing the error signals to generate the compressed signal.7. The compression method in claim 6 , further comprising:transforming the error signals using a linear ...

Подробнее
13-09-2012 дата публикации

METHOD OF DOWNLINK SIGNAL TRANSPORT OVER BACKHAUL COMMUNICATIONS THROUGH DISTRIBUTED PROCESSING

Номер: US20120230691A1
Принадлежит:

The amount of multi-antenna signals to be transmitted over the backhaul in a Coordinated MultiPoint (CoMP) system from the central processor (CP) to each base station is reduced. Embodiments of the present invention exploit characteristics of the underlying signal structure, and distribute some baseband processing functionalities—such as channel coding and the application of the multi-user precoding—from the CP to the remote base stations. Additionally, in some embodiments the non-precoded parts of multi-antenna signals are broadcast from the CP to all base stations in the CoMP system, to further reduce the burden on backhaul communications. In one embodiment, the backhaul network is a Gigabit-capable Passive Optical Network (GPON). 1. A method of distributing , from a Central Processor in a Coordinated Multipoint (CoMP) wireless communication system to a plurality of base stations , information to be transmitted to User Equipment (UE) in cells served by the base stations , comprising the steps of:selecting a multi-user precoding matrix for each base station, each precoding matrix comprising precoding weights to be applied to symbols to be transmitted to UEs by a base station;transmitting to each base station information about a precoding matrix selected for that base station;computing the information bits to be transmitted to all UEs in the CoMP system; andtransmitting the set of information bits to all base stations in the CoMP system;2. The method of further comprising the step of computing a multi-user precoding matrix for each base station prior to selecting a multi-user precoding matrix for each base station.3. The method of further comprisingquantizing the selected precoding matrices; andwherein transmitting to each base station information about a precoding matrix selected for that base station comprises transmitting a quantized precoding matrix to each base station.4. The method of wherein the step of computing a multi-user precoding matrix for each base ...

Подробнее
20-09-2012 дата публикации

JOINT MANAGEMENT OF RADIO AND TRANSPORT RESOURCES

Номер: US20120236774A1
Принадлежит:

A system for managing radio access resources includes a joint radio resource management/transport resource management unit configured to communicate with a plurality of radio units over a transport network, to jointly allocate radio resources at the radio unit and transport resources on the transport network in response to requests from wireless terminals requesting access to radio resources from the radio units, to send a radio resource allocation schedule to the plurality of radio units that defines radio resource allocations for the wireless terminals, and to generate a transport resource allocation schedule that defines transport resource allocations for the wireless terminals. The system further includes a transport resource controller configured to receive the transport resource allocation schedule and to map user data to physical transport resources on the transport network in response to the transport resource allocation schedule. 1. A system for managing radio access resources , comprising:a joint radio resource management/transport resource management unit configured to communicate with a plurality of radio units over a transport network, to jointly allocate radio resources at the radio unit and transport resources on the transport network in response to requests from wireless terminals requesting access to radio resources from the radio units, to send a radio resource allocation schedule to the plurality of radio units that defines radio resource allocations for the wireless terminals, and to generate a transport resource allocation schedule that defines transport resource allocations for the wireless terminals; anda transport resource controller configured to receive the transport resource allocation schedule and to map user data to physical transport resources on the transport network in response to the transport resource allocation schedule.2. The system of claim 1 , further comprising:a user/control data unit configured to communicate user and control ...

Подробнее
20-09-2012 дата публикации

DATA MODULATION

Номер: US20120236967A1
Автор: Hui Dennis, Lopez Miguel
Принадлежит:

A modulator includes a symbol mapper that is configured to map respective bits sets of a bit sequence corresponding to a burst and including data, training, tail, and guard bits into respective symbols to form a symbol sequence of data, training, tail, and guard symbols. A vector precoder is configured to apply a vector precoding transformation to the data and training symbols to form precoded symbols. These precoded symbols are combined with the tail and guard symbols in a symbol processor to form a sequence of transmit symbols. The record precoding conducted by the modulator of a transmitter enables improved link performance without the cost of increased processing complexity of the receiver algorithm. 1. A modulator comprising:a symbol mapper configured to receive a bit sequence corresponding to a radio burst and comprising data bits, training bits, tail bits and guard bits and to map respective sets of at least one bit of said bit sequence into respective symbols to form a symbol sequence comprising data symbols, training symbols, tail symbols and guard symbols;a vector precoder configured to apply a vector precoding transformation to said data symbols and said training symbols to form corresponding precoded symbols of said data symbols and said training symbols; anda symbol processor configured to form a sequence of transmit symbols based on said tail symbols and said guard symbols from said symbol mapper and said precoded symbols from said vector precoder.2. The modulator according to claim 1 , wherein said symbol mapper is further configured to map respective sets of multiple bits of said bit sequence into respective symbols to form said symbol sequence comprising said data symbols claim 1 , said training symbols claim 1 , said tail symbols and said guard symbols.3. The modulator according to claim 1 , further comprising a symbol interleaver configured to interleave said training symbols among said data symbols to form at least Q≧3 sets of said data symbols ...

Подробнее
27-09-2012 дата публикации

DYNAMIC, DISTRIBUTED COORDINATION OF PARAMETERS IN A CELLULAR TELECOMMUNICATION NETWORK

Номер: US20120244898A1
Принадлежит:

An apparatus, system, and method for dynamic, distributed coordination of parameters between a plurality of base stations in a cellular telecommunication network. An inter-cell communication interface connecting each given base station with the given base station's neighboring base stations is extended to communicate parameter settings between the given base station and the neighboring base stations. An apparatus in each given base station receives from the given base station's neighboring base stations, parameter settings being utilized by the neighboring base stations for transmitting and/or receiving in associated neighboring cells. The apparatus utilizes the parameter settings received from the neighboring base stations as factors to determine local parameter settings for the given base station. The given base station then sends the local parameter settings and supplemental information to the neighboring base stations so that optimal network-wide parameter settings can be selected. 1. An apparatus in a first base station for dynamic , distributed coordination of parameters between the first base station and a plurality of neighboring base stations in a cellular telecommunication network , the apparatus comprising:a processor that controls the operation of the apparatus when executing computer program instructions stored on a non-transitory memory device, wherein the processor controls the following components of the apparatus:an interface unit that receives from the neighboring base stations, parameter settings being utilized by the neighboring base stations for transmitting and/or receiving in associated neighboring cells; anda parameter computer that utilizes the parameter settings received from the neighboring base stations as factors to determine local parameter settings for use by the first base station for transmitting and/or receiving in a first cell associated with the first base station.2. The apparatus as recited in claim 1 , wherein the processor also ...

Подробнее
15-11-2012 дата публикации

CHANNEL ESTIMATION FOR A VERY LARGE-SCALE MULTIPLE-INPUT MULTIPLE-OUTPUT (MIMO) SYSTEM

Номер: US20120288022A1
Принадлежит:

A transmitter, receiver, and method for channel estimation for a Multiple-Input Multiple-Output (MIMO) communication system in which the transmitter includes a multiplicity of transmit antennas spaced such that spacing between adjacent antennas provides a spatial correlation coefficient greater than a threshold level. The transmitter selects a subset of the multiplicity of transmit antennas for transmitting the pilot reference signals. The pilot reference signals are transmitted only from the selected subset of transmit antennas to the receiver. The receiver includes a channel estimator configured to derive a channel estimation for all of the multiplicity of transmit antennas using the received pilot reference signals and known or estimated spatial correlation among the multiplicity of transmit antennas. 1. A method of transmitting pilot reference signals utilized by a receiver for channel estimation in a Multiple-Input Multiple-Output (MIMO) communication system in which a transmitter utilizes a plurality of transmit antennas , the method comprising the steps of:spacing the plurality of transmit antennas such that spacing between adjacent antennas provides a spatial correlation coefficient greater than a threshold level;selecting by the transmitter, a selected subset of the plurality of transmit antennas for transmitting the pilot reference signals; andtransmitting the pilot reference signals only from the selected subset of transmit antennas to a receiver.2. The method as recited in claim 1 , wherein the spacing between adjacent antennas is equal to or less than one-half wavelength of the transmitted pilot reference signals.3. A method of channel estimation for a Multiple-Input Multiple-Output (MIMO) communication system in which a transmitter utilizes a plurality of transmit antennas claim 1 , the method comprising the steps of:receiving by a receiver, pilot reference signals transmitted only from a selected subset of the plurality of transmit antennas; ...

Подробнее
29-11-2012 дата публикации

Adaptive Feedback of Channel Information for Coordinated Transmission on a Wireless Backhaul

Номер: US20120300654A1
Принадлежит: Telefonaktiebolaget LM Ericsson AB

A backhaul link is established between a base station and a relay that assists the base station in communicating with a mobile device over an access link established between the relay and the mobile device. The channel response of the back-haul link is determined by estimating first and second parts of the backhaul link channel response, the second part changing faster than the first part. The first part of the backhaul link channel response is estimated by calculating an average of the backhaul link channel response over a predetermined period at the relay and the second part is estimated by calculating variation in the backhaul link channel response over the predetermined period at the relay. Quantized versions of the first and second parts of the backhaul link channel response are transmitted from the relay to the base station over the backhaul link

Подробнее
17-01-2013 дата публикации

DISTRIBUTED BEAM SELECTION FOR CELLULAR COMMUNICATION

Номер: US20130017855A1
Принадлежит: Telefonaktiebolaget LM Ericsson (Publ)

A group of multiple base stations implements distributed and coordinated antenna beamforming selection to achieve increased performance. Each of the base stations in the group determines an associated optimal set of antenna beam direction parameters in a distributed manner based on local radio information exchanged between neighboring ones of the base stations. Each of the base stations transmits to one or more user equipments (UEs) served by that base station using its associated optimal set of beam direction parameters. The local radio information generated by one of the base stations indicates how the transmissions of its neighbor base stations affect the performance of the base station. The performance of a base station may be measured by the difficulty or challenge in maintaining a minimum desired signal quality, e.g., a minimum SINR, for the UE served by the base station. 1. A method implemented in a first base station included in a network having multiple neighbor base stations , where the first base station is configured to serve a first user equipment (UE) and the neighbor base stations each serves a corresponding neighbor UE , the method comprising:acquiring local radio performance parameter information from the neighbor base stations;selecting antenna beamforming parameters for the first base station to use to transmit to the first UE based on the local radio performance parameter information; andtransmitting a radio signal to the first UE using the selected antenna beamforming parameters.2. The method in claim 1 , wherein the local radio performance parameter information generated by each of the first and neighbor base stations indicates how the performance of that base station is affected by the transmissions of its neighbor base stations claim 1 , and wherein the local radio performance parameter information is exchanged between the first and neighbor base stations to distributively coordinate beamforming parameter selection by the first and neighbor ...

Подробнее
21-03-2013 дата публикации

Method, Apparatus and System For Choosing a Parameter Setting From a Set of Available Parameter Settings

Номер: US20130072131A1
Принадлежит: TELEFONAKTIEBOLAGET L M ERICSSON (PUBL)

A system comprises a communication device that chooses a parameter setting from a set of available parameter settings. The system may include multiple communication devices, and each available parameter setting may have an associated cost. The communication device may receive parameter setting information from one or more other communication devices in the system, and the parameter setting information may identify the parameter setting being used by the one or more communication devices in the system. The communication device may choose a parameter setting that is associated with the lowest cost based on the parameter setting information received from the one or more other communication devices in the system. 1. In a system comprising a first communication device and a second communication device , a method performed by the first communication device for choosing a parameter setting from a set of two or more available parameter settings comprising a first available parameter setting and a second available parameter setting , wherein each of the first and second available parameter settings has an associated cost , the method comprising:(a) receiving, by the first communication device, information transmitted by the second communication device, the information transmitted by the second communication device comprising parameter setting information identifying a parameter setting being used by the second communication device;(b) determining, by the first communication device, a first cost value using, at the least: (i) the first available parameter setting and (ii) the parameter setting being used by the second communication device;(c) determining, by the first communication device, a second cost value using, at the least: (i) the second available parameter setting and (ii) the parameter setting being used by the second communication device;(d) determining which available parameter setting, or settings, from the set of available parameter settings is associated with ...

Подробнее
28-03-2013 дата публикации

SPATIALLY RANDOMIZED PILOT SYMBOL TRANSMISSION METHODS, SYSTEMS AND DEVICES FOR MULTIPLE INPUT/MULTIPLE OUTPUT (MIMO) WIRELESS COMMUNICATIONS

Номер: US20130077658A1
Принадлежит: TELEFONAKTIEBOLAGET L M ERICSSON (PUBL)

Compressive sampling is used to generate pilot symbols to be transmitted over an array of antennas in a MIMO wireless communications device. A pilot symbol is transmitted over the array of antennas according to a spatially randomized antenna transmission function that randomly changes across the array of antennas. The randomized antenna transmission function may randomly select/deselect antennas and/or randomly change amplitude and/or phase of the pilot symbol transmission. Channel estimates can be constructed at a receiver based on the spatially randomized pilot symbols that were transmitted. 1. A method of transmitting pilot symbols by a multiple input multiple output (MIMO) wireless communications device that includes an array of antennas , the method comprising:transmitting a respective pilot symbol in a sequence of pilot symbols simultaneously over the array of antennas according to a random antenna transmission function that randomly changes across the array of antennas.2. A method according to wherein the transmitting comprises:obtaining a predetermined pseudo-random number sequence; andtransmitting a respective pilot symbol in the sequence of pilot symbols simultaneously over the array of antennas according to a random antenna transmission function that randomly changes across the array of antennas based on the predetermined pseudo-random number sequence.3. A method according to wherein the random antenna transmission function comprises a random antenna select/deselect function that causes the respective pilot symbol in the sequence of pilot symbols to be transmitted simultaneously over a randomly selected subset of the array of antennas claim 1 , wherein the randomly selected subsets of the array of antennas range from one to all of the antennas.4. A method according to wherein the random antenna transmission function comprises a random antenna transmission amplitude function that causes the respective pilot symbol in the sequence of pilot symbols to be ...

Подробнее
02-05-2013 дата публикации

Adaptation of Parameters in a Communication Network

Номер: US20130109421A1
Принадлежит: TELEFONAKTIEBOLAGET L M ERICSSON (PUBL)

A distributed parameter update procedure is provided for updating parameters that do not have discrete values. When a parameter value is changed, a search is conducted of a parameter space to find a new parameter value minimizes some cost function. The cost function is derived based on the current parameter settings in neighboring nodes. The distributed parameter update procedure may simplify the search process by localizing the search of the parameter space for a new parameter value to the vicinity of the current parameter setting. In some embodiments, the search is conducted along a line of steepest descent emanating from the current parameter setting. 1. A method of determining parameter settings for a network node in a communication network , the method comprising:receiving, at a network node, current parameter settings for each of one or more neighboring nodes in a local network of the network node;computing a gradient of a summed cost function for the network node as a function of the current parameter settings for the network node and its neighboring nodes;determining a revised parameter setting for the network node by searching a parameter space along the gradient of the summed cost function; andsending the revised parameter setting for the network node to the neighboring nodes.2. The method of wherein computing a gradient of a summed cost function comprises:receiving a partial derivative with respect to the network node of a local cost function for each of one or more of the neighboring nodes; andcomputing the gradient of a summed cost function for the network node based on the received partial derivatives of the local cost functions for the neighboring nodes.3. The method of wherein receiving a partial derivative with respect to the network node of a local cost function for each of one or more of the neighboring nodes comprises:exchanging current parameter settings with the neighboring nodes, wherein the network node receives current parameter settings for ...

Подробнее
09-05-2013 дата публикации

DYNAMIC SPACE DIVISION DUPLEX (SDD) WIRELESS COMMUNICATIONS WITH MULTIPLE ANTENNAS USING SELF-INTERFERENCE CANCELLATION

Номер: US20130114468A1
Принадлежит:

A system and method to perform Full Duplex (FD) Space Division Duplex (SDD) communication using a Self-Interference Cancelling (SIC) precoder that applies different antenna phase shifts and amplitude scales to the transmitted signals to force them to be in the null space of the selected receive antennas. Thus, a wireless communication unit can place nulls at each of its receive antennas digitally at baseband for one or more frequency bands. The SIC precoder may be computed based on the self-interference channel from the transmit chain(s) to the receive chain(s). Different SIC precoders may be adaptively selected and stored digitally for different frequency bands. Subsequent single or multi-user precoder can be applied in concatenation with the SIC precoder to transmit signals to one or more users while receiving signals from one or more users simultaneously over the same frequency band. 1. A method of providing full-duplex communication in a pre-determined frequency band using a wireless communication unit having a plurality of antennas , the method comprising the steps of:the wireless unit receiving one or more receive data streams in the pre-determined frequency band utilizing a first subset of the plurality of antennas, wherein the first subset includes at least one antenna from the plurality of antennas as a receive antenna;the wireless unit simultaneously transmitting one or more transmit data streams in the pre-determined frequency band utilizing a second subset of the plurality of antennas, wherein the second subset includes less than or equal to the total number of antennas in the plurality of antennas as transmit antennas; andthe wireless unit adjusting the relative amplitudes and relative phases of radio signals carrying the transmit data streams that are transmitted through the transmit antennas in the pre-determined frequency band, thereby configuring all transmit antennas to collectively place a substantial null at each receive antenna when transmitting ...

Подробнее
16-05-2013 дата публикации

CHANNEL ESTIMATION AND EQUALIZATION FOR HARD-LIMITED SIGNALS

Номер: US20130121448A1
Автор: Hui Dennis, Zangi Kambiz
Принадлежит: TELEFONAKTIEBOLAGET L M ERICSSON (PUBL)

The present invention provides a method and apparatus for channel estimation when the amplitude of a received signal is hard-limited. A channel estimator computes amplitude estimates for the received signal based on the phase samples of the received signal. The amplitude estimates may comprise the expected values of the amplitude given the phase samples. The channel estimator then computes revised channel estimates based on the amplitude estimates and the phase samples. The process may be performed iteratively to refine the channel estimates during each iteration. 1. A method of generating channel estimates for a received signal that is hard-limited based on phase samples of the received signal , said method comprising:computing expected amplitude values for the received signal based on the phase samples; andcomputing revised channel estimates based on the expected amplitude values and the phase samples.2. The method of wherein the computation of the expected amplitude values for the received signal is based further on a previous noise statistic.3. The method of wherein the expected amplitude values for the received signal and the revised channel estimates are computed iteratively.4. The method of wherein the computation of the expected amplitude values for the received signal is based further on previous channel estimates.5. The method of wherein the expected amplitude values for the received signal and the revised channel estimates are computed iteratively.6. The method of wherein the revised channel estimates computed during each iteration are available as the previous channel estimates for a subsequent iteration.7. The method of wherein the computation of the expected amplitude values for the received signal is based further on a previous noise statistic.8. The method of further comprising computing a revised noise statistic during each iteration claim 7 , wherein the revised noise statistic computed during each iteration is available as the previous noise ...

Подробнее
23-05-2013 дата публикации

Energy efficient operation for dense deployment of wireless access nodes

Номер: US20130128785A1
Принадлежит: Telefonaktiebolaget LM Ericsson AB

Systems and methods are disclosed for providing energy efficient operation for wireless access nodes in a dense deployment of wireless access nodes in a cellular communication network. In one particular embodiment, wireless access nodes form a super dense network. In one embodiment, a wireless access node in a dense deployment of wireless access nodes in a cellular communication network includes a transmitter and a receiver that are operated according to a discontinuous transmit and a discontinuous receive mode of operation. The wireless access node controls one or more duty cycles for the discontinuous transmit and discontinuous receive mode of operation based on an alertness state of the wireless access node. In one embodiment, the one or more duty cycles increase as the alertness state of the wireless access node increases. In this manner, the wireless access node is operated in an energy efficient manner.

Подробнее
23-05-2013 дата публикации

ENERGY EFFICIENT OPERATION FOR WIRELESS ACCESS NODES IN A LOW-LOAD SERVICE AREA WITHIN A DENSE DEPLOYMENT OF WIRELESS ACCESS NODES

Номер: US20130128788A1
Принадлежит:

Systems and methods are disclosed for efficient operation of wireless access nodes in a dense deployment of wireless access nodes in a cellular communication network. In general, the dense deployment of wireless access nodes includes multiple wireless access nodes in a service area. The service area is preferably, but not necessarily, a low-load service area. As used herein, a low-load service area is an area within an overall service area of the dense deployment of wireless access nodes in which all wireless access nodes are not needed to provide a desired data capacity. Overlapping radio coverage areas of the wireless access nodes in, or serving, the service area are leveraged to enable efficient operation of the wireless access nodes in the service area. 1. A cellular communication network comprising:a dense deployment of wireless access nodes, the dense deployment of wireless access nodes comprising a plurality of wireless access nodes in a service area;wherein only a subset of the plurality of wireless access nodes in the service area are active during each of a plurality of discontinuous transmit active intervals for the plurality of wireless access nodes in the service area, and only a subset of the plurality of wireless access nodes in the service area are active during each of a plurality of discontinuous receive active intervals for the plurality of wireless access nodes in the service area.2. The cellular communication network of wherein the service area is a low-load service area.3. The cellular communication network of wherein the same subset of the plurality of wireless access nodes in the service area is active during all of the plurality of discontinuous transmit active intervals for the plurality of wireless access nodes in the service area and all of the plurality of discontinuous receive active intervals for the plurality of wireless access nodes in the service area.4. The cellular communication network of wherein the subset of the plurality of ...

Подробнее
30-05-2013 дата публикации

Metric Corrections for Demodulators Using Serial Localization with Indecision

Номер: US20130136210A1
Принадлежит: TELEFONAKTIEBOLAGET L M ERICSSON (PUBL)

Demodulation methods and apparatus for a multi-stage SLI demodulator are disclosed. Residual signals from each demodulation stage are modeled as finite sets of unresolved signals and a new metric is introduced for use in search of best candidate symbol estimates. The metric may be evaluated based on a probability distribution function of the residual signals or a probability mass function of the unresolved signals. The metric may also be approximated by the sum of a conventional Euclidean metric and a correction metric. The best candidate symbol estimates generated from each stage of the multi-stage SLI demodulator are summed to form cumulative symbol estimates. 1. A method of demodulating multiple data streams implemented in one demodulation stage of a multi-stage receiver , said method comprising:receiving input symbols corresponding to multiple data streams;generating a set of candidate sequences from symbols in a symbol constellation, and a finite set of unresolved signals;computing a likelihood metric for each candidate sequence based on the input symbols and a probability mass function for the unresolved signals; andselecting, based on the likelihood metrics, one of said candidate sequences as output symbol estimates.2. The method of claim 1 , wherein computing a likelihood metric for each candidate sequence comprises computing a sum of a squared Euclidean distance and a correction term that includes the probability mass function for the unresolved signals.3. The method of claim 1 , wherein computing a likelihood metric comprises:determining a number of the unresolved signals in the finite set of unresolved signals; andwhen the number of the unresolved signals is less than a threshold, computing the likelihood metric as a sum of a squared Euclidean distance metric and a correction term that includes the probability mass function for the unresolved signals.4. The method of claim 3 , wherein the correction term is ignored in the computation of the likelihood ...

Подробнее
06-06-2013 дата публикации

SYSTEMS AND METHOD FOR GRAPH-BASED DISTRIBUTED PARAMETER COORDINATION IN A COMMUNICATION NETWORK

Номер: US20130142078A1
Принадлежит: TELEFONAKTIEBOLAGET L M ERICSSON (PUBL)

Systems and method are disclosed for graph-based distributed parameter coordination in a communication network. In general, discrete local parameters to be coordinated among communication nodes in the network and their respective performance metrics, or costs, are modeled using a factor graph. Based on the factor graph, a variant of the sum-product algorithm, namely the min-sum algorithm, is applied in order for the communication nodes, through iterative message passing with their neighboring communication nodes, to decide upon optimal values for the local parameters for the communication nodes that collectively optimize a global performance metric across the communication network. In one embodiment, the communication network is a wireless communication network. In one specific embodiment, the wireless communication network is a cellular communication network. 1. A method of operation of a communication node in a communication network , comprising:iteratively exchanging messages with a plurality of neighboring communication nodes in the communication network based on a factor graph until a predefined stopping criteria is satisfied, the factor graph modeling discrete local parameters to be coordinated among communication nodes in the communication network and corresponding performance metrics of the communication nodes; andcomputing an optimal value for the local parameter of the communication node based on results of iteratively exchanging the messages with the plurality of neighboring communication nodes.2. The method of wherein computing the optimal value for the local parameter of the communication node comprises computing the optimal value for the local parameter of the communication node such that the optimal value for the local parameter and corresponding optimal values determined for local parameters of other communication nodes in the communication network together optimize a global performance metric for the communication network.3. The method of wherein ...

Подробнее
06-06-2013 дата публикации

GRAPH-BASED DISTRIBUTED COORDINATION METHODS FOR WIRELESS COMMUNICATION NETWORKS

Номер: US20130142082A1
Принадлежит: TELEFONAKTIEBOLAGET L M ERICSSON (PUBL)

Systems and methods are disclosed for graph-based distributed parameter coordination in a communication network. In general, discrete local parameters to be coordinated among communication nodes in the communication network and their respective performance metrics, or costs, are modeled using a factor graph. Based on the factor graph, a variant of the sum-product algorithm, namely the min-sum algorithm, is applied in order for the communication nodes, through iterative message passing with their neighboring communication nodes, to decide upon optimal values for the local parameters for the communication nodes that collectively optimize a global performance metric across the communication network. In one embodiment, the communication network is a wireless communication network. In one specific embodiment, the wireless communication network is a cellular communication network. 1. A method of operation of a base station in a cellular communication network , comprising:iteratively exchanging messages with a plurality of neighboring base stations in the cellular communication network based on a factor graph until one or more predefined stopping criteria are satisfied, the factor graph modeling discrete local parameters to be coordinated among base stations in the cellular communication network and corresponding local performance metrics of the base stations, wherein the discrete local parameters represent precoding matrices to be utilized for one of a group consisting of downlinks from the base stations to mobile terminals served by the base stations and uplinks from the mobile terminals served by the base stations to the base stations; andcomputing an optimal value for the local parameter of the base station based on results of iteratively exchanging the messages with the plurality of neighboring base stations.2. The method of wherein the precoding matrices are antenna selection matrices.3. The method of wherein the precoding matrices are beam selection matrices.4. The ...

Подробнее
13-06-2013 дата публикации

EXPLOITING CHANNEL TIME CORRELATION TO REDUCE CHANNEL STATE INFORMATION FEEDBACK BITRATE

Номер: US20130148706A1
Принадлежит:

The required bitrate for reporting channel state information from a network transceiver to the network is dramatically reduced, while maintaining fidelity of channel estimates, by exploiting prior channel estimates and the time correlation of channel response. For a selected set of sub-carriers, the transceiver estimates channel frequency response from pilot signals. The transceiver also predicts the frequency response for each selected sub-carrier, by multiplying a state vector comprising prior frequency response estimate and a coefficient vector comprising linear predictive coefficients. The predicted frequency response is subtracted from the estimated frequency response, and the prediction error is quantized and transmitted to the network. The network maintains a corresponding state vector and predictive coefficient vector, and also predicts a frequency response for each selected sub-carrier. The received prediction error is inverse quantized and subtracted from the predicted frequency response to yield a frequency response corresponding to that estimated at the transceiver. 1. An efficient method of reporting channel state information (CSI) by a transceiver operative in a wireless communication network in which downlink data is modulated onto a plurality of sub-carriers , each having a different frequency , comprising , at each iteration:receiving a plurality of known reference symbols over a subset of the plurality of sub-carriers;selecting a set of sub-carriers using a selection scheme synchronized to the network; estimating a frequency response;', 'predicting a frequency response, in a manner synchronized to the network, based on prior frequency response estimates and a time correlation of channel response;', 'subtracting the predicted frequency response from the estimated frequency response to yield a prediction error;', 'quantizing the prediction error; and, 'for each selected sub-carrier,'}transmitting the quantized prediction errors for all selected sub- ...

Подробнее
03-10-2013 дата публикации

Enhanced metrics for demodulation and soft information generation in the presence of a non-constant envelope modulated interferer

Номер: US20130259164A1
Принадлежит: Telefonaktiebolaget LM Ericsson AB

Systems and methods utilize enhanced metrics for demodulation and/or soft bit information generation in the presence of a non-constant envelope modulated interfering signal. In one embodiment, a receiver includes a downconverter and a demodulator. The downconverter receives a radio frequency signal comprising a desired signal, noise, and a non-constant envelope modulated interfering signal, and downconverts the radio frequency signal to provide a downconverted signal. The demodulator demodulates the downconverted signal based on a demodulation metric that models the non-constant envelope modulated interfering signal as a stationary non-Gaussian random process with a probability distribution derived from a modulation constellation of a modulation used for the non-constant envelope modulated interfering signal. In one embodiment, the demodulator outputs demodulated symbols. In another embodiment, the demodulator outputs soft bit information.

Подробнее
07-11-2013 дата публикации

Network nodes providing pre-call and during call advertising

Номер: US20130294593A1
Принадлежит: Individual

A voice call network node communicates advertisements to user terminals of a telecommunications system. The voice call network node includes a voice call handling component and an advertisement insertion component. The voice call handling component responds to a voice call from a caller user terminal by identifying characteristics of the caller user terminal and/or the callee user terminal. The advertisement insertion component communicates voice call profile information through a network to an advertisement service offering node. The voice call profile information identifies characteristics of the caller user terminal and/or the callee user terminal The advertisement insertion component also receives an advertisement from the advertisement service offering node responsive to the communicated voice call profile information, and communicates the advertisement to the caller user terminal and/or to the callee user terminal Related advertisement service offering nodes and user terminals are disclosed.

Подробнее
21-11-2013 дата публикации

Time Slot Sharing in TDMA Communication System

Номер: US20130308616A1
Автор: Hui Dennis, Lopez Miguel
Принадлежит:

The embodiments of the present invention relate to a method in a transmitting unit; a method in a receiving unit; a transmitting unit and a receiving unit, in a wireless communication network employing Time Division Multiple Access, TDMA, for transmitting and, receiving and demodulating data, respectively, the data being transmitted in a signal comprising a burst, wherein bursts relating to Nnumber of mobile stations are multiplexed into a single time slot. The transmission comprises grouping a block of N b number of user code bits, representing the data to be transmitted, into N/Ngroups of user code bits. Mapping the groups of user code bits to data symbols such that one group is represented by one data symbol, thereby obtaining a block of data symbols, wherein each data symbol is drawn from one or more pre-defined complex-valued symbol constellation(s). The transmission further comprises repeating the block of data symbols, such that the burst to be transmitted comprises Nnumber of equal blocks of data symbols, rotating the Nnumber of blocks of data symbols according to a mobile-station-specific rotation, and transmitting the rotated blocks of data symbols in a burst in the time slot. 120-. (canceled)21. A method in a transmitting unit for transmitting data in a burst over a wireless communication network employing Time Division Multiple Access (TDMA) , said burst comprising a payload of Ndata symbols , such that the data in said burst is represented by a block of data symbols , wherein bursts related to Nmobile stations are communicated in a single time slot , the method comprising:{'sub': b', 'Ds', 'MS, 'grouping a block of Nuser code bits, representing the data to be transmitted, into N/Ngroups of user code bits;'}mapping said groups of user code bits to data symbols such that one group is represented by one data symbol, thereby obtaining a block of data symbols, wherein each data symbol is drawn from one or more pre-defined complex-valued symbol constellations ...

Подробнее
13-02-2014 дата публикации

COMMUNICATING OVER A DESIRED TONE IN THE PRESENCE OF INTERFERENCE HAVING AN UNKNOWN MAGNITUDE THAT IS SUBSTANTIALLY CONSTANT

Номер: US20140044202A1
Автор: Hui Dennis
Принадлежит: TELEFONAKTIEBOLAGET L M ERICSSON (PUBL)

Methods and systems are disclosed for transmitting data over a desired frequency tone in the presence of an interference that has an unknown magnitude that is substantially constant. In general, data symbols are transmitted in a null space of the desired frequency tone. The null space of the desired frequency tone is orthogonal to the desired frequency tone. As such, the data symbols transmitted in the null space of the desired frequency tone are not interfered with by the interference at the desired frequency tone regardless of the magnitude of the interference. The data symbols transmitted in the null space of the desired frequency tone can then be recovered by a receiver without estimation of or compensation for the interference at the desired frequency tone. 1. A method of operation of a wireless transmitter comprising:generating a signal comprising a number, N−1, of data symbols in a null space of a predetermined frequency;for a number, N, of transmission time periods, modulating, based on the generated signal, a tone having the predetermined frequency; andtransmitting the modulated tone.2. The method of wherein the predetermined frequency is one of a plurality of subcarriers of a multi-subcarrier signal claim 1 , and transmitting the modulated tone comprises transmitting the multi-subcarrier signal such that the modulated tone is the one of the plurality of subcarriers of the multi-subcarrier signal.3. The method of wherein the multi-subcarrier signal is an Orthogonal Frequency Divisional Multiplexing signal.4. The method of wherein generating the signal comprises generating the signal such that each data symbol of the number claim 1 , N−1 claim 1 , of data symbols is carried across the number claim 1 , N claim 1 , of transmission time periods by a different basis vector in a set of basis vectors that characterize the null space of the predetermined frequency.5. The method of wherein generating the signal comprises claim 1 , for each of the number claim 1 , N ...

Подробнее
27-03-2014 дата публикации

METRIC COMPUTATION FOR INTERFERENCE-AWARE ROUTING

Номер: US20140086080A1
Принадлежит: TELEFONAKTIEBOLAGET L M ERICSSON (PUBL)

Systems and methods for computing and/or utilizing mutual information based link metrics for a link in a wireless mesh network are disclosed. In one embodiment, one or more mutual information values are computed for a link between a transmitter of a first network node and a receiver of a second network node in a wireless mesh network. Each of the one or more mutual information values is computed for a different hypothesized transmission mode for the link. One or more link metrics for the link are computed as a function of the mutual information values, where each link metric is computed based on a different one of the one or more mutual information values. In this manner, a link metric is computed for each of the one or more hypothesized transmission modes for the link. At least one of the link metrics are then provided to a routing update module. 1. A method comprising:computing one or more mutual information values for a link between a transmitter of a first network node and a receiver of a second network node in a wireless mesh network, wherein each of the one or more mutual information values comprises a mutual information value for the link for a different one of one or more transmission modes;computing one or more link metrics for the link as a function of the one or more mutual information values, where each link metric of the one or more link metrics is a function of a different one of the one or more mutual information values; andproviding at least one of the one or more link metrics to a routing update module.2. The method of wherein computing the one or more mutual information values comprises claim 1 , for each transmission mode of the one or more transmission modes:computing a signal-to-interference-plus-noise ratio for the link for the transmission mode; andcomputing the mutual information value for the link for the transmission mode as a function of the signal-to-interference-plus-noise ratio.3. The method of wherein the one or more transmission modes ...

Подробнее
04-01-2018 дата публикации

ADAPTIVE RELAY SCHEMES AND VIRTUAL FULL-DUPLEX RELAY OPERATION

Номер: US20180006796A1
Принадлежит:

A wireless communication system comprises a source node, a destination node, and a plurality of half-duplex relay nodes disposed between the source node and the destination node. The half-duplex relay nodes are configured in two disjoint paths each comprising an equal number of hops from the source node to the destination node. The source node is configured to alternately transmit information via the two disjoint paths in alternating time slots, and the destination node is configured to alternately receive information via the two disjoint paths in alternating time slots. 1. A wireless communication node , comprising:a processor and memory collectively encoding instructions that when executed by the processor, cause the wireless communication node to:identify a current time slot as an odd time slot or an even time slot; andin response to identifying the current time slot as an odd time slot or an even time slot, transmit a source message to a corresponding odd-time relay group or an even-time relay group during the current time slot,wherein each of the odd-time relay group and the even-time relay group comprises a different set of half-duplex relay nodes disposed between the wireless communication node and a destination node.2. The wireless communication node of claim 1 , wherein the instructions further cause the wireless communication node to:generate a block of information bits as the source message; andin response to identifying the current time slot as an odd time slot or an even time slot, encode the block of information bits into a codeword, generate a modulated signal from the codeword, and transmit the modulated signal as the source message.3. The wireless communication node of claim 2 , wherein the block of information bits is encoded with a first or second coding rate according to whether the current time slot is an odd time slot or an even time slot.4. The wireless communication node of claim 3 , wherein the first and second coding rates are determined ...

Подробнее
21-01-2021 дата публикации

ALTERATION OF SUCCESSIVE CANCELLATION ORDER IN DECODING OF POLAR CODES

Номер: US20210021844A1
Принадлежит:

Systems and methods for performing polar decoding using a transformation of the coded bits prior to polar decoding and an inverse transformation of the resulting data bits after polar decoding are disclosed. In some embodiments, a method of operation of a receiving node to perform polar decoding comprises transforming a received code bit vector yin accordance with a transformation Tto thereby provide a transformed code bit vector Y′=YT, performing polar decoding of the transformed code bit vector y′to thereby provide a transformed data bit vector v′, and inversely transforming the transformed data bit vector v′in accordance with an inverse transformation Tto thereby provide an estimated data bit vector v=v′T. In some embodiments, the transformation Tre-orders coded bits in the coded bit vector ysuch that some future frozen bit(s) are swapped in front of some information bit(s) prior to performing polar decoding. 1. A method of operation of a receiving node to perform polar decoding , comprising:{'sub': N', 'N', 'N', 'N', 'N, 'transforming a received code bit vector yin accordance with a transformation Tto thereby provide a transformed code bit vector y′=yT;'}{'sub': N', 'N, 'performing polar decoding of the transformed code bit vector y′ to thereby provide a transformed data bit vector v′; and'}{'sub': N', 'N', 'N', 'N', 'N, 'sup': −1', '−1, 'inversely transforming the transformed data bit vector v′ in accordance with an inverse transformation Tto thereby provide an estimated data bit vector v=v′T.'}3. The method of wherein the transformation Tis a bit-reversal matrix Rthat performs permutation in such a way that eR=e claim 2 , for all i∈{0 claim 2 , 1 claim 2 , 2 claim 2 , . . . claim 2 , N−1} claim 2 , where edenotes a vector with all zeros except at the ith position where the element is one claim 2 , and where r(i)∈{0 claim 2 , 1 claim 2 , 2 claim 2 , . . . claim 2 , N−1} denotes a number whose binary representation is in a reversed bit order as the binary ...

Подробнее
23-01-2020 дата публикации

Soft Output Decoding of Polar Codes

Номер: US20200028522A1
Принадлежит:

According to certain embodiments, a method is provided for generating soft information for code bits of polar codes. The method includes receiving, by a decoder of a receiver, soft information associated with coded bits from a first module of the receiver and using a tree structure of the polar code to generate updated soft information. The updated soft information is output by the decoder for use by a second module of the receiver. 1. A method in a receiver for generating soft information for code bits of polar codes , the method comprising:receiving, by a decoder of the receiver, soft information associated with coded bits from a first module of the receiver;using, by the decoder, a tree structure of the polar code to generate updated soft information; andoutputting, by the decoder of the receiver, the updated soft information for use by a second module of the receiver.2. The method of claim 1 , wherein the soft information comprises a plurality of log likelihood ratios (LLRs) of coded bits received by the decoder from the first module of the receiver.3. The method of claim 2 , wherein using the tree structure of the polar code to generate the updated soft information comprises:generating a plurality of LLRs of the info bits by traversing the plurality of LLRs of the coded bits through the tree structure of the polar code in a first direction;setting a plurality of LLRs of frozen bits to large, positive or negative, values according to a plurality of respective pre-set values of the frozen bits;re-encoding the plurality of LLRs of the info bits and the plurality of LLRs of the frozen bits.4. The method of claim 3 , wherein re-encoding the plurality of the LLRs of the info bits comprises:reverse propagating the plurality of LLRs of the info bits and the plurality of LLRs of the frozen bits into the plurality of LLRs of the coded bits.5. The method of claim 4 , where in reverse propagating the plurality of LLRs of the info bits and the plurality of LLRs of the ...

Подробнее
23-01-2020 дата публикации

Network Architecture, Methods, and Devices for a Wireless Communications Network

Номер: US20200028745A1
Автор: Abrahamsson Richard, Aktas Ismet, ALRIKSSON Peter, ANSARI Junaid, Ashraf Shehzad Ali, Asplund Henrik, Athley Fredrik, Axelsson Håkan, Axmon Joakim, AXNÄS Johan, Balachandran Kumar, Baldemair Robert, Bark Gunnar, BERG Jan-Erik, Bergstrom Andreas, Björkegren Håkan, Brahmi Nadia, Capar Cagatay, Carlsson Anders, Cedergren Andreas, Coldrey Mikael, da Silva Icaro L. J., Dahlman Erik, El Essaili Ali, Engström Ulrika, Ericson Márten, Eriksson Erik, Fallgren Mikael, Fan Rui, Fodor Gabor, Frenger Pål, Fridén Jonas, Fröberg Olsson Jonas, Furuskär Anders, Furuskog Johan, GARCIA Virgile, GATTAMI Ather, Gunnarsson Fredrik, GUSTAVSSON Ulf, Hagerman Bo, HARRYSSON Fredrik, He Ning, Hessler Martin, Hiltunen Kimmo, Hong Songnam, Hui Dennis, Huschke Jörg, Irnich Tim, Jacobsson Sven, JALDÉN Niklas, JÄRMYR Simon, Jiang Zhiyuan, Johansson Martin, Johansson Niklas, KANG Du Ho, Karipidis Eleftherios, Karlsson Patrik, Khayrallah Ali S., Kilinc Caner, KLANG Göran N., Kronander Jonas, Landström Sara, Larsson Christina, LI Gen, Lincoln Bo, Lindbom Lars, LINDGREN Robert, Lindoff Bengt, Lindqvist Fredrik, Liu Jinhua, Lohmar Thorsten, Lu Qianxi, Manholm Lars, Maric Ivana, Medbo Jonas, Miao Qingyu, Mildh Gunnar, Moosavi Reza, Müller Walter, Myhre Elena, Nilsson Johan, Norrman Karl, Olsson Bengt-Erik, Palenius Torgny, Parkvall Stefan, Peisa Janne, PETERSSON Sven, Pradas Jose Luis, Prytz Mikael, Queseth Olav, Ramachandra Pradeepa, Ramos Edgar, Reial Andres, RIMHAGEN Thomas, Ringh Emil, Rugeland Patrik, Rune Johan, Sachs Joachim, Sahlin Henrik, Saxena Vidit, SEIFI Nima, Selén Yngve, Semaan Eliane, SHARMA SACHIN, Shi Cong, Sköld Johan, Stattin Magnus, Stjernman Anders, Sundman Dennis, Sundström Lars, Tercero Vargas Miurel Isabel, Tidestav Claes, Tombaz Sibel, Torsner Johan, Tullberg Hugo, Vikberg Jari, Von Wrycza Peter, Wager Stefan, Walldeen Thomas, Wallen Anders, Wallentin Pontus, Wang Hai, Wang Helmersson Ke, WANG JIANFENG, Wang Yi-Pin Eric, Werner Karl, Wiberg Niclas, Wittenmark Emma, Yilmaz Osman Nuri Can, Zaidi Ali, Zhang Zhan, Zhang Zhang, Zheng Yanli
Принадлежит:

Methods and apparatus in a fifth-generation wireless communications network, including an example method, in a wireless device, that includes determining a reporting quality threshold for a parameter related to channel state information (CSI); performing a measurement for each of a plurality of beams from a first predetermined set of beams for evaluation; evaluating the measurement for each of the plurality of beams against the reporting quality threshold; discontinuing the performing and evaluating of measurements in response to determining that the reporting quality threshold is met for one of the beams, such that one or more beams in the first predetermined set of beams are not measured and evaluated; and reporting, to the wireless communications network, CSI for the one of the beams. 2. The method of claim 1 , wherein said determining is further based on a desired data rate.3. The method of claim 1 , wherein said determining is further based on a desired minimum bandwidth.4. The method of claim 1 , wherein the method further comprises:receiving a downlink signal comprising an uplink access configuration index;using the uplink access configuration index to identify an uplink access configuration from among a predetermined plurality of uplink access configurations; andtransmitting to the wireless communications network according to the identified uplink access configuration.5. The method of claim 1 , wherein the first numerology has a first subcarrier spacing and the second numerology has a second subcarrier spacing claim 1 , the first subcarrier spacing differing from the second subcarrier spacing.6. The method of claim 1 , wherein the first and second downlink subframes are received on the same carrier frequency.7. The method of claim 1 , wherein subframes of the first and second numerologies comprise first and second predetermined numbers of OFDM symbols claim 1 , respectively.8. The method of claim 1 , wherein at least one of the first and second numerologies ...

Подробнее
17-02-2022 дата публикации

CRC INTERLEAVING PATTERN FOR POLAR CODES

Номер: US20220052709A1
Принадлежит:

According to some embodiments, a method of operation of a wireless transmitter in a wireless communication network comprises: encoding a set of information carrying data bits u of length K with a linear outer code to generate a set of outer parity bits p along with the data bits u; interleaving the set of outer parity bits p and the data bits u using a predetermined interleaving mapping function that depends on the number of data bits K and is operable to distribute some bits of the set of parity bits p in front of some data bits u; and encoding the interleaved bits using a Polar encoder to generate a set of encoded bits x. Various interleaving mapping functions are disclosed. 1. A method of operation of a wireless transmitter in a wireless communication network , the method comprising:encoding a set of information carrying data bits u of length K with a linear outer code to generate a set of outer parity bits p along with the data bits u;interleaving the set of outer parity bits p and the data bits u using a predetermined interleaving mapping function that depends on the number of data bits K and is operable to distribute some bits of the set of parity bits p in front of some data bits u; andencoding the interleaved bits using a polar encoder to generate a set of encoded bits x.2. The method of claim 1 , further comprising transmitting the set of encoded bits x to a wireless receiver.5. The method of claim 3 , wherein Kis 53 and the template interleaver uses an interleaving pattern comprising any one of the following interleaving patterns claim 3 , wherein indices corresponding to cyclic redundancy check (CRC) bits are underlined:{'sub': 'T', 'u': [{'@style': 'single', '58'}, {'@style': 'single', '68'}, {'@style': 'single', '61'}, {'@style': 'single', '53'}, {'@style': 'single', '54'}, {'@style': 'single', '64'}, {'@style': 'single', '65'}, {'@style': 'single', '62'}, {'@style': 'single', '55'}, {'@style': 'single', '69'}, {'@style': 'single', '71'}, {'@style': ' ...

Подробнее
08-02-2018 дата публикации

FULL-DUPLEX POWER REPORTING

Номер: US20180041326A1
Принадлежит:

There is disclosed a method for operating a wireless device of a wireless communication network, the wireless device being capable of full-duplex communication, FD communication, on one or more carriers, FD carriers. The method comprises determining a power report indicating transmission power available to the wireless device for FD communication on one or more of the FD carriers and providing the power report to the wireless communication network. Moreover, there are disclosed corresponding and complementary methods and devices. 1. A method for operating a wireless device of a wireless communication network , the wireless device being capable of full-duplex communication , FD communication , on one or more carriers , FD carriers , the method comprising:determining a power report indicating transmission power available to the wireless device for FD communication on one or more of the FD carriers, wherein FD communication on a carrier comprises simultaneous transmission and reception on the carrier;providing the power report to the wireless communication network.2. The method according to claim 1 , wherein determining the power report is based on current scheduling or operation claim 1 , in particular pertaining to transmissions by the wireless device.3. The method according to claim 1 , wherein determining the power report is based on a self-interference suppression capability of the wireless device claim 1 , in particular for the one or more FD carriers of the wireless device.4. The method according to claim 1 , wherein determining the power report includes determining an indication of transmission power available to the wireless device for half-duplex communication on one or more carriers claim 1 , in particular on one or more FD carriers.5. A wireless device for a wireless communication network claim 1 , the wireless device being adapted for full-duplex communication claim 1 , FD communication claim 1 , on one or more carriers claim 1 , FD carriers claim 1 , the ...

Подробнее
18-02-2016 дата публикации

Aggregation-node selection using virtual hub

Номер: US20160050612A1
Принадлежит: Telefonaktiebolaget LM Ericsson AB

A route determination method is provided in a multi-hop network having a number of nodes, where at least two nodes are target nodes. The multi-hop network includes a fictitious node having fictitious links to at least two of the target nodes. The method includes determining, at least part of one or more extended routes for connecting one or more of the nodes included in the multi-hop network, to the fictitious node and determining, at least a part of a route in the multi-hop network, using the at least part of one or more extended routes. Other methods and devices are disclosed for route determination in a multi-hop network have several gateways or aggregation nodes for connecting to a communication network, and for routing in a multi-hop network.

Подробнее
16-02-2017 дата публикации

RATE-COMPATIBLE POLAR CODES

Номер: US20170047947A1
Принадлежит:

Systems and methods are disclosed herein relating to rate-compatible polar codes and the use thereof in a wireless communications system. In some embodiments, a transmit node operable for use in a wireless communications system comprises a rate-compatible polar encoder operable to encode information bits to provide coded bits utilizing parallel concatenated polar codes. The transmit node further comprises a transmitter operable to transmit the plurality of coded bits. In this manner, the transmit node may, in some embodiments, use polar codes having different coding rates to adapt to time-varying channel conditions. 1. A transmit node operable for use in a wireless communications system , comprising:a rate-compatible polar encoder operable to encode a plurality of information bits to provide a plurality of coded bits utilizing a plurality of parallel concatenated polar codes; anda transmitter operable to transmit the plurality of coded bits.2. The transmit node of wherein the rate-compatible polar encoder comprises: [{'sub': 1', '1', '1', '1, 'a first polar encoder operable to encode the plurality of information bits at a first code rate rto provide a number nof coded bits, where n=k/rand k is the number of information bits in the plurality of information bits; and'}, {'sub': 2', '2', '1', '2', '2', '1', '1', '2, 'a second polar encoder operable to encode a subset of the plurality of information bits at a second code rate rto provide a number nof coded bits, where r>rand the number nof coded bits is a number of coded bits that, when concatenated with the number nof coded bits, transforms a resulting code word from the first code rate rto the second code rate r;'}], 'a plurality of polar encoders operable to encode the plurality of information bits, the plurality of polar encoders comprising{'sub': desired', '1', 'desired, 'wherein the plurality of coded bits are provided at a desired code rate rand are a concatenation of coded bits output by polar encoders of the ...

Подробнее
01-03-2018 дата публикации

Terminal-Specific Cluster of Access Nodes for High Frequency Wireless Access

Номер: US20180063759A1
Принадлежит:

A wireless communication network includes an assistant serving access node () and a principal serving access node (). The principal serving access node () receives one or more measurement reports. The principal serving access node () communicates an assistance request to communicate one or more data packets. The assistant serving access node () buffers the one or more data packets before receiving the assistance request and communicates the one or more data packets to the user equipment (). 1. A wireless communication network comprising:an assistant serving access node; anda principal serving access node configured to:receive one or more measurement reports;determine, based on a strength of a connection between the user equipment and the principal serving access node, that the user equipment should communicate over a different connection;in response to the determination that the user equipment should communicate over the different connection and based on the one or more measurement reports, communicate, to the assistant serving access node, an assistance request to communicate one or more data packets to the user equipment; andwherein the assistant serving access node is configured to:buffer the one or more data packets of the plurality of data packets before receiving the assistance request from the principal serving access node; andin response to receiving the assistance request, communicate the one or more data packets to the user equipment.2. The wireless communication network of claim 1 , wherein:the principal serving access node is further configured to communicate a first request to the assistant serving access node based on a strength of a first connection between the assistant serving access node and the user equipment;the assistant serving access node is further configured to buffer the one or more data packets in response to receiving the first request.3. The wireless communication network of claim 1 , wherein:the principal serving access node is further ...

Подробнее
27-02-2020 дата публикации

INCREMENTAL REDUNDANCY AND VARIATIONS FOR POLAR CODES

Номер: US20200067529A1
Принадлежит: Telefonaktiebolaget lM Ericsson (publ)

Methods of transmitting blocks of incremental redundant coded bits are provided. Methods include concatenating, using an outer encoder, bits of an input bit vector to an outer encoded bit vector that has fewer bits than the input bit vector, wherein the outer encoded bit vector includes a mixture of information bits from the input bit vector. Methods include encoding the outer encoded bit vector into inner encoded data that is mapped to multiple data transmission channels that each include a channel reliability value. A first portion of the data transmission channels is used to transmit information bits corresponding to the outer encoded bit vector and a second portion of the data transmission channels is used to transmit frozen bits that include no information. 1. A method of transmitting blocks of incremental redundant coded bits comprising:concatenating, using an outer encoder, bits of an input bit vector to an outer encoded bit vector that has fewer bits than the input bit vector, wherein the outer encoded bit vector includes a mixture of information bits from the input bit vector; andencoding the outer encoded bit vector into inner encoded data that is mapped to a plurality of data transmission channels that each include a channel reliability value, wherein a first portion of the plurality of data transmission channels is used to transmit information bits corresponding to the outer encoded bit vector and a second portion of the plurality of data transmission channels is used to transmit frozen bits that include known values.2. The method of claim 1 , wherein encoding the outer encoded data comprises using a polar encoder that is operable to encode data for transmission using the plurality of data transmission channels claim 1 , wherein the polar encoder is configured to identify ones of the plurality of data transmission channels as the first portion of data transmission channels and other ones of the plurality of data transmission channels as the second ...

Подробнее
27-02-2020 дата публикации

Adaptive CRC Length for Beam Sweeping

Номер: US20200067640A1
Принадлежит:

According to some embodiments, a method for use in a wireless transmitter of adaptive cyclic redundancy check (CRC) length selection comprises: obtaining a system parameter related to a number of beam sweeps used by the wireless transmitter for transmitting a wireless signal; selecting a CRC length based on the obtained system parameter; selecting a CRC polynomial of the selected length; generating CRC bits from time-dependent or time-independent information bits using the CRC polynomial; concatenating the generated CRC bits with the time-dependent or time-independent information bits; encoding the concatenated bits; and transmitting the encoded bits to a wireless receiver. The system parameter may comprise: a carrier frequency; a number of transmit antenna elements; a number of receive antenna elements; a transmitter antenna azimuth configuration; a transmitter antenna elevation configuration; an antenna polarization type; a beam scanning algorithm; and a cell type. 1. A method for use in a wireless transmitter of adaptive cyclic redundancy check (CRC) length selection , the method comprising:{'sub': 'test', 'obtaining a system parameter related to a number of beam sweeps, L, used by the wireless transmitter for transmitting a wireless signal;'}selecting a CRC length based on the obtained system parameter;selecting a CRC polynomial of the selected length;generating CRC bits from time-dependent or time-independent information bits using the selected CRC polynomial;concatenating the generated CRC bits with the time-dependent or time-independent information bits;encoding the concatenated bits; andtransmitting the encoded bits to a wireless receiver.2. The method of claim 1 , wherein the obtained system parameter comprises at least one of:a carrier frequency;a number of transmit antenna elements;a number of receive antenna elements;a transmitter antenna azimuth configuration;a transmitter antenna elevation configuration;an antenna polarization type;a beam scanning ...

Подробнее
16-03-2017 дата публикации

SYSTEMS AND METHODS FOR BEAM SELECTION FOR HYBRID BEAMFORMING

Номер: US20170078004A1
Принадлежит:

Systems and methods of beam selection for hybrid beamforming are disclosed. Determining a select set of beam indices for use with transmissions to a receiver using hybrid precoding includes obtaining metrics for a first set of pairs of beam indices for use with the transmissions, where each pair includes a transmit beam index for a transmit antenna and a receive beam index for a receiver antenna. The method also includes selecting a first subset of the first set of pairs according to a first pruning decision, where the first subset includes at least one of the pairs. The method also includes processing only the first subset to determine the selected set of beam indices for use with the transmissions using hybrid precoding. In this way, a beam selection is made without the need to perform an exhaustive search of beams which is typically a time consuming process. 1. A method of determining a select set of beam indices for use with transmissions from a transmitter to a receiver using hybrid precoding , comprising:obtaining one or more metrics for a first plurality of pairs of beam indices for use with the transmissions from the transmitter to the receiver, where each pair of beam indices includes a transmit beam index for an antenna of the transmitter and a receive beam index for an antenna of the receiver;selecting a first subset of the first plurality of pairs of beam indices according to a first pruning decision, where the first subset includes at least one of the first plurality of pairs of beam indices; andprocessing only the first subset of the first plurality of pairs of beam indices to determine the selected set of beam indices for use with the transmissions from the transmitter to the receiver using hybrid precoding.2. The method of wherein processing only the first subset of the first plurality of pairs of beam indices to determine the selected set of beam indices for use with the transmissions from the transmitter to the receiver using hybrid precoding ...

Подробнее
24-03-2022 дата публикации

Polar Coding for Beam Sweeping Broadcast Channel

Номер: US20220095292A1
Принадлежит:

According to some embodiments, a method in a wireless transmitter comprises: obtaining a first set of bits (comprising a non-time-varying component) for wireless transmission; concatenating a second set of bits (comprising a time-varying component (e.g., beam identifier)) to the first set of bits; encoding the concatenated first and second set of bits using a channel code; and transmitting the encoded bits to a wireless receiver. In some embodiments, transmitting the encoded bits to the wireless receiver comprises transmitting a first beam. The method may further comprise: concatenating a third set of bits (comprising a time-varying component (e.g., beam identifier)) to the first set of wireless bits; encoding the concatenated first and third set of bits using a channel code; and transmitting the encoded bits to a wireless receiver using a second beam. 1. A method in a wireless transmitter , the method comprising:obtaining a first set of bits for wireless transmission, the first set of bits comprising a non-time-varying component;concatenating a second set of bits to the first set of bits, the second set of bits comprising a time-varying component;encoding the concatenated first and second set of bits using a channel code; andtransmitting the encoded bits to a wireless receiver.214.-. (canceled)15. A wireless transmitter comprising processing circuitry operable to:obtain a first set of bits for wireless transmission, the first set of bits comprising a non-time-varying component;concatenate a second set of bits to the first set of bits, the second set of bits comprising a time-varying component;encode the concatenated first and second set of bits using a channel code; andtransmit the encoded bits to a wireless receiver.16. The wireless transmitter of claim 15 , wherein the time varying-component of the second set of bits is associated with a transmit beam.17. The wireless transmitter of claim 15 , the processing circuitry further operable to:determine cyclic ...

Подробнее
12-06-2014 дата публикации

Methods and Devices for Transmission of Signals in a Telecommunication System

Номер: US20140161030A1
Автор: Dennis Hui, Miguel Lopez
Принадлежит: Telefonaktiebolaget LM Ericsson AB

Methods and devices for generating training symbols to be transmitted in a radio network are provided for a radio system where multiple users are sharing the same transmission slot. The method involves forming a sequence of training symbols by repeating an initial block of training symbols and for each user rotating the repeated block by a user specific rotation angle. A rotated block is periodically extended in both ends.

Подробнее
18-03-2021 дата публикации

SCHEDULING-RELATED DMRS FOR MMW RAN

Номер: US20210083823A1
Принадлежит:

There is disclosed a method of operating a transmitting node in a millimeter-wave communication network. The method comprises transmitting communication signaling in a transmission timing structure, the communication signaling comprising control signaling and data signaling, the communication signaling further comprising reference signaling common to the control signaling and data signaling. 1. A method of operating a transmitting node in a millimeter-wave communication network , the method comprising:transmitting millimeter-wave, mmW, signaling in a transmission timing structure, the timing structure comprising a plurality of consecutive time intervals;the mmW signaling comprising a plurality of signaling blocks, each signaling block being transmitted in a different time interval of the transmission timing structure; andthe mmW signaling comprises an intermediate common reference signaling block between a first signaling block and a second signaling block of the signaling blocks if the first and second signaling blocks are intended for the same target.2. The method according to claim 1 , wherein at least one of the millimeter-wave signaling and transmitting timing structure has a single carrier waveform.3. The method according to claim 1 , wherein at least one of:the first signaling block at least one of corresponds to and carries control signaling; and control signaling; and', 'data signaling., 'the second signaling block at least one of corresponds to and carries one of4. The method according to claim 1 , wherein the intermediate common reference signaling is Demodulation Reference Signaling claim 1 , DMRS.5. The method according to claim 1 , wherein the transmission timing structure corresponds to a symbol time interval.6. The method according to claim 1 , wherein the mmW signaling does not comprise an intermediate common reference signaling block if the first and second signaling blocks are not intended for the same target.7. The method according to claim 6 , ...

Подробнее
30-03-2017 дата публикации

Variable synchronization block format

Номер: US20170094624A1
Принадлежит: Telefonaktiebolaget LM Ericsson AB

An access node, AN, may be configured to communicate wirelessly with a wireless device (WD). The AN can transmit a first synchronization signal block having a first format. The AN can also transmit a second synchronization signal block of a second format, the first synchronization signal block including a first format different from the format of the second synchronization signal block. The first synchronization signal block can include an extended primary synchronization signal block that can be used to synchronize disadvantaged user equipment (e.g., user equipment experiencing low signal-to-noise ratio).

Подробнее
30-03-2017 дата публикации

Random Access Preamble for Minimizing PA Backoff

Номер: US20170094689A1
Принадлежит:

An example method in a user equipment comprises generating a random access preamble signal and transmitting the random access preamble signal. This generating of the random access preamble signal comprises generating a Single-Carrier Frequency-Division Multiple Access (SC-FDMA) random access preamble signal comprising two or more consecutive preamble symbol groups, each preamble symbol group comprising a cyclic prefix portion and a plurality of identical symbols occupying a single subcarrier of the SC-FDMA random access preamble signal. The single subcarrier for at least one of the preamble symbol groups corresponds to a first subcarrier frequency and the single subcarrier for an immediately subsequent one of the preamble symbol groups corresponds to a second subcarrier frequency. 1. A method , in a user equipment , the method comprising:generating a Single-Carrier Frequency-Division Multiple Access (SC-FDMA) random access preamble signal comprising two or more consecutive preamble symbol groups, each preamble symbol group comprising a cyclic prefix portion and a plurality of identical symbols occupying a single subcarrier of the SC-FDMA random access preamble signal, such that the single subcarrier for at least one of the preamble symbol groups corresponds to a first subcarrier frequency and the single subcarrier for an immediately subsequent one of the preamble symbol groups corresponds to a second subcarrier frequency; andtransmitting the SC-FDMA random access preamble signal.2. The method of claim 1 , wherein the second subcarrier frequency is adjacent to the first subcarrier frequency.3. The method of claim 1 , wherein phase continuity exists at the boundary between the at least one of the preamble symbol groups and the immediately subsequent one of the preamble symbol groups.4. The method of claim 1 , wherein all of the preamble symbol groups in the SC-FDMA random access preamble signal have the same complex amplitude.5. The method of claim 1 , wherein the ...

Подробнее
06-04-2017 дата публикации

A TRANSMITTER, A RECEIVER, AND METHODS THEREIN

Номер: US20170099170A1
Автор: Hui Dennis, Lopez Miguel
Принадлежит: Telefonaktiebolaget lM Ericsson (publ)

A transmitter and a method therein for transmitting CPM signals to a receiver. The transmitter divides bits into first and second bit sequences; obtains third and fourth bit sequences by appending bits to the first and second bit sequences. First and second intermediate sequences are generated based on the third and fourth bit sequences. The transmitter time-reverses the first and second intermediate sequences. The time-reversed first sequence is mapped to a third intermediate sequence, and the time-reversed second sequence is mapped to a fourth intermediate sequence. The transmitter generates fifth and sixth bit sequences from the third and fourth intermediate sequences. First and second CPM signals corresponding to first and second CPM bursts are created, which first burst is based on the third and sixth bit sequences, and which second burst is based on the fourth and fifth bit sequences. CPM signals are transmitted through a respective antenna. 1. A method in a transmitter for transmitting CPM signals to a receiver , wherein the transmitter and the receiver are comprised in a wireless communications network , and wherein the method comprises:dividing a sequence of user code bits into a first bit sequence and a second bit sequence, wherein the first and second bit sequences are of equal length;obtaining a third bit sequence by appending one or more tail bits to the first bit sequence, and a fourth bit sequence by appending one or more tail bits to the second bit sequence;generating a first intermediate sequence based on the third bit sequence, and a second intermediate sequence based on the fourth bit sequence, wherein the first intermediate sequence corresponds to a first set of pseudo-symbols and wherein the second intermediate sequence corresponds to a second set of pseudo-symbols;time reversing the first intermediate sequence and the second intermediate sequence;mapping the time-reversed first intermediate sequence to a third intermediate sequence ...

Подробнее
28-03-2019 дата публикации

Random Access Preamble for Minimizing PA Backoff

Номер: US20190098671A1
Принадлежит:

An example method in a user equipment comprises generating a random access preamble signal and transmitting the random access preamble signal. This generating of the random access preamble signal comprises generating a random access preamble signal comprising two or more consecutive preamble symbol groups, each preamble symbol group comprising a cyclic prefix portion and a plurality of identical symbols occupying a single subcarrier of the random access preamble signal. The single subcarrier for at least one of the preamble symbol groups corresponds to a first subcarrier frequency and the single subcarrier for an immediately subsequent one of the preamble symbol groups corresponds to a second subcarrier frequency. 125-. (canceled)26. A method , in a user equipment , the method comprising:generating a Single-Carrier Frequency-Division Multiple Access (SC-FDMA) random access preamble signal comprising consecutive preamble symbol groups, each preamble symbol group comprising a cyclic prefix portion and a plurality of identical symbols, every second one of the preamble symbol groups corresponding to a second subcarrier frequency and each of the remaining preamble symbol groups corresponding to a first subcarrier frequency; andtransmitting the SC-FDMA random access preamble signal.27. The method of claim 26 , wherein the second subcarrier frequency is adjacent to the first subcarrier frequency.28. The method of claim 26 , wherein phase continuity exists at the boundary between the at least one of the preamble symbol groups and the immediately subsequent one of the preamble symbol groups.29. The method of claim 26 , wherein all of the preamble symbol groups in the SC-FDMA random access preamble signal have the same complex amplitude.30. The method of claim 26 , wherein the length of the cyclic prefix portion is the same as the length of each of the identical symbols claim 26 , and the cyclic prefix portion is identical to each of the identical symbols.31. The method of ...

Подробнее
30-04-2015 дата публикации

Transmitter for Transmitting Discovery Signals, A Receiver and Methods Therein

Номер: US20150117435A1
Принадлежит:

A transmitter and a method therein for transmitting discovery signals to a receiver . The transmitter and the receiver arc comprised in a radio communications system . The transmitter transmits two or more discovery signals over two or more directions, wherein the each discovery signal is configured to span over a fraction of a carrier bandwidth. 130-. (canceled)31. A method , in a transmitter , for transmitting discovery signals to a receiver , wherein the transmitter and the receiver are comprised in a radio communications system , the method comprising:transmitting two or more discovery signals over two or more directions;wherein each discovery signal is configured to span over a fraction of a carrier bandwidth.32. The method of claim 31 , wherein transmitting the two or more discovery signals comprises transmitting the two or more discovery signals in a single symbol.33. The method of claim 32 , wherein transmitting the two or more discovery signals further comprises:multiplexing, in the frequency-domain, a plurality of discovery signals for a plurality of directions; andtransmitting the multiplexed plurality of discovery signals in the single symbol.34. The method of claim 31 , wherein transmitting the two or more discovery signals comprises transmitting the two or more discovery signals in two or more symbols.35. The method of claim 34 , wherein transmitting the two or more discovery signals further comprises:multiplexing, in the frequency-domain, a plurality of discovery signals for a plurality of directions; andtransmitting the multiplexed plurality of discovery signals in the two or more symbols.36. The method of claim 31 , wherein transmitting the two or more discovery signals comprises transmitting the two or more discovery signals together with information relating to at least one of:information indicating a beam direction;information indicating a frequency offset to a carrier center; andinformation indicating the transmitter.37. The method of claim 31 , ...

Подробнее
24-07-2014 дата публикации

METHOD OF DOWNLINK SIGNAL TRANSPORT OVER BACKHAUL COMMUNICATIONS THROUGH DISTRIBUTED PROCESSING

Номер: US20140204896A1
Принадлежит:

The amount of multi-antenna signals to be transmitted over the backhaul in a Coordinated MultiPoint (CoMP) system from the central processor (CP) to each base station is reduced. Embodiments of the present invention exploit characteristics of the underlying signal structure, and distribute some baseband processing functionalities—such as channel coding and the application of the multi-user precoding—from the CP to the remote base stations. Additionally, in some embodiments the non-precoded parts of multi-antenna signals are broadcast from the CP to all base stations in the CoMP system, to further reduce the burden on backhaul communications. In one embodiment, the backhaul network is a Gigabit-capable Passive Optical Network (GPON). 110-. (canceled)11. A method of transmitting signals to user equipment (UE) in a cell of a Coordinated Multipoint (CoMP) wireless communication system , comprising the steps of:receiving, from a Central Processor (CP), information about a precoding matrix and the information bits to be transmitted to all UEs in the CoMP system;applying a modulation and coding scheme (MCS) to the information bit to generate modulated symbols;applying precoding weights from the precoding matrix to the modulated symbols to generate precoded symbols; andtransmitting the precoded symbols to UEs in the cell.12. The method of wherein the step of receiving claim 11 , from a CP claim 11 , information about a precoding matrix comprises receiving claim 11 , from the CP claim 11 , an index into a precoding matrix codebook; and further comprising using the received index to retrieve a precoding matrix from the precoding matrix codebook.13. The method of wherein the step of receiving claim 11 , from a CP claim 11 , information about a precoding matrix comprises receiving claim 11 , from the CP claim 11 , a precoding matrix computed at the CP.14. The method of further comprising the step of receiving claim 11 , from the CP claim 11 , the MCS to apply to the information ...

Подробнее
05-05-2016 дата публикации

EFFICIENT BEAM SCANNING FOR HIGH-FREQUENCY WIRELESS NETWORKS

Номер: US20160127919A1
Принадлежит:

Systems and methods relating to non-adaptive beam scanning in a wireless network are disclosed. In some embodiments, a method of operation of a transmit node to perform non-adaptive beam scanning for transmit beam patterns of the transmit node that partition a service coverage area of the transmit node into transmit partition cells is provided. The method transmitting a known signal using each of multiple scanning beam patterns for each of multiple beam scanning stages over non-overlapping radio resource slots. The scanning beam patterns for the beam scanning stages are such that each unique combination of scanning beam patterns consisting of one scanning beam pattern from each of the beam scanning stages corresponds to a different transmit beam pattern of the transmit node. This multi-stage beam scanning approach provides an exponentially more efficient process for beam scanning than the conventional Sequential Beam Sweeping (SBS) approach. 1. A method of operation of a transmit node to perform non-adaptive beam scanning for a plurality of transmit beam patterns of the transmit node that partition a service coverage area of the transmit node into a plurality of transmit partition cells , comprising:transmitting a known signal using each of a plurality of scanning beam patterns for each of a plurality of beam scanning stages over non-overlapping radio resource slots;wherein the plurality of scanning beam patterns for the plurality of beam scanning stages are such that each unique combination of scanning beam patterns consisting of one scanning beam pattern from each of the plurality of beam scanning stages corresponds to a different transmit beam pattern of the plurality of transmit beam patterns of the transmit node.2. The method of wherein:for each beam scanning stage of the plurality of beam scanning stages, the plurality of scanning beam patterns for the beam scanning stage partition the service coverage area of the transmit node into a set of scanning partition ...

Подробнее
14-05-2015 дата публикации

REDUCED-SIZE MESSAGE PASS IN FACTOR GRAPHS FOR WIRELESS COMMUNICATIONS NETWORKS

Номер: US20150131524A1
Принадлежит: TELEFONAKTIEBOLAGET L M ERICSSON (PUBL)

Systems and methods are disclosed for graph-based distributed parameter coordination in a communications network. In general, discrete local parameters to be coordinated among communication nodes in the communications network and their respective performance metrics, or costs, are modeled using a factor graph. Based on the factor graph, a variant of a sum-product algorithm, namely the min-sum algorithm, is applied in order for the communication nodes, through iterative message passing of reduced size messages with their neighboring communication nodes, to decide upon optimal values for the local parameters for the communication nodes that collectively optimize a global performance metric across the communications network. In one embodiment, the communications network is a wireless communications network. In one specific embodiment, the wireless communications network is a cellular communications network. 1. A method of operation of a communication node in a communications network , comprising:iteratively exchanging reduced size messages with a plurality of neighboring communication nodes in the communications network based on a factor graph until one or more predefined stopping criteria are satisfied, the factor graph modeling discrete local parameters to be coordinated among communication nodes in the communications network and corresponding local performance metrics of the communication nodes; andcomputing an optimal value for the local parameter of the communication node based on results of iteratively exchanging the reduced size messages with the plurality of neighboring communication nodes.2. The method of wherein each reduced size message is a reduced size version of a corresponding message claim 1 , and each reduced size message comprises one or more values but less than all values from the corresponding message.3. The method of wherein computing the optimal value for the local parameter of the communication node comprises computing the optimal value for the ...

Подробнее
16-04-2020 дата публикации

Network Architecture, Methods, and Devices for a Wireless Communications Network

Номер: US20200120482A1
Автор: Abrahamsson Richard, Aktas Ismet, ALRIKSSON Peter, ANSARI Junaid, Ashraf Shehzad Ali, Asplund Henrik, Athley Fredrik, Axelsson Håkan, Axmon Joakim, AXNÄS Johan, Balachandran Kumar, Baldemair Robert, Bark Gunnar, BERG Jan-Erik, Bergstrom Andreas, Björkegren Håkan, Brahmi Nadia, Capar Cagatay, Carlsson Anders, Cedergren Andreas, Coldrey Mikael, da Silva Icaro L. J., Dahlman Erik, El Essaili Ali, Engström Ulrika, Ericson Márten, Eriksson Erik, Fallgren Mikael, Fan Rui, Fodor Gabor, Frenger Pål, Fridén Jonas, Fröberg Olsson Jonas, Furuskär Anders, Furuskog Johan, GARCIA Virgile, GATTAMI Ather, Gunnarsson Fredrik, GUSTAVSSON Ulf, Hagerman Bo, HARRYSSON Fredrik, He Ning, Hessler Martin, Hiltunen Kimmo, Hong Songnam, Hui Dennis, Huschke Jörg, Irnich Tim, Jacobsson Sven, JALDÉN Niklas, JÄRMYR Simon, Jiang Zhiyuan, Johansson Martin, Johansson Niklas, KANG Du Ho, Karipidis Eleftherios, Karlsson Patrik, Khayrallah Ali S., Kilinc Caner, KLANG Göran N., Kronander Jonas, Landström Sara, Larsson Christina, LI Gen, Lindbom Lars, LINDGREN Robert, Lindoff Bengt, Lindqvist Fredrik, Liu Jinhua, Lohmar Thorsten, Lu Qianxi, Manholm Lars, Maric Ivana, Medbo Jonas, Miao Qingyu, Mildh Gunnar, Moosavi Reza, Müller Walter, Myhre Elena, Norrman Karl, Olsson Bengt-Erik, Palenius Torgny, Parkvall Stefan, Peisa Janne, PETERSSON Sven, Pradas Jose Luis, Prytz Mikael, Queseth Olav, Ramachandra Pradeepa, Ramos Edgar, Reial Andres, RIMHAGEN Thomas, Ringh Emil, Rugeland Patrik, Rune Johan, Sachs Joachim, Sahlin Henrik, Saxena Vidit, SEIFI Nima, Selén Yngve, Semaan Eliane, SHARMA SACHIN, Shi Cong, Sköld Johan, Stattin Magnus, Stjernman Anders, Sundman Dennis, Sundström Lars, Tercero Vargas Miurel Isabel, Tidestav Claes, Tombaz Sibel, Torsner Johan, Tullberg Hugo, Vikberg Jari, Von Wrycza Peter, Wager Stefan, Walldeen Thomas, Wallentin Pontus, Wang Hai, Wang Helmersson Ke, WANG JIANFENG, Wang Yi-Pin Eric, Werner Karl, Wiberg Niclas, Wittenmark Emma, Yilmaz Osman Nuri Can, Zaidi Ali, Zhang Zhan, Zhang Zhang, Zheng Yanli
Принадлежит:

Methods and apparatus in a fifth-generation wireless communications, including an example method, in a wireless device, that includes receiving a downlink signal comprising an uplink access configuration index, using the uplink access configuration index to identify an uplink access configuration from among a predetermined plurality of uplink access configurations, and transmitting to the wireless communications network according to the identified uplink access configuration. The example method further includes, in the same wireless device, receiving, in a first subframe, a first Orthogonal Frequency-Division Multiplexing (OFDM) transmission formatted according to a first numerology and receiving, in a second subframe, a second OFDM transmission formatted according to a second numerology, the second numerology differing from the first numerology. Variants of this method, corresponding apparatuses, and corresponding network-side methods and apparatuses are also disclosed. 1. A wireless communications network , the wireless communications network comprising: processing circuitry configured to process received first user data and provide second user data, and', radio-frequency circuitry, and', receive information indicating a plurality of uplink access configurations, each uplink access configuration including a random access configuration;', 'receive an uplink access configuration index, using the uplink access configuration index to identify an uplink access configuration from among the indicated plurality of uplink access configurations, and transmit a message to the wireless communications network according to the identified uplink access configuration; and', 'subsequently transmit the first user data; and', 'receive in response to the transmitted message a first Orthogonal Frequency-Division Multiplexing (OFDM) transmission formatted according to a first numerology and receive a second OFDM transmission formatted according to a second numerology and carrying the ...

Подробнее
07-08-2014 дата публикации

Channel estimation for a very large-scale multiple-input multiple-output (mimo) system

Номер: US20140219377A1
Принадлежит: Telefonaktiebolaget LM Ericsson AB

A transmitter, receiver, and method for channel estimation for a Multiple-Input Multiple-Output (MIMO) communication system in which the transmitter includes a multiplicity of transmit antennas spaced such that spacing between adjacent antennas provides a spatial correlation coefficient greater than a threshold level. The transmitter selects a subset of the multiplicity of transmit antennas for transmitting the pilot reference signals. The pilot reference signals are transmitted only from the selected subset of transmit antennas to the receiver. The receiver includes a channel estimator configured to derive a channel estimation for all of the multiplicity of transmit antennas using the received pilot reference signals and known or estimated spatial correlation among the multiplicity of transmit antennas.

Подробнее
03-06-2021 дата публикации

EVM FOR PULSE-SHAPED SIGNALING FOR HIGH FREQUENCY RADIO NETWORKS

Номер: US20210167904A1
Принадлежит:

There is disclosed a method of operating a radio node in a wireless communication network. The method includes transmitting pulse-shaped signaling based on a pulse-shaped waveform using a transmission power, the transmission power being based on an Error Vector Magnitude (EVM) parametrisation for pulse-shaped signaling. The disclosure also pertains to related devices and methods. 1. A method of operating a radio node in a wireless communication network , the method comprising:generating pulse-shaped signaling, the pulse-shaped signaling being pulse-shaped based on periodically extending a frequency distribution of modulation symbols over a first number of subcarriers to a larger, second number of subcarriers, a subset of the first number of subcarriers from one end of the frequency distribution being appended at the other end of the first number of subcarriers; andtransmitting the pulse-shaped signaling using a transmission power, the transmission power being based on an Error Vector Magnitude (EVM) parameterization for pulse-shaped signaling.2. A radio node for a wireless communication network , the radio node being configured to:generate pulse-shaped signaling, the pulse-shaped signaling being pulse-shaped based on periodically extending a frequency distribution of modulation symbols over a first number of subcarriers to a larger, second number of subcarriers, a subset of the first number of subcarriers from one end of the frequency distribution being appended at the other end of the first number of subcarriers; andtransmit the pulse-shaped signaling using a transmission power, the transmission power being based on an Error Vector Magnitude (EVM) parameterization for pulse-shaped signaling.3. A method of testing a radio node for a wireless communication network , the method comprising:determining an Error Vector Magnitude (EVM) representation for pulse-shaped signaling transmitted by the radio node based on an EVM parameterization for pulse-shaped signaling, the ...

Подробнее
03-06-2021 дата публикации

PULSE-SHAPING FOR HIGH FREQUENCY RADIO NETWORKS

Номер: US20210167997A1
Принадлежит:

There is disclosed a method of operating a radio node in a wireless communication network. The method includes communicating utilising signaling, wherein communicating utilising signaling is based on performing pulse-shaping pertaining to the signaling. The disclosure also pertains to related devices and methods. 1. A method of operating a radio node in a wireless communication network , the method comprising communicating utilising signaling , the communicating utilising signaling being based on performing pulse-shaping pertaining to the signaling; andthe pulse shaping being performed based on periodically extending a frequency distribution of modulation symbols over a first number of subcarriers to a larger, second number of subcarriers, wherein a subset of the first number of subcarriers from one end of the frequency distribution is appended at the other end of the first number of subcarriers.2. A radio node for a wireless communication network , the radio node being configured to communicate utilising signaling , the communicating utilising signaling being based on performing pulse-shaping pertaining to the signaling; andthe pulse shaping being performed based on periodically extending a frequency distribution of modulation symbols over a first number of subcarriers to a larger, second number of subcarriers, wherein a subset of the first number of subcarriers from one end of the frequency distribution is appended at the other end of the first number of subcarriers.3. The method according to claim 1 , wherein performing pulse-shaping corresponds to performing pulse-shaping based on an input representing modulation symbols distributed over a first frequency range.4. The method according to claim 1 , wherein performing pulse-shaping corresponds to performing pulse-shaping based on a periodic expansion in frequency domain.5. The method according to claim 1 , wherein the pulse-shaping is performed based on a modulation of the signaling and/or an indication indicating ...

Подробнее
03-06-2021 дата публикации

PULSE-SHAPING SIGNALING FOR HIGH FREQUENCY RADIO NETWORKS

Номер: US20210167998A1
Принадлежит:

There is disclosed a method of operating a radio node in a wireless communication network. The method includes communicating utilising signaling, wherein communicating utilising signaling is based on performing pulse-shaping pertaining to the signaling, wherein pulse-shaping is based on a pulse-shaping indication. The disclosure also pertains to related devices and methods. 1. A method of operating a radio node in a wireless communication network , the method comprising:communicating utilising signaling, the communicating utilising signaling being based on performing pulse-shaping pertaining to the signaling, the pulse-shaping pertaining to the signaling being based on a pulse-shaping indication, the pulse shaping indication comprising a signaling characteristic of a control channel being used for communications utilising signaling between the radio node and at least one of a wireless device and a second node.2. A radio node for a wireless communication network , the radio node being configured to communicate utilising signaling , the communicating utilising signaling being based on performing pulse-shaping pertaining to the signaling , the pulse-shaping pertaining to the signaling being based on a pulse-shaping indication , the pulse shaping indication comprising a signaling characteristic of a control channel being used for communications utilising signaling between the radio node and at least one of a wireless device and a second node.3. The method according to claim 1 , wherein the pulse-shaping indication is transmitted by a network node.4. The method according to claim 1 , wherein the pulse-shaping indication is transmitted with control signaling claim 1 , the control signaling including at least one of physical layer signaling and higher layer signaling.5. The method according to claim 1 , wherein the pulse-shaping indication is transmitted with control signaling indexing a table configured to the radio node.6. The method according to claim 1 , wherein the ...

Подробнее
28-05-2015 дата публикации

DISTRIBUTED ROUTING IN WIRELESS NETWORKS

Номер: US20150146655A1
Принадлежит:

Systems and methods related to distributed route determination through a multi-hop wireless network based on multiple route metrics or properties are disclosed. In some embodiments, a method of operation of a network node comprises identifying a subset of neighbors of the network node in a wireless network based on: (a) link weight(s) for links from the network node to at least some of the neighbors of the network node with respect to route metric(s) and (b) defined limit(s) for the route metric(s). The method further comprises obtaining second link weights for the links from the network node to at least the subset of the neighbors with respect to a second route metric, and identifying from the subset of the neighbors, an optimal next hop neighbor for the network node. In this manner, multiple route metrics are taken into consideration in manner that is computationally efficient. 1. A method of operation of a network node in a wireless network to provide distributed multi-hop route determination , comprising:identifying, by the network node, a subset of a plurality of neighbors of the network node in the wireless network based on: (a) link weights for links from the network node to at least some of the plurality of neighbors of the network node with respect to one or more route metrics for a multi-hop route through the wireless network and (b) one or more defined limits for the one or more route metrics;obtaining, by the network node, second link weights for the links from the network node to at least the subset of the plurality of neighbors with respect to a second route metric for a multi-hop route through the wireless network; andidentifying, by the network node, from the subset of the plurality of neighbors, an optimal next hop neighbor for the network node in a multi-hop route through the wireless network based on the second link weights for the links from the network node to at least the subset of the plurality of neighbors with respect to the second route ...

Подробнее
17-05-2018 дата публикации

Energy-Efficient Multi-Hop Communication Schemes for Wireless Networks

Номер: US20180139680A1
Принадлежит:

A method in a node is disclosed. The method comprises determining () a first route from a first source node ( A) to a destination (), the first route comprising one or more relay nodes (). The method comprises determining () an energy-harvesting routing metric, the energy-harvesting routing metric for use in determining a second route from a second source node (B) to the destination (). The method comprises determining () the second route from the second source node (B) to the destination (), the determined second route comprising one or more relay nodes () selected to maximize the determined energy-harvesting routing metric. 1. A method in a node , comprising:determining a first route from a first source node to a destination, the first route comprising one or more relay nodes;determining an energy-harvesting routing metric, the energy-harvesting routing metric for use in determining a second route from a second source node to the destination; anddetermining the second route from the second source node to the destination, the determined second route comprising one or more relay nodes selected to maximize the determined energy-harvesting routing metric.2. The method of claim 1 , wherein the determined first route comprises a route having a shortest number of hops between the first source node and the destination.3. The method of claim 1 , wherein determining the second route from the second source node to the destination comprises:determining one or more first candidate relay nodes, the first candidate relay nodes located within a communication range of the second source node;determining which of the one or more first candidate relay nodes maximizes the energy-harvesting routing metric, wherein the determination of which of the one or more first candidate relay nodes maximizes the energy-harvesting routing metric is based on energy-harvesting routing metrics of the first source node, the second source node, and a first relay node of the first route; andselecting a ...

Подробнее
09-05-2019 дата публикации

METHOD AND APPARATUS FOR CONFIGURING A CLUSTER

Номер: US20190140790A1
Принадлежит:

A method for configuring a cluster for a terminal device in a wireless network. The method is performed at a network node, such as a base station or a radio network controller. The terminal device can establish at least two concurrent connections to at least one network node in the cluster. The method comprises dynamically adjusting a configuration of the cluster and informing the terminal device of the adjusted configuration so that connectivity of the terminal device in the cluster is adapted to the adjusted configuration. Correspondingly, there is also provided an apparatus embodied at or as at least part of the network node. 1. A method at a network node for configuring a cluster for a terminal device in a wireless network , wherein the terminal device establishes at least two concurrent connections to at least one network node in the cluster , the method comprising:dynamically adjusting a configuration of the cluster at least based on a service type for the terminal device; andinforming the terminal device of the adjusted configuration so that connectivity of the terminal device in the cluster is adapted to the adjusted configuration.2. The method according to claim 1 , wherein dynamically adjusting the configuration of the cluster further comprises adjusting at least one of the following:one or more of a set of parameters for adding or removing a connection into or from the cluster;a number of concurrent connections;one or more of a set of parameters for switching between the concurrent connections for transmission; andone or more of a set of parameters for cluster head re-allocation.3. The method according to claim 1 , wherein dynamically adjusting the configuration of the cluster is further based on at least one of the following:a traffic load of the at least one network node; anddeployment of the wireless network.4. The method according to claim 3 , wherein the traffic load is indicated by at least one of the following:a number of active terminal devices ...

Подробнее
10-06-2021 дата публикации

Polar Coding for Beam Sweeping Broadcast Channel

Номер: US20210176739A1
Принадлежит:

According to some embodiments, a method in a wireless transmitter comprises: obtaining a first set of bits (comprising a non-time-varying component) for wireless transmission; concatenating a second set of bits (comprising a time-varying component (e.g., beam identifier)) to the first set of bits; encoding the concatenated first and second set of bits using a channel code; and transmitting the encoded bits to a wireless receiver. In some embodiments, transmitting the encoded bits to the wireless receiver comprises transmitting a first beam. The method may further comprise: concatenating a third set of bits (comprising a time-varying component (e.g., beam identifier)) to the first set of wireless bits; encoding the concatenated first and third set of bits using a channel code; and transmitting the encoded bits to a wireless receiver using a second beam. 1. A method in a wireless transmitter , the method comprising:obtaining a first set of bits for wireless transmission, the first set of bits comprising a non-time-varying component;concatenating a second set of bits to the first set of bits, the second set of bits comprising a time-varying component;encoding the concatenated first and second set of bits using a channel code; andtransmitting the encoded bits to a wireless receiver.214.-. (canceled)15. A wireless transmitter comprising processing circuitry operable to:obtain a first set of bits for wireless transmission, the first set of bits comprising a non-time-varying component;concatenate a second set of bits to the first set of bits, the second set of bits comprising a time-varying component;encode the concatenated first and second set of bits using a channel code; andtransmit the encoded bits to a wireless receiver.16. The wireless transmitter of claim 15 , wherein the time varying-component of the second set of bits is associated with a transmit beam.17. The wireless transmitter of claim 15 , the processing circuitry further operable to:determine cyclic ...

Подробнее
16-05-2019 дата публикации

CIRCULAR BUFFER RATE MATCHING FOR POLAR CODES

Номер: US20190149176A1
Принадлежит:

Methods are proposed herein to perform rate matching for polar codes via circular buffering of the polar encoded bits. Embodiments are directed to methods of operation of a transmitting node in a wireless system including performing polar encoding of a set of information bits in accordance with a polar sequence of length Nto thereby generate Ncoded bits. The method can further include interleaving the coded bits to thereby provide an interleaved coded bit sequence, and storing the interleaved coded bit sequence into a circular buffer of length N. According to certain embodiments, the method can further include extracting N coded bits for transmission from the circular buffer. N can be greater than, equal to, or less than N. 1. A method of operation of a transmitting node in a wireless system , comprising:{'sub': B', 'B, 'performing polar encoding of a set of K information bits in accordance with a polar sequence of length Nto thereby generate Ncoded bits;'}interleaving the coded bits to thereby provide an interleaved coded bit sequence;{'sub': 'B', 'storing the interleaved coded bit sequence into a circular buffer of length N; and'}extracting N coded bits for transmission from the circular buffer.2. The method of wherein N>=N claim 1 , and (N−N) coded bits are repeated.3. The method of wherein N<=N claim 1 , and no coded bits are repeated.4. The method of wherein interleaving the coded bits comprises adaptively interleaving the coded bits based on one or more link parameters and/or one or more system parameters.5. The method of claim 1 , wherein extracting the N coded bits from the circular buffer comprises adaptively extracting the N coded bits from the circular buffer consecutively according to a sequence of the code bit claim 1 , where the sequence specifies the order the coded bits are written into the circular buffer.6. The method of wherein extracting the N coded bits from the circular buffer comprises adaptively extracting the N coded bits from the circular ...

Подробнее
23-05-2019 дата публикации

Adaptation of the CRC Code Length for 3GPP NR

Номер: US20190158219A1
Принадлежит:

The application relates to the adaption of the length of the cyclic redundancy check (CRC) code in the context of 3GPP NR. In 3GPP NR, the length of the uplink and downlink control information (UCI, DCI) significantly varies. Therefore, it is necessary to select a CRC code of appropriate size or length. Accordingly, a method () for use in a wireless transmitter comprises: determining an amount of data to transmit (), determining a cyclic redundancy check (CRC) polynomial length based on the amount of data to transmit (); encoding the data using a CRC of the determined polynomial length (); and transmitting the encoded data (). The data to transmit may not only comprise control channel data but also user data and may be encoded with a Polar code or a low-density parity check (LPDC) code. 1. A method for use in a wireless transmitter , the method comprising:determining an amount of data to transmit;determining a cyclic redundancy check (CRC) polynomial length based on the amount of data to transmit;encoding the data using a CRC of the determined polynomial length; andtransmitting the encoded data.2. The method of claim 1 , wherein determining the CRC polynomial length based on the amount of data to transmit comprises:when the determined amount of data to transmit is less than or equal to a threshold number of bits, determining a first CRC polynomial length; andwhen the determined amount of data to transmit is greater than the threshold number of bits, determining a second CRC polynomial length.34.-. (canceled)5. The method of claim 1 , wherein encoding the data using the CRC of the determined polynomial length comprises encoding the data using a Polar code.6. The method of claim 2 , wherein the threshold number of bits is 19 bits claim 2 , the first CRC polynomial length is 6 claim 2 , and the second CRC polynomial length is 11.7. The method of claim 6 , wherein a portion of the CRC polynomial length is used for error correction (L) and another portion of the CRC ...

Подробнее
23-05-2019 дата публикации

CODING AND DECODING OF A POLAR CODE CONCATENATED WITH INTERLEAVING WITH AN OUTER SYSTEMATIC CODE

Номер: US20190158226A1
Принадлежит:

Systems and methods related to concatenated polar encoding with interleaving are disclosed. In some embodiments, a method of operation of a radio node to perform encoding of a plurality of data bits for transmission by the radio node comprises encoding a plurality of data bits using a linear encoder to provide a first plurality of coded bits, where the first plurality of coded bits comprises a plurality of parity bits and the plurality of data bits. The method further comprises interleaving the first plurality of coded bits in accordance with an interleaving mapping to provide a plurality of interleaved bits and encoding the plurality of interleaved bits using a polar encoder to provide a second plurality of coded bits to be transmitted by the radio node. 1. A method of operation of a radio node to perform encoding of a plurality of data bits for transmission by the radio node , comprising:encoding a plurality of data bits using a linear encoder to provide a first plurality of coded bits, the first plurality of coded bits comprising a plurality of parity bits and the plurality of data bits, where the plurality of parity bits are a single parity check code;interleaving the first plurality of coded bits in accordance with an interleaving mapping to provide a plurality of interleaved bits; andencoding the plurality of interleaved bits using a polar encoder to provide a second plurality of coded bits to be transmitted by the radio node.2. The method of wherein the interleaving mapping maps the plurality of interleaved bits to inputs of the polar encoder.3. The method of wherein the plurality of interleaved bits is a sequence of bits comprising the plurality of parity bits interleaved with the plurality of data bits claim 1 , and the interleaving mapping is such that at least one of the plurality of parity bits precedes at least one of the plurality of data bits in the sequence of bits.4. The method of wherein:the plurality of interleaved bits is a sequence of bits ...

Подробнее
08-06-2017 дата публикации

IMPROVING DATA RATES OF SHORT MESSAGE NOISY NETWORK CODING AND DECODE-AND FORWARD RELAYING

Номер: US20170164232A1
Автор: Hui Dennis, Maric Ivana
Принадлежит:

A method for communicating data in a network node is disclosed. A data transmission is received from a first network node at a second network node. The first network node is configured to perform decode-and-forward operations and the second network node configured to perform compression operations. A compression index to be used for conveying the data transmission is generated. The generated compression index is encoded using superposition coding. The compression index is sent to at least the first network node. 1. A method for communicating data in a network node , comprising:receiving, from a first network node, a data transmission at a second network node, the first network node configured to perform decode-and-forward operations and the second network node configured to perform compression operations;generating a compression index to be used for conveying the data transmission;encoding, using superposition coding, the generated compression index; andsending the compression index to at least the first network node.2. The method of claim 1 , wherein generating a compression index to be used for conveying the data transmission comprises:determining network nodes performing decode-and-forward operation;determining two or more channel coding rates each corresponding to a component codebook of a superposition code; andquantizing the data transmission using a vector quantization scheme at a quantization rate that is consistent with a sum of the two or more channel coding rates.3. The method of claim 2 , wherein determining two or more channel coding rates each corresponding to a component codebook of a superposition code further comprises:determining at least one channel coding rate that is able to be decoded by the first network node.4. The method of claim 1 , wherein encoding claim 1 , using superposition coding claim 1 , the generated compression index comprises:dividing the compression index into two or more component compression indices; andencoding each of the ...

Подробнее
23-05-2019 дата публикации

Beam-Scan Time Indicator

Номер: US20190159151A1
Принадлежит:

The present disclosure relates to transmitting synchronization signals and in particular to so called beam sweep. In particular the disclosure relates to methods for providing synchronization using synchronization sequences that are transmitted at different points in time. The disclosure also relates to corresponding devices and computer programs. A method in a network node, for transmitting synchronization sequences of a synchronization signal to one or more receiving wireless devices, comprises determining multiple synchronization sequences, such that each synchronization sequence comprises a respective timing indication, whereby each synchronization sequence enables determination of a time of an event in a receiving wireless device and transmitting the synchronization sequences to the one or more wireless devices, at different points in time. 1. A method for use in a network node , for transmitting synchronization sequences of a synchronization signal , transmitted in a beam sweep , to one or more receiving wireless devices , the method comprising:determining multiple synchronization sequences, such that each synchronization sequence comprises a respective timing indication, whereby each synchronization sequence enables a receiving wireless device to determine a time of an event; andtransmitting the synchronization sequences to the one or more wireless devices, at different points in time.2. The method of claim 1 , wherein the multiple synchronization sequences are time dependent versions of a synchronization signal referring to one particular event.3. The method of claim 1 , further comprising:determining the time of the event.4. The method of claim 1 , wherein the synchronization sequences are transmitted in different directions.5. The method of claim 4 , wherein the transmission of the synchronization sequences constitutes a beam sweep.6. The method of claim 1 , wherein the timing indications are relative to a time of transmission of the respective ...

Подробнее
14-05-2020 дата публикации

Beam-Scan Time Indicator

Номер: US20200154385A1
Принадлежит:

The present disclosure relates to transmitting synchronization signals and in particular to so called beam sweep. In particular the disclosure relates to methods for providing synchronization using synchronization sequences that are transmitted at different points in time. The disclosure also relates to corresponding devices and computer programs. A method in a network node, for transmitting synchronization sequences of a synchronization signal to one or more receiving wireless devices, comprises determining multiple synchronization sequences, such that each synchronization sequence comprises a respective timing indication, whereby each synchronization sequence enables determination of a time of an event in a receiving wireless device and transmitting the synchronization sequences to the one or more wireless devices, at different points in time. 1. A method implemented by a network node , for transmitting synchronization sequences of a synchronization signal to one or more wireless devices , the method comprising:determining multiple synchronization sequences, such that each synchronization sequence comprises a respective timing indication from which a timing of a forthcoming transmission event is derivable; andtransmitting the synchronization sequences to the one or more wireless devices, at different points in time.2. The method of claim 1 , wherein the multiple synchronization sequences are time dependent versions of a synchronization signal referring to one particular transmission event.3. The method of claim 1 , further comprising determining the timing of the transmission event.4. The method of claim 1 , wherein the synchronization sequences are transmitted in different directions.5. The method of claim 4 , wherein the transmission of the synchronization sequences constitutes a beam sweep.6. The method of claim 1 , wherein the timing indication in each synchronization sequence is relative to a time of transmission of the synchronization sequence.7. The method ...

Подробнее
28-05-2020 дата публикации

Adaptive Selection and Efficient Storage of Information Bit Locations for Polar Codes

Номер: US20200169272A1
Принадлежит:

According to certain embodiments, a method for use in a transmitter comprises selecting an information set or sequence of information sets for polar encoding. The information set or sequence of information sets are selected from a plurality of information sets based on one or more system parameters and/or one or more link measurements. The method further comprises performing polar encoding for a plurality of data bits to yield encoded data. The polar encoding is performed according to the selected information set or sequence of information sets. The method further comprises transmitting the encoded data to a receiver. 2. The method of claim 1 , wherein performing the polar encoding comprises inputting the data bits into a polar encoder claim 1 , wherein each data bit is input according to an assigned bit location claim 1 , the assigned bit location defined by the selected information set or sequence of information sets.3. The method of claim 1 , wherein the one or more system parameters include a rate matching configuration and the information set or sequence of information sets is selected based at least in part on the rate matching configuration.4. The method of claim 3 , wherein the rate matching configuration comprises a puncturing pattern indicating a subset of the bits to be removed from the encoded data before transmitting the encoded data.5. The method of claim 4 , wherein the encoded data comprises a first subset of encoded data bits and a second subset of encoded data bits claim 4 , and wherein the puncturing pattern indicates to remove the second subset of encoded data bits in response to a determination that another transmitter has been configured to transmit the second subset of encoded data bits to the receiver.6. The method of claim 3 , wherein the rate matching configuration comprises a repetition pattern indicating a subset of the bits of the encoded data to be repeated before transmitting the encoded data.7. The method of claim 1 , wherein the one ...

Подробнее
09-07-2015 дата публикации

SELECTION OF COOPERATIVE STRATEGIES FOR RELAY NODES IN A WIRELESS NETWORK TO ENHANCE DATA THROUGHPUT

Номер: US20150195033A1
Автор: Hui Dennis, Maric Ivana
Принадлежит: TELEFONAKTIEBOLAGET L M ERICSSON (PUBL)

Systems and methods are disclosed for selecting cooperative strategies for relay nodes in a wireless network. In one embodiment, a cooperative strategy for a relay node in a wireless network is selected from a set of two or more cooperative strategies. The cooperative strategy defines a manner in which the relay node relays messages along a multi-hop route through the wireless network. Use of the cooperative strategy by the relay node is then effected. In one embodiment, the cooperative strategy is selected based on one or more channel quality based criteria. By selecting the cooperative strategy for the relay node, and in one preferred embodiment selecting cooperative strategies for all other relay nodes in the multi-hop route, performance of the wireless network can be improved. 1. A method comprising:selecting a cooperative strategy for a relay node in a wireless network from a set of two or more cooperative strategies, the cooperative strategy defining a manner in which the relay node relays messages along a multi-hop route through the wireless network; andeffecting use of the cooperative strategy by the relay node.2. The method of wherein selecting the cooperative strategy comprises selecting the cooperative strategy from the set of two or more cooperative strategies based on one or more channel quality based criteria.3. The method of wherein selecting the cooperative strategy comprises selecting the cooperative strategy from the set of two or more cooperative strategies based on a data rate based criterion.4. The method of wherein selecting the cooperative strategy from the set of two or more cooperative strategies based on the data rate based criterion comprises:selecting one of the set of two or more cooperative strategies for the relay node that provides a highest end-to-end data rate for the multi-hop route.5. The method of wherein the two or more cooperative strategies comprise a first cooperative strategy that requires decoding of received messages and a ...

Подробнее
15-07-2021 дата публикации

Transmitter for Transmitting Discovery Signals, A Receiver and Methods Therein

Номер: US20210219215A1
Принадлежит:

A transmitter and a method therein for transmitting discovery signals to a receiver. The transmitter and the receiver are comprised in a radio communications system. The transmitter transmits two or more discovery signals over two or more directions. Each discovery signal is configured to span over a fraction of a carrier bandwidth. 1. A method , for operating a user equipment in a 3Generation Partnership Project (3GPP) radio communication system , the method comprising: a first discovery signal spanning a sub-band over a first beam, wherein the first discovery signal is received together with information indicating a beam direction of the first beam; and', 'a second discovery signal spanning a sub-band over a second beam; and, 'receiving, over a carrier with a carrier bandwidth separated into one or more sub-bandswherein a bandwidth of the one or more sub-bands is less than the carrier bandwidth.2. The method of claim 1 , wherein the first and second discovery signals are received in two or more symbols.3. The method of claim 2 , wherein the two or more received discovery signals are:multiplexed, in the frequency-domain, for the two or more beams; andreceived in the two or more symbols.4. The method of claim 1 , wherein the first discovery signal is cyclically received on different beams.5. The method of claim 1 , wherein the first discovery signal is further received cyclically over different beams.6. A user equipment (UE) configured to operate in a 3Generation Partnership Project (3GPP) radio communication system claim 1 , the UE comprising: a first discovery signal spanning a sub-band over a first beam, wherein the first discovery signal is received together with information indicating a beam direction of the first beam; and', 'a second discovery signal spanning a sub-band over a second beam; and, 'a receiver configured to receive, over a carrier with a carrier bandwidth separated into one or more sub-bandswherein a bandwidth of the one or more sub-bands is less ...

Подробнее
25-09-2014 дата публикации

EFFICIENT UPLINK TRANSMISSION OF CHANNEL STATE INFORMATION

Номер: US20140286267A1
Принадлежит:

A User Equipment in a wireless communication network includes a multiplicity of antennas, from which a subset of antennas is selected using a selection scheme synchronized to the network. A set of sub-carriers is selected from a plurality of sub-carriers using a selection scheme synchronized to the network. The UE receives a plurality of known reference symbols over the selected set of sub-carriers and through the selected subset of antennas. A frequency response for each selected sub-carrier is estimated over only the selected subset of antennas. The results are quantized and transmitted to the network on an uplink control channel. 1. A method of reporting Channel State Information (CSI) by a User Equipment (UE) operative in a wireless communication network in which downlink data is modulated onto a plurality of sub-carriers , each having a different frequency , wherein the UE includes a multiplicity of antennas , and the method comprises , at each iteration:selecting a subset of antennas from the multiplicity of antennas using a selection scheme synchronized to the network;selecting a set of non-uniformly spaced sub-carriers from the plurality of sub-carriers using a selection scheme synchronized to the network;receiving a plurality of known reference symbols over the selected set of sub-carriers and through the selected subset of antennas;estimating a frequency response for each selected sub-carrier over only the selected subset of antennas;quantizing the estimated frequency responses; andtransmitting the quantized frequency responses to the network via an uplink control channel.2. The method according to claim 1 , wherein the multiplicity of antennas are closely spaced.3. The method according to claim 1 , wherein the step of selecting the subset of antennas includes selecting a subset of non-uniformly spaced antennas.4. The method according to claim 3 , wherein the step of selecting the subset of non-uniformly spaced antennas includes utilizing a pseudo-random ...

Подробнее
11-06-2020 дата публикации

Distributed CRC-Assisted Polar Code Construction

Номер: US20200186170A1
Принадлежит: Telefonaktiebolaget lM Ericsson (publ)

According to some embodiments, a method in a wireless device comprises obtaining a set of information bits for wireless transmission and dividing the set of information bits into one or more subsets of information bits. For each subset, generating extra cyclic redundancy check (CRC) bits using a CRC polynomial capable of generating N CRC bits. The extra CRC bits for each subset comprise less than N CRC bits. The method further comprises: generating a final set of N or less CRC bits for the set of information bits using the CRC polynomial; generating a set of coded bits by encoding the set of information bits for wireless transmission, together with the extra CRC bits and the final set of CRC bits, using a polar encoder; and transmitting the set of coded bits using a wireless transmitter. 1. A method for use in a wireless transmitter , the method comprising:obtaining set of information bits for wireless transmission;dividing the set of information bits into one or more subsets of information bits;for each subset of the one or more subsets of information bits, generating extra cyclic redundancy check (CRC) bits using a CRC polynomial capable of generating N CRC bits and wherein the extra CRC bits for each subset of information bits comprise less than N CRC bits;generating a final set of N or less CRC bits for the set of information bits using the CRC polynomial;generating a set of coded bits by encoding the set of information bits for wireless transmission, together with the extra CRC bits and the final set of CRC bits, using a polar encoder; andtransmitting the set of coded bits using a wireless transmitter.211.-. (canceled)12. A wireless transmitter comprising processing circuitry operable to:obtain a set of information bits for wireless transmission;divide the set of information bits into one or more subsets of information bits;for each subset of the one or more subsets of information bits, generate extra cyclic redundancy check (CRC) bits using a CRC polynomial ...

Подробнее
02-10-2014 дата публикации

COMMUNICATING OVER A DESIRED TONE IN THE PRESENCE OF INTERFERENCE HAVING AN UNKNOWN MAGNITUDE THAT IS SUBSTANTIALLY CONSTANT

Номер: US20140294104A1
Автор: Hui Dennis
Принадлежит:

Methods and systems are disclosed for transmitting data over a desired frequency tone in the presence of an interference that has an unknown magnitude that is substantially constant. In general, data symbols are transmitted in a null space of the desired frequency tone. The null space of the desired frequency tone is orthogonal to the desired frequency tone. As such, the data symbols transmitted in the null space of the desired frequency tone are not interfered with by the interference at the desired frequency tone regardless of the magnitude of the interference. The data symbols transmitted in the null space of the desired frequency tone can then be recovered by a receiver without estimation of or compensation for the interference at the desired frequency tone. 1. A method of operation of a wireless transmitter comprising:generating a signal comprising a number, N−1, of data symbols in a null space of a predetermined frequency;for a number, N, of transmission time periods, modulating, based on the generated signal, a tone having the predetermined frequency; andtransmitting the modulated tone.2. The method of wherein the predetermined frequency is one of a plurality of subcarriers of a multi-subcarrier signal claim 1 , and transmitting the modulated tone comprises transmitting the multi-subcarrier signal such that the modulated tone is the one of the plurality of subcarriers of the multi-subcarrier signal.3. The method of wherein the multi-subcarrier signal is an Orthogonal Frequency Divisional Multiplexing claim 2 , OFDM claim 2 , signal.4. The method of wherein generating the signal comprises generating the signal such that each data symbol of the number claim 1 , N−1 claim 1 , of data symbols is carried across the number claim 1 , N claim 1 , of transmission time periods by a different basis vector in a set of basis vectors that characterize the null space of the predetermined frequency.5. The method of wherein generating the signal comprises claim 1 , for each ...

Подробнее
29-07-2021 дата публикации

HIGH FREQUENCY WIRELESS COMMUNICATION NETWORK

Номер: US20210235437A1
Принадлежит:

There is disclosed a method of operating a radio node in a wireless communication network. The method includes communicating using a first set of one or more signaling beams, wherein communicating includes performing beamforming for one or more signaling beams of the first set based on a set of beam signaling characteristics. Each beam signaling characteristic pertains to a reference beam. The disclosure also pertains to related devices and methods. 1. A method of operating a radio node in a wireless communication network , the method comprising:communicating using a first set of at least one signaling beam, communicating comprising performing beamforming for at least one signaling beam of the first set based on a set of beam signaling characteristics, each beam signaling characteristic pertaining to a reference beam.2. The method according to claim 1 , wherein the first set of signaling characteristics comprises a plurality of subsets of signaling characteristics claim 1 , each subset pertaining to a different reference beam.3. The method according to claim 1 , wherein a beam signaling characteristic at least one of represents and indicates at least one of:a signal strength of a beam;a signal quality of a beam; anddelay spread of a beam.4. The method according to claim 1 , wherein a reference beam is one of a second set of reference beams claim 1 , the second set of reference beams being associated to at least one of:the set of beam signaling characteristics; andthe first set of signaling beams.5. The method according to claim 1 , wherein a beam signaling characteristic is based on measurement performed on reference signaling carried on the reference beam it pertains to.6. The method according to claim 1 , wherein a reference beam carries reference signaling claim 1 , the reference signaling having a signaling structure comprising at least one non-transmission time interval and at least one transmission time interval.7. The method according to claim 1 , wherein a ...

Подробнее
26-07-2018 дата публикации

Transmitter for Transmitting Discovery Signals, A Receiver and Methods Therein

Номер: US20180213471A1
Принадлежит:

A transmitter and a method therein for transmitting discovery signals to a receiver. The transmitter and the receiver are comprised in a radio communications system. The transmitter transmits two or more discovery signals over two or more directions. Each discovery signal is configured to span over a fraction of a carrier bandwidth. 1. A method , in a base station , for transmitting synchronization signals to a user equipment , the base station is configured for transmitting over a carrier bandwidth , the method comprising:transmitting two or more synchronization signals over two or more directions; andwherein each synchronization signal is configured to span over a fraction of the carrier bandwidth, the carrier bandwidth is separated into sub-bands, and each of the two or more synchronization signals is configured to span over one sub-band.2. The method of claim 1 , wherein transmitting the two or more synchronization signals comprises transmitting the two or more synchronization signals in two or more symbols.3. The method of claim 2 , wherein transmitting the two or more synchronization signals further comprises:multiplexing, in the frequency-domain, the two or more synchronization signals for the two or more directions; andtransmitting the multiplexed two or more synchronization signals in the two or more symbols.4. The method of claim 1 , wherein transmitting the two or more synchronization signals further comprises:multiplexing, in the time-domain, the two or more synchronization signals for the two or more directions; andtransmitting the multiplexed two or more synchronization signals over the same sub-band.5. The method of claim 1 , wherein transmitting the two or more synchronization signals comprises transmitting the two or more synchronization signals together with information relating to at least one of:information indicating a beam direction;information indicating a frequency offset to a carrier center; andinformation indicating the base station.6. The ...

Подробнее
11-07-2019 дата публикации

Systems and Methods for Adaptive Initial Synchronization Beam Sweep

Номер: US20190215049A1
Принадлежит:

According to certain embodiments, a method in a network node is provided for adaptive initial synchronization beam sweep transmission. The method includes transmitting a plurality of initial synchronization beams with at least two different beam sweep cycles. At least one beam sweep cycle is an exhaustive beam sweep cycle and at least one beam sweep cycle is an optimized beam sweep cycle. The exhaustive beam sweep cycle covers all of a serving area of the cell and the optimized beam sweep cycle covers a subset of the serving area. 1. A method in a network node for adaptive initial synchronization beam sweep transmission , the network node controlling a serving area of a cell , the , method comprising;transmitting a plurality of initial synchronization beams with at least two different beam sweep cycles, wherein at least one beam sweep cycle is an exhaustive beam sweep cycle and at least one beam sweep cycle is an optimized beam sweep cycle wherein the exhaustive beam sweep cycle covers all of a serving area of the cell and the optimized beam sweep cycle covers a subset of the serving area,wherein the plurality of initial synchronization cants comprise a number of K optimized bean swept cycles transmitted between two exhaustive beam sweep cycles.2. (canceled)3. The method of claim 1 , wherein:{'sub': opt', 'opt, 'each optimized beam sweep cycle has a duration of tunits of time, and depends on the beam sweep pattern, and the number of K optimized beam sweep cycles is determined based on the duration of tunits of time; or,'}{'sub': opt', 'full', 'opt, 'each optimized beam sweep cycle has a duration of tunits of time, and each exhaustive beam sweep cycle has a duration of tthat is greater than the duration of t.'}4. (canceled)5. The method of claim 1 , further comprising:receiving time-stamped data from a wireless device,{'sub': 'full', 'wherein the exhaustive beam sweep cycle is run at an interval of Tunits of time that is selected based on the time-stamped data ...

Подробнее
02-07-2020 дата публикации

CIRCULAR BUFFER RATE MATCHING FOR POLAR CODES

Номер: US20200212940A1
Принадлежит:

Methods are proposed herein to perform rate matching for polar codes via circular buffering of the polar encoded bits. Embodiments are directed to methods of operation of a transmitting node in a wireless system including performing polar encoding of a set of information bits in accordance with a polar sequence of length Nto thereby generate Ncoded bits. The method can further include interleaving the coded bits to thereby provide an interleaved coded bit sequence, and storing the interleaved coded bit sequence into a circular buffer of length N. According to certain embodiments, the method can further include extracting N coded bits for transmission from the circular buffer. N can be greater than, equal to, or less than N. 1{'sub': B', 'B, 'performing polar encoding of a set of K information bits in accordance with a polar sequence of length Nto thereby generate Ncoded bits;'}interleaving the coded bits to thereby provide an interleaved coded bit sequence;{'sub': 'B', 'storing the interleaved coded bit sequence into a circular buffer of length N; and'}extracting N coded bits for transmission from the circular buffer.. A method of operation of a transmitting node in a wireless system, comprising: The present application is a continuation of U.S. patent application Ser. No. 16/246,319, filed Jan. 11, 2019, now U.S. Pat. No. 10,587,290, which is a continuation of International Application No. PCT/162018/050813, filed Feb. 9, 2018, which claims priority to Provisional Application No. 62/457,665, filed Feb. 10, 2017, the disclosures of which are incorporated herein by reference in their entireties.The present disclosure rate to polar codes and, in particular, rate-matching for polar codes.Polar codes, proposed by Arikan [1], are the first class of constructive coding schemes that are provable to achieve the symmetric capacity of the binary-input discrete memoryless channels under a low-complexity Successive Cancellation (SC) decoder. However, the finite-length ...

Подробнее
20-08-2015 дата публикации

Method for Improving Data Throughput in Wireless Networks

Номер: US20150237563A1
Автор: Dennis Hui, Ivana Maric
Принадлежит: Telefonaktiebolaget LM Ericsson AB

The proposed layer solution defines two or more layers of relay nodes to convey traffic data from a source node to a destination node. All of the nodes in a given layer were selected for that layer because they each satisfied a signal quality requirement specified for that layer, where all relay nodes defined in one layer simultaneously start transmitting in response to a received transmission. Due to the layered approach, the destination node may be configured to decode only the traffic data relayed by the relay nodes in the immediately preceding (final) layer while treating any remaining received signals as noise. As a result, only those access nodes most likely to significantly contribute to and improve the signal quality of traffic data received at the destination node are selected as relay nodes for a particular source-destination node pair.

Подробнее
09-07-2020 дата публикации

Enhanced Information Sequences for Polar Codes

Номер: US20200220560A1
Автор: Hui Dennis
Принадлежит:

According to some embodiments, a method of operation of a transmit node in a wireless communication system comprises performing polar encoding of a set of K information bits to thereby generate a set of polar-encoded information bits. The K information bits are mapped to the first K bit locations in an information sequence SN. The information sequence SN is a ranked sequence of N information bit locations among a plurality of input bits for the polar encoding where N is equivalent to a code length. A size of the information sequence SN is greater than or equal to K. The information sequence SN is optimized for the specific value of the code length (N). The method may further comprise transmitting the set of polar-encoded information bits. 1. A method of operation of a transmit node in a wireless communication system , the method comprising:performing polar encoding of a set of K information bits to thereby generate a set of polar-encoded information bits wherein:{'sub': N', 'N, 'the K information bits are mapped to the first K bit locations in an information sequence S, the information sequence Sbeing a ranked sequence of N information bit locations among a plurality of input bits for the polar encoding where N is equivalent to a code length;'}{'sub': 'N', 'a size of the information sequence Sis greater than or equal to K; and'}{'sub': 'N', 'the information sequence Sis optimized for the specific value of the code length (N).'}213.-. (canceled)14. A transmit node comprising:a polar encoder operable to perform polar encoding of a set of K information bits to thereby generate a set of polar-encoded information bits wherein:{'sub': N', 'N, 'the K information bits are mapped to the first K bit locations in an information sequence S, the information sequence Sbeing a ranked sequence of N information bit locations among a plurality of input bits for the polar encoding where N is equivalent to a code length;'}{'sub': 'N', 'a size of the information sequence Sis greater ...

Подробнее
25-07-2019 дата публикации

INFORMATION BITS FOR POLAR CODES WITH MIXED CRITERIA

Номер: US20190229850A1
Принадлежит:

According to some embodiments, a method performed by a wireless device for polar encoding payload bits comprises: identifying payload bits of a data channel that have known values; placing a first subset of the known payload bits at input positions of a polar encoder that correspond to the earliest decoding bit positions of the polar encoder; placing a second subset of the known payload bits at input positions of the polar encoder that correspond to the least reliable decoding bit positions of the polar encoder after placement of the first subset of the known payload bits; and transmitting the polar encoded payload bits to a wireless receiver. The first subset of the known payload bits are placed in earliest decoding bit positions to improve early termination gain. The second subset of the known payload bits are placed in least reliable decoding bit positions to enhance error performance. 1. A method performed by a wireless transmitter for polar encoding payload bits , the method comprising:identifying payload bits of a data channel that have known values;placing a first subset of the known payload bits at input positions of a polar encoder that correspond to the earliest decoding bit positions of the polar encoder;placing a second subset of the known payload bits at input positions of the polar encoder that correspond to the least reliable decoding bit positions of the polar encoder after placement of the first subset of the known payload bits;polar encoding the payload bits; andtransmitting the polar encoded payload bits to a wireless receiver.2. The method of claim 1 , wherein the first subset of the known payload bits are placed in earliest decoding bit positions to improve early termination gain.3. The method of claim 1 , wherein the second subset of the known payload bits are placed in least reliable decoding bit positions to enhance error performance.4. The method of claim 1 , wherein the identified payload bits that have known values include a half frame ...

Подробнее
01-09-2016 дата публикации

EFFICIENT MEDIUM ACCESS WITH DIRECTION AWARENESS

Номер: US20160254930A1
Принадлежит: TELEFONAKTIEBOLAGET L M ERICSSON (PUBL)

The present disclosure presents a method performed in a first node in a wireless communication system, of accessing a shared channel for transmission from the first node to at least one second node. The method comprises the step of receiving, from a third node a pilot signal announcing reception in the third node, wherein the pilot signal comprises information enabling estimation of a channel response from the first node to the third node; estimating, using the pilot signal, a channel response from the first node to the third node and predicting, based on the estimated channel response, an interference level at the receiver of the third node of a directive transmission from the first node to the second node; and accessing the shared channel based on the predicted interference level. 1. A method , performed in a first node in a wireless communication system , of accessing a shared channel for transmission from the first node to at least one second node , the method comprising:receiving, from a third node a pilot signal announcing reception in the third node, wherein the pilot signal comprises information enabling estimation of a channel response from the first node to the third node;estimating, using the pilot signal, a channel response from the first node to the third node;predicting, based on the estimated channel response, an interference level at the receiver of the third node of a directive transmission from the first node to the second node; andaccessing the shared channel based on the predicted interference level.2. The method of accessing a shared channel according to claim 1 , wherein the pilot signal comprises a sequence claim 1 , whose auto-correlation properties imply that the correlation of cyclically shifted versions of the sequence is below a predetermined value.3. The method of accessing a shared channel according to claim 1 , wherein the sequence is a Zadoff-Chu claim 1 , Frank or Milewski sequence.4. The method of accessing a shared channel ...

Подробнее
23-07-2020 дата публикации

Enhanced Information Sequences for Polar Codes

Номер: US20200235754A1
Принадлежит:

According to some embodiments, a method of operation of a transmit node in a wireless communication system comprises performing polar encoding of a set of K information bits to thereby generate a set of polar-encoded information bits. The K information bits are mapped to the first K bit locations in an information sequence S. The information sequence Sis a ranked sequence of N information bit locations among a plurality of input bits for the polar encoding where N is equivalent to a code length. A size of the information sequence Sis greater than or equal to K. The information sequence Sis optimized for the specific value of the code length (N). The method may further comprise transmitting the set of polar-encoded information bits. 1. A method of operation of a transmit node in a wireless communication system , the method comprising:performing polar encoding of a set of K information bits to thereby generate a set of polar-encoded information bits wherein:{'sub': N', 'N, 'the K information bits are mapped to the first K bit locations in an information sequence S, the information sequence Sbeing a ranked sequence of N information bit locations among a plurality of input bits for the polar encoding where N is equivalent to a code length;'}{'sub': 'N', 'a size of the information sequence Sis greater than or equal to K; and'}{'sub': 'N', 'the information sequence Sis optimized for the specific value of the code length (N).'}2102. The method of claim 1 , further comprising transmitting () the set of polar-encoded information bits.3. The method of wherein N=512 claim 1 , and the information sequence Sis:{'sub': '512', 'sup': '1', 'S=[511 510 509 507 503 495 508 479 506 505 502 447 501 494 499 493 383 478 491 477 504 487 475 446 255 500 445 471 498 443 492 382 497 463 490 439 381 476 489 486 379 431 474 485 254 375 473 444 470 253 483 415 442 469 367 251 496 462 441 467 438 380 461 247 351 488 437 378 459 430 239 435 484 377 429 374 472 455 319 252 482 414 373 427 223 468 ...

Подробнее
23-07-2020 дата публикации

Enhanced Information Sequences for Polar Codes

Номер: US20200235852A1
Принадлежит:

According to some embodiments, a method of operation of a transmit node in a wireless communication system comprises performing polar encoding of a set of K information bits to thereby generate a set of polar-encoded information bits. The K information bits are mapped to the first K bit locations in an information sequence S. The information sequence Sis a ranked sequence of N information bit locations among a plurality of input bits for the polar encoding where N is equivalent to a code length. A size of the information sequence Sis greater than or equal to K. The information sequence Sis optimized for the specific value of the code length (N). The method may further comprise transmitting the set of polar-encoded information bits. 1. A method of operation of a transmit node in a wireless communication system , the method comprising:performing polar encoding, of a set of K information bits to thereby generate a set of polar-encoded information bits wherein:{'sub': N', 'N, 'the K information bits are mapped to the first K bit locations in an information sequence S, the information sequence Sbeing a ranked sequence of N information bit locations among a plurality of input bits for the polar encoding where N is equivalent to a code length;'}{'sub': 'N', 'a size of the information sequence Sis greater than or equal to K; and'}{'sub': 'N', 'the Information sequence Sis optimized for the specific value of the code length (N).'}2. The method of claim 1 , further comprising claim 1 , transmitting the set of polar-encoded information bits.22. The method of claim 1 , wherein the transmit node is a radio access node in a wireless communication system.23. The method of claim 1 , wherein the transmit node is a wireless communication device In a wireless communication system.24. A transmit node comprising:a polar encoder operable to perform polar encoding of a set, of K information bits to thereby generate a set of polar-encoded information bits wherein:{'sub': N', 'N, 'the K ...

Подробнее
31-08-2017 дата публикации

Graph-Based Determination of Initial-Synchronization Beam Scanning

Номер: US20170250739A1
Принадлежит: Telefonaktiebolaget LM Ericsson AB

Techniques for determining beam-sweeping patterns for synchronization signals transmitted in a region by several access nodes in a network, where each access node is connected to a corresponding array of antenna elements. An example method includes modeling a total power function for the power transmitted in the synchronization signals, as a factor graph having a plurality of check nodes and variable nodes, each check node corresponding to a virtual wireless device in the region and each variable node corresponding to an available beam for an access node. The virtual wireless devices are emulated so as to implement quality-of-service constraints on synchronization signals received by the virtual wireless devices. An iterative message-passing algorithm, such as a min-sum algorithm, is applied to the modeled total power function, to determine a sequence of power levels, for each access node, for sweeping synchronization signal beams, so as to minimize the total power function.

Подробнее
31-08-2017 дата публикации

Method and Apparatus for Synchronization Signal Transmission in a Wireless Communication System

Номер: US20170251441A1
Принадлежит: Telefonaktiebolaget LM Ericsson AB

In one aspect of the teachings herein, a radio network node advantageously adapts the transmission duration of a synchronization signal with respect to transmission of the synchronization signal in different directions. For example, the radio network node uses a shorter transmission duration in beam directions that are associated with better reception conditions and a longer transmission duration in beam directions that are associated with poorer reception conditions. As a consequence of varying the transmission duration according to received-signal qualities known or expected for the different directions, the radio network node can shorten the overall time needed to complete one synchronization-signal transmission cycle and use less energy, as compared to using a more conservative, longer transmission time in all beam directions.

Подробнее
17-09-2015 дата публикации

Antenna Beam Control

Номер: US20150264583A1
Принадлежит:

Spatial sensor data, such as position, movement and rotation, which is provided by a sensor in a wireless communication device in a wireless communication system is used. By using the spatial sensor data it is possible to calculate predicted spatial data for use in controlling antenna beams for transmission as well as reception in the wireless communication system. 1. A method performed by a node of a wireless communication system , for performing an iterative process , wherein the iterative process comprises:receiving, from a first wireless communication device, spatial sensor data relating to the first wireless communication device;recording the received spatial sensor data such that a time sequence of historical and current spatial sensor data relating to the first wireless communication device is maintained; andcalculating, using data of the time sequence of historical and current spatial sensor data relating to the first wireless communication device, predicted spatial data for use in controlling at least one antenna beam in the wireless communication system.2. The method of claim 1 , wherein the spatial sensor data comprises any one or more of:position data,translation data,rotation data, andwhere the spatial sensor data are absolute values or values that are relative between the node and the first wireless communication device or a combination of said absolute and relative values.3. The method of claim 2 , comprising:calculating, using the predicted spatial data, a prediction of beam forming antenna weights for use in controlling a direction of at least one antenna beam in the node.4. The method of claim 3 , wherein the calculation of a prediction of beam forming antenna weights comprises an extrapolation procedure.5. The method of claim 3 , wherein the calculation of a prediction of beam forming antenna weights comprises a stochastic linear prediction procedure.6. The method of claim 3 , wherein the calculation of a prediction of beam forming antenna weights ...

Подробнее
08-08-2019 дата публикации

SPATIALLY COUPLED POLAR CODES

Номер: US20190245650A1
Принадлежит:

A method in a node () comprises generating () a plurality of constituent polar codes, each of the plurality of constituent polar codes having an associated block length and an associated set of information bits. The method comprises coupling () at least a portion of the sets of information bits associated with each of the plurality of constituent polar codes to generate a spatially coupled polar code. The method comprises encoding () a wireless transmission using the spatially coupled polar code. 1. A method in a node , comprising:generating a plurality of constituent polar codes, each of the plurality of constituent polar codes having an associated block-length and an associated set of information bits;coupling at least a portion of the sets of information bits associated with each of the plurality of constituent polar codes to generate a spatially coupled polar code; andencoding a wireless transmission using the spatially coupled polar code.2. The method of claim 1 , wherein coupling at least a portion of the sets of information bits associated with each of the plurality of constituent polar codes to generate a spatially coupled polar code comprises:using a first subset of information bits in a first set of information bits associated with a first constituent polar code to form one or more information bits of another set of information bits associated with another constituent polar code of the plurality of constituent polar codes.3. The method claim 1 , wherein the at least a portion of the sets of information bits associated with each of the plurality of constituent polar codes are coupled using coupling matrix that specifies how information bits from a first constituent polar code of the plurality of constituent polar codes are coupled to one or more other constituent polar codes of the plurality of constituent polar codes.4. The method of claim 3 , wherein the coupling matrix comprises elements from a binary Galois field.5. The method of claim 3 , wherein the ...

Подробнее
15-08-2019 дата публикации

BIT ORDER OF NR PBCH PAYLOAD TO ENHANCE POLAR CODE PERFORMANCE

Номер: US20190253188A1
Принадлежит:

Systems and methods are described herein that allow information carrying bits of a transmission block to be placed at higher-reliability positions prior to transmission. An exemplary method includes generating a set of payload bits to be encoded for transmission, wherein the set of payload bits includes at least one known bit, interleaving the set of payload bits to generate an interleaved set of payload bits, wherein the interleaved set includes the at least one known bit in a predetermined position in the interleaved set, providing the interleaved set to a cyclic redundancy check (CRC) encoder to generate CRC-interleaved set of payload bits, wherein the CRC-interleaved set includes the at least one known bit in a predetermined position within the CRC-interleaved set, and encoding the CRC-interleaved set for transmission to a wireless device. Associated network nodes and wireless devices are included. 1. A method for preparing a transport block for transmission , the method comprising:generating a set of payload bits to be encoded for transmission, wherein the set of payload bits includes at least one known bit;interleaving the set of payload bits to generate an interleaved set of payload bits, wherein the interleaved set includes the at least one known bit in a predetermined position in the interleaved set;providing the interleaved set to a cyclic redundancy check (CRC) encoder to generate a CRC-interleaved set of payload bits, wherein the CRC-interleaved set includes the at least one known bit in a predetermined position within the CRC-interleaved set; andencoding the CRC-interleaved set for transmission to a wireless device.2. The method of claim 1 , wherein the at least one known bit has a value that is known or partially known.3. The method of claim 1 , wherein the at least one known bit is a reserved bit.4. The method of claim 1 , wherein encoding the CRC-interleaved set for transmission comprises using a polar encoder to encode the CRC-interleaved set for ...

Подробнее
15-09-2016 дата публикации

Receiver channel reservation

Номер: US20160270120A1
Принадлежит: Telefonaktiebolaget LM Ericsson AB

The present disclosure proposes a solution that increases the efficiency of the MAC and use of the spectrum by indicating in a receiver channel reservation, RCR, signal that the channel is reserved only at the receiver side of a link, during the planned reception by the receiver. The disclosure relates to a method, performed in a first node in a wireless communication system, of reserving a shared media for signal reception, the method comprising defining, parts of the shared media to reserve for signal reception in the first node, configuring a receiver channel reservation signal to indicate the defined parts and transmitting the receiver channel reservation signal to reserve the shared media. The disclosure also relates to a method in a node receiving a receiver channel reservation, RCR, signal and to the corresponding network nodes.

Подробнее
21-10-2021 дата публикации

PULSE-SHAPING FOR HIGH FREQUENCY RADIO NETWORKS

Номер: US20210328839A1
Принадлежит:

There is disclosed a method of operating a radio node in a wireless communication network. The method includes communicating utilising signaling, wherein communicating utilising signaling is based on performing pulse-shaping pertaining to the signaling. The disclosure also pertains to related devices and methods. 1. A method of operating a radio node in a wireless communication network , the method comprising communicating utilising signaling , the communicating utilising signaling being based on performing pulse-shaping pertaining to the signaling.2. The method according to claim 1 , wherein performing pulse-shaping corresponds to performing pulse-shaping based on an input representing modulation symbols distributed over a first frequency range.3. The method according to claim 1 , wherein performing pulse-shaping corresponds to performing pulse-shaping based on a periodic expansion in frequency domain.4. The method according to claim 1 , wherein the pulse-shaping is performed based on a modulation of the signaling and/or an indication indicating the modulation of the signaling.5. The method according to claim 1 , wherein the pulse-shaping is based on a first pulse-shaping parameter claim 1 , the pulse-shaping parameter indicating at least one of a roll-off used for pulse-shaping claim 1 , a bandwidth expansion and subcarriers to be pulse-shaped.6. The method according to claim 1 , wherein the pulse-shaping is based on a second pulse-shaping parameter gamma claim 1 , gamma indicating a bandwidth compression.7. The method according to claim 1 , wherein at least one of:for at least one modulation out of a set of modulations, pulse-shaping is performed; andfor at least one modulation of the set of modulations, no pulse-shaping is performed.8. The method according to claim 1 , wherein at least one of a first pulse-shaping parameter and a second pulse-shaping parameter is dependent on at least one of a modulation and a modulation indication.9. The method according to ...

Подробнее