• Title/Summary/Keyword: Parallel Processing System

Search Result 891, Processing Time 0.031 seconds

OFDM Communication System Using the Additive Control Tone for PAPR Reduction (PAPR 저감을 위하여 부가 Control 톤을 이용하는 OFDM 통신 시스템)

  • Kim Jin-Kwan;Lee Ill-Jin;Ryu Heung-Gyoon
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.16 no.12 s.103
    • /
    • pp.1229-1238
    • /
    • 2005
  • OFDM(Orthogonal Frequency Division Multiplexing) communications system is very attractive for the high data rate wireless transmission. However, it may be distorted in the nonlinear HPA(High Power Amplifier) since OFDM signal has hish PAPR(Peak-to-Average Power Ratio). In this paper, a new method using control tone is studied for reducing the PAPR and we call it PCT(PAPR Control Tone) method. This proposed PCT method is to assign control tones for PAPR reduction at the predefined sub-carriers. After IFFT(Inverse Fast Fourier Transform) and PAPR calculation, the OFDM data signal of the lowest PAPR is selected to transmit. Unlike the conventional method, it can cut down the computational complexity because it does not require the transmission and demodulation process of side information about the phase rotation. Furthermore, if this method is made up in parallel configuration, it can solve the time delay problem so that it can be processed in real time processing. This proposed method is compared with the conventional selected mapping(SLM) technique. We find out the PAPR reduction performance and BER when the number of control tone is 6 and nonlinear HPA is considered.

A Load Balancing Method using Partition Tuning for Pipelined Multi-way Hash Join (다중 해시 조인의 파이프라인 처리에서 분할 조율을 통한 부하 균형 유지 방법)

  • Mun, Jin-Gyu;Jin, Seong-Il;Jo, Seong-Hyeon
    • Journal of KIISE:Databases
    • /
    • v.29 no.3
    • /
    • pp.180-192
    • /
    • 2002
  • We investigate the effect of the data skew of join attributes on the performance of a pipelined multi-way hash join method, and propose two new harsh join methods in the shared-nothing multiprocessor environment. The first proposed method allocates buckets statically by round-robin fashion, and the second one allocates buckets dynamically via a frequency distribution. Using harsh-based joins, multiple joins can be pipelined to that the early results from a join, before the whole join is completed, are sent to the next join processing without staying in disks. Shared nothing multiprocessor architecture is known to be more scalable to support very large databases. However, this hardware structure is very sensitive to the data skew. Unless the pipelining execution of multiple hash joins includes some dynamic load balancing mechanism, the skew effect can severely deteriorate the system performance. In this parer, we derive an execution model of the pipeline segment and a cost model, and develop a simulator for the study. As shown by our simulation with a wide range of parameters, join selectivities and sizes of relations deteriorate the system performance as the degree of data skew is larger. But the proposed method using a large number of buckets and a tuning technique can offer substantial robustness against a wide range of skew conditions.

Low Power TLB System by Using Continuous Accessing Distinction Algorithm (연속적 접근 판별 알고리즘을 이용한 저전력 TLB 구조)

  • Lee, Jung-Hoon
    • The KIPS Transactions:PartA
    • /
    • v.14A no.1 s.105
    • /
    • pp.47-54
    • /
    • 2007
  • In this paper we present a translation lookaside buffer (TLB) system with low power consumption for imbedded processors. The proposed TLB is constructed as multiple banks, each with an associated block buffer and a corresponding comparator. Either the block buffer or the main bank is selectively accessed on the basis of two bits in the block buffer (tag buffer). Dynamic power savings are achieved by reducing the number of entries accessed in parallel, as a result of using the tag buffer as a filtering mechanism. The performance overhead of the proposed TLB is negligible compared with other hierarchical TLB structures. For example, the two-cycle overhead of the proposed TLB is only about 1%, as compared with 5% overhead for a filter (micro)-TLB and 14% overhead for a same structure without continuos accessing distinction algorithm. We show that the average hit ratios of the block buffers and the main banks of the proposed TLB are 95% and 5% respectively. Dynamic power is reduced by about 95% with respect to with a fully associative TLB, 90% with respect to a filter-TLB, and 40% relative to a same structure without continuos accessing distinction algorithm.

