• Journal of Advanced Navigation Technology
• /
• v.18 no.6
• /
• pp.600-608
• /
• 2014

In this paper, CABAC H/W module is developed using co-design method. After entire H.264/AVC encoder was developed with C using reference SW(JM), CABAC H/W IP is developed as a block in H.264/AVC encoder. Context modeller of CABAC is included on the hardware to update the changed value during binary encoding, which enables the efficient usage of memory and the efficient design of I/O stream. Hardware IP is co-operated with the reference software JM of H.264/AVC, and executed on Virtex-4 FX60 FPGA on ML410 board. Functional simulation is done using Modelsim. Compared with existing H/W module of CABAC with register-level design, the development time is reduced greatly and software engineer can design H/W module more easily. As a result, the used amount of slice in CABAC is less than 1/3 of that of CAVLC module. The proposed co-design method is useful to provide hardware accelerator in need of speed-up of high efficient video encoder in embedded system.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.8
• /
• pp.1531-1536
• /
• 2016

In this paper, we propose a fast motion estimation algorithm which is important in performance of video encoding. Even though so many fast algorithms for motion estimation have been published due to its tremendous computational amount of for full search algorithm, efforts for reducing computations in motion estimation still remain. In the paper, we propose an algorithm that reduces unnecessary computations only, while keeping prediction quality the same as that of the full search. The proposed algorithm does not calculate block matching error for each candidate at once to find motion vectors but divides the calculation procedure into several steps and calculates partial sum of block errors. By doing that, we can estimate the minimum error point early and get the enhancement of calculation speed by reducing unnecessary computations. The proposed algorithm uses smaller computations than conventional fast search algorithms with the same prediction quality as full search.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.97-100
• /
• 2007

In order to overcome many defects in the current JPEG standard of still image compression, the new JPEG2000 standard has been development. The JPEG2000 standard is based on the principles of DWT and EBCOT Entropy Coding. EBCOT(Embedded block coding with optimized truncation) is the most important technology in the latest image-coding standard, JPEG2000. However, EBCOT occupies the highest computation time to operate bit-level processing. Therefore, many researches have achieved methods to minimize computation speed of EBCOT. Thus, this paper proposes the method of context-extraction that improves computational architecture. This paper proposes efficient context coding method. The proposed algorithm would apply to hard-wired JPEG2000 Encoder that is used for compression of high resolution image.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.2C
• /
• pp.193-202
• /
• 2010

In this paper, we propose a fast algorithm that can reduce the complexity for inter mode decision of the H.264 encoder. The main idea consists of two techniques. The first one is the technique early terminating mode decision process. We focused on the skip and $16{\times}16$ mode because these modes occupies the largest portion in most of sequences. The second one is the technique skipping unnecessary $8{\times}8$ modes. The time consumption caused by the $8{\times}8$ mode is very considerable. Therefore if we can extract the unnecessary $8{\times}8$ mode calculation well, a large amount of time can be saved in total encoding process. The experimental results show that the proposed algorithm can achieve up to 43% speed up ratio with insignificant PSNR loss. The increase of total bits encoded is also not noticeable.

• Speech Sciences
• /
• v.10 no.3
• /
• pp.241-250
• /
• 2003

In this paper, we implemented the vocoder of variable rate by applying the SOLA-B algorithm to the G.729A to the TMS320C5416 in real-time. This method using the SOLA-B algorithm is that it is reduced the duration of the speech in encoding and is played at the speed of normal by extending the duration of the speech in decoding. But the method applied to the existed G.729A and SOLA-B algorithm is caused the loss of speech quality in G.729A which is not reflected about length variation of speech. Therefore the proposed method is encoded according as it is modified the structure of LSP quantization table about the length of speech is reduced by using the SOLA-B algorithm. The vocoder of variable rate by applying the G.729A and SOLA-B algorithm is represented the maximum complexity of 10.2MIPS about encoder and 2.8MIPS about decoder in 8kbps transmission rate. Also it is evaluated 17.3MIPS about encoder, 9.9MIPS about decoder in 6kbps and 18.5MIPS about encoder, 11.1MIPS about decoder in 4kbps according to the transmission rate. The used memory is about program ROM 9.7kwords, table ROM 4.69kwords, RAM 5.2kwords. The waveform of output is showed by the result of C simulator and Bit Exact. Also, the result of MOS test for evaluation of speech quality of the vocoder of variable rate which is implemented in real-time, it is estimated about 3.68 in 4kbps.

• The Journal of Korean Society of Virology
• /
• v.30 no.1
• /
• pp.83-99
• /
• 2000

