• 한국통신학회논문지
• /
• 제38C권6호
• /
• pp.540-549
• /
• 2013

본 논문에서는 멀티 레벨 셀 낸드 플래시 메모리에서 연판정 에러 정정을 위한 적응적 비균일 양자화기를 제안한다. 기존의 최대 상호 정보(maximum mutual information) 양자화기는 최적의 연판정 에러 정정 성능을 보이지만, 소모적인 탐색(exhaustive search)으로 인하여 많은 계산량을 요구한다. 본 논문에서 제안된 양자화기는 최대 여섯 개의 파라미터로 표현되는 간단한 구조를 갖고 있어 연산량이 적다. 또한 제안된 양자화기는 쓰기 심볼과 읽기 심볼 사이의 상호 정보를 최대화하는 방향으로 파라미터 값의 최적화시키므로, 최대 상호 정보 양자화기에 근접하는 우수한 연판정 에러 정정 성능을 보인다.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 2009년도 IWAIT
• /
• pp.723-726
• /
• 2009

This paper describes a non-causal interpolative prediction method for B-picture encoding. Interpolative prediction uses correlations between neighboring pixels, including non-causal pixels, for high prediction performance, in contrast to the conventional prediction, using only the causal pixels. For the interpolative prediction, the optimal quantizing scheme has been investigated for preventing conding error power from expanding in the decoding process. In this paper, we extend the optimal quantization sceme to inter-frame prediction in video coding. Unlike H.264 scheme, our method uses non-causal frames adjacent to the prediction frame.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권11호
• /
• pp.5381-5399
• /
• 2016

Currently, the quantize-and-forward (QF) scheme with high order modulation and quantization has rather high complexity and it is thus impractical, especially in multiple relay cooperative communications. To overcome these deficiencies, an improved low complex QF scheme is proposed by the combination of the low order binary phase shift keying (BPSK) modulation and the 1-bit and 2-bit quantization, respectively. In this scheme, the relay selection is optimized by the best relay position for best bit-error-rate (BER) performance, where the relays are located closely to the destination node. In addition, an optimal power allocation is also suggested on a total power constraint. Finally, the BER and the achievable rate of the low order 1-bit, 2-bit and 3-bit QF schemes are simulated and analyzed. Simulation results indicate that the 3-bit QF scheme has about 1.8~5 dB, 4.5~7.5 dB and 1~2.5 dB performance gains than those of the decode-and-forward (DF), the 1-bit and 2-bit QF schemes, at BER of $10^{-2}$, respectively. For the 2-bit QF, the scheme of the normalized Source-Relay (S-R) distance with 0.9 has about 5dB, 7.5dB, 9dB and 15dB gains than those of the distance with 0.7, 0.5, 0.3 and 0.1, respectively, at BER of $10^{-3}$. In addition, the proposed optimal power allocation saves about 2.5dB much more relay power on an average than that of the fixed power allocation. Therefore, the proposed QF scheme can obtain excellent features, such as good BER performance, low complexity and high power efficiency, which make it much pragmatic in the future cooperative communications.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 2006년도 학술대회
• /
• pp.127-132
• /
• 2006

Quantization in video coding plays an important role in controlling the bit-rate of compressed video bit-streams. It has been used as an important control means to adjust the amount of bit-streams to at]owed bandwidth of delivery networks and storage. Due to the dependent nature of video coding, dependent quantization has been proposed and applied for MPEG-2 video coding to better maintain the quality of reconstructed frame for given constraints of target bit-rate. Since Scalable Video Coding (SVC) being currently standardized exhibits highly dependent coding nature not only between frames but also lower and higher scalability layers where the dependent quantization can be effectively applied, in this paper, we propose a dependent quantization scheme for SVC and compare its performance in visual qualities and bit-rates with the current JSVM reference software for SVC. The proposed technique exploits the frame dependences within each GOP of SVC scalability layers to formulate dependent quantization. We utilize Lagrange optimization, which is widely accepted in R-D (rate-distortion) based optimization, and construct trellis graph to find the optimal cost path in the trellis by minimizing the R-D cost. The optimal cost path in the trellis graph is the optimal set of quantization parameters (QP) for frames within a GOP. In order to reduce the complexity, we employ pruning procedure using monotonicity property in the trellis optimization and cut the frame dependency into one GOP to decrease dependency depth. The optimal Lagrange multiplier that is used for SVC is equal to H.264/AVC which is also used in the mode prediction of the JSVM reference software. The experimental result shows that the dependent quantization outperforms the current JSVM reference software encoder which actually takes a linear increasing QP in temporal scalability layers. The superiority of the dependent quantization is achieved up to 1.25 dB increment in PSNR values and 20% bits saving for the enhancement layer of SVC.

• Journal of Communications and Networks
• /
• 제17권5호
• /
• pp.463-472
• /
• 2015

This paper considers a limited feedback system for two-way wireless relaying channels with physical network coding (PNC). For full feedback systems, the optimal structure with the PNC has already been studied where a modulo operation is employed. In this case, phase and power of two end node channels are adjusted to maximize the minimum distance. Based on this result, we design new quantization methods for the phase and the power in the limited feedback system. By investigating the minimum distance of the received constellation, we present a code-book design to maximize the worst minimum distance. Especially, for quantization of the power for 16-QAM, a new power quantization scheme is proposed to maximize the performance. Also, utilizing the characteristics of the minimum distance observed in our codebook design, we present a power allocation method which does not require any feedback information. Simulation results confirm that our proposed scheme outperforms conventional systems with reduced complexity.

