知搜-全球专利检索

  1. 登录
  2. 注册

搜索结果

18 条记录 (耗时 0.021 秒)

    Decoding method for tail-biting convolutional codes using a search depth viterbi algorithm
    1.
    发明授权
    Decoding method for tail-biting convolutional codes using a search depth viterbi algorithm 有权
    使用搜索深度维特比算法解码卷积码的解码方法

    公开(公告)号：US08136023B2

    公开(公告)日：2012-03-13

    申请号：US12945661

    申请日：2010-11-12

    申请人： Wuxian Shi ,  Juan Du ,  Yiqun Ge ,  Guobin Sun

    发明人： Wuxian Shi ,  Juan Du ,  Yiqun Ge ,  Guobin Sun

    IPC分类号： H03M13/03

    CPC分类号： H03M13/3938 ,  H03M13/413 ,  H03M13/6362 ,  H03M13/6502 ,  H03M13/6505 ,  H04L1/0054 ,  H04L1/0059

    摘要： A method for decoding tail-biting convolutional codes. The method includes initializing a correction depth, selecting a first starting state from a set of encoding states, and initializing a metric value for the selected starting state as zero and the other states as infinity. The input bit stream is read and a Search Depth Viterbi algorithm (SDVA) is performed to determine path metrics and identify a minimum-metric path. The ending state for the minimum-metric path is determined and the output for this ending state is identified as “previous output.” A second starting state is set to the ending state of the minimum-metric path, and symbols equal to the correction depth from the previous output are read. The SDVA is performed on the second set of read symbols to generate a corrected output. A decoded output is generated by replacing symbols at the beginning of the previous output with the corrected output.

    摘要翻译： 一种用于解码尾巴卷积码的方法。 该方法包括初始化校正深度，从一组编码状态中选择第一起始状态，以及将所选择的起始状态的度量值初始化为零，将其他状态初始化为无穷大。 读取输入比特流，执行搜索深度维特比算法（SDVA）以确定路径度量并识别最小度量路径。 确定最小度量路径的结束状态，并将该结束状态的输出识别为“先前输出”。将第二起始状态设置为最小度量路径的结束状态，等于校正深度的符号 从以前的输出读取。 在第二组读符号上执行SDVA以产生校正输出。 通过使用校正输出替换先前输出开始处的符号来产生解码输出。

    Low complexity decoding algorithm for tail-biting convolutional codes
    2.
    发明授权
    Low complexity decoding algorithm for tail-biting convolutional codes 有权
    用于尾部卷积码的低复杂度解码算法

    公开(公告)号：US08397148B2

    公开(公告)日：2013-03-12

    申请号：US13368190

    申请日：2012-02-07

    申请人： Wuxian Shi ,  Juan Du ,  Yiqun Ge ,  Guobin Sun

    发明人： Wuxian Shi ,  Juan Du ,  Yiqun Ge ,  Guobin Sun

    IPC分类号： H03M13/03

    CPC分类号： H03M13/3938 ,  H03M13/413 ,  H03M13/6362 ,  H03M13/6502 ,  H03M13/6505 ,  H04L1/0054 ,  H04L1/0059

    摘要： A method for decoding tail-biting convolutional codes. The method includes initializing a correction depth, selecting a first starting state from a set of encoding states, and initializing a metric value for the selected starting state as zero and the other states as infinity. The input bit stream is read and a Search Depth Viterbi algorithm (SDVA) is performed to determine path metrics and identify a minimum-metric path. The ending state for the minimum-metric path is determined and the output for this ending state is identified as “previous output.” A second starting state is set to the ending state of the minimum-metric path, and symbols equal to the correction depth from the previous output are read. The SDVA is performed on the second set of read symbols to generate a corrected output. A decoded output is generated by replacing symbols at the beginning of the previous output with the corrected output.

    摘要翻译： 一种用于解码尾巴卷积码的方法。 该方法包括初始化校正深度，从一组编码状态中选择第一起始状态，以及将所选择的起始状态的度量值初始化为零，将其他状态初始化为无穷大。 读取输入比特流，执行搜索深度维特比算法（SDVA）以确定路径度量并识别最小度量路径。 确定最小度量路径的结束状态，将该结束状态的输出识别为先前的输出。 第二起始状态被设置为最小度量路径的结束状态，并且读取等于来自先前输出的校正深度的符号。 在第二组读符号上执行SDVA以产生校正输出。 通过使用校正输出替换先前输出开始处的符号来产生解码输出。

    Decoding method for tail-biting convolutional codes using a search depth viterbi algorithm
    3.
    发明授权
    Decoding method for tail-biting convolutional codes using a search depth viterbi algorithm 有权
    使用搜索深度维特比算法解码卷积码的解码方法

    公开(公告)号：US07856591B2

    公开(公告)日：2010-12-21

    申请号：US11687543

    申请日：2007-03-16

    申请人： Wuxian Shi ,  Juan Du ,  Yiqun Ge ,  Guobin Sun

    发明人： Wuxian Shi ,  Juan Du ,  Yiqun Ge ,  Guobin Sun

    IPC分类号： H03M13/03

    CPC分类号： H03M13/3938 ,  H03M13/413 ,  H03M13/6362 ,  H03M13/6502 ,  H03M13/6505 ,  H04L1/0054 ,  H04L1/0059

    摘要： A method for decoding tail-biting convolutional codes. The method includes initializing a correction depth, selecting a first starting state from a set of encoding states, and initializing a metric value for the selected starting state as zero and the other states as infinity. The input bit stream is read and a Search Depth Viterbi algorithm (SDVA) is performed to determine path metrics and identify a minimum-metric path. The ending state for the minimum-metric path is determined and the output for this ending state is identified as “previous output.” A second starting state is set to the ending state of the minimum-metric path, and symbols equal to the correction depth from the previous output are read. The SDVA is performed on the second set of read symbols to generate a corrected output. A decoded output is generated by replacing symbols at the beginning of the previous output with the corrected output.

    摘要翻译： 一种用于解码尾巴卷积码的方法。 该方法包括初始化校正深度，从一组编码状态中选择第一起始状态，以及将所选择的起始状态的度量值初始化为零，将其他状态初始化为无穷大。 读取输入比特流，执行搜索深度维特比算法（SDVA）以确定路径度量并识别最小度量路径。 确定最小度量路径的结束状态，并将该结束状态的输出识别为“先前输出”。将第二起始状态设置为最小度量路径的结束状态，等于校正深度的符号 从以前的输出读取。 在第二组读符号上执行SDVA以产生校正输出。 通过使用校正输出替换先前输出开始处的符号来产生解码输出。

    DECODING METHOD FOR TAIL-BITING CONVOLUTIONAL CODES USING A SEARCH DEPTH VITERBI ALGORITHM
    4.
    发明申请
    DECODING METHOD FOR TAIL-BITING CONVOLUTIONAL CODES USING A SEARCH DEPTH VITERBI ALGORITHM 有权
    使用搜索深度维特比算法解码转换代码的解码方法

    公开(公告)号：US20110060972A1

    公开(公告)日：2011-03-10

    申请号：US12945661

    申请日：2010-11-12

    申请人： Wuxian Shi ,  Juan Du ,  Yiqun Ge ,  Gobin Sun

    发明人： Wuxian Shi ,  Juan Du ,  Yiqun Ge ,  Gobin Sun

    IPC分类号： H03M13/23 ,  G06F11/10 ,  H03M13/41

    CPC分类号： H03M13/3938 ,  H03M13/413 ,  H03M13/6362 ,  H03M13/6502 ,  H03M13/6505 ,  H04L1/0054 ,  H04L1/0059

    摘要： A method for decoding tail-biting convolutional codes. The method includes initializing a correction depth, selecting a first starting state from a set of encoding states, and initializing a metric value for the selected starting state as zero and the other states as infinity. The input bit stream is read and a Search Depth Viterbi algorithm (SDVA) is performed to determine path metrics and identify a minimum-metric path. The ending state for the minimum-metric path is determined and the output for this ending state is identified as “previous output.” A second starting state is set to the ending state of the minimum-metric path, and symbols equal to the correction depth from the previous output are read. The SDVA is performed on the second set of read symbols to generate a corrected output. A decoded output is generated by replacing symbols at the beginning of the previous output with the corrected output.

    摘要翻译： 一种用于解码尾巴卷积码的方法。 该方法包括初始化校正深度，从一组编码状态中选择第一起始状态，以及将所选择的起始状态的度量值初始化为零，将其他状态初始化为无穷大。 读取输入比特流，执行搜索深度维特比算法（SDVA）以确定路径度量并识别最小度量路径。 确定最小度量路径的结束状态，并将该结束状态的输出识别为“先前输出”。将第二起始状态设置为最小度量路径的结束状态，等于校正深度的符号 从以前的输出读取。 在第二组读符号上执行SDVA以产生校正输出。 通过使用校正输出替换先前输出开始处的符号来产生解码输出。

    Time and frequency synchronization method for OFDMA uplink receivers and base stations
    5.
    发明授权
    Time and frequency synchronization method for OFDMA uplink receivers and base stations 有权
    OFDMA上行接收机和基站的时频同步方法

    公开(公告)号：US08514774B2

    公开(公告)日：2013-08-20

    申请号：US11676914

    申请日：2007-02-20

    申请人： Yiqun Ge ,  Wuxian Shi ,  Juan Du

    发明人： Yiqun Ge ,  Wuxian Shi ,  Juan Du

    IPC分类号： H04B7/212 ,  H04B7/19 ,  H04B1/00 ,  H04W4/00

    CPC分类号： H04L27/2657 ,  H04L27/2662 ,  H04L27/2684 ,  H04L27/2691

    摘要： A method, and components for performing such method, is provided for synchronizing multiple user signals in a multi-user communication system. An interference matrix is generated based on time delay and frequency offset information for the active users accessing an OFDMA uplink receiver. User signals are received from the active users and are segmented into blocks, and the interference matrix is applied to each of the blocks. The received user signal is OFDM demodulated and un-used sub-carriers are discarded. Typically, the method includes also applying a factorization matrix formed by factoring a correction matrix created from the interference matrix and an inverse matrix formed based on the factoring results to the user signal blocks, e.g., the correction step includes multiplying each of the blocks from the user signal by each of these three matrices. The corrected user blocks are then concatenated to form a corrected vector signal.

    摘要翻译： 提供一种用于执行这种方法的方法和用于在多用户通信系统中同步多个用户信号的组件。 基于用于访问OFDMA上行链路接收机的活动用户的时间延迟和频率偏移信息生成干扰矩阵。 从活动用户接收用户信号，并将其分割为块，并且将干扰矩阵应用于每个块。 接收到的用户信号是OFDM解调的，未使用的子载波被丢弃。 通常，该方法还包括应用通过将从干扰矩阵产生的校正矩阵分解而形成的分解矩阵和基于因子分解结果形成的逆矩阵到用户信号块，例如，校正步骤包括将来自 用户信号通过这三个矩阵中的每一个。 校正的用户块然后被级联以形成校正的矢量信号。

    TIME AND FREQUENCY SYNCHRONIZATION METHOD FOR OFDMA UPLINK RECEIVERS AND BASE STATIONS
    6.
    发明申请
    TIME AND FREQUENCY SYNCHRONIZATION METHOD FOR OFDMA UPLINK RECEIVERS AND BASE STATIONS 有权
    OFDMA上网接收者和基站的时间和频率同步方法

    公开(公告)号：US20070202903A1

    公开(公告)日：2007-08-30

    申请号：US11676914

    申请日：2007-02-20

    申请人： Yiqun Ge ,  Wuxian Shi ,  Juan Du

    发明人： Yiqun Ge ,  Wuxian Shi ,  Juan Du

    IPC分类号： H04B7/00

    CPC分类号： H04L27/2657 ,  H04L27/2662 ,  H04L27/2684 ,  H04L27/2691

    摘要： A method, and components for performing such method, is provided for synchronizing multiple user signals in a multi-user communication system. An interference matrix is generated based on time delay and frequency offset information for the active users accessing an OFDMA uplink receiver. User signals are received from the active users and are segmented into blocks, and the interference matrix is applied to each of the blocks. The received user signal is OFDM demodulated and un-used sub-carriers are discarded. Typically, the method includes also applying a factorization matrix formed by factoring a correction matrix created from the interference matrix and an inverse matrix formed based on the factoring results to the user signal blocks, e.g., the correction step includes multiplying each of the blocks from the user signal by each of these three matrices. The corrected user blocks are then concatenated to form a corrected vector signal.

    摘要翻译： 提供一种用于执行这种方法的方法和用于在多用户通信系统中同步多个用户信号的组件。 基于用于访问OFDMA上行链路接收机的活动用户的时间延迟和频率偏移信息生成干扰矩阵。 从活动用户接收用户信号，并将其分割为块，并且将干扰矩阵应用于每个块。 接收到的用户信号是OFDM解调的，未使用的子载波被丢弃。 通常，该方法还包括应用通过将从干扰矩阵产生的校正矩阵分解而形成的分解矩阵和基于因子分解结果形成的逆矩阵到用户信号块，例如，校正步骤包括将来自 用户信号通过这三个矩阵中的每一个。 校正的用户块然后被级联以形成校正的矢量信号。

    LOW COMPLEXITY DECODING ALGORITHM FOR TAIL-BITING CONVOLUTIONAL CODES
    7.
    发明申请
    LOW COMPLEXITY DECODING ALGORITHM FOR TAIL-BITING CONVOLUTIONAL CODES 有权
    用于尾随位移代码的低复杂度解码算法

    公开(公告)号：US20120137198A1

    公开(公告)日：2012-05-31

    申请号：US13368190

    申请日：2012-02-07

    申请人： Wuxian Shi ,  Juan Du ,  Yigun Ge ,  Guobin Sun

    发明人： Wuxian Shi ,  Juan Du ,  Yigun Ge ,  Guobin Sun

    IPC分类号： H03M13/23 ,  G06F11/10 ,  H03M13/41

    CPC分类号： H03M13/3938 ,  H03M13/413 ,  H03M13/6362 ,  H03M13/6502 ,  H03M13/6505 ,  H04L1/0054 ,  H04L1/0059

    摘要： A method for decoding tail-biting convolutional codes. The method includes initializing a correction depth, selecting a first starting state from a set of encoding states, and initializing a metric value for the selected starting state as zero and the other states as infinity. The input bit stream is read and a Search Depth Viterbi algorithm (SDVA) is performed to determine path metrics and identify a minimum-metric path. The ending state for the minimum-metric path is determined and the output for this ending state is identified as “previous output.” A second starting state is set to the ending state of the minimum-metric path, and symbols equal to the correction depth from the previous output are read. The SDVA is performed on the second set of read symbols to generate a corrected output. A decoded output is generated by replacing symbols at the beginning of the previous output with the corrected output.

    摘要翻译： 一种用于解码尾巴卷积码的方法。 该方法包括初始化校正深度，从一组编码状态中选择第一起始状态，以及将所选择的起始状态的度量值初始化为零，将其他状态初始化为无穷大。 读取输入比特流，执行搜索深度维特比算法（SDVA）以确定路径度量并识别最小度量路径。 确定最小度量路径的结束状态，并将该结束状态的输出识别为“先前输出”。将第二起始状态设置为最小度量路径的结束状态，等于校正深度的符号 从以前的输出读取。 在第二组读符号上执行SDVA以产生校正输出。 通过使用校正输出替换先前输出开始处的符号来产生解码输出。

    HIGHLY AVAILABLE SERVERS
    8.
    发明申请
    HIGHLY AVAILABLE SERVERS 有权
    高可用的服务器

    公开(公告)号：US20130332507A1

    公开(公告)日：2013-12-12

    申请号：US13489965

    申请日：2012-06-06

    申请人： Juan Du ,  Arun K. Iyengar ,  Gong Su

    发明人： Juan Du ,  Arun K. Iyengar ,  Gong Su

    IPC分类号： H04L12/56

    CPC分类号： H04L47/125 ,  H04L69/40

    摘要： Techniques for maintaining high availability servers are disclosed. For example, a method comprises the following steps. One or more client requests are provided to a first server for execution therein. The one or more client requests are also provided to a second server for storage therein. In response to the first server failing, the second server is configured to execute at least one client request of the one or more client requests provided to the first server and the second server that is not properly executed by the first server.

    摘要翻译： 公开了用于维护高可用性服务器的技术。 例如，一种方法包括以下步骤。 一个或多个客户机请求被提供给第一服务器以在其中执行。 一个或多个客户端请求也被提供给第二服务器以便在其中存储。 响应于第一服务器故障，第二服务器被配置为执行提供给第一服务器的一个或多个客户端请求的至少一个客户端请求，以及由第一服务器未正确执行的第二服务器。