A defective HIV-1 helper virus DNA, pHyPC, was assembled by deleting the RNA packaging signal, env, nef and the 3'LTR sequences. HIV-1 like virus particles that carry the HIV-1 receptor, CD4 were generated by co expression of pHyPC and plasmid DNAs encoding different chimeric CD4 proteins. The CD4 particles, sharing the CD4 ectodomain, precisely fused to different membrane anchors. CD4(+) particles specifically bound to HIV-1 Env expressing cells, but any signs of infection into these cells were not detected. Binding was only partially blocked by either polyclonal anti-CD4 antibodies or by high concentrations of soluble CD4. Surprisingly, CD4(+) particles also adsorbed to HeLa, CHO, NIH3T3 and COS-7 cells in the absence of HIV-1 Env expression. Adsorption was comparable in strength and speed to the highly specific CD4-Env interaction. CD4(-) particles exhibited only background levels of binding. Cell binding was CD4. dependent, but it was independent of the cell type from which the CD4(+) particles originated. Interestingly, CD4-dependent/Env-independent binding was only found when CD4 was present on virus particles. This suggests that the micro-environment of CD4 on virus particles uniquely expose this new cell binding activity. Its high affinity could explain in part why infection of Env(+) cells by CD4(+) particles was not detected. Further experiments will be required to evaluate whether this strong membrane interaction could represent one step in the multiple-step viral entry process.

• Journal of IKEEE
• /
• v.9 no.1 s.16
• /
• pp.31-39
• /
• 2005

This paper presented new biometrics data transfer model, and use MD5 (Message Digest5) and RSA (Ron Rivest, Adi Shamir, Len Adleman) algorithm to improve biometrics data's security. So, did so that can run user authentication more safely. That is, do so that may input fingerprint among biometrics through client, and transmit processed fingerprint to server. When fingerprint information is transmitted, it uses MD5 algorithm to solve problem that get seized unlawful living body information from outside and information does Digest. And did to pass through process that transmit again this by RSA method. Also, experimented general text data and living body data that is not encoded, transmission speed and security of living body data that encoding and transmit each comparison. By running user authentication through such improved method, is expected to be applied in several. fields by method to simplify certification procedure and is little more correct and stable.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.12C
• /
• pp.1669-1676
• /
• 2004

In H.264, 7 modes {16${\times}$16, 16${\times}$8, 8${\times}$16, 8${\times}$8, 8${\times}$4, 4${\times}$8, 4${\times}$4) are used to enhance the coding efficiency. The motion vector estimation with 7 modes may require huge computing time. In this paper, to speed up the motion vector estimation procedure while the high image quality remains, we propose a motion vector refinement scheme using the temporary motion vector generated with little computation. The proposed estimation process consists of three phases: Mode decision for a 16${\times}$16 macroblock, Composing a temporary motion vector, Refinement of the temporary motion vector. We demonstrate the effectiveness of the proposed method by computer simulation. In the results, the encoding time consumed by the proposed scheme has been reduced significantly while the encoded video quality remains unchanged.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.3
• /
• pp.671-680
• /
• 1998

Network services, such as teleconferencing, remote diagnostics and education, and CSCW require multicasting. Multicast routing methods can be divided into two categories. One is the shortest path tree method and the other is the minimal Steiner tree method. The latter has an advantage over the former in that only one Steiner tree is needed for a group. However, finding a minimal Steiner tree is an NP-complete problem and it is necessary to find an efficient heuristic algorithm. In this paper, we present an evolutionary optimization method for finding minimal Steiner trees without sacrificing too much computational efforts. In particular, we describe a tree-based genetic encoding scheme which is in sharp constast with binary string representations usually adopted in convetional genetic algorithms. Experiments have been performed to show that the presented method can find optimal Steiner trees for given vetwork configurations. Comparitivie studies have shown that the evolutionary method finds on average a better solution than other conventional heustric algorithms.

• Journal of the Institute of Convergence Signal Processing
• /
• v.18 no.2
• /
• pp.62-67
• /
• 2017

In this paper, we propose a fast motion estimation algorithm which is important in performance of video encoding. Even though so many fast algorithms for motion estimation have been published due to tremendous computational amount of full search algorithm, efforts for reducing computations of motion estimation still remain. In the paper, we propose an algorithm that reduces unnecessary computations only, while keeping prediction quality the same as that of the full search. The proposed algorithm does not calculate block matching error for each candidate directly to find motion vectors but divides the calculation procedure into several steps and calculates partial sum of block errors for candidates with high priority. By doing that, we can find the minimum error point early and get the enhancement of calculation speed by reducing unnecessary computations. The proposed algorithm uses smaller computations than conventional fast search algorithms with the same prediction quality as the full search algorithm.