• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.41 no.7
• /
• pp.81-88
• /
• 2004

In this paper, a low power area efficient charge recycling predecoder (AE-CRPD) is proposed. The AE-CRPD is modified from the conventional charge recycling predecoder (CNV-CRPD). The AE-CRPD significantly reduces the area and power of the control circuits for the charge recycling operation. It saves 38% area and 8% power of the 2-to-4 CNV-CRPD. It also utilizes the property of the consecutive address increase in the memory. The AE-CRPDs are used for the frequently transited least significant bits and the conventional predecoders are used for the occasionally transited most significant bits. It saves 23% power of the 12-bit conventional predecoder.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.10
• /
• pp.1225-1233
• /
• 1988

In this paper, several simple approaches to Laplacian pyramid coding have been presented for obtaining reasonably acceptable image quality even at low bit rates of 0.3-0.5 bits/pel. For this purpose, the feedback construction of each Lapliacian plane, 3-dimensional prediction and three-level center-clipping quantization are introduced into the coding procedures. For greatly reducing the bit rate of the bottom layer, two new schemes of conditional transmission and edge sharpening without transmission are used. In experiments, our latter sheme has yielded the total bit rate of about 0.3 bits/pel while retaining reasonably acceptable image quality.

• Journal of Korea Multimedia Society
• /
• v.9 no.3
• /
• pp.307-314
• /
• 2006

This paper proposes a QT_rev algorithm for identifying multiple tags. The proposed QT_rev algorithm is based on the query tree algorithm. In the algorithm, the tag will send all the bits of their identification codes when the query string matches the first bits of their identification codes. On the other hand, in the QT_rev algorithm, the tag will send the remaining bits of their identification codes. After the leader receives all the responses of the tags, it knows which bit is collided. Therefore, if the collision occurs in the last bit, the reader can identify two tags simultaneously without further query. According to the simulation results, the QT_rev algorithm outperforms the QT algorithm in terms of the number of queries and the number of response bits.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.12
• /
• pp.6190-6213
• /
• 2019

For small-scale vector data, restrictions on watermark scheme capacity and robustness limit the use of copyright protection. A watermarking scheme based on robust geometric features and capacity maximization strategy that simultaneously improves capacity and robustness is presented in this paper. The distance ratio and angle of adjacent vertices are chosen as the watermark domain due to their resistance to vertex and geometric attacks. Regarding watermark embedding and extraction, a capacity-improved strategy based on quantization index modulation, which divides more intervals to carry sufficient watermark bits, is proposed. By considering the error tolerance of the vector map and the numerical accuracy, the optimization of the capacity-improved strategy is studied to maximize the embedded watermark bits for each vertex. The experimental results demonstrated that the map distortion caused by watermarks is small and much lower than the map tolerance. Additionally, the proposed scheme can embed a copyright image of 1024 bits into vector data of 150 vertices, which reaches capacity at approximately 14 bits/vertex, and shows prominent robustness against vertex and geometric attacks for small-scale vector data.

• Journal of Digital Contents Society
• /
• v.7 no.3
• /
• pp.169-174
• /
• 2006

In recent years, RFID is widely used in industrial applications including factory, material flow, logistics and defense areas. In this paper, The convolutional encoding and viterbi decoding is also implemented to improve the system performance. in an FPGA chip. The used convolution code is constraint length K=3 and rate R=1/2. The length of command frame and response frame is total of 48bits consisting of SOF 8 bits, command 16 bits, CRC 16 bit, and EOF 8 bits. And also the frame error rates are measured under the channel of line-of-sight and non line-of-sight, respectively. The performances are analyzed with FSK modulation only and FSK modulation added with convolutional encoding. These two measured results are compared with that of a RFID system with ASK modulation.

• The Journal of the Acoustical Society of Korea
• /
• v.16 no.1
• /
• pp.10-15
• /
• 1997

