blank Quick help
blank Maintenance news

Scheduled maintenance

Regular maintenance outages:
between 05.00 and 05.15 hrs CET (Monday to Sunday).

Other outages
Availability
Register Forum

2022.02.11

More...
blank News flashes

News Flashes

New version of the European Patent Register – SPC proceedings information in the Unitary Patent Register.

2024-07-24

More...
blank Related links

Release notes
European Patent Register Assistant
European Patent Register Resource Book
European Patent Register – pocket guide
FAQ - European Patent Register
FAQ - Register Alert
Federated Register (Flyer)
Global Dossier (Flyer)
Register events
Deep link coverage
Federated Register content
The Patent Information Tour
Fair use charter

Extract from the Register of European Patents

EP About this file: EP2215724

EP2215724 - REDUCED-COMPLEXITY DECODING ALGORITHMS FOR TAIL-BITING CONVOLUTIONAL CODES [Right-click to bookmark this link]
StatusNo opposition filed within time limit
Status updated on  11.10.2019
Database last updated on 24.08.2024
FormerThe patent has been granted
Status updated on  03.12.2018
FormerGrant of patent is intended
Status updated on  31.07.2018
FormerExamination is in progress
Status updated on  17.02.2017
Most recent event   Tooltip23.07.2021Lapse of the patent in a contracting state
New state(s): MT		published on 25.08.2021  [2021/34]
Applicant(s)For all designated states
Telefonaktiebolaget LM Ericsson (publ)
164 83 Stockholm / SE
[2018/49]
Former [2010/32]For all designated states
Telefonaktiebolaget LM Ericsson (publ)
164 83 Stockholm / SE
Inventor(s)01 / CHEN, Tsao-Tsen
Trumslagargatan 7
S-125 34 Älvsjö / SE
02 / TSAI, Shiau-He Shawn
7335 Calle Cristobal Unit 156
San Diego, CA 92126 / US
 [2010/32]
