• Carbon letters
• /
• v.27
• /
• pp.35-41
• /
• 2018

Surfactant-wrapped separation methods of metallic and semiconducting single-walled carbon nanotubes (SWCNTs) can result in large changes in intrinsic physical and chemical properties due to electronic interactions between a nanotube and a surfactant. Our approach to synthesize SWCNTs with an electronic feature relied on utilizing carbon nanorings, [n] cycloparaphenylenes ([n]CPPs), which are the fundamental unit of armchair type SWCNTs (a-SWCNTs) that possess a metallic feature without any surfactants. To obtain long tubular structures from [n]CPPs, the host-guest complexes formed with well-aligned [n]CPP hosts and various fullerene guests on a silicon substrate were pyrolyzed under an ethanol gas flow at a high temperature with focused-ultraviolet laser irradiation. The pyrolyzed [n]CPPs were observed to transform from nanorings to tubular structures with 1.5-1.7 nm diameters corresponding to the employed diameter of [n]CPPs. Our approach suggests that [n]CPPs are useful for structure-controlled synthesis of SWCNTs.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.04a
• /
• pp.447-450
• /
• 2011

This paper shows the application of P-N Learning [4] method in the soccer ball detection and improvement for increasing the speed of processing. In the P-N learning, the learning process is guided by positive (P) and negative (N) constraints which restrict the labeling of the unlabeled data, identify examples that have been classified in contradiction with structural constraints and augment the training set with the corrected samples in an iterative process. But for the long-view in the soccer game, P-N learning will produce so many ferns that more time is spent than other methods. We propose that color histogram of each frame is constructed to delete the unnecessary details in order to decreasing the number of feature points. We use the mask to eliminate the gallery region and Line Hough Transform to remove the line and adjust the P-N learning's parameters to optimize accurate and speed.

• Journal of Advanced Navigation Technology
• /
• v.7 no.2
• /
• pp.141-148
• /
• 2003

This paper presents and compares several techniques that detect the symbol rate of unknown received signal. Symbol rate is detected from the power spectral density of the circuits such as the delay and multiplier circuit, the square law circuit, and analytic signal, etc. As a result of discrete Fourier transform of the output signals of these circuits, a lot of spectral lines and some peaks appear in frequency domain and the position of first peak is corresponding to the symbol rate. If a spectral line on the frequency that is not located in symbol rate is larger than the first peak, the symbol rate is erroneously detected. Thus, the ratio between the value of first peak and the highest side spectral line is used for the measure of the performance of symbol rate detector. For the MPSK modulation, the analytic signal method shows better performance than the delay and multiplier and square law circuits when the received signal power is lager than -20dB. It is also noted that the delay and multiplier circuit is not able to detect the symbol rate for the QAM modulation.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.5
• /
• pp.32-38
• /
• 2009

FTT(Fast Fourier Transform) processor is widely used in OFDM(Orthogonal Frequency Division Multiplesing) system. Because of the increased requirement of mobility and bandwidth in the OFDM system, they need large point FTT processor. Since the size of memory which stores the twiddle factor coefficients are proportional to the N of FFT size, we propose a new method by which we can reduce the size of the coefficient memory. In the proposed method, we exploit a counter and unsigned multiplier to generate the twiddle factor indices. To verify the proposed algorithm, we design TFCGs(Twiddle Factor Coefficient Generator) for 1024pint FFTs with R2SDF(Radix-2 Single-Path Delay Feedback), $R2^3SDF,\;R2^3SDF,\;R2^4SDF$ architectures. The size of ROM is reduced to 1/8N. In the case of $R2^4SDF$ architecture, the area and the power are reduced by 57.9%, 57.5% respectively.

• ETRI Journal
• /
• v.43 no.5
• /
• pp.869-880
• /
• 2021

Herein, we estimate the direction of arrival (DOA) of non-Gaussian signals for nested arrays (NAs) by implementing the fourth-order difference co-array (FODC) and successive methods. In particular, considering the property of the fourth-order cumulant (FOC), we first construct the FODC of the NA, which can obtain O(N⁴) virtual elements using N physical sensors, whereas conventional FOC methods can only obtain O(N²) virtual elements. In addition, the closed-form expression of FODC is presented to verify the enhanced degrees of freedom (DOFs). Subsequently, we exploit the vectorized FOC (VFOC) matrix to match the FODC of the NA. Notably, the VFOC matrix is a single snapshot vector, and the initial DOA estimates can be obtained via the discrete Fourier transform method under the underdetermined correlation matrix condition, which utilizes the complete DOFs of the FODC. Finally, fine estimates are obtained through the spatial smoothing-Capon method with partial spectrum searching. Numerical simulation verifies the effectiveness and superiority of the proposed method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.12
• /
• pp.1970-1982
• /
• 1993

