• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.1A
• /
• pp.26-34
• /
• 2002

Mobile telecommunication systems such as IS-95 and IMT-2000 employ frame based communication using frames up to 20 msec in length and the receiving end has to store the whole frome before it is being processed. The size of the frame buffer ofter dominates those of the processing unit such as soft decision Viterbi decoder. The frame buffer for IMT-2000, for example, has to be increased 80 times as large as that of IS-95. One of the parameters deciding the number of bits in a frame will be obviously the number of bits in soft quantization. Start after striking space key 2 times. This paper has studied a new aspect of offset and quantization step size on BER performance and proposes a new 3-bit soft quantization algorithm which shows similar performance as that of 4-bit soft decision Viterbi receiver. The optimal offset values and step sizes for the other practical quantization levels ---16, 8, 4, 2--- have also been found. In addition, a new optimal symbol metric table has been devised which takes the accumulation value of various repeated signals and produces a rescaled 3-bit valu.tart after striking space key 2 times.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.49 no.8
• /
• pp.63-72
• /
• 2012

In this paper, we proposed a parallel architecture of line & block edge filter for high-performance H.264/AVC deblocking filter for Quad Full High Definition(Quad FHD) video real time processing. To improve throughput, we designed 4-parallel block edge filter with 16 line edge filter. To reduce internal buffer size and processing cycle, we scheduled 4-parallel zig-zag scan order as deblocking filtering order. To avoid data conflicts we placed 1 delay cycle between block edge filtering. We implemented interleaving buffer, as internal buffer of block edge filter, to sharing buffer for reducing buffer size. The proposed architecture was simulated in 0.18um standard cell library. The maximum operation frequency is 108MHz. The gate count is 140.16Kgates. The proposed H.264/AVC deblocking filter can support Quad FHD at 113.17 frames per second by running at 90MHz.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.7B
• /
• pp.1292-1300
• /
• 2000

본 논문에서는 연결지향적인 ATM 네트워크에서 비연결지향적인 데이터 전송을 효율적으로 하기 위한 방법으로 Frame-Weighted(FW) 스케줄링 기법을 제시한다. 본 방법은 기존의 GPS 계열이 갖는 셀 단위에서의 스케줄링으로 인한 낮은 효율 및 높은 셀 손실을 프레임 단위에서의 스케줄링으로 극복한다. 이를 이용하면 네트워크 내의 버퍼 점유율을 낮춤으로써 프로엠 지연을 단축하고 셀 손실을 최소화할 수 있어 데이터 전송에 효과적으로 쓰일 수 있다.

• Annual Conference of KIPS
• /
• 2001.10a
• /
• pp.773-776
• /
• 2001

본 논문에서는 캘리브레이션 패턴을 카메라와 평행한 평면에 위치시켜 카메라의 회전 요소를 없게 하여 회전 행렬이 단위 행렬이 되게 한 상태에서 카메라를 캘리브레이션 하였다. 카메라의 투영중심에 대한 투영면과 프레임 버퍼에서의 영상 중심 위치($C_x,\;C_y$), 촛점거리(f) 등의 내부 파라메타와 세계 좌표의 원점에 대한 카메라의 상대 위치($T_x,\;T_y,\;T_z$)를 서로 다른 거리에서 획득한 두 장의 패턴 영상을 이용하여 효과적으로 계산하였다.

• Annual Conference of KIPS
• /
• 2004.05a
• /
• pp.1401-1404
• /
• 2004

점증하고 있는 무선망에서의 다양한 멀티미디어 서비스를 안정적으로 지원하기 위해서는 효율적인 대역폭 관리가 필수적이다. 본 논문에서는 차세대 네트워크의 기반이 되는 계층 셀 구조에서, 대역폭의 효율적인 관리를 지원하기 위한 통합 프레임워크를 제안하였다. 현재 트래픽의 과밀도와 사용자의 이동성을 기반으로 적절한 셀 선택, 대역폭 예약 및 재설정, 버퍼링 등의 알고리즘을 설계하였으며, 이들을 유기적으로 통합, 시스템 전반의 QoS를 향상시켰다.

• Annual Conference of KIPS
• /
• 2011.04a
• /
• pp.655-658
• /
• 2011