In this paper, an efficient LSF quantizer, named improved PSVQ(IPSVQ), is proposed to apply in the 8 kbps QCELP speech coder. By using 27 bits IPSVQ instead of 40 bits DPCM quantizer per frame, we can save 13 bits/frame and allocate those bits to the codebook gain and the pitch gain parameters. Hence we improve the overall performance of the QCELP codec. The enhanced QCELP shows the performance improvement of 0.9 dB SNR and 0.4 dB SEGSNR. Informal listening tests also confirm the improvement in the speech quality.

• Journal of information and communication convergence engineering
• /
• v.10 no.3
• /
• pp.315-320
• /
• 2012

In H.264/AVC, the first frame of a group of pictures (GOP) is encoded in intra mode which generates a large number of bits. The number of bits for the I-frame affects the qualities of the following frames of a GOP since they are encoded using the bits remaining among the bits allocated to the GOP. In addition, the first frame is used for the inter mode encoding of the following frames. Thus, the initial quantization parameter (QP) affects the following frames as well as the first frame. In this paper, an adaptive peak signal to noise ratio (PSNR)-based initial QP determination algorithm is presented. In the proposed algorithm, a novel linear model is established based on the observation of the relation between the initial QPs and PSNRs of frames. Using the linear model and PSNR results of the encoded GOPs, the proposed algorithm accurately estimates the optimal initial QP which maximizes the PSNR of the current GOP. It is shown by experimental results that the proposed algorithm predicts the optimal initial QP accurately and thus achieves better PSNR performance than that of the existing algorithm.

• Journal of Sensor Science and Technology
• /
• v.24 no.6
• /
• pp.359-363
• /
• 2015

This paper proposes an algorithm that reduces the conversion time of a single-slope A/D converter (SSADC) that has n-bit resolution, which typically is limited by conversion time taking up to $2^n$ clock cycles for an operation. To improve this situation, we have researched a novel hybrid-type A/D converter that consists of a pseudo-pipeline A/D converter and a conventional SSADC. The pseudo-pipeline A/D converter, using a single-stage of analog components, determines the most significant bits (MSBs) or upper bits and the conventional SSADC determines the remaining bits. Therefore, the modified SSADC, similar to the hybrid-type A/D converter, is able to significantly reduce the conversion time because the pseudo-pipeline A/D converter, which determines the MSBs (or upper bits), does not rely on a clock. The proposed A/D converter was designed using a $0.35-{\mu}m$ 2-poly 4-metal standard complementary metal oxide semiconductor (CMOS) technology process; additionally, its characteristics were simulated.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.9
• /
• pp.3421-3443
• /
• 2021

A data hiding method based on integer factorization via e-books in the EPUB format with XHTML and CSS files for copyright protection is proposed. Firstly, a fixed number m of leading bits in a message are transformed into an integer which is then factorized to yield k results. One of the k factorizations is chosen according to the decimal value of a number n of the subsequent message bits with n being decided as the binary logarithm of k. Next, the chosen factorization, denoted as a × b, is utilized to create a combined use of the

and elements in the XHTML files to embed the m + n message bits by including into the two elements a class selector named according to the value of a as well as a text segment with b characters. The class selector is created by the use of a CSS pseudo-element. The resulting web pages are of no visual difference from the original, achieving a steganographic effect. The security of the embedded message is also considered by randomizing the message bits before they are embedded. Good experimental results and comparisons with exiting methods show the feasibility of the proposed method for copyright protection of e-books.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.9
• /
• pp.63-69
• /
• 1998

In this paper, we propose a new Bit-Rate control algorithm based on bit usage matching to substitute encoded GOP(s) for new GOP(s) in MPEG-2 bitstream. It iteratively encodes current picture according to quantization value of previous picture and records bit-usage of each slice until nearly target bits are used. With target bits falling in two output bits, quantization value of slice should be changed to alleviate output bit error. We use recorded bit-usage information to decide which slices should be encoded with one quantization value and others with another. As every macroblock has different activity, we change macroblock quantization value using slice quantization value and activity value. The simulation results demonstrate that the fluctuation of the output bits can be kept within few-several tens of bits while maintaining the quality of the reconstructed pictures at a relatively stable level.