会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 6. 发明申请
    • Arrangements for encoding and decoding digital data
    • 编码和解码数字数据的安排
    • US20080231479A1
    • 2008-09-25
    • US11725401
    • 2007-03-19
    • Veerendra Bhora
    • Veerendra Bhora
    • H03M7/00
    • H03M13/4123H03M13/413
    • A method for encoding data is disclosed. The method can include receiving a first bit segment (K−1 bits) from a bit stream, storing the first bit segment, initializing an encoder with the first bit segment, start encoding and transmitting from the Kth bit to the end of the appended data stream, and appending the first bit segment (K−1 bits) to the end of the data stream. The disclose arrangements can be similar to tail-biting methods different in that the initial bits are utilized to initialize the encoded as opposed to the tail or last bit as provided by tailbiting methods.
    • 公开了一种编码数据的方法。 该方法可以包括从比特流接收第一比特段(K-1比特),存储第一比特段,初始化具有第一比特段的编码器,开始编码和从第< 位到附加数据流的末尾,并将第一位段(K-1位)附加到数据流的结尾。 公开的布置可以类似于尾巴方法,其不同之处在于,使用初始比特来初始化编码,而不是尾巴或最后一位,如尾巴方法所提供的。
    • 8. 发明授权
    • Arrangements for encoding and decoding digital data
    • 编码和解码数字数据的安排
    • US07992075B2
    • 2011-08-02
    • US11725401
    • 2007-03-19
    • Veerendra Bhora
    • Veerendra Bhora
    • H03M13/03
    • H03M13/4123H03M13/413
    • A method for encoding data is disclosed. The method can include receiving a first bit segment (K−1 bits) from a bit stream, storing the first bit segment, initializing an encoder with the first bit segment, start encoding and transmitting from the Kth bit to the end of the appended data stream, and appending the first bit segment (K−1 bits) to the end of the data stream. The disclose arrangements can be similar to tail-biting methods different in that the initial bits are utilized to initialize the encoded as opposed to the tail or last bit as provided by tailbiting methods.
    • 公开了一种编码数据的方法。 该方法可以包括从比特流接收第一比特段(K-1比特),存储第一比特段,初始化具有第一比特段的编码器,开始编码和从第K比特到附加数据的结尾发送 流,并将第一个位段(K-1位)附加到数据流的末尾。 公开的布置可以类似于尾巴方法,其不同之处在于,使用初始比特来初始化编码,而不是尾巴或最后一位,如尾巴方法所提供的。