AUPR680201A0 - Reduced computation for logmap iterative decoding - Google Patents

Reduced computation for logmap iterative decoding

Info

Publication number
AUPR680201A0
AUPR680201A0 AUPR6802A AUPR680201A AUPR680201A0 AU PR680201 A0 AUPR680201 A0 AU PR680201A0 AU PR6802 A AUPR6802 A AU PR6802A AU PR680201 A AUPR680201 A AU PR680201A AU PR680201 A0 AUPR680201 A0 AU PR680201A0
Authority
AU
Australia
Prior art keywords
logmap
iterative decoding
reduced computation
computation
reduced
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.)
Abandoned
Application number
AUPR6802A
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nokia of America Corp
Original Assignee
Lucent Technologies Inc
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 Lucent Technologies Inc filed Critical Lucent Technologies Inc
Priority to AUPR6802A priority Critical patent/AUPR680201A0/en
Publication of AUPR680201A0 publication Critical patent/AUPR680201A0/en
Priority to EP02753430A priority patent/EP1413061A1/en
Priority to PCT/US2002/024538 priority patent/WO2003015289A1/en
Priority to US10/480,135 priority patent/US20040181406A1/en
Priority to KR1020047001641A priority patent/KR100890348B1/en
Priority to JP2003520091A priority patent/JP4195378B2/en
Abandoned legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/23—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using convolutional codes, e.g. unit memory codes
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
    • H03M13/39—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes
    • H03M13/3905—Maximum a posteriori probability [MAP] decoding or approximations thereof based on trellis or lattice decoding, e.g. forward-backward algorithm, log-MAP decoding, max-log-MAP decoding
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/29—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes
    • H03M13/2957—Turbo codes and decoding
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/65—Purpose and implementation aspects
    • H03M13/6502—Reduction of hardware complexity or efficient processing
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/65—Purpose and implementation aspects
    • H03M13/6577—Representation or format of variables, register sizes or word-lengths and quantization
    • H03M13/6591—Truncation, saturation and clamping
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/65—Purpose and implementation aspects
    • H03M13/6577—Representation or format of variables, register sizes or word-lengths and quantization
    • H03M13/6594—Non-linear quantization

Landscapes

  • Physics & Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Nonlinear Science (AREA)
  • Error Detection And Correction (AREA)
  • Detection And Correction Of Errors (AREA)
AUPR6802A 2001-08-03 2001-08-03 Reduced computation for logmap iterative decoding Abandoned AUPR680201A0 (en)

Priority Applications (6)

Application Number Priority Date Filing Date Title
AUPR6802A AUPR680201A0 (en) 2001-08-03 2001-08-03 Reduced computation for logmap iterative decoding
EP02753430A EP1413061A1 (en) 2001-08-03 2002-08-02 Clamping and non linear quantization of extrinsic information in an iterative decoder
PCT/US2002/024538 WO2003015289A1 (en) 2001-08-03 2002-08-02 Clamping and non linear quantization of extrinsic information in an iterative decoder
US10/480,135 US20040181406A1 (en) 2001-08-03 2002-08-02 Clamping and non linear quantization of extrinsic information in an iterative decoder
KR1020047001641A KR100890348B1 (en) 2001-08-03 2002-08-02 A method of iterative decoding, and a decoder
JP2003520091A JP4195378B2 (en) 2001-08-03 2002-08-02 Clamping and nonlinear quantization of external information in an iterative decoder

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
AUPR6802A AUPR680201A0 (en) 2001-08-03 2001-08-03 Reduced computation for logmap iterative decoding

Publications (1)

Publication Number Publication Date
AUPR680201A0 true AUPR680201A0 (en) 2001-08-30

Family

ID=3830758

Family Applications (1)

Application Number Title Priority Date Filing Date
AUPR6802A Abandoned AUPR680201A0 (en) 2001-08-03 2001-08-03 Reduced computation for logmap iterative decoding

Country Status (5)

Country Link
EP (1) EP1413061A1 (en)
JP (1) JP4195378B2 (en)
KR (1) KR100890348B1 (en)
AU (1) AUPR680201A0 (en)
WO (1) WO2003015289A1 (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2007050895A2 (en) * 2005-10-27 2007-05-03 Qualcomm Incorporated A method and apparatus for r-ackch subcarrier allocation in a wireless communcation systems

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE10008064B4 (en) * 2000-02-22 2009-07-02 Siemens Ag Method for adapting the data blocks to be supplied to a turbo-coder and corresponding communication device

Also Published As

Publication number Publication date
JP2004538705A (en) 2004-12-24
EP1413061A1 (en) 2004-04-28
KR20040023710A (en) 2004-03-18
WO2003015289A1 (en) 2003-02-20
KR100890348B1 (en) 2009-03-25
JP4195378B2 (en) 2008-12-10

Similar Documents

Publication Publication Date Title
AU2002225857A1 (en) Stopping criteria for iterative decoding
AU2002242285A1 (en) Interleaver for turbo decoder
AU2003253631A1 (en) Data processor adapted for turbo decoding
EP1265160A3 (en) Data structure
EP1253701A3 (en) Motor
AU2002363129A1 (en) Collaboration-enabled enterprise
AU2003259781A1 (en) Convolutional decoding
AU5126800A (en) Low delay decoding
AU2002356334A1 (en) Positioning system
AU2002344853A1 (en) Abca10 transporter
AU2003259782A1 (en) Noise-adaptive decoding
AU2002317875A1 (en) Catadioptrical reduction lens
AUPR680201A0 (en) Reduced computation for logmap iterative decoding
AU2002318478A1 (en) Zeolite ssz-59
AUPR679301A0 (en) Arrangement for low power turbo decoding
AU2002344498A1 (en) Multimedia data processor
AU2002351428A1 (en) Recording system
AU2002233523A1 (en) Convolutional decoder
AU2002308506A1 (en) Area efficient parallel turbo decoding
AU2002354089A1 (en) Anti kinke
AU2002341696A1 (en) State metric rescaling for viterbi decoding
AU2002314501A1 (en) Pre-paid data services
AU2002257809A1 (en) Low complexity convolutional decoder
AU2003237410A1 (en) Decoding system
AU2002310198A1 (en) Internet metric system