• ETRI Journal
• /
• v.43 no.3
• /
• pp.471-482
• /
• 2021

Several code-division multiple access (CDMA)-based interconnect schemes have been recently proposed as alternatives to the conventional time-division multiplexing bus in multicore systems-on-chip. CDMA systems with a dynamic assignment of spreading codewords are particularly attractive because of their potential for higher bandwidth efficiency compared with the systems in which the codewords are statically assigned to processing elements. In this paper, we propose a novel distributed arbitration scheme for dynamic CDMA-bus-based systems, which solves the complexity and scalability issues associated with commonly used centralized arbitration schemes. The proposed arbitration unit is decomposed into multiple simple arbitration elements, which are connected in a ring. The arbitration ring implements a token-passing algorithm, which both resolves destination conflicts and assigns the codewords to processing elements. Simulation results show that the throughput reduction in an optimally configured dynamic CDMA bus due to arbitration-related overheads does not exceed 5%.

• East Asian mathematical journal
• /
• v.12 no.2
• /
• pp.155-162
• /
• 1996

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.48 no.11
• /
• pp.9-17
• /
• 2011

As semiconductor process rapidly developed, the density of chips becomes higher and the space between adjacent lines narrows smaller. This trend increases the capacitance and inductance in interconnects and the coupling-capacitance of adjacent lines grows even bigger than the self-capacitance of themselves, especially in global interconnects. Inductive and capacitive coupling observed in these phenomena may cause serious problems in signal integrity. This paper proposes a codeword generation technique using extra interconnect lines to reduce the crosstalk caused by inductive and capacitive coupling and to reduce dynamic power consumption considering probability of input data. To estimate the performance of the proposed technique, the experimental results have been obtained using FastCap, FastHenry and HSPICE, and it has been shown that the power consumption using the proposed technique has yielded approximately 15% less than the results of the previous technique.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.5
• /
• pp.112-120
• /
• 2013

In this paper, we propose high-performance H.264/AVC CAVLC encoder for UD video real time processing. Statistical values are obtained in one cycle through the parallel arithmetic and logical operations, using non-zero bit stream which represents zero coefficient or non-zero coefficient. To encode codeword per one cycle, we remove recursive operation in level encoding through parallel comparison for coefficient and escape value. In oder to implement high-speed circuit, proposed CAVLC encoder is designed in two-stage {statical scan, codeword encoding} pipeline. Reducing the encoding table, the arithmetic unit is used to encode non-coefficient and to calculate the codeword. The proposed architecture was simulated in 0.13um standard cell library. The gate count is 33.4Kgates. The architecture can support Ultra Definition Video ($3840{\times}2160$) at 100 frames per second by running at 100MHz.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.5
• /
• pp.677-690
• /
• 1995

In this paper, we propose the high efficiency data compression capable of error control using block-sorting, move to front(MTF) and arithmetic code with variable length in to fixed out. First, the substring with is parsed into length N is shifted one by one symbol. The cyclic shifted rows are sorted in lexicographical order. Second, the MTF technique is applied to get the reference of locality in the sorted substring. Then the preprocessed sequence is coded using VF(variable to fixed) arithmetic code which can be limited the error propagation in one codeword. The key point is how to split the fixed length codeword in proportion to symbol probabilities in VF arithmetic code. We develop the new VF arithmetic coding that split completely the codeword set for arbitrary source alphabet. In addition to, an extended representation for symbol probability is designed by using recursive Gray conversion. The performance of proposed method is compared with other well-known source coding methods with respect to entropy, compression ratio and coding times.

• Journal of the Korea Convergence Society
• /
• v.4 no.4
• /
• pp.21-29
• /
• 2013

Two-dimensional QR Code has improved greatly the limits on the capacity, size, direction of the one-dimensional bar code. And it has the capacity of compressing and storing the massive amount of data and is widely used in many applications. Recently, the two-dimensional QR Code has been spread rapidly because of introducing the smart phones and increasing the amount of using them. However, there is little documentations about decoding the QR Code in which can store the large amount of information. In this paper, therefore, we present specific processing procedures and algorithms on decoding the two-dimensional QR Code and then make us understand their decoding process by explaining some examples.

• The Journal of the Acoustical Society of Korea
• /
• v.13 no.3
• /
• pp.63-70
• /
• 1994

In this Paper, we propose a new codeword tying algorithm based on a tree structured classfier. The proposed algorithm which can be viewed as a kind of soft decision using statistical properties between codewords and states has an advantage of fast construction, and guarantees a unique optimal solution. Also, it can easily be applied to any speech recognition system based on discrete hidden Markov model (HMM). Experimental results on speaker-independent isolated word recognition show error reduction of $6\%$ for the codebook of size 256 and $9\%$ for 512 size and also HMM parameter reduction of about $20\%$.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.12
• /
• pp.1323-1326
• /
• 2014

In this letter, we compare the performance of two concatenated coding structures in slow FH/SS systems for multimedia/multicast transmission on shipboard. Two outer code symbols are transmitted during a hop. The first structure consists of one inner codeword per one outer code symbol, while the second structure consists of one inner codeword per two outer code symbols. We analyze the overall block error probability in asymptotic region and show that the performance of the second scheme is superior to the first one.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.1
• /
• pp.28-33
• /
• 2003

This paper proposes a database index and retrieval method using the PCA(Principal Component Analysis). We perform a scene change detection and key frame extraction from the DC Image constructed by DCT DC coefficients in the compressed video stream that is video compression standard such as MPEG. In the extracted key frame, we use the PCA, then we can make codebook that has a statistical data as a codeword, which is saved as a database index. We also provide retrieval image that are similar to user's query image in a video database. As a result of experiments, we confirmed that the proposed method clearly showed superior performance in video retrieval and reduced computation time and memory space.

• Journal of the Institute of Convergence Signal Processing
• /
• v.11 no.3
• /
• pp.226-231
• /
• 2010

This paper proposes a new coding technique for constructing error correcting high rate DC-free multimode code using a generator matrix generated from a sparse parity-check matrix. The scheme exploits high rate generator matrixes for producing distinct candidate codewords. The decoding complexity depends on whether the syndrome of the received codeword is zero or not. If the syndrome is zero, the decoding is simply performed by expurgating the redundant bits of the received codeword. Otherwise, the decoding is performed by a sum-product algorithm. The performance of the proposed scheme can achieve a reasonable DC-suppression and a low bit error rate.