This paper describes an efficient array algorithm for parallel computation of vector-radix two-dimensional (2-D) fast discrete cosine transform (VR-FCT), and its VLSI implementation. By mapping the 2-D VR-FCT onto a 2-D array of processing elements (PEs), the butterfly structure of the VR-FCT can be efficiently importanted with high concurrency and local communication geometry. The proposed array algorithm features architectural modularity, regularity and locality, so that it is very suitable for VLSI realization. Also, no transposition memory is required, which is invitable in the conventional row-column decomposition approach. It has the time complexity of O(N+Nnzp-log2N) for (N*N) 2-D DCT, where Nnzd is the number of non-zero digits in canonic-signed digit(CSD) code, By adopting the CSD arithmetic in circuit desine, the number of addition is reduced by about 30%, as compared to the 2`s complement arithmetic. The computational accuracy analysis for finite wordlength processing is presented. From simulation result, it is estimated that (8*8) 2-D DCT (with Nnzp=4) can be computed in about 0.88 sec at 50 MHz clock frequency, resulting in the throughput rate of about 72 Mega pixels per second.

• Journal of the Korean Ceramic Society
• /
• v.39 no.5
• /
• pp.479-483
• /
• 2002

Silicon dioxide thick film using silica optical waveguide cladding was fabricated by Plasma Enhanced Chemical Vapor Deposition(PECVD) method, at a low temperature ($320^{\circ}$C) and from $(SiH_4+N_2O)$ gas mixtures. The effects of deposition parameters on properties of $SiO_2$ thick films were investigated by variation of $N_2O/SiH_4$ flow ratio and RF power. After the deposition process, the samples were annealed in a furnace at $1150^{\circ}$C, in N2 atmosphere, for 2h. As the $N_2O/SiH_4$ flow ratio increased, deposition rate decreased from 9.4 to 2.9 ${\mu}m/h$. As the RF power increased, deposition rate increased from 4.7 to 6.9 ${\mu}m/h$. The thickness and the refractive index measurements were measured by prism coupler. X-ray Photoelectron Spectroscopy(XPS) and Fourier Transform-infrared Spectroscopy(FT-IR) were used to determine the chemical states. The cross-section of films was observed by Scanning Electron Microscopy(SEM).

• Communications of the Korean Mathematical Society
• /
• v.27 no.4
• /
• pp.721-732
• /
• 2012

The principal aim of the paper is to investigate new integral expression $${\int}_0^{\infty}x^{s+1}e^{-{\sigma}x^2}L_m^{(\gamma,\delta)}\;({\zeta};{\sigma}x^2)\;L_n^{(\alpha,\beta)}\;({\xi};{\sigma}x^2)\;J_s\;(xy)\;dx$$, where $y$ is a positive real number; $\sigma$, $\zeta$ and $\xi$ are complex numbers with positive real parts; $s$, $\alpha$, $\beta$, $\gamma$ and $\delta$ are complex numbers whose real parts are greater than -1; $J_n(x)$ is Bessel function and $L_n^{(\alpha,\beta)}$ (${\gamma};x$) is generalized Laguerre polynomials. Some integral formulas have been obtained. The Maple implementation has also been examined.

• Journal of the Korean Vacuum Society
• /
• v.7 no.s1
• /
• pp.190-196
• /
• 1998

Amorphous ternary $Si_xC_yN-z$ thin films were obtained by plasma enhanced chemical vapor deposition(PECVD) using $N_2, SiH_4 \;and \;C_2H_4$ as the reaction sources. The chemical state were characterized by x-ray photoelectron spectroscopy (XPS) and Fourier transform infrared spectroscopy(FTIR). The optical properties of the thin films were investigated by UV-visible spectrophotometer and ellipsometer, and the optical band gaps of thin films were determined from corresponding transmittance spectra following Tauc equation.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10b
• /
• pp.245-250
• /
• 1992

In this paper, we present a nev algorithm for the fast computation of the discrete cosine transform(DCT). This algorithm consists of the three dimensional prime factor-decomposed algorithm(PFA) and three dimensional common factor-decomposed algorithm(CFA). We can compute N-point DCT for the number N decomposable Into three relative prime numbers using PFA and into three common numbers using CFA. We also show input and output index mapping for the three decomposition. it results in requiring fever multiplicaions than the previous algorithms. Particularly, for the large number N, it is more powerful in reducing the number of multiplication.