EP2858285A1 - Procédé de détection de symboles dans des signaux de communication - Google Patents

Procédé de détection de symboles dans des signaux de communication Download PDF

Info

Publication number
EP2858285A1
EP2858285A1 EP13187322.6A EP13187322A EP2858285A1 EP 2858285 A1 EP2858285 A1 EP 2858285A1 EP 13187322 A EP13187322 A EP 13187322A EP 2858285 A1 EP2858285 A1 EP 2858285A1
Authority
EP
European Patent Office
Prior art keywords
llrs
channel
opt
filter
received signal
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
EP13187322.6A
Other languages
German (de)
English (en)
Other versions
EP2858285B1 (fr
Inventor
Fredrik RUSEK
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to EP13187322.6A priority Critical patent/EP2858285B1/fr
Priority to CN201310552767.0A priority patent/CN103595666B/zh
Publication of EP2858285A1 publication Critical patent/EP2858285A1/fr
Application granted granted Critical
Publication of EP2858285B1 publication Critical patent/EP2858285B1/fr
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0045—Arrangements at the receiver end
    • H04L1/0047—Decoding adapted to other signal detection operation
    • H04L1/005—Iterative decoding, including iteration between signal detection and decoding operation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00—Baseband systems
    • H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/03—Shaping networks in transmitter or receiver, e.g. adaptive shaping networks
    • H04L25/03006—Arrangements for removing intersymbol interference
    • H04L25/03171—Arrangements involving maximum a posteriori probability [MAP] detection
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00—Baseband systems
    • H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/03—Shaping networks in transmitter or receiver, e.g. adaptive shaping networks
    • H04L25/03006—Arrangements for removing intersymbol interference
    • H04L25/03178—Arrangements involving sequence estimation techniques
    • H04L25/03248—Arrangements for operating in conjunction with other apparatus
    • H04L25/03286—Arrangements for operating in conjunction with other apparatus with channel-decoding circuitry
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00—Baseband systems
    • H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/03—Shaping networks in transmitter or receiver, e.g. adaptive shaping networks
    • H04L25/03006—Arrangements for removing intersymbol interference
    • H04L25/03178—Arrangements involving sequence estimation techniques
    • H04L25/03312—Arrangements specific to the provision of output signals
    • H04L25/03318—Provision of soft decisions

Definitions

  • the present method relates to a method for detection of symbols carried in communication signals. Furthermore, the invention also relates to a detection device, a computer program, and a computer program product thereof.
  • H an MxN matrix of channel gains
  • x is an Nx1 vector of channel inputs
  • n is an Mx1 vector of IID complex Gaussian noise variables with mean 0 and covariance matrix N 0 I .
  • channel matrix H may represent.
  • This innovation assumes an arbitrary H , so that it encompasses, e.g., inter-symbol interference (ISI) channel (e.g., encountered for example in satellite transmission), MIMO (e.g., encountered for example in the LTE downlink), MIMO-ISI (e.g., encountered for example in the LTE uplink), ICI (e.g., encountered for example in the LTE downlink with high Doppler spread), etc.
  • ISI inter-symbol interference
  • MIMO e.g., encountered for example in the LTE downlink
  • MIMO-ISI e.g., encountered for example in the LTE uplink
  • ICI e.g., encountered for example in the LTE downlink with high Doppler spread
  • x n - 1 , ... , x n - K , where x k ⁇ , k ⁇ 0 .
  • CS channel shortening
  • the channel matrix H becomes a Toeplitz matrix representing a convolution.
  • the filter W is also a convolution matrix which is well known.
  • FIG. 1 A block diagram of the CS idea is provided in Fig. 1 .
  • An objective of the present invention is to provide a solution which mitigates or solves the drawbacks and problems of prior art solutions.
  • Another objective of the present invention is to provide a method which provides improved decoding performance compared to prior art methods.
  • a method for detection of symbols carried in received communication signals comprising the steps of:
  • the LLRs of said channel inputs x in step a) is obtained from a decoder, and the method further comprises the steps of:
  • the first filter is a modified Wiener filter for said radio channel inputs x having mean ⁇ and variance D .
  • E ( ) is the expectation operator and I k is a set of indices that depends on k in a pre-determined fashion, and wherein the vector comprising r k , ⁇ k , is denoted by E ( x
  • said optimal matrix G opt is solely dependent on said MSE estimate B and the memory L.
  • the memory L can be arbitrarily chosen.
  • the second filter has the form ( G opt + I ), where I is the identity matrix.
  • said radio channel H is a linear radio channel.
  • the communication signal is transmitted in a cellular wireless communication system, such as 3GPP communication systems.
  • the present invention also relates to a computer program, having code means, which when run by processing means causes said processing means to execute the method according to the invention.
  • the invention concerns a computer program product comprising a computer readable medium and the computer program, wherein the computer program is included in the computer readable medium, and comprises of one or more from the group: ROM (Read-Only Memory), PROM (Programmable ROM), EPROM (Erasable PROM), Flash memory, EEPROM (Electrically EPROM), hard disk drive or any other suitable computer readable medium.
  • a detection device arranged for detection of symbols carried in received communication signals, the receiver comprising a processor arranged to:
  • the LLRs of said channel inputs x in step a) is obtained from a decoder, and the processor is further arranged to:
  • the present invention provides a method and a device for obtaining extrinsic LLRs of channel inputs x .
  • the mentioned extrinsic LLRs can be used in many different applications, such as iterative detection of encoded data transmitted over radio channels, E-ICIC of the LTE downlink, satellite communication using the DVB-S standards, to name but a few.
  • the present solution is used in an iterative detection algorithm with an outer ECC decoder.
  • an outer ECC decoder By using the extrinsic LLRs and iterating the performance is improved.
  • bold face uppercase letters denote matrices and bold face lowercase letters denote vectors.
  • Steps 1-6 of the CS receiver described above implies that the receiver operates according to a mismatched probability density function (pdf), q y
  • the optimal full complexity receiver operates according to, p y
  • the mismatched pdf q( y l x ) directly specifies the BCJR operations.
  • the Ungerboeck model is obtained by rewriting p( y l x ) as, p y
  • Equation (1) is what we mean by the term "Ungerboeck model".
  • the CS concept in view of the Ungerboeck model is now to modify the last expression of (1) into, q y
  • the Ungerboeck model is equivalent to the Forney model in terms of complexity, but for CS there is a crucial difference, namely, Fact 7:
  • the Ungerboeck model provides more degrees of freedom in selecting CS parameters as the matrix G r need not be positive definite.
  • the outcome is often that the optimal matrix is indeed not positive definite.
  • the Ungerboeck CS offers a performance that is not reachable for Forney CS, which means that the rate in Fact 5 is not reachable for Forney based CS.
  • Ungerboeck based CS receiver from "Optimal channel shortening for MIMO and ISI channels" presented in the previous section (although no equations were given) represents prior art of the CS art. It maximizes the transmission rate that can be used when a CS receiver is adopted.
  • the inventor has identified the following: in modem wireless communication systems, the receiver iterates between detection of the channel H and an outer error correcting code (ECC) decoder. Hence, in all iterations, except in the first step, of the channel detector, there is prior information about the data symbols x . Therefore, the inventor concludes that the prior information should somehow be taken into consideration when designing the CS detector and the parameters H opt and G opt should reflect the prior information. Prior information is characterized through a-priori LLRs of the input symbols x .
  • ECC outer error correcting code
  • the present invention relates to a method for detection of communication symbols in communication signals transmitted in wireless communication systems.
  • At least one communication signal y is transmitted over a radio channel H , and the received signal y comprises encoded radio channel symbol inputs x . Further, a priori Log Likelihood Ratios, LLRs, of the channel inputs x are also received.
  • the basic method according to the invention further comprises the steps of:
  • the output of the method i.e., the extrinsic LLRs of the channel inputs x
  • the method can be applied in any scenario where symbols x are observed through a noisy linear vector channel with memory and where some form of prior information of x is present. If those assumptions are fulfilled, the method will produce extrinsic LLRs.
  • the present method and device can be used as a building block in any system that has a need for such method. The method can therefore find wide spread application areas, ranging from wireless communications to biology.
  • the LLRs of the channel inputs x in step a) above is obtained from a decoder (e.g., an ECC decoder).
  • the method further comprises the steps of:
  • an iterative CS BCJR decoder which uses the information from the decoder to improve the symbol estimations for each iteration step.
  • the outcome of the present invention is a CS decoder with computational complexity O (
  • O
  • the CS detector can reach exactly what one could hope for, namely that within the memory length, it can condition on the actually transmitted data symbol, but outside it condition on the estimated symbol from the decoder. Note that as the iterations proceeds, the quality of ⁇ becomes better and better. Eventually, if the process converges, ⁇ will become x. A comparison to the result of Fact 5 can now be done. These two rates have the same forms, but the rate in Fact 5 lacks the ⁇ terms. Thus, the rate of the optimized iterative CS detector, stated above, is superior to the rate of the non-iterative detector.
  • Fig. 3 illustrates a system model of an embodiment of the present invention.
  • the figure illustrates the order among the operations needed to synthesize the present detection method: (i) based on the prior LLRs, the parameters ⁇ and D are computed. (ii) Based on ⁇ , D , the channel matrix H , the noise density N 0 , and the BCJR memory length L , the parameters ⁇ , G opt , and F are computed. (iii) The received signal y is thereafter filtered and interference cancelled based on ⁇ , ⁇ , G opt , and F , which produces E ( x
  • Fig. 4 Simulation results of the present invention and prior art are shown in Fig. 4 for 6x6 MIMO systems with QPSK inputs.
  • the outer ECC is an irregular (2050, 4100) LDPC code, and it follows that the 4100 code symbols are transmitted over 342 channel matrices H . All channel matrices within each code block are assumed independent and comprise independent complex Gaussian random variables.
  • L This implies that there are 4 states in the BCJR, which should be compared with a complexity of 4096 for the full complexity BCJR.
  • the left curve is the performance result of a proposed receiver according to the invention, while the right curve is the CS prior art receiver. From the curves a clear improvement can be seen with a method according to the present invention.
  • any method according to the present invention may also be implemented in a computer program, having code means, which when run by processing means causes the processing means to execute the steps of the method.
  • the computer program is included in a computer readable medium of a computer program product.
  • the computer readable medium may comprises of essentially any memory, such as a ROM (Read-Only Memory), a PROM (Programmable Read-Only Memory), an EPROM (Erasable PROM), a Flash memory, an EEPROM (Electrically Erasable PROM), or a hard disk drive.
  • the present method can be implemented and executed in suitable detection devices, and it is realized by the skilled person that the present detection device may comprise the necessary communication capabilities in the form of e.g., functions, means, units, elements, etc., for executing the methods according to the invention which means that the devices can be modified, mutatis mutandis , according to any method of the present invention.
  • the present detection device may comprise the necessary communication capabilities in the form of e.g., functions, means, units, elements, etc., for executing the methods according to the invention which means that the devices can be modified, mutatis mutandis , according to any method of the present invention.
  • Examples of other such means, units, elements and functions are: memory, encoders, decoders, mapping units, multipliers, interleavers, deinterleavers, modulators, demodulators, inputs, outputs, antennas, amplifiers, DSPs, etc. which are suitably arranged together for correct operation.
  • the processors of the present detection device may comprise, e.g., one or more instances of a Central Processing Unit (CPU), a processing unit, a processing circuit, a processor, an Application Specific Integrated Circuit (ASIC), a microprocessor, or other processing logic that may interpret and execute instructions.
  • CPU Central Processing Unit
  • ASIC Application Specific Integrated Circuit
  • the expression "processor” may thus represent a processing circuitry comprising a plurality of processing circuits, such as, e.g., any, some or all of the ones mentioned above.
  • the processing circuitry may further perform data processing functions for inputting, outputting, and processing of data comprising data buffering and device control functions, such as call processing control, user interface control, or the like.
  • the present detection device comprises a processor which is arranged to execute, mutatis mutandis , the corresponding method steps.
  • Fig. 5 shows an example of a detector device according to the invention. As shown, the processor executes the different steps according to the invention.
  • the detector device can e.g. be a receiver device or be a part of such a receiver device arranged for communication in a wireless communication system. However, the detection device can also be a standalone detection device coupled to a receiver device, communication processing device or any other suitable communication device receiving communication signals.
  • the present receiver device comprises a receiver unit, a computing unit, a filtering and interference cancellation unit, an estimating unit, a computing unit, a filtering unit, and a feeding unit all arranged to execute the corresponding method steps.
  • Fig. 6 shows an example of a receiver device according to the alternative embodiment of the invention. As shown, each functional unit executes its associated step of the invention are inter-coupled accordingly.
  • the method and corresponding detector device can be used in any suitable wireless communication system.
  • Example of such system is cellular systems such as LTE and LTE-A in which communication is performed in the uplink and the downlink between base stations and user nodes (UEs).
  • Fig. 7 illustrates a system overview of a cellular system with uplink and downlink transmission of communication signals.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Power Engineering (AREA)
  • Physics & Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Radio Transmission System (AREA)
EP13187322.6A 2013-10-04 2013-10-04 Procédé de détection de symboles dans des signaux de communication Active EP2858285B1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP13187322.6A EP2858285B1 (fr) 2013-10-04 2013-10-04 Procédé de détection de symboles dans des signaux de communication
CN201310552767.0A CN103595666B (zh) 2013-10-04 2013-11-07 用于检测通信信号中的符号的方法、设备

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
EP13187322.6A EP2858285B1 (fr) 2013-10-04 2013-10-04 Procédé de détection de symboles dans des signaux de communication

Publications (2)

Publication Number Publication Date
EP2858285A1 true EP2858285A1 (fr) 2015-04-08
EP2858285B1 EP2858285B1 (fr) 2018-01-10

Family

ID=49303810

Family Applications (1)

Application Number Title Priority Date Filing Date
EP13187322.6A Active EP2858285B1 (fr) 2013-10-04 2013-10-04 Procédé de détection de symboles dans des signaux de communication

Country Status (2)

Country Link
EP (1) EP2858285B1 (fr)
CN (1) CN103595666B (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10809648B2 (en) 2013-03-15 2020-10-20 Ricoh Company, Ltd. Powder container

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101494462B (zh) * 2009-03-03 2012-02-22 东南大学 Rs乘积码级联卷积码***的迭代译码方法

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101056161A (zh) * 2006-04-10 2007-10-17 上海无线通信研究中心 一种可降低复杂度的软入软出检测方法
CN101841339B (zh) * 2009-03-17 2015-05-06 电信科学技术研究院 一种编码器、译码器及编码、译码方法

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101494462B (zh) * 2009-03-03 2012-02-22 东南大学 Rs乘积码级联卷积码***的迭代译码方法

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
COLAVOLPE, AND A.: "On MAP symbol detection for ISI channels using the observation Letters", IEEE, vol. 9, August 2005 (2005-08-01), pages 722
F. RUSEK; A. PRLJA: "Optimal channel shortening for MIMO and ISI channels", IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, February 2012 (2012-02-01)
FREDRIK RUSEK ET AL: "Optimal Channel Shortening for MIMO and ISI Channels", IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, IEEE SERVICE CENTER, PISCATAWAY, NJ, US, vol. 11, no. 2, 1 February 2012 (2012-02-01), pages 810 - 818, XP011414997, ISSN: 1536-1276, DOI: 10.1109/TWC.2011.121911.110809 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10809648B2 (en) 2013-03-15 2020-10-20 Ricoh Company, Ltd. Powder container

Also Published As

Publication number Publication date
CN103595666B (zh) 2016-09-28
EP2858285B1 (fr) 2018-01-10
CN103595666A (zh) 2014-02-19

Similar Documents

Publication Publication Date Title
US9071316B2 (en) Method for detection of symbols in communication signals
US7583763B2 (en) Multi input multi output wireless communication reception method and apparatus
US6757337B2 (en) Coding-assisted MIMO joint detection and decoding
US8345784B2 (en) Reduced-complexity equalization with sphere decoding
US20070121753A1 (en) Wireless communications apparatus
EP1912371A2 (fr) Appareil de communication sans fil
CN108353046B (zh) 用于顺序解码器的预期终止
US7848440B2 (en) Multi-channel communication method and apparatus using plural Markov Chain Monte Carlo simulations
US10484133B2 (en) Methods and systems for decoding a data signal based on the generation of a decoding tree
EP1895730A1 (fr) Génération de décisions douces dans un système MIMO à réduction de réseau
EP3633944B1 (fr) Procédé et appareil de traitement de signal avec les réseaux de neurones
US8139669B2 (en) Space domain filter detecting method in a multi-antenna wireless communication system
EP1912396A2 (fr) Appareil de communication sans fil
EP2961080B1 (fr) Procédé pour exécuter une réduction en treillis Lenstra-Lenstra-Lovasz
US8442103B2 (en) Method and system for processing a signal in a communication system
EP2858285B1 (fr) Procédé de détection de symboles dans des signaux de communication
Miranda et al. Avoiding divergence in the Shalvi–Weinstein algorithm
Bakulin et al. Low-complexity iterative MIMO detection based on turbo-MMSE algorithm
US9787433B2 (en) Demodulation technique
US6693568B2 (en) Apparatus, and an associated method, for detecting digital data using MLSE detection with a dynamically-sized trellis
Hu et al. On the design of channel shortening demodulators for iterative receivers in MIMO and ISI channels
Hansen et al. On sphere detection and minimum-phase prefiltered reduced-state sequence estimation
KR20090012955A (ko) 다중 입력 다중 출력 통신 시스템에서 다중 안테나 사용이득 증가 장치 및 방법

Legal Events

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

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20131004

AK Designated contracting states

Kind code of ref document: A1

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

AX Request for extension of the european patent

Extension state: BA ME

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

Free format text: STATUS: EXAMINATION IS IN PROGRESS

17Q First examination report despatched

Effective date: 20161125

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

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

Free format text: STATUS: GRANT OF PATENT IS INTENDED

INTG Intention to grant announced

Effective date: 20170719

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

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

Free format text: STATUS: THE PATENT HAS BEEN GRANTED

AK Designated contracting states

Kind code of ref document: B1

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

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

Ref country code: AT

Ref legal event code: REF

Ref document number: 963530

Country of ref document: AT

Kind code of ref document: T

Effective date: 20180115

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602013031887

Country of ref document: DE

REG Reference to a national code

Ref country code: NL

Ref legal event code: MP

Effective date: 20180110

REG Reference to a national code

Ref country code: AT

Ref legal event code: MK05

Ref document number: 963530

Country of ref document: AT

Kind code of ref document: T

Effective date: 20180110

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: NL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180110

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: ES

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180110

Ref country code: CY

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180110

Ref country code: LT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180110

Ref country code: FI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180110

Ref country code: HR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180110

Ref country code: NO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180410

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: AT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180110

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180411

Ref country code: BG

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180410

Ref country code: PL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180110

Ref country code: RS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180110

Ref country code: LV

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180110

Ref country code: SE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180110

Ref country code: IS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180510

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 6

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602013031887

Country of ref document: DE

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: RO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180110

Ref country code: AL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180110

Ref country code: IT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180110

Ref country code: EE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180110

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

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

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: DK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180110

Ref country code: SM

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180110

Ref country code: CZ

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180110

Ref country code: SK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180110

26N No opposition filed

Effective date: 20181011

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180110

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

REG Reference to a national code

Ref country code: BE

Ref legal event code: MM

Effective date: 20181031

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LU

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20181004

Ref country code: MC

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180110

REG Reference to a national code

Ref country code: IE

Ref legal event code: MM4A

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: BE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20181031

Ref country code: LI

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20181031

Ref country code: CH

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20181031

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20181004

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MT

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20181004

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: TR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180110

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: PT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180110

Ref country code: HU

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT; INVALID AB INITIO

Effective date: 20131004

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MK

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20180110

REG Reference to a national code

Ref country code: DE

Ref legal event code: R081

Ref document number: 602013031887

Country of ref document: DE

Owner name: HONOR DEVICE CO., LTD., SHENZHEN, CN

Free format text: FORMER OWNER: HUAWEI TECHNOLOGIES CO., LTD., SHEN ZHEN, GUANGDONG, CN

REG Reference to a national code

Ref country code: GB

Ref legal event code: 732E

Free format text: REGISTERED BETWEEN 20210812 AND 20210818

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20230831

Year of fee payment: 11

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FR

Payment date: 20230911

Year of fee payment: 11

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20230830

Year of fee payment: 11