Institute of Embedded Systems

Menu

2002

Zimmermann K. Efficient DNA sticker algorithms for NP-complete graph problems.. Computer Physics Communications.. 2002 Apr.; 144.((3),):297-309.      [DOI] 
Zimmermann K. On applying molecular computation to binary linear codes.. IEEE Transactions on Information Theory.. 2002 Feb.; 48.((2),):505-510.      [DOI] 

2001

Popp A, Zimmermann K. On loop transformations of nested loops with affine dependencies.. Computer Physics Communications.. 2001 Sep.; 139((1)):90-103.      [DOI] 
Fey G. Set Partitioning in Hierarchical Trees: eine FPGA-Implementierung. [Diploma Thesis]. 2001.
Zimmermann K, Achtziger W. Optimal piecewise linear schedules for LSGP- and LPGS-decomposed array processors via quadratic programming.. Computer Physics Communications.. 2001 Sep.; 139((1)):64-89.      [DOI] 
Babu NS, Zimmermann K. Decoding of linear codes over Galois rings.. IEEE Transactions on Information Theory.. 2001 May; 47((4)):1599-1603.      [DOI] 

2000

Thomas Rehfinger NSB, Zimmermann K. New Good Codes via CQuest - A System for the Silicon Search of Linear Codes.. In: In A. Betten, A. Kohnert, R. Laue and A. Wassermann (Eds.), editors. Algebraic Combinatorics and Applications. Springer; 2000 Jul.. p. 294-306.      [DOI] 
Achtziger W, Zimmermann K. Finding Quadratic Schedules for Affine Recurrence Equations Via Nonsmooth Optimization.. Journal of Signal Processing Systems.. 2000 Jul.; 25((3)):235-260.      [DOI] 

1999

Thomas Rehfinger NSB, Zimmermann K. Parallelizing the Search for Good Linear Codes.. In: In Proceedings of Workshop zur Architektur von Rechensystemen. Jena / Germany: 1999 Oct.. p. 203-210.

1998

Anton Betten AW, Zimmermann K. Codierungstheorie - Konstruktion und Anwendung linearer Codes.. Springer; 1998.      [DOI] 
Falk H. Hardware Partitioning for Prototype Boards (in German). [Diploma Thesis]. Dortmund / Germany: University of Dortmund; 1998 Aug..
Zimmermann K, Achtziger W. On Time Optimal Implementation of Uniform Recurrences onto Array Processors via Quadratic Programming.. Journal of Signal Processing Systems.. 1998 May; 19((1)):19-38.      [DOI] 
Achtziger W, Zimmermann K. Computing time-optimal quadratic schedules for affine recurrence equations.. Erlangen / Germany: 1998. Report No.: (243).

1997

Zimmermann K. A Unifying Lattice-Based Approach for the Partitioning of Systolic Arrays via LPGS and LSGP.. Journal of Signal Processing Systems.. 1997 Sep.; 17.((1)):21-41.      [DOI] 
Zimmermann K, Achtziger W. Finding Space-Time Transformations for Uniform Recurrences via Branching Parametric Linear Programming.. Journal of Signal Processing Systems.. 1997 Mar.; 15.((3)):259-274.      [DOI] 
Achtziger W, Zimmermann K. Optimal Polynomial Schedules: An Approach via Non-smooth Optimization.. In: In Proceedings of the First International Workshop on Approximate Reasoning in Scheduling (ARS). Zurich / Switzerland: 1997 Feb..

1996

