• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.4A
• /
• pp.546-552
• /
• 2000

The decoding of Turbo-Code relies on the application of a soft input/soft output decoders which can be realized using maximum-a-posteriori(MAP) symbol estimator[l]. Radix-2 MAP decoder can not be used for high speed communications because of a large number of interleaver block size N. This paper proposed a new simple method for radix-4 MAP decoder based on radix-2 MAP decoder in order to reduce the interleave block size. A branch metrics, forward and backward recursive functions are proposed for applying to radix-4 MAP structure with symbol interleaver. Radix-4 MAP decoder shall be illustratively described and its error performance capability shall be compared to conventional radix-2 MAP decoder in AWGN channel.

• Herbal Formula Science
• /
• v.18 no.2
• /
• pp.1-14
• /
• 2010

This report describes 57 prescriptions including Paeoniae Radix and Glycyrrhizae Radix in Dongeuibogam. Paeoniae Radix and Glycyrrhizae Radix have been used separately or concurrently in Oriental Medicine for a long time as a treatment for various disease. The following conclusions are reached through investigations on the applications of prescriptions including Paeoniae Radix and Glycyrrhizae Radix in Dongeuibogam. 1. 7 times(12.3%) prescriptions are recorded in women chapter, 6 times(10.5%) in cold chapter, 5 times(8.8%) in stool chapter and fatigue chapter each, 4 times(7.0%) in psychiatry chapter, which are arranged in order of frequency. 2. Anxiety, Yin-Yang deficiency, stroke, treating blood, cataract, fever floating due to Yin deficiency, weak and fatigue, pregnancy, abortion, women accessary disease, cold-feeling heart pain, stiffness, etc, among 51 symptoms in prescriptions including Paeoniae Radix and Glycyrrhizae Radix. 3. The dosage of Paeoniae Radix and Glycyrrhizae Radix are from 5 pun:2.5 pun to 2 nyang:1 nyang. 1 jeon:5 pun is recored 39 times(68.4%), 2 jeon:1 jeon and 1 nyang:5 jeon is 6 times(3.21%), 2 nyang:1 nyang is 2 times(1.8%) used among 57 prescriptions including Paeoniae Radix and Glycyrrhizae Radix. 4. 57 prescriptions including Paeoniae Radix and Glycyrrhizae Radix are mostly composed of Samooltang and Sagoonjatang, Gyejitang, Gamgiltang, Bowontang, Goongguitang, Jeongwoneum, Bojoongikgitang, Jigoongsan, Ijintang, Pyeongwuisan, Oryungsan, etc, according to the usage.

• Korean Journal of Pharmacognosy
• /
• v.16 no.2
• /
• pp.81-92
• /
• 1985

The Polygoni Radix and Cynanchi Radix have been used to potentiate the liver functions in clinic of Oriental Medicine. The water extracts of Polygoni Radix and Cynanchi Radix were administered orally to rats intoxicated with carbon tetrachloride and then this experiment have been performed by observing liver fatty degeneration and activities of enzymes such as cytochrome oxidase (CYO), adenosine triphosphatase (ATP), acid phosphatase (ACP), lactate dehydrogenase (LDH) and alkaline phosphatase (ALP). By oral administration of water extracts of the radices between 1 and 10 days, the following results were obtained. 1. The group given Cynanchi Radix extract showed recovery of the fat liver in 4 days, whereas that given Polygoni Radix extract did the recovery in 8 days. 2. In cytochrome oxidase activity, the group given Cynanchi extract showed normal activity in 6 days, whereas that given Polygoni Radix extract did the activity in 8 days. 3. In adenosine triphosphatase activity, the groups given Cynanchi Radix and Polygoni Radix extracts showed normal activities in 2 and 8 days, respectively. 4. In acid phosphatase activity, the groups given Cynanchi Radix and Polygoni Radix extracts showed recovery of the activities in 2 and 4 days, respectively. 5. In lactate dehydrogenase activity, the group given Cynanchi Radix and Polygoni Radix extracts showed recovery of the activities in 6 and 10 days, respectively. 6. In alkaline phosphatase activity, the group given Cynanchi Radix extract showed normal activity in 2 days, whereas that given Polygoni Radix extract showed slight recovery between 4 and 6 days followed by decrease of the activity in 8 and 10 days. From the above-mentioned results, it was found that both of the water extracts of Polygoni and Cynanchi Radix possessed the recovery action of liver function as intoxicated with carbon tetrachloride in rats. It is also noted that the extract of Cynanchi Radix showed more potent activity than that of Polygoni Radix.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.5
• /
• pp.84-93
• /
• 2007