• Journal of Electrical Engineering and Technology
• /
• 제4권2호
• /
• pp.185-193
• /
• 2009

This paper presents a methodology for photovoltaic (PV) system allocation in distribution systems using a discrete particle swarm optimization (DPSO). The PV allocation problem is in the category of mixed integer nonlinear programming and its formulation may include multi-valued dis-crete variables. Thus, the PSO requires a scheme to deal with multi-valued discrete variables. This paper introduces a novel multi-level quantization scheme using a sigmoid function for discrete particle swarm optimization. The technique is employed to a standard PSO architecture; the same velocity update equation as in continuous versions of PSO is used but the particle's positions are updated in an alternative manner. The set of multi-level quantization is defined as integer multiples of powers-of-two terms to efficiently approximate the sigmoid function in transforming a particle's position into discrete values. A comparison with a genetic algorithm (GA) is performed to verify the quality of the solutions obtained.

• 대한전기학회논문지:전력기술부문A
• /
• 제48권8호
• /
• pp.1031-1036
• /
• 1999

A Hierarchical vector Quantization scheme is implemented and an optimal thresholding technique of quadtree segmentation for performing high quality low bit rate image compression is proposes. A mathematical model is constructed under the assumption that the standard deviations of sub-blocks are larger than or equal to the standard deviation of the upper level block which is generated by merging of sub-blocks. This thresholding technique based on the mathematical modeling allows producing about 1 dB improved performance in terms of PSNR at most ranges of bit rates over the quadtree coder, which is based on MSE for quadtree segmentation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제3권5호
• /
• pp.461-474
• /
• 2009

The cognitive radio (CR) technique is a useful tool for improving spectrum utilization by detecting and using the vacant spectrum bands in which cooperative spectrum sensing is a key element, while avoiding interfering with the primary user. In this paper, we propose a novel cluster-based cooperative spectrum sensing scheme in cognitive radio with two solutions for the purpose of improving in sensing performance. First, for the cluster header, we use the double adaptive energy thresholds and a multi-bit quantization with different quantization interval for improving the cluster performance. Second, in the common receiver, the weighed HALF-voting rule will be applied to achieve a better combination of all cluster decisions into a global decision.

• 한국통신학회논문지
• /
• 제34권2A호
• /
• pp.170-176
• /
• 2009

다중사용자 다중안테나 시스템은 단일사용자 다중안테나 시스템보다 더 좋은 성능을 가진다는 것이 알려져 있다. 그러나 다중사용자 다중안테나 시스템은 선택된 사용자들 간의 신호 간섭이 발생하기 때문에 그것을 제거해야 된다. 간섭 신호를 제거하는 기법 중에 가장 널리 쓰이는 방법으로서 zero-forcing beamforming (ZFBF) 방법이 있다. 하지만 이 방법은 상당히 정확한 채널 정보를 송신단이 알아야 되기 때문에 실제 시스템에서 사용되기 위해서는 많은 양의 피드백 비트수가 필요하게 된다. ZFBF의 단점을 보완하기 위해 Random Beamforming (RBF) 시스템이 제안되었다[1]. RBF는 미리 정해진 코드북에 가장 최적의 성능을 보이는 사용자들에게 데이터를 보내는 방법으로서, 각 수신단은 코드북 내의 최적의 성능을 가지는 코드워드의 인텍스와 CQI 정보를 피드백 한다. 그러나 [l]에서는 송신단이 각 수신단의 CQI 정보를 완벽히 안다고 가정을 하였는데 실제 시스템에서는 CQI 정보도 양자화 되어야 한다. 따라서 이번 논문에서는 CQI 정보를 효율적으로 양자화하는 방법을 제안한다.

• 전자공학회논문지B
• /
• 제31B권11호
• /
• pp.88-96
• /
• 1994

벡터 양자화를 이용하여 영상신호를 압축하는 경우, 원 영상을 복원하기 위하여 복호기쪽에 어야 하는 인덱스들 사이에는 높은 상관성이 존재하며, 이러한 높은 상관성을 인덱스의 부호화에 이용하면 보다 높은 부호화 효율을 얻을 수 있다. 본 논문에서는, 각 인덱스들을 이전 인덱스의 값에 따라 적응적으로 부호화하는 조건부 엔트로피 부호화를 도입하고, 이 경우 벡터 양자기를 최적화하는 방법을 제안한다. 즉, 조건부 엔트로피 부호화를 도입하는 경우 각 입력벡터당 평균 비트수는 조건부 엔트로피에 근접한다는 사실을 유용하여, 조건부 엔트로피를 제한한 상태에서 평균 왜곡을 최소화 하도록 VQ 부호책을 구성함으로써 최적화 과정이 이루어진다. 또한, 이와 같이 각 입력벡터의 양자화 결과가 다음 입력벡터의 인덱스를 부호화하는데 영향을 미치는 경우, 장시간(long term)의 관점에서 최적인 인덱스열을 찾기 위해 우리는 비터비 탐색 방법을 도입한다. 영상 모의 실험을 통해, 제안하는 방법이, 구획간의 상관성을 이용하지 않는 기존의 엔트로피 제한 벡터 양자기에 비해 같은 비트율에서 약 1.0~3.0 dB 높은 PSNR을 나타냄을 알 수 있었다.