Achtziger W, Zimmermann K. On optimal piecewise linear schedules for LSPG- and LPGS-partitionings of array processors via quadratic programming.. Erlangen / Germany: 1996. Report No.: (202).
Achtziger W, Zimmermann K. The scheduling problem for recurrence equations.. Erlangen / Germany: 1996. Report No.: (200).
Achtziger W, Zimmermann K. A branching linear programming approach for the mapping of systems of n-dimensional affine recurrences onto k-dimensional systolic arrays.. Erlangen / Germany: 1996. Report No.: (172).
Achtziger W, Zimmermann K. Finding space-time transformations for uniform recurrences via branching parametric linear programming.. Erlangen / Germany: 1996. Report No.: (168).
Zimmermann K. Linear mappings ofn-dimensional uniform recurrences ontok-dimensional systolic arrays.. Journal of Signal Processing Systems.. 1996 May; 12.((2)):187-202.      [DOI] 
Zimmermann K. On generalizations of repeated-root cyclic codes.. IEEE Transactions on Information Theory.. 1996 Mar.; 42.((2)):641-649.      [DOI] 
Zimmermann K, Achtziger W. Synthesizing Regular Arrays from Single Affine Recurrences via Quadratic and Branching Parametric Linear Programming.. In: In Proceedings of the 7th International Workshop on Parallel Processing by Cellular Automata and Arrays (Parcella). Berlin / Germany: 1996 Sep.. p. 224-231.
Zimmermann K, Achtziger W. Synthesizing regular arrays from affine recurrences via quadratic and branching parametric linear programming.. Erlangen / Germany: 1996. Report No.: (174).
Achtziger W, Zimmermann K. A branching linear programming approach for the mapping of systems of n-dimensional affine recurrences onto k-dimensional systolic arrays.. In: In Proceedings of the 4th Workshop on Parallel Systems and Algorithms. Singapore: 1996 Apr.. p. 247-259.
Achtziger W, Zimmermann K. On time optimal implementation of uniform recurrences onto array processors via quadratic programming.. Erlangen / Germany: 1996. Report No.: (204).

1995

Zimmermann K. Hecke modules as linear block codes and block m-PSK modulation codes.. In: In Proceedings of the IEEE International Symposium on Information Theory. Whistler / Canada: 1995 Sep.. p. 247-259.      [DOI] 
Liebler RA, Zimmermann K. Combinatorial S>n-Modules as Codes.. IEEE Journal of Algebraic Combinatorics.. 1995 Jan.; 4.((1)):47-68.      [DOI] 

1994

Zimmermann K. On weight spaces of polynomial representations of the general linear group as linear codes.. Journal of Combinatorial Theory, Series A.. 1994 Jul.; 67.((1)):1-22.      [DOI] 
Zimmermann K. Beiträge zur algebraischen Codierungstheorie mittels modularer Darstellungstheorie.. Bayreuther Mathematische Schriften.. 1994; 48.

1993

Zimmermann K. On the majority decodable distance of codes in filtrations of characteristic p>0.. Archiv der Mathematik.. 1993 Nov.; 61.((5)):434-443.      [DOI] 
Zimmermann K. On the decoding of indecomposable binary group codes.. Atti del Seminario Matematico e Fisico dell'Universita di Modena.. 1993; 41.445-455.
Zimmermann K. On the exponent of indecomposable abelian group codes.. In: In Proceedings of the Marshall Hall conference on Coding theory, design theory, group theory. John Wiley & Sons; 1993. p. 291-295.
Karl-Heinz Zimmermann TL, Kung S. On partitioning and fault tolerance issues for neural array processors.. Journal of Signal Processing Systems.. 1993 Jun.; 6.((1)):85-94.      [DOI] 

1992

Zimmermann K. On a complete decoding scheme for binary radical codes.. Archiv der Mathematik.. 1992 Nov.; 59.((5)):513-520.      [DOI] 
Zimmermann K. The weight distribution of indecomposable cyclic codes over 2-groups.. Journal of Combinatorial Theory, Series A.. 1992 May; 60.((1)):85-103.      [DOI] 
Zimmermann K. An optimal partitioning method for parallel algorithms: LSGP.. In: In B. Soucek (Eds.), editors. Fuzzy, holographic, and parallel intelligence: The sixth-generation breakthrough. John Wiley & Sons; 1992. p. 233-266.

1991

Zimmermann K. On the construction of majority-logic decodable group codes.. In: In Proceedings of the 3rd IMA International Conference on Cryptography and Coding. Cirencester / United Kingdom: 1991 Dec.. p. 367-377.
Zimmermann K. On indecomposable Abelian codes and their vertices.. IEEE Transactions on Information Theory.. 1991 Nov.; 37.((6)):1723-1731.      [DOI] 
Zimmermann K. Spechtmoduln als Codes.. Séminaire Lotharingien de Combinatoire.. 1991 Jul.; 27.101-110.

1990

Zimmermann K. The theory of acyclic systolic systems.. Journal of Parallel and Distributed Computing.. 1990 May; 9.((1)):26-41.      [DOI] 

1988

Zimmermann K. Pipeline-automata - A model for acyclic systolic systems.. In: In Proceedings of the 4th International Workshop on Parallel Processing by Cellular Automata and Arrays (Parcella). Berlin / Germany: 1988 Oct.. p. 372-379.      [DOI]