In this paper, a Radix-8 structure for high-speed FFT is propose. Main block of the proposed FFT structure is Radix-8 DIF(Decimation In Frequency) butterfly. Even throughput of the Radix-8 FFT is twice than that of the Radix-4 FFT, implementation area of the Radix-8 is larger than that of Radix-4 FFT. But, implementation area of the proposed Radix-8 FFT was reduced by using DA(Distributed Arithmetic) for multiplication. For comparison, the 64-point FFT was implemented using conventional Radix-4 butterfly and proposed Radix-8 butterfly, respectively. The Verilog-HDL coding results for the proposed FFT structure show 49.2% cell area increment comparison with those of the conventional Radix-4 FFT structure. Namely, to speed up twice, 49.2% of area cost is required. In case of same throughput, power consumption of the proposed structure is reduced by 25.4%. Due to its efficient processing scheme, the proposed FFT structure can be used in large size of FFT like OFDM Modem.

• Proceedings of the IEEK Conference
• /
• 2000.11b
• /
• pp.297-300
• /
• 2000

This paper proposes a high-speed and area-efficient FFT algorithm and performs a hardware implementation. This algorithm, named by “Radix-4/2”, uses the feature of existing radix-2$^3$algorithm, It reduces the number of non-trivial multipliers in SFG to the ratio of 3 to 2 campared with radix-2 or radix-4 algorithm and radix-4/2 has also twice throughput as radix-2$^3$algorithm's. It is proved that FFT processor using the proposed algorithm and 64-point MDC pipeline architecture has twice throughput as radix-2$^3$algorithm's, and reduces areas by 25 percentages in contrast to radix-4 algorithm's.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.9
• /
• pp.2121-2126
• /
• 2013

This paper compares radix-2 based structures for 32768-point FFT. Radix-$2^k$ structures have been widely used because the butterfly is simple and the number of multipliers can be reduced in those structures. This paper applied various radix-$2^k$ structures to 32768-point FFT that is representing ultra-long FFT. The ultra-long FFT has been studied much recently. This paper shows that the radix-$2^4$ structure is the most adequate because it shows the smallest complexity in the synthesis and the best SQNR performance. should be placed here.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.12 no.2
• /
• pp.35-44
• /
• 2002

In this paper, an implementation method of RSA exponentiator based on Radix-$2^k$ modular multiplication algorithm is presented and verified. We use Booth receding algorithm to implement Radix-$2^k$ modular multiplication and implement radix-16 modular multiplier using 2K-byte memory and CSA(carry-save adder) array - with two full adder and three half adder delays. For high speed final addition we use a reduced carry generation and propagation scheme called pseudo carry look-ahead adder. Furthermore, the optimum value of the radix is presented through the trade-off between the operating frequency and the throughput for given Silicon technology. We have verified 1,024-bit RSA processor using Altera FPGA EP2K1500E device and Samsung 0.3$\mu\textrm{m}$ technology. In case of the radix-16 modular multiplication algorithm, (n+4+1)/4 clock cycles are needed and the 1,024-bit modular exponentiation is performed in 5.38ms at 50MHz.

• Journal of Digital Convergence
• /
• v.11 no.2
• /
• pp.287-297
• /
• 2013

In this paper, we propose an efficient variable-length radix-8/4/2 FFT architecture for OFDM systems. The FFT processor is based on radix-8 FFT algorithm and also supports radix-4 or radix-2 FFT computation. We are using efficient "In-place" memory access method to maintain conflict-free data access and minimize memory size. Also we replace a very large lookup table with a twiddle factor generator which consumes less area then a ROM-based lookup table. The proposed FFT processor performs variable-length FFT including 64, 256, 512, 1024, 2048, 4096 and 8192 points which cover all the required FFT lengths used in 802.11a, 802.16a, DAB, DVB-T, VDSL and ADSL.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.85-86
• /
• 2007

In this paper, a Radix-8 structure for high-speed FFT is proposed. Even throughput of the Radix-8 FFT is twice than that of the Radix-4 FFT, implementation area of the Radix-8 is larger than that of Radix-4 FFT. But, implementation area of the proposed Radix-8 FFT was reduced by using DA(Distributed Arithmetic) for multiplication. The Verilog-HDL coding results for the proposed FFT structure show 49.2% cell area increment comparison with those of the conventional Radix-4 FFT structure. Namely, to speed up twice, 49.2% of area cost is required. In case of same throughput, power consumption of the proposed structure is reduced by 25.4%.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.8
• /
• pp.5579-5585
• /
• 2015

In FFT(Fast Fourier Transform) implementation, DIT(Decimation-In-Time) and DIF (Decimation-In-Frequency) methods are mostly used. Among them, various DIF structures such as Radix-2/4/8 algorithm have been developed. Compared to the DIF, the DIT structures have not been investigated even though they have a big advantage producing a sequential output. In this paper, a butterfly structure for DIT Radix-8 algorithm is proposed. The proposed structure has smaller latency time because of Radix-8 algorithm in addition to the advantage of the sequential output. In case of 4096-point FFT implementation, the proposed structure has only 4 stages which shows the smaller latency time compared to the 12 stages of Radix-2 algorithm. The proposed butterfly can be used in FFT block required the sequential output and smaller latency time.