VLSI architecture of a K-best detector for MIMO--OFDM wireless communication systems

The K-best detector is considered as a promising technique in the MIMO-OFDM detection because of its good performance and low complexity. In this paper, a new K-best VLSI architecture is presented. In the proposed architecture, the metric computation units (MCUs) expand each surviving path only to its partial branches, based on the novel expansion scheme, which can predetermine the branches' ascending order by their local distances. Then a distributed sorter sorts out the new K surviving paths from the expanded branches in pipelines. Compared to the conventional K-best scheme, the proposed architecture can approximately reduce fundamental operations by 50% and 75% for the 16-QAM and the 64-QAM cases, respectively, and, consequently, lower the demand on the hardware resource significantly. Simulation results prove that the proposed architecture can achieve a performance very similar to conventional K-best detectors. Hence, it is an efficient solution to the K-best detector's VLSI implementation for high-throughput MIMO-OFDM systems.

Hit-or-miss representation of a pattern spectrum and its optical implementation

We demonstrate that a pattern spectrum can be decomposed into the union of hit-or-miss transforms with respect to a series of structure-element pairs. Moreover we use a Boolean-logic function to express the pattern spectrum and show that the Boolean-logic representation of a pattern spectrum is composed of hit-or-miss min terms. The optical implementation of a pattern spectrum is based on an incoherent optical correlator with a feedback operation. (C) 1996 Optical Society of America

Fuzzy reasoning morphological operators and their optical implementation

Fuzzy-reasoning theory is widely used in industrial control. Mathematical morphology is a powerful tool to perform image processing. We apply fuzzy-reasoning theory to morphology and suggest a scheme of fuzzy-reasoning morphology, including fuzzy-reasoning dilation and erosion functions. These functions retain more fine details than the corresponding conventional morphological operators with the same structuring element. An optical implementation has been developed with area-coding and thresholding methods. (C) 1997 Optical Society of America.

Scaled fractional Fourier transform and its optical implementation

The scaled fractional Fourier transform is suggested and is implemented optically by one lens for different values of phi and output scale. In addition, physically it relates the FRT with the general lens transform-the optical diffraction between two asymmetrically positioned planes before and after a lens. (C) 1997 Optical Society of America.

Logic-operated mathematical morphology and its optical implementation

A more powerful tool for binary image processing, i.e., logic-operated mathematical morphology (LOMM), is proposed. With LOMM the image and the structuring element (SE) are treated as binary logical variables, and the MULTIPLY between the image and the SE in correlation is replaced with 16 logical operations. A total of 12 LOMM operations are obtained. The optical implementation of LOMM is described. The application of LOMM and its experimental results are also presented. (C) 1999 Optical Society of America.

Two-step digit-set-restricted modified signed-digit addition-subtraction algorithm and its optoelectronic implementation

A novel, to our knowledge, two-step digit-set-restricted modified signed-digit (MSD) addition-subtraction algorithm is proposed. With the introduction of the reference digits, the operand words are mapped into an intermediate carry word with all digits restricted to the set {(1) over bar, 0} and an intermediate sum word with all digits restricted to the set {0, 1}, which can be summed to form the final result without carry generation. The operation can be performed in parallel by use of binary logic. An optical system that utilizes an electron-trapping device is suggested for accomplishing the required binary logic operations. By programming of the illumination of data arrays, any complex logic operations of multiple variables can be realized without additional temporal latency of the intermediate results. This technique has a high space-bandwidth product and signal-to-noise ratio. The main structure can be stacked to construct a compact optoelectronic MSD adder-subtracter. (C) 1999 Optical Society of America.

FUZZY SOLID SETS FOR MATHEMATICAL MORPHOLOGY AND OPTICAL IMPLEMENTATION

Fuzzy sets in the subject space are transformed to fuzzy solid sets in an increased object space on the basis of the development of the local umbra concept. Further, a counting transform is defined for reconstructing the fuzzy sets from the fuzzy solid sets, and the dilation and erosion operators in mathematical morphology are redefined in the fuzzy solid-set space. The algebraic structures of fuzzy solid sets can lead not only to fuzzy logic but also to arithmetic operations. Thus a fuzzy solid-set image algebra of two image transforms and five set operators is defined that can formulate binary and gray-scale morphological image-processing functions consisting of dilation, erosion, intersection, union, complement, addition, subtraction, and reflection in a unified form. A cellular set-logic array architecture is suggested for executing this image algebra. The optical implementation of the architecture, based on area coding of gray-scale values, is demonstrated. (C) 1995 Optical Society of America

Fuzzy inferring mathematical morphology and optical implementation

