• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.39 no.5
• /
• pp.65-73
• /
• 2002

In this paper, we propose and verify an implementation method for a single-chip 2048 complex point FFT/IFFT in terms of sequential data processing. For the sequential processing of 2048 complex data, buffers to store the input data are necessary. Therefore, DRAM-like pipelined commutator architecture is used as a buffer. The proposed structure brings about the 60% chip size reduction compared with conventional approach by using this design method. The 16-point FFT is a basic building block of the entire FFT chip, and the 2048-point FFT consists of the cascaded blocks with five stages of radix-4 and one stage of radix-2. Since each stage requires rounding of the resulting bits while maintaining the proper S/N ratio, the convergent block floating point (CBFP) algorithm is used for the effective internal bit rounding and their method contributed to a single chip design of digital audio broadcasting system.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.12
• /
• pp.87-95
• /
• 2009

In this paper, an area-efficient FFT processor is proposed for MIMO-OFDM based SDR systems. The proposed scalable FFT processor can support the variable length of 64, 128, 512, 1024 and 2048. By reducing the required number of non-trivial multipliers with mixed-radix (MR) and multi-path delay commutator (MDC) architecture, the complexity of the proposed FFT processor is dramatically decreased without sacrificing system throughput The proposed FFT processor was designed in hardware description language (HDL) and synthesized to gate4eve1 circuits using 0.18um CMOS standard cell library. With the proposed architecture, the gate count for the processor is 46K and the size of memory is 64Kbits, which are reduced by 59% and 39%, respectively, compared with those of the 4-channel radix-2 single-path delay feedback (R2SDF) FFT processor. Also, compared with 4-channel radix-2 MDC (R2MDC) FFT processor, it is confirmed that the gate count and memory size are reduced by 16.4% and 26.8, respectively.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.54 no.7
• /
• pp.29-35
• /
• 2017

This paper presents a high-throughput area-efficient mixed-radix fast Fourier transform (FFT) processor using the efficient scheduling schemes. The proposed FFT processor can support 64, 128, 256, and 512-point FFTs for orthogonal frequency division multiplexing (OFDM) systems, and can achieve a high throughput using mixed-radix algorithm and eight-parallel multipath delay commutator (MDC) architecture. This paper proposes new scheduling schemes to reduce the size of read-only memories (ROMs) and complex constant multipliers without increasing delay elements and computation cycles; thus, reducing the hardware complexity further. The proposed mixed-radix MDC FFT processor is designed and implemented using the Samsung 65nm complementary metal-oxide semiconductor (CMOS) technology. The experimental result shows that the area of the proposed FFT processor is 0.36 mm2. Furthermore, the proposed processor can achieve high throughput rates of up to 2.64 GSample/s at 330 MHz.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.3C
• /
• pp.175-182
• /
• 2011

This paper presents a novel eight-parallel 128/256-point mixed-radix multi-path delay commutator (MRMDC) FFT/IFFT processor for orthogonal frequency-division multiplexing (OFDM) systems. The proposed FFT architecture can provide a high throughput rate and low hardware complexity by using an eight-parallel data-path scheme, a modified mixed-radix multi-path delay commutator structure and an efficient scheduling scheme of complex multiplications. The efficient scheduling scheme can reduce the number of complex multipliers at the second stage from 88 to 40. The proposed FFT/IFFT processor has been designed and implemented with the 90nm CMOS technology. The proposed eight-parallel FFT/IFFT processor can provide a throughput rate of up to 27.5Gsample/s at 430MHz.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.10C
• /
• pp.1025-1031
• /
• 2007

This paper proposes an area-efficient pipeline FFT processor for MIMO-OFDM systems with four transmitting and four receiving antennas. Since the MIMO-OFDM system transmits multiple data streams, the complexity for the MIMO-OFDM system with a single-channel FFT processor increases linearly with the increase of the number of transmit channels. The proposed FFT processor is based on multi-channel structure, and therefore it can efficiently support multiple data streams. With the mixed radix algorithm, the number of non-trivial multiplications of the proposed FFT processor is decreased. The proposed FFT processor is synthesized with CMOS $0.18{\mu}m$ process and reduces the logic gates by 25% over a 4-channel Radix-4 multi-path delay commutator (R4MDC) FFT processor. Since the MIMO-OFDM FFT processor is one of the largest modules in the systems, the proposed FFT processor will be a vast contribution improvement to the low complexity design of MIMO-OFDM systems.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.3
• /
• pp.570-576
• /
• 2004