Representative(s)Ericsson
Patent Development
Torshamnsgatan 21-23
164 80 Stockholm / SE
[2018/49]
Former [2010/32]Kühn, Friedrich Heinrich
Ericsson AB Patent Unit LTE Torshamnsgatan 23
164 80 Stockholm / SE
Application number, filing date08841999.920.10.2008
[2010/32]
WO2008SE51176
Priority number, dateUS20070982112P23.10.2007         Original published format: US 982112 P
US2008014095617.06.2008         Original published format: US 140956
[2010/32]
Filing languageEN
Procedural languageEN
PublicationType: A2 Application without search report
No.:WO2009054779
Date:30.04.2009
Language:EN
[2009/18]
Type: A2 Application without search report 
No.:EP2215724
Date:11.08.2010
Language:EN
The application published by WIPO in one of the EPO official languages on 30.04.2009 takes the place of the publication of the European patent application.
[2010/32]
Type: B1 Patent specification 
No.:EP2215724
Date:05.12.2018
Language:EN
[2018/49]
Search report(s)International search report - published on:EP09.07.2009
ClassificationIPC:H03M13/39
[2010/32]
CPC:
H03M13/3938 (EP,US); H03M13/413 (EP,US); H03M13/2996 (EP,US)
Designated contracting statesAT,   BE,   BG,   CH,   CY,   CZ,   DE,   DK,   EE,   ES,   FI,   FR,   GB,   GR,   HR,   HU,   IE,   IS,   IT,   LI,   LT,   LU,   LV,   MC,   MT,   NL,   NO,   PL,   PT,   RO,   SE,   SI,   SK,   TR [2018/49]
Former [2010/32]AT,  BE,  BG,  CH,  CY,  CZ,  DE,  DK,  EE,  ES,  FI,  FR,  GB,  GR,  HR,  HU,  IE,  IS,  IT,  LI,  LT,  LU,  LV,  MC,  MT,  NL,  NO,  PL,  PT,  RO,  SE,  SI,  SK,  TR 
TitleGerman:DEKODIERUNGSALGORITHMEN FÜR TAIL-BIITING FALTUNGSCODES[2018/29]
English:REDUCED-COMPLEXITY DECODING ALGORITHMS FOR TAIL-BITING CONVOLUTIONAL CODES[2010/32]
French:ALGORITHMES DE DÉCODAGE À COMPLEXITÉ RÉDUITE POUR CODES CONVOLUTIONNELS CIRCULAIRES[2010/32]
Former [2010/32]DEKODIERUNGSALGORITHMEN MIT GERINGER KOMPLEXITÄT FÜR TAIL-BITING-FALTUNGSKODES
Entry into regional phase28.04.2010National basic fee paid 
28.04.2010Designation fee(s) paid 
28.04.2010Examination fee paid 
Examination procedure13.08.2009Request for preliminary examination filed
International Preliminary Examining Authority: EP
28.04.2010Examination requested  [2010/32]
01.07.2010Amendment by applicant (claims and/or description)
16.02.2017Despatch of a communication from the examining division (Time limit: M04)
29.05.2017Reply to a communication from the examining division
14.06.2018Date of oral proceedings
26.07.2018Minutes of oral proceedings despatched
01.08.2018Communication of intention to grant the patent
07.09.2018Fee for grant paid
07.09.2018Fee for publishing/printing paid
07.09.2018Receipt of the translation of the claim(s)
Divisional application(s)The date of the Examining Division's first communication in respect of the earliest application for which a communication has been issued is  16.02.2017
Opposition(s)06.09.2019No opposition filed within time limit [2019/46]
Fees paidRenewal fee
25.10.2010Renewal fee patent year 03
25.10.2011Renewal fee patent year 04
25.10.2012Renewal fee patent year 05
28.10.2013Renewal fee patent year 06
27.10.2014Renewal fee patent year 07
27.10.2015Renewal fee patent year 08
27.10.2016Renewal fee patent year 09
27.10.2017Renewal fee patent year 10
29.10.2018Renewal fee patent year 11
Opt-out from the exclusive  Tooltip
competence of the Unified
Patent Court		 See the Register of the Unified Patent Court for opt-out data
Responsibility for the accuracy, completeness or quality of the data displayed under the link provided lies entirely with the Unified Patent Court.
Lapses during opposition  TooltipHU20.10.2008
AT05.12.2018
CY05.12.2018
CZ05.12.2018
DK05.12.2018
EE05.12.2018
ES05.12.2018
FI05.12.2018
HR05.12.2018
IT05.12.2018
LT05.12.2018
LV05.12.2018
MC05.12.2018
MT05.12.2018
NL05.12.2018
PL05.12.2018
RO05.12.2018
SE05.12.2018
SI05.12.2018
SK05.12.2018
TR05.12.2018
BG05.03.2019
NO05.03.2019
GR06.03.2019
IS05.04.2019
PT05.04.2019
[2021/34]
Former [2021/32]HU20.10.2008
AT05.12.2018
CY05.12.2018
CZ05.12.2018
DK05.12.2018
EE05.12.2018
ES05.12.2018
FI05.12.2018
HR05.12.2018
IT05.12.2018
LT05.12.2018
LV05.12.2018
MC05.12.2018
NL05.12.2018
PL05.12.2018
RO05.12.2018
SE05.12.2018
SI05.12.2018
SK05.12.2018
TR05.12.2018
BG05.03.2019
NO05.03.2019
GR06.03.2019
IS05.04.2019
PT05.04.2019
Former [2021/26]AT05.12.2018
CY05.12.2018
CZ05.12.2018
DK05.12.2018
EE05.12.2018
ES05.12.2018
FI05.12.2018
HR05.12.2018
IT05.12.2018
LT05.12.2018
LV05.12.2018
MC05.12.2018
NL05.12.2018
PL05.12.2018
RO05.12.2018
SE05.12.2018
SI05.12.2018
SK05.12.2018
TR05.12.2018
BG05.03.2019
NO05.03.2019
GR06.03.2019
IS05.04.2019
PT05.04.2019
Former [2020/29]AT05.12.2018
CZ05.12.2018
DK05.12.2018
EE05.12.2018
ES05.12.2018
FI05.12.2018
HR05.12.2018
IT05.12.2018
LT05.12.2018
LV05.12.2018
MC05.12.2018
NL05.12.2018
PL05.12.2018
RO05.12.2018
SE05.12.2018
SI05.12.2018
SK05.12.2018
TR05.12.2018
BG05.03.2019
NO05.03.2019
GR06.03.2019
IS05.04.2019
PT05.04.2019
Former [2020/17]AT05.12.2018
CZ05.12.2018
DK05.12.2018
EE05.12.2018
ES05.12.2018
FI05.12.2018
HR05.12.2018
IT05.12.2018
LT05.12.2018
LV05.12.2018
NL05.12.2018
PL05.12.2018
RO05.12.2018
SE05.12.2018
SI05.12.2018
SK05.12.2018
TR05.12.2018
BG05.03.2019
NO05.03.2019
GR06.03.2019
IS05.04.2019
PT05.04.2019
Former [2019/50]AT05.12.2018
CZ05.12.2018
DK05.12.2018
EE05.12.2018
ES05.12.2018
FI05.12.2018
HR05.12.2018
IT05.12.2018
LT05.12.2018
LV05.12.2018
NL05.12.2018
PL05.12.2018
RO05.12.2018
SE05.12.2018
SI05.12.2018
SK05.12.2018
BG05.03.2019
NO05.03.2019
GR06.03.2019
IS05.04.2019
PT05.04.2019
Former [2019/48]AT05.12.2018
CZ05.12.2018
DK05.12.2018
EE05.12.2018
ES05.12.2018
FI05.12.2018
HR05.12.2018
IT05.12.2018
LT05.12.2018
LV05.12.2018
NL05.12.2018
PL05.12.2018
RO05.12.2018
SE05.12.2018
SK05.12.2018
BG05.03.2019
NO05.03.2019
GR06.03.2019
IS05.04.2019
PT05.04.2019
Former [2019/39]AT05.12.2018
CZ05.12.2018
EE05.12.2018
ES05.12.2018
FI05.12.2018
HR05.12.2018
IT05.12.2018
LT05.12.2018
LV05.12.2018
NL05.12.2018
PL05.12.2018
RO05.12.2018
SE05.12.2018
SK05.12.2018
BG05.03.2019
NO05.03.2019
GR06.03.2019
IS05.04.2019
PT05.04.2019
Former [2019/37]AT05.12.2018
CZ05.12.2018
EE05.12.2018
ES05.12.2018
FI05.12.2018
HR05.12.2018
IT05.12.2018
LT05.12.2018
LV05.12.2018
NL05.12.2018
PL05.12.2018
RO05.12.2018
SE05.12.2018
BG05.03.2019
NO05.03.2019
GR06.03.2019
PT05.04.2019
Former [2019/35]AT05.12.2018
CZ05.12.2018
ES05.12.2018
FI05.12.2018
HR05.12.2018
IT05.12.2018
LT05.12.2018
LV05.12.2018
NL05.12.2018
PL05.12.2018
SE05.12.2018
BG05.03.2019
NO05.03.2019
GR06.03.2019
PT05.04.2019
Former [2019/34]AT05.12.2018
ES05.12.2018
FI05.12.2018
HR05.12.2018
IT05.12.2018
LT05.12.2018
LV05.12.2018
NL05.12.2018
SE05.12.2018
BG05.03.2019
NO05.03.2019
GR06.03.2019
PT05.04.2019
Former [2019/33]AT05.12.2018
ES05.12.2018
FI05.12.2018
HR05.12.2018
LT05.12.2018
LV05.12.2018
NL05.12.2018
SE05.12.2018
BG05.03.2019
NO05.03.2019
GR06.03.2019
PT05.04.2019
Former [2019/30]AT05.12.2018
ES05.12.2018
FI05.12.2018
HR05.12.2018
LT05.12.2018
LV05.12.2018
NL05.12.2018
SE05.12.2018
BG05.03.2019
NO05.03.2019
GR06.03.2019
Former [2019/24]AT05.12.2018
ES05.12.2018
FI05.12.2018
HR05.12.2018
LT05.12.2018
LV05.12.2018
SE05.12.2018
BG05.03.2019
NO05.03.2019
GR06.03.2019
Former [2019/23]AT05.12.2018
ES05.12.2018
FI05.12.2018
HR05.12.2018
LT05.12.2018
LV05.12.2018
BG05.03.2019
NO05.03.2019
Former [2019/22]FI05.12.2018
LT05.12.2018
BG05.03.2019
NO05.03.2019
Former [2019/21]FI05.12.2018
LT05.12.2018
NO05.03.2019
Former [2019/20]LT05.12.2018
NO05.03.2019
Cited inInternational search[X]  - ROSE Y SHAO ET AL, "Two Decoding Algorithms for Tailbiting Codes", IEEE TRANSACTIONS ON COMMUNICATIONS, IEEE SERVICE CENTER, PISCATAWAY, NJ, US, (20031001), vol. 51, no. 10, ISSN 0090-6778, pages 1658 - 1664, XP002476332 [X] 1-11 * the whole document *

DOI:   http://dx.doi.org/10.1109/TCOMM.2003.818084
 [PX]  - TSAO-TSEN CHEN ET AL, "Reduced-complexity wrap-around Viterbi algorithm for decoding tail-biting convolutional codes", WIRELESS CONFERENCE, 2008. EW 2008. 14TH EUROPEAN, IEEE, PISCATAWAY, NJ, USA, (20080622), ISBN 978-3-8007-3102-2, pages 1 - 6, XP031320010 [PX] 1-11 * the whole document *
The EPO accepts no responsibility for the accuracy of data originating from other authorities; in particular, it does not guarantee that it is complete, up to date or fit for specific purposes.