Fuzzification is introduced into gray-scale mathematical morphology by using two-input one-output fuzzy rule-based inference systems. The fuzzy inferring dilation or erosion is defined from the approximate reasoning of the two consequences of a dilation or an erosion and an extended rank-order operation. The fuzzy inference systems with numbers of rules and fuzzy membership functions are further reduced to a simple fuzzy system formulated by only an exponential two-input one-output function. Such a one-function fuzzy inference system is able to approach complex fuzzy inference systems by using two specified parameters within it-a proportion to characterize the fuzzy degree and an exponent to depict the nonlinearity in the inferring. The proposed fuzzy inferring morphological operators tend to keep the object details comparable to the structuring element and to smooth the conventional morphological operations. Based on digital area coding of a gray-scale image, incoherently optical correlation for neighboring connection, and optical thresholding for rank-order operations, a fuzzy inference system can be realized optically in parallel. (C) 1996 Society of Photo-Optical Instrumentation Engineers.

Classified one-step modified signed-digit arithmetic and its optical implementation

Based on the two-step modified signed-digit (MSD) algorithm, we present a one-step algorithm for the parallel addition and subtraction of two MSD numbers. This algorithm is reached by classifying the three neighboring digit pairs into 10 groups and then making a decision on the groups. It has only a look-up truth table, and can be further formulated by eight computation rules. A joint spatial encoding technique is developed to represent both the input data and the computation rules. Furthermore, an optical correlation architecture is suggested to implement the MSD adder in parallel. An experimental demonstration is also given. (C) 1996 Society of Photo-Optical instrumentation Engineers.

Optical two-dimensional SW-banyan network: Optical implementation, routing control, and determination of permissible permutations

A 2-D SW-banyan network is introduced by properly folding the 1-D SW-banyan network, and its corresponding optical setup is proposed by means of polarizing beamsplitters and 2-D phase spatial light modulators. Then, based on the characteristics and the proposed optical setup, the control for the routing path between any source-destination pair is given, and the method to determine whether a given permutation is permissible or not is discussed. Because the proposed optical setup consists of only optical polarization elements, it is compact in structure, its corresponding energy loss and crosstalk are low, and its corresponding available number of channels is high. (C) 1996 Society of Photo-Optical Instrumentation Engineers.

Routing scheme, permutation properties, and optical implementation of a four-shuffle-exchange-based Omega network

The routing scheme and some permutation properties of a four-shuffle-exchange-based Omega network are discussed. The corresponding optical setup, which is composed of 2-D phase spatial light modulators and calcite plates, is proposed and demonstrated through mapping the inputs to a 2-D array. Instead of one shuffle-exchange followed by one switching operation as in ordinary Omega networks, in our presented system, the shuffle interconnection embraced in the switches is accomplished simply by varying the switching structure of each stage. For the proposed polarization-optical modules, the system is compact in structure, efficient in performance, and insensitive to the environment. (C) 1997 Society of Photo-Optical Instrumentation Engineers.

Parallel optical negabinary signed-digit computing: algorithm and optical implementation

Negabinary is a component of the positional number system. A complete set of negabinary arithmetic operations are presented, including the basic addition/subtraction logic, the two-step carry-free addition/subtraction algorithm based on negabinary signed-digit (NSD) representation, parallel multiplication, and the fast conversion from NSD to the normal negabinary in the carry-look-ahead mode. All the arithmetic operations can be performed with binary logic. By programming the binary reference bits, addition and subtraction can be realized in parallel with the same binary logic functions. This offers a technique to perform space-variant arithmetic-logic functions with space-invariant instructions. Multiplication can be performed in the tree structure and it is simpler than the modified signed-digit (MSD) counterpart. The parallelism of the algorithms is very suitable for optical implementation. Correspondingly, a general-purpose optical logic system using an electron trapping device is suggested. Various complex logic functions can be performed by programming the illumination of the data arrays without additional temporal latency of the intermediate results. The system can be compact. These properties make the proposed negabinary arithmetic-logic system a strong candidate for future applications in digital optical computing with the development of smart pixel arrays. (C) 1999 Society of Photo-Optical Instrumentation Engineers. [S0091-3286(99)00803-X].

Optoelectronic implementation of mathematical morphology

An optoelectronic implementation based on optical neighborhood operations and electronic nonlinear feedback is proposed to perform morphological image processing such as erosion, dilation, opening, closing and edge detection. Results of a numerical simulation are given and experimentally verified.

Polarization analysis and experimental implementation of PLZT electro-optical switch using fiber Sagnac interferometers

The polarization characteristics of electro-optical (EO) switches using fiber Sagnac interferometer (FSI) structures are theoretically investigated. Analytical solutions of output fields are presented when the twists and birefringence in a Sagnac loop are considered. Numerical calculations show that the twists of fiber, the orientation of the inserted phase retarder, and the splitting ratio of the coupler will influence both the output intensity and the output polarization properties of the proposed switch. A polarization-independent EO switch based on a Sagnac interferometer and a PUT bar was experimentally implemented, which showed good coincidence with the analytical results. The experiment showed a switch with 22 dB extinction ratio and less than 31.1 ns switching time. (c) 2006 Optical Society of America.