会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明申请
    • Method and system for determining unwrapped phases from noisy two-dimensional wrapped-phase images
    • 用于从噪声二维包裹相图像确定展开相位的方法和系统
    • US20080007450A1
    • 2008-01-10
    • US11482491
    • 2006-07-07
    • Jonathan YedidiaAli AzarbayejaniEmin MartinianYing-Zong Huang
    • Jonathan YedidiaAli AzarbayejaniEmin MartinianYing-Zong Huang
    • G01S13/90
    • G01S13/9035
    • A method converts an input image of noisy wrapped phases to an output image of absolute unwrapped phases. The noisy wrapped phases in the input image are represented as a set of re-wrapped phases and a set of phase shifts. The set of re-wrapped phases are partitioned into a first group and a second group. Integer differences between the phase shifts are optimized while holding the re-wrapped phases fixed. Then, the first group of re-wrapped phases are optimized, while holding the integer differences between the phase shifts, and the second group of re-wrapped phases fixed. The integer differences between the phase shifts are optimized again, while holding the re-wrapped phases fixed. Then, the second group of re-wrapped phases are optimized, while holding the integer differences between the phase shifts, and the first group of re-wrapped phases fixed. The optimizing steps are repeated until the re-wrapped phase converge. Then, the converged re-wrapped phases and integer differences between the phase shifts are output as an output image of absolute unwrapped phases.
    • 一种方法将噪声包裹相位的输入图像转换为绝对展开相位的输出图像。 输入图像中的噪声包裹相位被表示为一组再包裹相位和一组相移。 重新包装阶段的集合被分成第一组和第二组。 优化相移之间的整数差异,同时保持重新包装的相位固定。 然后,优化了第一组重新包装阶段,同时保持相移之间的整数差,而第二组重新包装阶段固定。 相位移之间的整数差再次被优化,同时保持重新包裹的相位固定。 然后,对第二组重新缠绕阶段进行优化,同时保持相移之间的整数差,而第一组再缠绕相固定。 重复优化步骤直到重新缠绕相位收敛。 然后,将相移之间的收敛再包裹相位和整数差值输出为绝对展开相位的输出图像。
    • 6. 发明申请
    • Compressing signals using serially-concatenated accumulate codes
    • 使用串行级联代码压缩信号
    • US20060048038A1
    • 2006-03-02
    • US10928448
    • 2004-08-27
    • Jonathan YedidiaAnthony VetroAshish KhistiDmitry Malioutov
    • Jonathan YedidiaAnthony VetroAshish KhistiDmitry Malioutov
    • H03M13/03
    • H03M7/30H03M13/00H03M13/03H03M13/1194H03M13/19H03M13/6312
    • A method compresses a set of correlated signals by first converting each signal to a sequence of integers, which are further organized as a set of bit-planes. This can be done by signal transformation and quantization. An inverse accumulator is applied to each bit-plane to produce a bit-plane of shifted bits, which are permuted according to a predetermined permutation to produce bit-planes of permuted bits. Each bit-plane of permuted bits is partitioned into a set of blocks of bits. Syndrome bits are generated for each block of bits according to a rate-adaptive base code. Subsequently, the syndrome bits can be decompressed in a decoder to recover the original correlated signals. For each bit-plane of the corresponding signal, a bit probability estimate is generated. Then, the bit-plane is reconstructed using the syndrome bits and the bit probability estimate. The sequence of integers corresponding to all of the bit-planes can then be reconstructed from the bit probability estimates, and the original signal can be recovered from the sequences of integers using an inverse quantization and inverse transform.
    • 一种方法通过首先将每个信号转换成整数序列来压缩一组相关信号,该整数序列进一步被组织为一组位平面。 这可以通过信号变换和量化来完成。 反向累加器被施加到每个位平面以产生位移位的位平面,它们根据预定的排列被排列以产生置换位的位平面。 置换位的每个位平面被划分成一组位块。 根据速率自适应基本码为每个位块产生综合位。 随后,可以在解码器中解压缩校正子位以恢复原始的相关信号。 对于相应信号的每个位平面,产生位概率估计。 然后,使用校正子位和位概率估计来重构位平面。 然后可以从比特概率估计中重构对应于所有比特平面的整数序列,并且可以使用逆量化和逆变换从整数序列中恢复原始信号。
    • 7. 发明授权
    • Quasi-cyclic low-density parity-check codes
    • 准循环低密度奇偶校验码
    • US08595589B2
    • 2013-11-26
    • US13251180
    • 2011-09-30
    • Jonathan YedidiaYige Wang
    • Jonathan YedidiaYige Wang
    • H03M13/00
    • H03M13/116H03M13/1154H03M13/1165
    • A system and a method for determining a quasi-cyclic (QC) low-density parity-check (LDPC) code, such that the QC LDPC code has no trapping sets are disclosed. A set of matrices representing a family of QC LDPC codes are acquired, wherein each QC LDPC code is a tail-biting spatially-coupled code of girth not less than eight, and wherein each column of each matrix in the set has a weight not less than four. Based on a trapping set pattern, a matrix from the set of matrices is selected such that the matrix represents the QC LDPC code with no trapping sets. The matrix can be stored into a memory.
    • 一种用于确定准循环(QC)低密度奇偶校验(LDPC)码的系统和方法,使得QC LDPC码没有捕获集合被公开。 获取表示QC LDPC码族的一组矩阵,其中每个QC LDPC码是周长不小于8的尾巴空间耦合码,并且其中集合中的每个矩阵的每列具有不小于 比四。 基于捕获集合模式,选择来自矩阵集合的矩阵,使得矩阵表示没有陷阱集合的QC LDPC码。 矩阵可以存储到存储器中。