Micro-CT System for Small Animal Imaging (소동물영상을 위한 마이크로 컴퓨터단층촬영장치)

  • Nam, Ki-Yong;Kim, Kyong-Woo;Kim, Jae-Hee;Son, Hyun-Hwa;Ryu, Jeong-Hyun;Kang, Seoung-Hoon;Chon, Kwon-Su;Park, Seong-Hoon;Yoon, Kwon-Ha
    • Progress in Medical Physics
    • /
    • v.19 no.2
    • /
    • pp.102-112
    • /
    • 2008
  • We developed a high-resolution micro-CT system based on rotational gantry and flat-panel detector for live mouse imaging. This system is composed primarily of an x-ray source with micro-focal spot size, a CMOS (complementary metal oxide semiconductor) flat panel detector coupled with Csl (TI) (thallium-doped cesium iodide) scintillator, a linearly moving couch, a rotational gantry coupled with positioning encoder, and a parallel processing system for image data. This system was designed to be of the gantry-rotation type which has several advantages in obtaining CT images of live mice, namely, the relative ease of minimizing the motion artifact of the mice and the capability of administering respiratory anesthesia during scanning. We evaluated the spatial resolution, image contrast, and uniformity of the CT system using CT phantoms. As the results, the spatial resolution of the system was approximately the 11.3 cycles/mm at 10% of the MTF curve, and the radiation dose to the mice was 81.5 mGy. The minimal resolving contrast was found to be less than 46 CT numbers on low-contrast phantom imaging test. We found that the image non-uniformity was approximately 70 CT numbers at a voxel size of ${\sim}55{\times}55{\times}X100\;{\mu}^3$. We present the image test results of the skull and lung, and body of the live mice.

  • PDF

Analysis on the Active/Inactive Status of Computational Resources for Improving the Performance of the GPU (GPU 성능 저하 해결을 위한 내부 자원 활용/비활용 상태 분석)

  • Choi, Hongjun;Son, Dongoh;Kim, Jongmyon;Kim, Cheolhong
    • The Journal of the Korea Contents Association
    • /
    • v.15 no.7
    • /
    • pp.1-11
    • /
    • 2015
  • In recent high performance computing system, GPGPU has been widely used to process general-purpose applications as well as graphics applications, since GPU can provide optimized computational resources for massive parallel processing. Unfortunately, GPGPU doesn't exploit computational resources on GPU in executing general-purpose applications fully, because the applications cannot be optimized to GPU architecture. Therefore, we provide GPU research guideline to improve the performance of computing systems using GPGPU. To accomplish this, we analyze the negative factors on GPU performance. In this paper, in order to clearly classify the cause of the negative factors on GPU performance, GPU core status are defined into 5 status: fully active status, partial active status, idle status, memory stall status and GPU core stall status. All status except fully active status cause performance degradation. We evaluate the ratio of each GPU core status depending on the characteristics of benchmarks to find specific reasons which degrade the performance of GPU. According to our simulation results, partial active status, idle status, memory stall status and GPU core stall status are induced by computational resource underutilization problem, low parallelism, high memory requests, and structural hazard, respectively.

A Frequency Domain DV-to-MPEG-2 Transcoding (DV에서 MPEG-2로의 주파수 영역 변환 부호화)

  • Kim, Do-Nyeon;Yun, Beom-Sik;Choe, Yun-Sik
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.38 no.2
    • /
    • pp.138-148
    • /
    • 2001
  • Digital Video (DV) coding standards for digital video cassette recorder are based mainly on DCT and variable length coding. DV has low hardware complexity but high compressed bit rate of about 26 Mb/s. Thus, it is necessary to encode video with low complex video coding at the studios and then transcode compressed video into MPEG-2 for video-on-demand system. Because these coding methods exploit DCT, transcoding in the DCT domain can reduce computational complexity by excluding duplicated procedures. In transcoding DV into MPEC-2 intra coding, multiplying matrix by transformed data is used for 4:1:1-to-4:2:2 chroma format conversion and the conversion from 2-4-8 to 8-8 DCT mode, and therefore enables parallel processing. Variance of sub block for MPEG-2 rate control is computed completely in the DCT domain. These are verified through experiments. We estimate motion hierarchically using DCT coefficients for transcoding into MPEG-2 inter coding. First, we estimate motion of a macro block (MB) only with 4 DC values of 4 sub blocks and then estimate motion with 16-point MB using IDCT of 2$\times$2 low frequencies in each sub block, and finish estimation at a sub pixel as the fifth step. ME with overlapped search range shows better PSNR performance than ME without overlapping.

  • PDF

