The Enhanced Variable Rate Codec (EVRC) is a standard for the Speech Service Option 3 for Wideband Spread Spectrum Digital System, which has been employed in both IS-95 cellular systems and ANSI J-STC-008 PCS (Persona...The Enhanced Variable Rate Codec (EVRC) is a standard for the Speech Service Option 3 for Wideband Spread Spectrum Digital System, which has been employed in both IS-95 cellular systems and ANSI J-STC-008 PCS (Personal Communications Systems). This paper investigated the combination of turbo codes with Unequal Error Protection (UEP) and 16-QAM modulation for EVRC codec of Rate 1 to get power and bandwidth efficient coding scheme. The results show that the UEP system outperforms the Equal Error Protection (EEP) one by 1.45 dB at BER of 10 -5.展开更多
很少有消费电子类产品象 DVD 播放机这样取得巨大的成功。DVD 图像格式通过将卓越的视频质量与多声道音频相结合,使 DVD 播放机成为家庭娱乐的核心。低端 DVD 播放机通常通过 RCA 插口提供两声道模拟音频,并且通过 S/PDIF 或光学连接提...很少有消费电子类产品象 DVD 播放机这样取得巨大的成功。DVD 图像格式通过将卓越的视频质量与多声道音频相结合,使 DVD 播放机成为家庭娱乐的核心。低端 DVD 播放机通常通过 RCA 插口提供两声道模拟音频,并且通过 S/PDIF 或光学连接提供5.1声道压缩数字音频。数字音频输出对非压缩线性PCM 音频采用 IEC60958进行编码,或对压缩音频,展开更多
Side information （SI） is one of the key issues in distributed video coding （DVC） and affects the compression performance of DVC largely. This paper proposes an SI refinement algorithm, in which the Wyner-Ziv （WZ...Side information （SI） is one of the key issues in distributed video coding （DVC） and affects the compression performance of DVC largely. This paper proposes an SI refinement algorithm, in which the Wyner-Ziv （WZ） frame is split into two parts based on checkerboard pattern, and the two parts are encoded independently but decoded sequentially. In the decoding process, the part 1 is first decoded with the initial SI and partially decoded part （PDP） 1 is used to improve the motion vectors （MVs） and SI of both parts. At the next stage, the part 2 is decoded with the improved SI and PDP 2 is used to further refine MVs of the part 2. Then, SI of both parts are further refined. Simulation results show that the proposed algorithm can improve the peak signal to noise ratio （PSNR） by up to 1.43 dB when compared with traditional DVC codec.展开更多
Recently, the 1-bit compressive sensing （1-bit CS） has been studied in the field of sparse signal recovery. Since the amplitude information of sparse signals in 1-bit CS is not available, it is often the support or ...Recently, the 1-bit compressive sensing （1-bit CS） has been studied in the field of sparse signal recovery. Since the amplitude information of sparse signals in 1-bit CS is not available, it is often the support or the sign of a signal that can be exactly recovered with a decoding method. We first show that a necessary assumption （that has been overlooked in the literature） should be made for some existing theories and discussions for 1-bit CS. Without such an assumption, the found solution by some existing decoding algorithms might be inconsistent with 1-bit measurements. This motivates us to pursue a new direction to develop uniform and nonuniform recovery theories for 1-bit CS with a new decoding method which always generates a solution consistent with 1-bit measurements. We focus on an extreme case of 1-bit CS, in which the measurements capture only the sign of the product of a sensing matrix and a signal. We show that the 1-bit CS model can be reformulated equivalently as an t0-minimization problem with linear constraints. This reformulation naturally leads to a new linear-program-based decoding method, referred to as the 1-bit basis pursuit, which is remarkably different from existing formulations. It turns out that the uniqueness condition for the solution of the 1-bit basis pursuit yields the so-called restricted range space property （RRSP） of the transposed sensing matrix. This concept provides a basis to develop sign recovery conditions for sparse signals through 1-bit measurements. We prove that if the sign of a sparse signal can be exactly recovered from 1-bit measurements with 1-bit basis pursuit, then the sensing matrix must admit a certain RRSP, and that if the sensing matrix admits a slightly enhanced RRSP, then the sign of a k-sparse signal can be exactly recovered with 1-bit basis pursuit.展开更多
基金National Natural Science Foundation ofChina( No.6972 5 0 0 1)
文摘The Enhanced Variable Rate Codec (EVRC) is a standard for the Speech Service Option 3 for Wideband Spread Spectrum Digital System, which has been employed in both IS-95 cellular systems and ANSI J-STC-008 PCS (Personal Communications Systems). This paper investigated the combination of turbo codes with Unequal Error Protection (UEP) and 16-QAM modulation for EVRC codec of Rate 1 to get power and bandwidth efficient coding scheme. The results show that the UEP system outperforms the Equal Error Protection (EEP) one by 1.45 dB at BER of 10 -5.
文摘很少有消费电子类产品象 DVD 播放机这样取得巨大的成功。DVD 图像格式通过将卓越的视频质量与多声道音频相结合,使 DVD 播放机成为家庭娱乐的核心。低端 DVD 播放机通常通过 RCA 插口提供两声道模拟音频,并且通过 S/PDIF 或光学连接提供5.1声道压缩数字音频。数字音频输出对非压缩线性PCM 音频采用 IEC60958进行编码,或对压缩音频,
基金Supported by the National Natural Science Foundation of China （ No. 60736043, 60672088） and the National Basic Research Program of China （No. 2009CB32005）.
文摘Side information （SI） is one of the key issues in distributed video coding （DVC） and affects the compression performance of DVC largely. This paper proposes an SI refinement algorithm, in which the Wyner-Ziv （WZ） frame is split into two parts based on checkerboard pattern, and the two parts are encoded independently but decoded sequentially. In the decoding process, the part 1 is first decoded with the initial SI and partially decoded part （PDP） 1 is used to improve the motion vectors （MVs） and SI of both parts. At the next stage, the part 2 is decoded with the improved SI and PDP 2 is used to further refine MVs of the part 2. Then, SI of both parts are further refined. Simulation results show that the proposed algorithm can improve the peak signal to noise ratio （PSNR） by up to 1.43 dB when compared with traditional DVC codec.
基金supported by the Engineering and Physical Sciences Research Council of UK (Grant No. #EP/K00946X/1)
文摘Recently, the 1-bit compressive sensing （1-bit CS） has been studied in the field of sparse signal recovery. Since the amplitude information of sparse signals in 1-bit CS is not available, it is often the support or the sign of a signal that can be exactly recovered with a decoding method. We first show that a necessary assumption （that has been overlooked in the literature） should be made for some existing theories and discussions for 1-bit CS. Without such an assumption, the found solution by some existing decoding algorithms might be inconsistent with 1-bit measurements. This motivates us to pursue a new direction to develop uniform and nonuniform recovery theories for 1-bit CS with a new decoding method which always generates a solution consistent with 1-bit measurements. We focus on an extreme case of 1-bit CS, in which the measurements capture only the sign of the product of a sensing matrix and a signal. We show that the 1-bit CS model can be reformulated equivalently as an t0-minimization problem with linear constraints. This reformulation naturally leads to a new linear-program-based decoding method, referred to as the 1-bit basis pursuit, which is remarkably different from existing formulations. It turns out that the uniqueness condition for the solution of the 1-bit basis pursuit yields the so-called restricted range space property （RRSP） of the transposed sensing matrix. This concept provides a basis to develop sign recovery conditions for sparse signals through 1-bit measurements. We prove that if the sign of a sparse signal can be exactly recovered from 1-bit measurements with 1-bit basis pursuit, then the sensing matrix must admit a certain RRSP, and that if the sensing matrix admits a slightly enhanced RRSP, then the sign of a k-sparse signal can be exactly recovered with 1-bit basis pursuit.
