• Progress in Superconductivity
• /
• v.7 no.1
• /
• pp.36-40
• /
• 2005

The problem of fluctuation-induced digital errors in a rapid single flux quantum (RSFQ) circuit has been a very important issue. In this work, we calculated the bit error rate of an RSFQ switch used in superconductive arithmetic logic unit (ALU). RSFQ switch should have a very low error rate in the optimal bias. Theoretical estimates of the RSFQ error rate are on the order of $10^{-50}$ per bit operation. In this experiment, we prepared two identical circuits placed in parallel. Each circuit was composed of 10 Josephson transmission lines (JTLs) connected in series with an RSFQ switch placed in the middle of the 10 JTLs. We used a splitter to feed the same input signal to both circuits. The outputs of the two circuits were compared with an RSFQ exclusive OR (XOR) to measure the bit error rate of the RSFQ switch. By using a computerized bit-error-rate test setup, we measured the bit error rate of $2.18{\times}10^{-12}$ when the bias to the RSFQ switch was 0.398 mA that was quite off from the optimum bias of 0.6 mA.

• Journal of the Institute of Convergence Signal Processing
• /
• v.2 no.3
• /
• pp.9-15
• /
• 2001

Very low bit rate video coding uses the inter-picture video coding method for high compression. The inter-picture video coding is coded based on the information of the previous frames so any packet loss can lead to reduce the image quality on the transmission. In this paper, we proposed the multi-stream generation method for inter-media synchronization of very low bit rate video based on TCP for reliable transmission. The proposed approach performs a reliable transmission via a TCP based protocol. This method incorporates multi-streams in order to enhance the robustness of delivery and can withstand against network jitter. Moreover, the client bandwidths are fully utilized in a highly efficient way.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.11
• /
• pp.102-113
• /
• 1997

In this paepr, a new image segmentation method reducing efficiently contour information causing bottleneck problem at segmentatio-based very low bit rate codingis proposed, while preserving objective and subjective quality. It consists of 4-level hierarchical image segmentation based on mathematical morphology and 1-leve region merging structure using contast of two adjacent regions. For two adjacent region pairs at the fourth level included in each region of the thid level, contrast is calculated. Among the pairs of two adjacent regions with less value than threshold, two adjacent regions having the minimum contrast are merged first. After region merging, texture of the merged region is updated. The procedure is performed recursively for all the adjacent region pairs at the fourth level included in each region of the third level. Compared with the previous method, the objective and subjective image qualities are similar. But it reduces 46.65% texture information on the average by decreasing total region number to be tansmitted. Specially, it shows reduction of the 23.95% contour information of the average. Thus, it can improve efficiently the bottleneck problem at segementation-based very low bit rate coding.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.4
• /
• pp.761-771
• /
• 1994

This paper focuses on how spectrum information can be represented efficiently in a very low bit rate CELP speech coder. To achieve the goal, an LPC cepstral coefficients VQ scheme representing the spectrum information in a CELP coder is proposed. To represent the spectrum information using LPC cepstrums, three different cepstral distance measures having different spectral meanings in the frequency domain are considered, and their performances are compared and analyzed. The experimental results show that spectrum information in low bit rate CELP coders can be represented very efficiently using the proposed LPC cepstral vector quantization scheme.

• Progress in Superconductivity and Cryogenics
• /
• v.7 no.1
• /
• pp.21-24
• /
• 2005

The problem of fluctuation-induced digital errors in a rapid single flux quantum (RSFQ) circuit has been very important issue. So in this experiment, we calculated error rate of RSFQ switch in superconductiyity ALU, The RSFQ switch should have a very low error rate in the optimal bias. We prepared two circuits Placed in parallel. One was a 10 Josephson transmission lines (JTLs) connected in series, and the other was the same circuit but with an RSFQ switch placed in the middle of the 10 JTLs. We used a splitter to feed the same input signal to the both circuits. The outputs of the two circuits were compared with an RSFQ XOR to measure the error rate of the RSFQ switch. By using a computerized bit error rate test setup, we measured the bit error rate of 2.18$\times$$10^{12}$ when the bias to the RSFQ switch was 0.398mh that was quite off from the optimum bias of 0.6mA.

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.900-903
• /
• 2002

This paper proposes the use of wavelet packet transform in a transform based video coding scheme, which is mainly used in low/very low bit-rate video coding schemes i.e. H.263 standard. In the experiments, the discrete cosine transform in the video coding scheme is replaced by the wavelet packet transform, and the improved performance in term of peak signal to noise ratio is measured and compared with the results obtained from the coding scheme implementing the ordinary wavelet transform. The experimental results show an impressive improvement obtained from the use of wavelet packet transform.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.12A
• /
• pp.2085-2091
• /
• 2001

In lossy compression method, the transformed coefficients are quantized. This results in the quantization noise. The video image quality and bit rate is closely related with the quantization step. In this paper, we proposed a new quantization function for the improved performance. The DC value of each macroblock is compensated depending on the magnitude of DC quantization error. It is implemented very low bit-rate video coding, i.e., H.26L. The experimental result is useful when the object motion is not severe.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.4
• /
• pp.771-781
• /
• 1997

In order to solve the problem of uncovered background region due to the region-due to the region-based motion estimation, this paper presents a new method which generates the uncovered region memory using motion estimation and shows the application of the algorithm for very low bit rate video coding. The proposed algorithm can be briefly described as follows it detects the changed region by using the information of FD(frame difference) and segmentation, and then as for only that region the backward motion estimation without transmission of shape information is done. Therefore, from only motion information the uncovered background region memory is generated and updated. The contents stored in the uncovered background region memory are referred whenever the uncovered region comes into existence. The regions with large prediction error are transformed and coded by using DCT. As results of simulation, the proposed algorithm shows the superior improvement in the subjective and objective image quality due to the remarkable reduction of transmission bits for prediction error.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.35-38
• /
• 2000

Low bit rate image/video coding is essential for many visual communication applications. When bit rates become low, most compression algorithms yield visually blocking artifacts that highly degrade the perceptual quality, and post-processing approaches provide one attractive solution. In this paper, we provide simple and very efficient blocking artifacts reduction method using constrained random value addition. Our method is simple enough to be used for real-time post-processing of video.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.8
• /
• pp.21-27
• /
• 2013

In this paper, we propose a low-complexity Turbo coded BICM-ID (bit-interleaved coded modulation with iterative decoding) system. A Turbo code is a powerful error correcting code with a BER (bit error rate) performance very close to the Shannon limit. In order to increase spectral efficiency of the Turbo code, a coded modulation combining Turbo code with high order modulation is used. The BER performance of Turbo-BICM can be improved by Turbo-BICM-ID using iterative demodulation and decoding algorithm. However, compared with Turbo-BICM, the decoding complexity of Turbo-BICM-ID is increased by exchanging information between decoder and demodulator. To reduce the decoding complexity of Turbo-BICM-ID, we propose a low-complexity Turbo-BICM-ID system. When compared with conventional Turbo-BICM-ID, the proposed scheme not only show similar BER performance but also reduce the decoding complexity.