A Study on Applicability of Pre-splitting Blasting Method According to Joint Frequency Characteristics in Rock Slope (암반사면의 절리빈도 특성에 따른 프리스플리팅 발파공법의 적용성 연구)

  • Kim, Shin;Lee, Seung-Joong;Choi, Sung-O.
    • Explosives and Blasting
    • /
    • v.28 no.2
    • /
    • pp.1-16
    • /
    • 2010
  • This study focuses on the phenomenon that the blast damaged zone developed on rock slope surfaces can be affected by joint characteristics rather than by explosive power when the pre-splitting is applied to excavate a jointed rock slope. The characteristics of rock joints on a slope were investigated and categorized them into 4 cases. Also an image processing system has been used for comparing the distribution pattern of rock blocks. From this investigation, it was found that the rock blocks bigger than 2,000 mm occupied 42% in the case of single joint set and it showed the well efficiency of pre-splitting blast. In cases of 2~3 parallel joint sets and 2~3 intersecting joint sets are developed on rock surfaces, the rock blocks in the range of 1,000~2,000 mm occupied 43.6% and 35.8%, respectively, and it showed that the efficiency of pre-splitting was decreased. When more than 3 joint sets are randomly developed, however, the rock blocks in the range of 250~500 mm occupied 35% and there was no block bigger than 1,000 mm. This denotes that the blasting with pre-splitting was not effective. The numerical analysis using PFC2D showed that the blast damaged zone in a rock mass could be directly influenced by the pre-splitting. It is, therefore, required to investigate the discontinuity pattern on rock surfaces in advance, when the pre-splitting method is applied to excavate jointed rock slopes and to apply a flexible blating design with a consideration of the joint characteristics.

The Relationship between Visual Stress and MBTI Personality Types (시각적 스트레스와 MBTI 성격유형과의 관계)

  • Kim, Sun-Uk;Han, Seung-Jo
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.13 no.9
    • /
    • pp.4036-4044
    • /
    • 2012
  • This study is aimed to investigate the association between web-based visual stress and MBTI personality types. The stressor deriving visual stress is built by 14 vowels out of Korean alphabet as a content and parallel striples as a background on the screen, which is given to each subject during 5min. The dependent variable indicating how much human takes visual stress is the reduction rate of flicker fusion frequency, which is evaluated with visual flicker fusion frequency tester. The independent variables are gender and 8 MBTI personality types(E-I, S-N, T-F, and J-P), and hypotheses are based on human information processing model and previous studies. The results address that the reduction rate is not significantly affected by gender, S-N, and J-P, but E-I and T-F have significant influences on it. The reduction rate in I-type is almost 2 times as much as that in E-type and T-type has the rate 2.2 times more than F-type. This study can be applicable to determine the adequate personnel for jobs requiring less sensibility to visual stressors in areas that human error may lead to critical damages to an overall system.

Implementation of High-Throughput SHA-1 Hash Algorithm using Multiple Unfolding Technique (다중 언폴딩 기법을 이용한 SHA-1 해쉬 알고리즘 고속 구현)

  • Lee, Eun-Hee;Lee, Je-Hoon;Jang, Young-Jo;Cho, Kyoung-Rok
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.47 no.4
    • /
    • pp.41-49
    • /
    • 2010
  • This paper proposes a new high speed SHA-1 architecture using multiple unfolding and pre-computation techniques. We unfolds iterative hash operations to 2 continuos hash stage and reschedules computation timing. Then, the part of critical path is computed at the previous hash operation round and the rest is performed in the present round. These techniques reduce 3 additions to 2 additions on the critical path. It makes the maximum clock frequency of 118 MHz which provides throughput rate of 5.9 Gbps. The proposed architecture shows 26% higher throughput with a 32% smaller hardware size compared to other counterparts. This paper also introduces a analytical model of multiple SHA-1 architecture at the system level that maps a large input data on SHA-1 block in parallel. The model gives us the required number of SHA-1 blocks for a large multimedia data processing that it helps to make decision hardware configuration. The hs fospeed SHA-1 is useful to generate a condensed message and may strengthen the security of mobile communication and internet service.

Efficient DRAM Buffer Access Scheduling Techniques for SSD Storage System (SSD 스토리지 시스템을 위한 효율적인 DRAM 버퍼 액세스 스케줄링 기법)

  • Park, Jun-Su;Hwang, Yong-Joong;Han, Tae-Hee
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.48 no.7
    • /
    • pp.48-56
    • /
    • 2011
  • Recently, new storage device SSD(Solid State Disk) based on NAND flash memory is gradually replacing HDD(Hard Disk Drive) in mobile device and thus a variety of research efforts are going on to find the cost-effective ways of performance improvement. By increasing the NAND flash channels in order to enhance the bandwidth through parallel processing, DRAM buffer which acts as a buffer cache between host(PC) and NAND flash has become the bottleneck point. To resolve this problem, this paper proposes an efficient low-cost scheme to increase SSD performance by improving DRAM buffer bandwidth through scheduling techniques which utilize DRAM multi-banks. When both host and NAND flash multi-channels request access to DRAM buffer concurrently, the proposed technique checks their destination and then schedules appropriately considering properties of DRAMs. It can reduce overheads of bank active time and row latency significantly and thus optimizes DRAM buffer bandwidth utilization. The result reveals that the proposed technique improves the SSD performance by 47.4% in read and 47.7% in write operation respectively compared to conventional methods with negligible changes and increases in the hardware.