知搜-全球专利检索

  1. 登录
  2. 注册

搜索结果

15 条记录 (耗时 0.016 秒)

    Combined long and short distance wireless communication system and its method
    11.
    发明申请
    Combined long and short distance wireless communication system and its method 审中-公开
    组合长距离和短距离无线通信系统及其方法

    公开(公告)号：US20050064866A1

    公开(公告)日：2005-03-24

    申请号：US10500492

    申请日：2002-12-25

    申请人： Guobin Sun ,  Zifeng Hou

    发明人： Guobin Sun ,  Zifeng Hou

    IPC分类号： H04B7/26 ,  H04L12/28 ,  H04W16/30 ,  H04W16/32 ,  H04W36/02 ,  H04W36/14 ,  H04W36/18 ,  H04W88/06 ,  H04W92/00 ,  H04B7/00 ,  H04M1/00 ,  H04Q7/20

    CPC分类号： H04W36/14 ,  H04W88/06

    摘要： This invention provides a combined long and short distance wireless communication system and method thereof. A dual distance terminal provides subscribers with the long and short distance wireless communication service and guarantees that the service isn't interrupted when switching between different networks occurs. A remote distance base station provides the dual distance terminal with remote distance wireless access. A short distance AP provides the dual distance terminal with short distance wireless access. A dual distance network server connects the remote distance base station and the short distance AP to switch between networks and make the dual distance terminal access the network to which is switched. The present invention enables the dual distance terminal within the coverage of the long and short distance wireless system to communicate with the long distance networks and automatically switch to short distance wireless local area networks (WLAN) when the dual distance terminal enters the short distance WLAN so that seamless switch is achieved. The subscribers having different priority levels access different short distance WLANs with different levels after authority identification.

    摘要翻译： 本发明提供一种组合的长距离和短距离无线通信系统及其方法。 双距离终端为用户提供长距离和短距离无线通信服务，并保证在不同网络之间切换时服务不中断。 远距离基站为双距离终端提供远距离无线接入。 短距离AP为双距离终端提供短距离无线接入。 双距离网络服务器连接远程基站和短距离AP，在网络之间切换，使双路终端接入被切换到的网络。 本发明使长距离和短距离无线系统的覆盖范围内的双距离终端能够与长距离网络通信，并且当双距离终端进入短距离WLAN时自动切换到短距离无线局域网（WLAN） 实现了无缝切换。 具有不同优先级的用户在权限识别之后接入具有不同等级的不同的短距离WLAN。

    LOW COMPLEXITY DECODING ALGORITHM FOR TAIL-BITING CONVOLUTIONAL CODES
    12.
    发明申请
    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以产生校正输出。 通过使用校正输出替换先前输出开始处的符号来产生解码输出。

    Decoding method for tail-biting convolutional codes using a search depth viterbi algorithm
    14.
    发明授权
    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以产生校正输出。 通过使用校正输出替换先前输出开始处的符号来产生解码输出。