The purpose of this paper is to improve allocation of the number of bits without skipping the frame by accurately estimating the target bits in H. 264/AVC rate control. The scheme ImPoses an enhancement method of the ...The purpose of this paper is to improve allocation of the number of bits without skipping the frame by accurately estimating the target bits in H. 264/AVC rate control. The scheme ImPoses an enhancement method of the target frame rate based on H. 264/AVC bit allocation. The enhancement uses a frame complexion estimation to improve the existing Mean Absolute Difference （MAD） complexity measurement. Bit allocation to each frame is not just computed by target frame rote but also adjusted by a combined frame complexity measure. Using the statistical characteristic, the scheme obtains change of occurrence bit about QP to apply the bit amount by QP from the video characteristic and apply it in the estimated bit amount of the current frame. Simulation results show that the proposed rate eontrol scheme achieves time saving of mine than 99% over existing rate control algorithm. Nevertheless, Peak Signal-to-Noise Ration （PSNR） and bit rate were almost the same as the performances.展开更多
Because the partial transmit sequence(PTS) peak-to-average power ratio(PAPR) reduction technology for optical orthogonal frequency division multiplexing(O-OFDM) systems has higher computational complexity, a novel two...Because the partial transmit sequence(PTS) peak-to-average power ratio(PAPR) reduction technology for optical orthogonal frequency division multiplexing(O-OFDM) systems has higher computational complexity, a novel two-stage enhanced-iterative-algorithm PTS(TS-EIA-PTS) PAPR reduction algorithm with lower computational complexity is proposed in this paper. The simulation results show that the proposed TS-EIA-PTS PAPR reduction algorithm can reduce the computational complexity by 18.47% in the condition of the original signal sequence partitioned into 4 sub-blocks at the remaining stage of n-d=5. Furthermore, it has almost the same PAPR reduction performance and the same bit error rate(BER) performance as the EIA-PTS algorithm, and with the increase of the subcarrier number, the computational complexity can be further reduced. As a result, the proposed TS-EIA-PTS PAPR reduction algorithm is more suitable for the practical O-OFDM systems.展开更多
Path length calculation is a frequent requirement in studies related to graph theoretic problems such as genetics. Standard method to calculate average path length （APL） of a graph requires traversing all nodes in t...Path length calculation is a frequent requirement in studies related to graph theoretic problems such as genetics. Standard method to calculate average path length （APL） of a graph requires traversing all nodes in the graph repeatedly, which is computationally expensive for graphs containing large number of nodes. We propose a novel method to calculate APL for graphs commonly required in the studies of genetics. The proposed method is computationally less expensive and less time-consuming compared to standard method.展开更多
文摘The purpose of this paper is to improve allocation of the number of bits without skipping the frame by accurately estimating the target bits in H. 264/AVC rate control. The scheme ImPoses an enhancement method of the target frame rate based on H. 264/AVC bit allocation. The enhancement uses a frame complexion estimation to improve the existing Mean Absolute Difference （MAD） complexity measurement. Bit allocation to each frame is not just computed by target frame rote but also adjusted by a combined frame complexity measure. Using the statistical characteristic, the scheme obtains change of occurrence bit about QP to apply the bit amount by QP from the video characteristic and apply it in the estimated bit amount of the current frame. Simulation results show that the proposed rate eontrol scheme achieves time saving of mine than 99% over existing rate control algorithm. Nevertheless, Peak Signal-to-Noise Ration （PSNR） and bit rate were almost the same as the performances.
基金supported by the National Natural Science Foundation of China(Nos.61472464 and 61471075)the Program for Innovation Team Building at Institutions of Higher Education in Chongqing(No.J2013-46)+1 种基金the Natural Science Foundation of Chongqing Science and Technology Commission(Nos.cstc2015jcyj A0554 and cstc2013jcyj A40017)the Program for Postgraduate Science Research and Innovation of Chongqing University of Posts and Telecommunications(Chongqing Municipal Education Commission)(No.CYS14144)
文摘Because the partial transmit sequence(PTS) peak-to-average power ratio(PAPR) reduction technology for optical orthogonal frequency division multiplexing(O-OFDM) systems has higher computational complexity, a novel two-stage enhanced-iterative-algorithm PTS(TS-EIA-PTS) PAPR reduction algorithm with lower computational complexity is proposed in this paper. The simulation results show that the proposed TS-EIA-PTS PAPR reduction algorithm can reduce the computational complexity by 18.47% in the condition of the original signal sequence partitioned into 4 sub-blocks at the remaining stage of n-d=5. Furthermore, it has almost the same PAPR reduction performance and the same bit error rate(BER) performance as the EIA-PTS algorithm, and with the increase of the subcarrier number, the computational complexity can be further reduced. As a result, the proposed TS-EIA-PTS PAPR reduction algorithm is more suitable for the practical O-OFDM systems.
文摘Path length calculation is a frequent requirement in studies related to graph theoretic problems such as genetics. Standard method to calculate average path length （APL） of a graph requires traversing all nodes in the graph repeatedly, which is computationally expensive for graphs containing large number of nodes. We propose a novel method to calculate APL for graphs commonly required in the studies of genetics. The proposed method is computationally less expensive and less time-consuming compared to standard method.
