Method and apparatus for encoding and decoding data
    11.
    发明专利
    Method and apparatus for encoding and decoding data 有权
    编码和解码数据的方法和装置

    公开(公告)号:JP2008092570A

    公开(公告)日:2008-04-17

    申请号:JP2007252797

    申请日:2007-09-28

    CPC classification number: H03M13/2996 H03M13/2903 H03M13/2957

    Abstract: PROBLEM TO BE SOLVED: To provide a method and apparatus for turbo coding and decoding that appropriately matches a CTB to available FEC block sizes.
    SOLUTION: During operation, a concatenated transport block (CTB) of length X is received and a forward error correction (FEC) block size K
    I is determined from a group of available non-contiguous FEC block sizes between K
    min and K
    max , wherein K
    min ≤K
    I max , and K
    I-1 and K
    I are additionally based on X. The concatenated transport block of length X is segmented into C segments each of size substantially equal to K
    I . An FEC codeword for each of the C segments is determined using FEC block size K
    I , and the C FEC codewords are transmitted over a channel.
    COPYRIGHT: (C)2008,JPO&INPIT

    Abstract translation: 要解决的问题:提供一种用于turbo编码和解码的方法和装置,其将CTB适当地匹配到可用的FEC块大小。 解决方案:在操作期间,接收长度为X的级联传输块(CTB),并且从一组可用的非连续FEC确定前向纠错(FEC)块大小K K 和K 之间的块尺寸,其中K ≤K≤S / SB>和K I-1 和K I 另外基于X.长度为X的级联传输块被分割成C个段,每个段大小基本上等于 ķ。 使用FEC块大小K SB I确定C段中的每一个的FEC码字,并且通过信道发送C FEC码字。 版权所有(C)2008,JPO&INPIT

    SOFT DECISION OUTPUT DECODER FOR CONVOLUTION CODING

    公开(公告)号:JP2001267936A

    公开(公告)日:2001-09-28

    申请号:JP2001033290

    申请日:2001-02-09

    Applicant: MOTOROLA INC

    Abstract: PROBLEM TO BE SOLVED: To provide a soft decision output decoder for convolution coding that decodes a signal expressed in a grating with a block length N divided into windows with a length of L. SOLUTION: The decoding of a signal expressed in a grating with a block length N divided into windows having a length of L includes a step (206) where forward recursions from a point P1 before the first window to the first window are forwardly decoded and a step where reverse recursions from a point P2 after the last window to the last window are reversely decoded so as to define a known state for the first and the last window. The decoding also includes a step (208) where the signal expressed in the window from the known state in the last window until the start point of the window reversely by suing the reverse recursions to decide a reverse recursion state metric set, a step (210) where the the first window until the last point of the window forwardly by using the forward recursions to decide a forward recursion state metric set, and a step (212) a soft output in each state of the window and a branch metric in each state are calculated by using the forward and reverse recursion state metrics to provide an output of a soft output with respect to each state.

    15.
    发明专利
    未知

    公开(公告)号:BRPI0808537A2

    公开(公告)日:2014-08-26

    申请号:BRPI0808537

    申请日:2008-02-22

    Applicant: MOTOROLA INC

    Abstract: A method and apparatus are provided for indicating to a communication unit a plurality of modulation and coding schemes (MCSs) to be utilized for communication. During a first MCS is determined for first resource blocks to be sent to a first remote unit or base station, and a second MCS is determined for a second resource block to be sent to the remote unit or base station. A message is transmitted indicating the first and the second MCS and also indicating the first resource blocks and the second resource block. Finally, a first PDU is transmitted to the remote unit or base station at a first time using the first MCS and the first resource blocks and a second PDU is transmitted to the remote unit or base station at the first time using the second MCS and the second resource block.

    17.
    发明专利
    未知

    公开(公告)号:BRPI0807977A2

    公开(公告)日:2014-06-10

    申请号:BRPI0807977

    申请日:2008-02-13

    Applicant: MOTOROLA INC

    Abstract: A method and apparatus for turbo encoding with a contention-free interleaver is provided herein. During operation an input block of size K′ is received. The original input block and the interleaved input block are encoded to obtain a codeword block, wherein the original input block is interleaved using an interleaver of size K′ and a permutation &pgr;(i)=(f1×i+f2×i2)mod K′, where 0≦̸i≦̸K′−1 is the sequential index of the symbol positions after interleaving, &pgr;(i) is the symbol index before interleaving corresponding to position i, K′ is the interleaver size in symbols, and f1 and f2 are the factors defining the interleaver. The values of K′, f1, f2 are taken from at least one row of a table. The codeword block is transmitted through the channel.

    19.
    发明专利
    未知

    公开(公告)号:BRPI0615079A2

    公开(公告)日:2011-05-03

    申请号:BRPI0615079

    申请日:2006-07-05

    Applicant: MOTOROLA INC

    Abstract: A method for assigning resources to FS and FNS users, for example, in an OFDM wireless communication system 100, including assigning a first frequency resource to at least one FS user during a time interval, wherein the first frequency resource includes at least two near contiguous sub-carriers, and assigning a second frequency resource to at least one FNS user during the same time interval, the second frequency resource includes for each FNS user at least two non-contiguous sub-carriers, wherein the first and second frequency resources are part of a common frequency channel.

Patent Agency Ranking