본 연구는 이종 무선 네트워크에서 발생하는 핸드오버 부하를 개선하는 알고리즘을 제안한다. 핸드오버는 단말기의 위치가 네트워크의 구성 단위인 셀을 옮겨갈 때 발생한다. 이 위치 업데이트 비용은 매우 크다. 효과적인 위치 업데이트를 위해서 idle 상태에서는 단말기가 셀 선택 알고리즘에 의해서 셀을 결정한 뒤, 핸드오버 여부를 보고한다. 본 논문에서 제안하는 방식은 셀 내부에 가상의 버퍼 영역을 두어 버퍼 영역 안쪽의 핸드오버를 제한하고, 버퍼 영역 바깥쪽의 핸드오버는 기존 방식을 이용하는 것이다. 실험은 네트워크 시뮬레이터 NS-3에서 수행되었고, 그 결과 제안된 알고리즘이 핸드오버 횟수를 프로필 기반 네트워크 선택 프레임워크(Profile-based Network Selection Framework, PNSF) 알고리즘 대비 약 7% 감소시켰으며, 위치 정보의 정확성은 PNSF와 동등한 성능을 보여 위치 기반 서비스의 질 향상에 기여함을 확인할 수 있었다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.10A
• /
• pp.1555-1562
• /
• 1999

Various video rate control techniques have been proposed for the transmission of video under fixed channel capacity. In most techniques, the coding parameters and quantizer scaling factors are determined based on information derived from previously coded data. In this paper, an successfully used for video rate-control. Experimental results show that the proposed prediction-based rate control scheme can efficiently regulate the bit-rate caused by dramatic scene change and have better PSNR performance than the TM5 rate control mechanism.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.9B
• /
• pp.1082-1091
• /
• 2011

Power-reduction techniques based on DVFS(Dynamic Voltage and Frequency Scaling) are crucial for lengthening operating times of battery powered mobile systems. This paper proposes an optimal DVFS scheduling algorithm for decoders with memory size limitation on display buffer, which is realistic constraints not properly touched in the previous works. Furthermore, we mathematically prove that the proposed algorithm is optimal in the limited display buffer and limited clock frequency model, and also can be used for feasibility check. Simulation results show the proposed algorithm outperformed the previous heuristic algorithms by 7% in average, and the performance of all algorithms using display buffers saturates at about 10 frame size.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.4
• /
• pp.455-470
• /
• 2001

This paper is focused on the traffic characterization for the efficient transmission of the VBR video source in the ATM network. For the traffic characterization, low traffic monitoring technique is applied and the dynamic VBR characterization method is suggested to satisfy the delay requirement. The dynamic VBR method uses the token bucket algorithm buffering though Cumulative Constraint Function. According to the Cumulative Constraint Function, the packet initially started transferring at the peak rate and the token bucket provided proper amount of buffer for traffic after a certain period of monitoring. It also reduced the network resource bandwidth through renewal of the cumulative frame and changed the rate from the previous frame information. It requires only small amount of monitoring and causes little overhead. In addition, it lowered the complexity of Deterministic Constraint Function to 0(n) and mapped the token rate and token depth to the token bucket. This study shows less network resource consumed than the previous method, comparing and analyzing the result of simulations.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.11
• /
• pp.20-25
• /
• 2016

This study addresses a low complexity and lossless frame memory compression algorithm based on block-buffer structure for efficient high resolution video processing. Our study utilizes the block-based MHT (modified Hadamard transform) for spatial decorrelation and AGR (adaptive Golomb-Rice) coding as an entropy encoding stage to achieve lossless image compression with low complexity and efficient hardware implementation. The MHT contains only adders and 1-bit shift operators. As a result of AGR not requiring additional memory space and memory access operations, AGR is effective for low complexity development. Comprehensive experiments and computational complexity analysis demonstrate that the proposed algorithm accomplishes superior compression performance relative to existing methods, and can be applied to hardware devices without image quality degradation as well as negligible modification of the existing codec structure. Moreover, the proposed method does not require the memory access operation, and thus it can reduce costs for hardware implementation and can be useful for processing high resolution video over Full HD.