In this paper, we design the IFFT/FFT (Inverse fast Fourier Transform/Fast Fourier Transform) modules for IEEE 802.11a-1999, which is a standard of the High-speed Wireless LAN using the OFDM (Orthogonal Frequency Division Multiplexing). The designed IFFT/FFT is the 64-point FFT to be compatible with IEEE 802.11a and the pipelined architecture which needs neither serial-to-parallel nor parallel-to-serial converter. We compare four types of IFFT/FFT modules for the hardware complexity and operation : R22SDF (Radix-2 Single-path Delay feedback), the R2SDF (Radix-2 Single-path Delay feedback), R2SDF (Radix-4 Single-path Delay Feedback), and R4SDC (Radix-4 Single-path Delay Commutator). In order to minimize the error, we design the IFFT/FFT module to operate with additional decimal parts after butterfly operation. In case of the R22SDF, the IFFT/FFT module has 44,747 gate counts excluding RAMs and the minimized error rate as compared with other types. And we know that the R22SDF has a small hardware structure as compared with other types.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.10a
• /
• pp.621-622
• /
• 2017

In this paper, a low-complexity FFT processor is proposed for narrow-band interference signal cancellation based array antenna. The proposed FFT pocessor can support the variable length of 64, 128 and 512. By reducing number of non-tirval multipliers with mixed radix-4/2/4/2/4/2 algorithm and flexible multi-path delay commutator(MDC) architecture, the complexity of the proposed FFT processor is dramatically decreased. The proposed FFT processor was designed in Xilinx system generator and Implemented with Xilinx Virtex-7 FPGA. With the proposed architecture, the number of slices for the processor is 11454, and the number of DSP48s is 194.

• Tribology and Lubricants
• /
• v.26 no.5
• /
• pp.277-282
• /
• 2010

The purpose of this paper is to study and analysis the failure examples for parasitic current leakage produced in starting system on gasoline engine. It verified the discharge of battery by electric leakage because of internal wiring damage problem for CD auto changer installed in car. Also, it verified the no-stating phenomenon because of deposit forming by chemical reaction of battery fluid between battery post and cable fixing parts. It verified the damage for brush holder and commutator mixing by internal short phenomenon because of brush carbon a particle and engine oil that was flowed into internal of starting motor. It verified the working phenomenon of audio by a point of contact even if the driver turn to "LOCK" position the key.

• Bulletin of the Korean Mathematical Society
• /
• v.52 no.2
• /
• pp.581-591
• /
• 2015

Let $\mathcal{A}$ be a factor von Neumann algebra with dimension greater than 1. We prove that if a linear map ${\delta}:\mathcal{A}{\rightarrow}\mathcal{A}$ satisfies $${\delta}([[a,b],c])=[[{\delta}(a),b],c]+[[a,{\delta}(b),c]+[[a,b],{\delta}(c)]$$ for any $a,b,c{\in}\mathcal{A}$ with ab = 0 (resp. ab = P, where P is a fixed nontrivial projection of $\mathcal{A}$), then there exist an operator $T{\in}\mathcal{A}$ and a linear map $f:\mathcal{A}{\rightarrow}\mathbb{C}I$ vanishing at every second commutator [[a, b], c] with ab = 0 (resp. ab = P) such that ${\delta}(a)=aT-Ta+f(a)$ for any $a{\in}\mathcal{A}$.

• Bulletin of the Korean Mathematical Society
• /
• v.55 no.4
• /
• pp.1037-1049
• /
• 2018

In this paper, we have first presented the construction of the linear characters of a finite Coxeter group $G_n$ of type $B_n$ by lifting all linear characters of the quotient group $G_n/[G_n,G_n]$ of the commutator subgroup $[G_n,G_n]$. Also we show that the sets of distinguished coset representatives $D_A$ and $D_{A^{\prime}}$ for any two signed compositions A, A' of n which are $G_n$-conjugate to each other and for each conjugate class ${\mathcal{C}}_{\lambda}$ of $G_n$, where ${\lambda}{\in}\mathcal{BP}(n)$, the equality ${\mid}{\mathcal{C}}_{\lambda}{\cap}D_A{\mid}={\mid}{\mathcal{C}}_{\lambda}{\cap}D_{A^{\prime}}{\mid}$ holds. Finally, we have given the general structure of units of Mantaci-Reutenauer algebra.